Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366200395.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 ASLink-PT-08a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366200395
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 5 14:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:10 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 757K 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 ASLink-PT-08a-LTLCardinality-00
FORMULA_NAME ASLink-PT-08a-LTLCardinality-01
FORMULA_NAME ASLink-PT-08a-LTLCardinality-02
FORMULA_NAME ASLink-PT-08a-LTLCardinality-03
FORMULA_NAME ASLink-PT-08a-LTLCardinality-04
FORMULA_NAME ASLink-PT-08a-LTLCardinality-05
FORMULA_NAME ASLink-PT-08a-LTLCardinality-06
FORMULA_NAME ASLink-PT-08a-LTLCardinality-07
FORMULA_NAME ASLink-PT-08a-LTLCardinality-08
FORMULA_NAME ASLink-PT-08a-LTLCardinality-09
FORMULA_NAME ASLink-PT-08a-LTLCardinality-10
FORMULA_NAME ASLink-PT-08a-LTLCardinality-11
FORMULA_NAME ASLink-PT-08a-LTLCardinality-12
FORMULA_NAME ASLink-PT-08a-LTLCardinality-13
FORMULA_NAME ASLink-PT-08a-LTLCardinality-14
FORMULA_NAME ASLink-PT-08a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779482541594

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-22 20:42:23] [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-22 20:42:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 20:42:24] [INFO ] Load time of PNML (sax parser for PT used): 532 ms
[2026-05-22 20:42:24] [INFO ] Transformed 1796 places.
[2026-05-22 20:42:24] [INFO ] Transformed 2646 transitions.
[2026-05-22 20:42:24] [INFO ] Found NUPN structural information;
[2026-05-22 20:42:24] [INFO ] Parsed PT model containing 1796 places and 2646 transitions and 9934 arcs in 804 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA ASLink-PT-08a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 1796 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1796/1796 places, 2618/2618 transitions.
Ensure Unique test removed 32 places
Discarding 16 places :
Implicit places reduction removed 16 places
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 1748 transition count 2618
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 60 place count 1736 transition count 2563
Ensure Unique test removed 1 places
Iterating global reduction 1 with 13 rules applied. Total rules applied 73 place count 1735 transition count 2563
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 75 place count 1735 transition count 2561
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 1734 transition count 2553
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 1734 transition count 2553
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 1733 transition count 2545
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 1733 transition count 2545
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 1732 transition count 2537
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 1732 transition count 2537
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 1731 transition count 2529
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 1731 transition count 2529
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 1730 transition count 2521
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 1730 transition count 2521
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 1729 transition count 2513
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 1729 transition count 2513
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 1728 transition count 2505
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 1728 transition count 2505
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 1727 transition count 2497
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 1727 transition count 2497
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 1726 transition count 2489
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 1726 transition count 2489
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 1725 transition count 2481
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 1725 transition count 2481
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 1724 transition count 2473
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 1724 transition count 2473
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 1723 transition count 2465
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 1723 transition count 2465
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 1722 transition count 2457
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 1722 transition count 2457
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 1721 transition count 2449
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 1721 transition count 2449
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 1720 transition count 2441
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 1720 transition count 2441
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 1719 transition count 2433
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 1719 transition count 2433
Applied a total of 107 rules in 1577 ms. Remains 1719 /1796 variables (removed 77) and now considering 2433/2618 (removed 185) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9905378274603745671.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8689314155736729567.kers'
[2026-05-22 20:42:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9905378274603745671.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8689314155736729567.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2433 rows 1719 cols 9046 entries
Finished phase 1 with 702 SingleSign rule and 720 generalized
[2026-05-22 20:42:26] [INFO ] Computed 297 invariants in 25 ms
Computed 297 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-8689314155736729567.kers
Total runtime 28 ms.
[2026-05-22 20:42:29] [INFO ] Implicit Places using invariants in 3342 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 221, 239, 257, 386, 402, 407, 408, 409, 427, 445, 574, 590, 595, 596, 616, 634, 763, 779, 784, 785, 786, 804, 822, 951, 967, 972, 973, 974, 992, 1010, 1139, 1155, 1160, 1161, 1162, 1180, 1198, 1327, 1343, 1348, 1349, 1350, 1386, 1515, 1520, 1532, 1537, 1538, 1539, 1557, 1559, 1562, 1580, 1581, 1582, 1583, 1600, 1608, 1616, 1622, 1628, 1634, 1640, 1648, 1654, 1660, 1668]
Discarding 78 places :
Implicit Place search using SMT only with invariants took 3423 ms to find 78 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1641/1796 places, 2433/2618 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1629 transition count 2421
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1629 transition count 2421
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 1620 transition count 2412
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 1620 transition count 2412
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 1615 transition count 2407
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 1615 transition count 2407
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 1613 transition count 2405
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 1613 transition count 2405
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1611 transition count 2403
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1611 transition count 2403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1610 transition count 2402
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1610 transition count 2402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1609 transition count 2401
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1609 transition count 2401
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1608 transition count 2400
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1608 transition count 2400
Applied a total of 66 rules in 503 ms. Remains 1608 /1641 variables (removed 33) and now considering 2400/2433 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2408882488298321260.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8925201051903538454.kers'
[2026-05-22 20:42:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2408882488298321260.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8925201051903538454.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2400 rows 1608 cols 8358 entries
Finished phase 1 with 1046 SingleSign rule and 343 generalized
[2026-05-22 20:42:30] [INFO ] Computed 219 invariants in 17 ms
Computed 219 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-8925201051903538454.kers
Total runtime 20 ms.
[2026-05-22 20:42:31] [INFO ] Implicit Places using invariants in 1536 ms returned []
[2026-05-22 20:42:31] [INFO ] Invariant cache hit.
[2026-05-22 20:42:38] [INFO ] Implicit Places using invariants and state equation in 6222 ms returned []
Implicit Place search using SMT with State Equation took 7773 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1608/1796 places, 2400/2618 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13321 ms. Remains : 1608/1796 places, 2400/2618 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1608/1608 places, 2400/2400 transitions.
Applied a total of 0 rules in 56 ms. Remains 1608 /1608 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2026-05-22 20:42:38] [INFO ] Invariant cache hit.
[2026-05-22 20:42:39] [INFO ] Implicit Places using invariants in 1305 ms returned []
[2026-05-22 20:42:39] [INFO ] Invariant cache hit.
[2026-05-22 20:42:45] [INFO ] Implicit Places using invariants and state equation in 5591 ms returned []
Implicit Place search using SMT with State Equation took 6910 ms to find 0 implicit places.
Running 2399 sub problems to find dead transitions.
[2026-05-22 20:42:45] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1607 variables, 164/164 constraints. Problems are: Problem set: 0 solved, 2399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1607/4008 variables, and 164 constraints, problems are : Problem set: 0 solved, 2399 unsolved in 30112 ms.
Refiners :[Positive P Invariants (semi-flows): 0/37 constraints, Generalized P Invariants (flows): 164/182 constraints, State Equation: 0/1608 constraints, PredecessorRefiner: 2399/2399 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2399 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1607 variables, 164/164 constraints. Problems are: Problem set: 0 solved, 2399 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1607/4008 variables, and 164 constraints, problems are : Problem set: 0 solved, 2399 unsolved in 30103 ms.
Refiners :[Positive P Invariants (semi-flows): 0/37 constraints, Generalized P Invariants (flows): 164/182 constraints, State Equation: 0/1608 constraints, PredecessorRefiner: 0/2399 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61396ms problems are : Problem set: 0 solved, 2399 unsolved
Search for dead transitions found 0 dead transitions in 61444ms
Finished structural reductions in LTL mode , in 1 iterations and 68463 ms. Remains : 1608/1608 places, 2400/2400 transitions.
Support contains 35 out of 1608 places after structural reductions.
[2026-05-22 20:43:47] [INFO ] Flatten gal took : 212 ms
[2026-05-22 20:43:47] [INFO ] Flatten gal took : 128 ms
[2026-05-22 20:43:47] [INFO ] Input system was already deterministic with 2400 transitions.
RANDOM walk for 40000 steps (186 resets) in 1744 ms. (22 steps per ms) remains 11/22 properties
BEST_FIRST walk for 40004 steps (17 resets) in 277 ms. (143 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (19 resets) in 226 ms. (176 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (18 resets) in 186 ms. (213 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (19 resets) in 205 ms. (194 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (15 resets) in 137 ms. (289 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (18 resets) in 205 ms. (194 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (19 resets) in 231 ms. (172 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (17 resets) in 194 ms. (205 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (18 resets) in 171 ms. (232 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (17 resets) in 161 ms. (246 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (18 resets) in 127 ms. (312 steps per ms) remains 11/11 properties
[2026-05-22 20:43:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 357/373 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 249/622 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 964/1586 variables, 176/213 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1586 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 22/1608 variables, 6/219 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1608 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 2400/4008 variables, 1608/1827 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4008 variables, 0/1827 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/4008 variables, 0/1827 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4008/4008 variables, and 1827 constraints, problems are : Problem set: 0 solved, 11 unsolved in 4244 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 182/182 constraints, State Equation: 1608/1608 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 357/373 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 249/622 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/622 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 964/1586 variables, 176/213 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1586 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1586 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 22/1608 variables, 6/220 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1608 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4008/4008 variables, and 1828 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 182/182 constraints, State Equation: 1608/1608 constraints, PredecessorRefiner: 0/11 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9286ms problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 1608 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1608/1608 places, 2400/2400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 290 transitions
Trivial Post-agglo rules discarded 290 transitions
Performed 290 trivial Post agglomeration. Transition count delta: 290
Iterating post reduction 0 with 290 rules applied. Total rules applied 290 place count 1608 transition count 2110
Reduce places removed 290 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 292 rules applied. Total rules applied 582 place count 1318 transition count 2108
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 584 place count 1316 transition count 2108
Performed 210 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 210 Pre rules applied. Total rules applied 584 place count 1316 transition count 1898
Deduced a syphon composed of 210 places in 3 ms
Ensure Unique test removed 66 places
Reduce places removed 276 places and 0 transitions.
Iterating global reduction 3 with 486 rules applied. Total rules applied 1070 place count 1040 transition count 1898
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 20 rules applied. Total rules applied 1090 place count 1029 transition count 1889
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1099 place count 1020 transition count 1889
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 29 Pre rules applied. Total rules applied 1099 place count 1020 transition count 1860
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 1157 place count 991 transition count 1860
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1162 place count 986 transition count 1855
Iterating global reduction 5 with 5 rules applied. Total rules applied 1167 place count 986 transition count 1855
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
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 5 rules applied. Total rules applied 1172 place count 986 transition count 1850
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1174 place count 984 transition count 1850
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 3 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 7 with 172 rules applied. Total rules applied 1346 place count 898 transition count 1764
Free-agglomeration rule applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 1353 place count 898 transition count 1757
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1360 place count 891 transition count 1757
Free-agglomeration rule (complex) applied 35 times.
Iterating global reduction 8 with 35 rules applied. Total rules applied 1395 place count 891 transition count 1722
Ensure Unique test removed 1 places
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 8 with 36 rules applied. Total rules applied 1431 place count 855 transition count 1722
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1437 place count 855 transition count 1716
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 9 with 19 rules applied. Total rules applied 1456 place count 855 transition count 1716
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1458 place count 855 transition count 1716
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1459 place count 854 transition count 1715
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 1466 place count 847 transition count 1715
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 14 Pre rules applied. Total rules applied 1466 place count 847 transition count 1701
Deduced a syphon composed of 14 places in 3 ms
Ensure Unique test removed 7 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 10 with 35 rules applied. Total rules applied 1501 place count 826 transition count 1701
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 1508 place count 819 transition count 1694
Iterating global reduction 10 with 7 rules applied. Total rules applied 1515 place count 819 transition count 1694
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 1522 place count 819 transition count 1687
Applied a total of 1522 rules in 659 ms. Remains 819 /1608 variables (removed 789) and now considering 1687/2400 (removed 713) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 659 ms. Remains : 819/1608 places, 1687/2400 transitions.
RANDOM walk for 40000 steps (590 resets) in 612 ms. (65 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (85 resets) in 142 ms. (279 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (84 resets) in 197 ms. (202 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (86 resets) in 72 ms. (548 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (87 resets) in 72 ms. (547 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (87 resets) in 69 ms. (571 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (93 resets) in 67 ms. (588 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (87 resets) in 71 ms. (555 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (89 resets) in 67 ms. (588 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (87 resets) in 111 ms. (357 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (89 resets) in 74 ms. (533 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (89 resets) in 71 ms. (555 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 197586 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 11
Probabilistic random walk after 197586 steps, saw 48502 distinct states, run finished after 3010 ms. (steps per millisecond=65 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16825041950521210111.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1384745837792507556.kers'
[2026-05-22 20:44:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16825041950521210111.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1384745837792507556.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 1 ms.
// Phase 1: matrix 1687 rows 811 cols 6855 entries
Finished phase 1 with 310 SingleSign rule and 382 generalized
[2026-05-22 20:44:02] [INFO ] Computed 127 invariants in 13 ms
Computed 127 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-1384745837792507556.kers
Total runtime 15 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 285/301 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 79/380 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 12/392 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 326/718 variables, 78/104 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/718 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 65/783 variables, 12/116 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/783 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 35/818 variables, 10/126 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/818 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 1/819 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/819 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 1687/2506 variables, 819/946 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2506 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 0/2506 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2506/2506 variables, and 946 constraints, problems are : Problem set: 0 solved, 11 unsolved in 3289 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 88/88 constraints, State Equation: 819/819 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 285/301 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/301 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 79/380 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 12/392 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 326/718 variables, 78/104 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/718 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/718 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 65/783 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/783 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 35/818 variables, 10/127 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/818 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 1/819 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/819 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 1687/2506 variables, 819/947 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2506 variables, 11/958 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2506 variables, 1/959 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2506 variables, 1/960 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2506 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (OVERLAPS) 0/2506 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2506/2506 variables, and 960 constraints, problems are : Problem set: 0 solved, 11 unsolved in 28299 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 88/88 constraints, State Equation: 819/819 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31678ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 46686 ms.
Support contains 16 out of 819 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 819/819 places, 1687/1687 transitions.
Applied a total of 0 rules in 33 ms. Remains 819 /819 variables (removed 0) and now considering 1687/1687 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 819/819 places, 1687/1687 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 819/819 places, 1687/1687 transitions.
Applied a total of 0 rules in 30 ms. Remains 819 /819 variables (removed 0) and now considering 1687/1687 (removed 0) transitions.
[2026-05-22 20:45:20] [INFO ] Invariant cache hit.
[2026-05-22 20:45:21] [INFO ] Implicit Places using invariants in 1058 ms returned [88, 94, 97, 99, 102, 109, 110, 164, 176, 184, 190, 193, 195, 196, 201, 202, 254, 268, 277, 283, 286, 288, 290, 295, 296, 351, 373, 382, 385, 387, 388, 392, 397, 398, 450, 467, 473, 476, 478, 479, 484, 485, 537, 556, 562, 564, 568, 569, 574, 575, 627, 644, 652, 655, 657, 658, 663, 664, 682, 717, 738, 746, 752, 753]
[2026-05-22 20:45:21] [INFO ] Actually due to overlaps returned [196, 290, 392, 479, 569, 753, 658, 682, 88, 94, 99, 184, 190, 195, 277, 283, 288, 373, 382, 387, 467, 473, 478, 562, 568, 644, 657, 102, 164, 176, 254, 268, 351, 388, 450, 537, 556, 627, 652, 717, 738, 746, 752]
Discarding 43 places :
Implicit Place search using SMT only with invariants took 1064 ms to find 43 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 776/819 places, 1687/1687 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 776 transition count 1683
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 772 transition count 1681
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 770 transition count 1681
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 37 place count 745 transition count 1656
Iterating global reduction 3 with 25 rules applied. Total rules applied 62 place count 745 transition count 1656
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 68 place count 739 transition count 1650
Iterating global reduction 3 with 6 rules applied. Total rules applied 74 place count 739 transition count 1650
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 738 transition count 1649
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 738 transition count 1649
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 112 place count 720 transition count 1631
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 113 place count 719 transition count 1629
Iterating global reduction 3 with 1 rules applied. Total rules applied 114 place count 719 transition count 1629
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 719 transition count 1628
Free-agglomeration rule applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 139 place count 719 transition count 1604
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 163 place count 695 transition count 1604
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 169 place count 695 transition count 1598
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 175 place count 689 transition count 1598
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 176 place count 689 transition count 1598
Applied a total of 176 rules in 288 ms. Remains 689 /776 variables (removed 87) and now considering 1598/1687 (removed 89) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11887902934491023360.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9606865876881613361.kers'
[2026-05-22 20:45:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11887902934491023360.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9606865876881613361.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1598 rows 688 cols 6631 entries
Finished phase 1 with 294 SingleSign rule and 311 generalized
[2026-05-22 20:45:22] [INFO ] Computed 84 invariants in 12 ms
Computed 84 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-9606865876881613361.kers
Total runtime 14 ms.
[2026-05-22 20:45:22] [INFO ] Implicit Places using invariants in 969 ms returned [95, 96, 170, 171, 247, 248, 334, 335, 405, 406, 482, 483, 557, 558]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 972 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 675/819 places, 1598/1687 transitions.
Applied a total of 0 rules in 29 ms. Remains 675 /675 variables (removed 0) and now considering 1598/1598 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2383 ms. Remains : 675/819 places, 1598/1687 transitions.
RANDOM walk for 40000 steps (659 resets) in 444 ms. (89 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (111 resets) in 103 ms. (384 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (116 resets) in 85 ms. (465 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (112 resets) in 87 ms. (454 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (113 resets) in 68 ms. (579 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (105 resets) in 92 ms. (430 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (111 resets) in 107 ms. (370 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (115 resets) in 99 ms. (400 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (119 resets) in 61 ms. (645 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (103 resets) in 86 ms. (459 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (115 resets) in 57 ms. (689 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (115 resets) in 63 ms. (625 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 146145 steps, run timeout after 3012 ms. (steps per millisecond=48 ) properties seen :0 out of 11
Probabilistic random walk after 146145 steps, saw 74317 distinct states, run finished after 3013 ms. (steps per millisecond=48 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10328918109745170858.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16877559705705424877.kers'
[2026-05-22 20:45:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10328918109745170858.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16877559705705424877.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1598 rows 674 cols 6442 entries
Finished phase 1 with 245 SingleSign rule and 360 generalized
[2026-05-22 20:45:26] [INFO ] Computed 70 invariants in 12 ms
Computed 70 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-16877559705705424877.kers
Total runtime 14 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 318/334 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 127/461 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 30/491 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 167/658 variables, 32/68 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/658 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 9/667 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/667 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 8/675 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/675 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 1598/2273 variables, 675/745 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2273 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/2273 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2273/2273 variables, and 745 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2562 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 675/675 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 318/334 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 127/461 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 30/491 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 167/658 variables, 32/68 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/658 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/658 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 9/667 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/667 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 8/675 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/675 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 1598/2273 variables, 675/746 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2273 variables, 11/757 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2273 variables, 1/758 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2273 variables, 1/759 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2273/2273 variables, and 759 constraints, problems are : Problem set: 0 solved, 11 unsolved in 75016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 675/675 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 77613ms problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 675 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 675/675 places, 1598/1598 transitions.
Applied a total of 0 rules in 23 ms. Remains 675 /675 variables (removed 0) and now considering 1598/1598 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 675/675 places, 1598/1598 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 675/675 places, 1598/1598 transitions.
Applied a total of 0 rules in 23 ms. Remains 675 /675 variables (removed 0) and now considering 1598/1598 (removed 0) transitions.
[2026-05-22 20:46:44] [INFO ] Invariant cache hit.
[2026-05-22 20:46:44] [INFO ] Implicit Places using invariants in 621 ms returned []
[2026-05-22 20:46:44] [INFO ] Invariant cache hit.
[2026-05-22 20:46:46] [INFO ] Implicit Places using invariants and state equation in 1890 ms returned []
Implicit Place search using SMT with State Equation took 2520 ms to find 0 implicit places.
[2026-05-22 20:46:46] [INFO ] Redundant transitions in 173 ms returned []
Running 1560 sub problems to find dead transitions.
[2026-05-22 20:46:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/674 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/674 variables, 33/68 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 674/2273 variables, and 68 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 35/37 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 0/675 constraints, PredecessorRefiner: 1560/1560 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/674 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/674 variables, 33/68 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 674/2273 variables, and 69 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 35/37 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 0/675 constraints, PredecessorRefiner: 0/1560 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60680ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 60697ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63429 ms. Remains : 675/675 places, 1598/1598 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1608/1608 places, 2400/2400 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1606 transition count 2393
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1606 transition count 2393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1605 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1605 transition count 2392
Applied a total of 6 rules in 147 ms. Remains 1605 /1608 variables (removed 3) and now considering 2392/2400 (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-10517871909825797912.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8149316652501885681.kers'
[2026-05-22 20:47:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10517871909825797912.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8149316652501885681.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 2392 rows 1605 cols 8329 entries
Finished phase 1 with 1042 SingleSign rule and 344 generalized
[2026-05-22 20:47:48] [INFO ] Computed 219 invariants in 48 ms
Computed 219 P flows in 49 ms.
Exported basis to /tmp/petrispot-output-8149316652501885681.kers
Total runtime 52 ms.
[2026-05-22 20:47:50] [INFO ] Implicit Places using invariants in 2357 ms returned [572, 1314]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2364 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1603/1608 places, 2392/2400 transitions.
Applied a total of 0 rules in 49 ms. Remains 1603 /1603 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2561 ms. Remains : 1603/1608 places, 2392/2400 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(p0)))'
Stuttering acceptance computed with spot in 333 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08a-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 1046 ms.
Product exploration explored 100000 steps with 50000 reset in 902 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 61 ms. Proved property starting from automaton with 2 states, 2 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 84 ms.
FORMULA ASLink-PT-08a-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-08a-LTLCardinality-00 finished in 5074 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((F(p0)&&G(p1)))||X(X(F((p2&&F(p3))))))))'
Support contains 7 out of 1608 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1608/1608 places, 2400/2400 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 299 transitions
Trivial Post-agglo rules discarded 299 transitions
Performed 299 trivial Post agglomeration. Transition count delta: 299
Iterating post reduction 0 with 299 rules applied. Total rules applied 299 place count 1607 transition count 2100
Reduce places removed 306 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 313 rules applied. Total rules applied 612 place count 1301 transition count 2093
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 621 place count 1294 transition count 2091
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 624 place count 1291 transition count 2091
Performed 230 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 230 Pre rules applied. Total rules applied 624 place count 1291 transition count 1861
Deduced a syphon composed of 230 places in 2 ms
Ensure Unique test removed 69 places
Reduce places removed 299 places and 0 transitions.
Iterating global reduction 4 with 529 rules applied. Total rules applied 1153 place count 992 transition count 1861
Discarding 20 places :
Implicit places reduction removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 4 with 45 rules applied. Total rules applied 1198 place count 972 transition count 1836
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 1223 place count 947 transition count 1836
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 32 Pre rules applied. Total rules applied 1223 place count 947 transition count 1804
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 1287 place count 915 transition count 1804
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 1300 place count 902 transition count 1791
Iterating global reduction 6 with 13 rules applied. Total rules applied 1313 place count 902 transition count 1791
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
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 6 with 13 rules applied. Total rules applied 1326 place count 902 transition count 1778
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1328 place count 900 transition count 1778
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1329 place count 899 transition count 1777
Iterating global reduction 8 with 1 rules applied. Total rules applied 1330 place count 899 transition count 1777
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1330 place count 899 transition count 1776
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1332 place count 898 transition count 1776
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 8 with 160 rules applied. Total rules applied 1492 place count 818 transition count 1696
Applied a total of 1492 rules in 273 ms. Remains 818 /1608 variables (removed 790) and now considering 1696/2400 (removed 704) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11960532453249680738.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-819351049672310655.kers'
[2026-05-22 20:47:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11960532453249680738.kers, --Pflows, --basisKERS=/tmp/petrispot-output-819351049672310655.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1696 rows 818 cols 6868 entries
Finished phase 1 with 326 SingleSign rule and 370 generalized
[2026-05-22 20:47:53] [INFO ] Computed 122 invariants in 12 ms
Computed 122 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-819351049672310655.kers
Total runtime 14 ms.
[2026-05-22 20:47:54] [INFO ] Implicit Places using invariants in 894 ms returned [72, 90, 96, 101, 160, 177, 183, 188, 190, 250, 267, 273, 278, 280, 343, 365, 371, 376, 377, 381, 441, 465, 470, 472, 532, 549, 555, 561, 563, 623, 641, 647, 652, 654, 680, 715, 736, 744, 750, 752, 815]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 908 ms to find 41 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 777/1608 places, 1696/2400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 777 transition count 1691
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 772 transition count 1691
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 26 place count 756 transition count 1675
Iterating global reduction 2 with 16 rules applied. Total rules applied 42 place count 756 transition count 1675
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 57 place count 741 transition count 1660
Iterating global reduction 2 with 15 rules applied. Total rules applied 72 place count 741 transition count 1660
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 79 place count 734 transition count 1653
Iterating global reduction 2 with 7 rules applied. Total rules applied 86 place count 734 transition count 1653
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 124 place count 715 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 714 transition count 1632
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 714 transition count 1632
Applied a total of 126 rules in 180 ms. Remains 714 /777 variables (removed 63) and now considering 1632/1696 (removed 64) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2577088792761977076.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5502775722284639979.kers'
[2026-05-22 20:47:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2577088792761977076.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5502775722284639979.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1632 rows 714 cols 6563 entries
Finished phase 1 with 327 SingleSign rule and 306 generalized
[2026-05-22 20:47:54] [INFO ] Computed 81 invariants in 30 ms
Computed 81 P flows in 31 ms.
Exported basis to /tmp/petrispot-output-5502775722284639979.kers
Total runtime 32 ms.
[2026-05-22 20:47:55] [INFO ] Implicit Places using invariants in 733 ms returned []
[2026-05-22 20:47:55] [INFO ] Invariant cache hit.
[2026-05-22 20:47:57] [INFO ] Implicit Places using invariants and state equation in 2611 ms returned []
Implicit Place search using SMT with State Equation took 3379 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 714/1608 places, 1632/2400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4741 ms. Remains : 714/1608 places, 1632/2400 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((F(p0)&&G(p1)))||X(X(F((p2&&F(p3))))))))'
Stuttering acceptance computed with spot in 781 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ASLink-PT-08a-LTLCardinality-02
Product exploration explored 100000 steps with 21676 reset in 440 ms.
Product exploration explored 100000 steps with 21883 reset in 491 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 11 factoid took 206 ms. Reduced automaton from 10 states, 28 edges and 4 AP (stutter insensitive) to 7 states, 23 edges and 4 AP (stutter insensitive).
RANDOM walk for 40000 steps (510 resets) in 538 ms. (74 steps per ms) remains 10/16 properties
BEST_FIRST walk for 40003 steps (81 resets) in 138 ms. (287 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (66 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (65 resets) in 430 ms. (92 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (66 resets) in 68 ms. (579 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (86 resets) in 90 ms. (439 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (86 resets) in 75 ms. (526 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (66 resets) in 65 ms. (606 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (58 resets) in 62 ms. (634 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (52 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (83 resets) in 122 ms. (325 steps per ms) remains 10/10 properties
[2026-05-22 20:48:00] [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, 10 unsolved
At refinement iteration 1 (OVERLAPS) 288/295 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 137/432 variables, 15/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 59/491 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 29/520 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 6/526 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/526 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 187/713 variables, 46/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/713 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 1/714 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/714 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 1632/2346 variables, 714/795 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2346 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 0/2346 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2346/2346 variables, and 795 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2316 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 714/714 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 288/295 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 137/432 variables, 15/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 59/491 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 29/520 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 6/526 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/526 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 187/713 variables, 46/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/713 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/713 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 1/714 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/714 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 1632/2346 variables, 714/796 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2346 variables, 10/806 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2346/2346 variables, and 806 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 714/714 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7358ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 714 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 714/714 places, 1632/1632 transitions.
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 714 transition count 1602
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 67 place count 684 transition count 1595
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 1 with 23 rules applied. Total rules applied 90 place count 684 transition count 1572
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 113 place count 661 transition count 1572
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 115 place count 661 transition count 1572
Applied a total of 115 rules in 172 ms. Remains 661 /714 variables (removed 53) and now considering 1572/1632 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 661/714 places, 1572/1632 transitions.
RANDOM walk for 40000 steps (701 resets) in 390 ms. (102 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (109 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (87 resets) in 104 ms. (380 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (89 resets) in 79 ms. (500 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (83 resets) in 81 ms. (487 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (112 resets) in 132 ms. (300 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (109 resets) in 65 ms. (606 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (93 resets) in 60 ms. (655 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (84 resets) in 56 ms. (701 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (82 resets) in 58 ms. (678 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (112 resets) in 62 ms. (634 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 118391 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 10
Probabilistic random walk after 118391 steps, saw 67689 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17799131708988334543.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6238152380036237503.kers'
[2026-05-22 20:48:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17799131708988334543.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6238152380036237503.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1572 rows 661 cols 6580 entries
Finished phase 1 with 269 SingleSign rule and 311 generalized
[2026-05-22 20:48:11] [INFO ] Computed 81 invariants in 12 ms
Computed 81 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-6238152380036237503.kers
Total runtime 13 ms.
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, 10 unsolved
At refinement iteration 1 (OVERLAPS) 237/244 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 106/350 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 55/405 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 55/460 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 29/489 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 6/495 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 165/660 variables, 46/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/660 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 1/661 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/661 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 1572/2233 variables, 661/742 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2233 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 0/2233 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2233/2233 variables, and 742 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2516 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 661/661 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 237/244 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 106/350 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 55/405 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 55/460 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 29/489 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 6/495 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 165/660 variables, 46/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/660 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/660 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 1/661 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/661 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 1572/2233 variables, 661/743 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2233 variables, 10/753 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2233 variables, 1/754 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2233 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 0/2233 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2233/2233 variables, and 754 constraints, problems are : Problem set: 0 solved, 10 unsolved in 18254 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 661/661 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20827ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 39727 ms.
Support contains 7 out of 661 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 661/661 places, 1572/1572 transitions.
Applied a total of 0 rules in 27 ms. Remains 661 /661 variables (removed 0) and now considering 1572/1572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 661/661 places, 1572/1572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 661/661 places, 1572/1572 transitions.
Applied a total of 0 rules in 23 ms. Remains 661 /661 variables (removed 0) and now considering 1572/1572 (removed 0) transitions.
[2026-05-22 20:49:11] [INFO ] Invariant cache hit.
[2026-05-22 20:49:12] [INFO ] Implicit Places using invariants in 761 ms returned [89, 90, 160, 161, 231, 232, 311, 312, 388, 389, 461, 462, 532, 533]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 771 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 647/661 places, 1572/1572 transitions.
Applied a total of 0 rules in 24 ms. Remains 647 /647 variables (removed 0) and now considering 1572/1572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 830 ms. Remains : 647/661 places, 1572/1572 transitions.
RANDOM walk for 40000 steps (662 resets) in 309 ms. (129 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (108 resets) in 85 ms. (465 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (84 resets) in 75 ms. (526 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (91 resets) in 82 ms. (481 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (84 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (107 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (108 resets) in 64 ms. (615 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (99 resets) in 53 ms. (740 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (74 resets) in 54 ms. (727 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (71 resets) in 56 ms. (701 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (116 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 112727 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 10
Probabilistic random walk after 112727 steps, saw 63309 distinct states, run finished after 3002 ms. (steps per millisecond=37 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5193357658226032488.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13520031043101824883.kers'
[2026-05-22 20:49:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5193357658226032488.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13520031043101824883.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1572 rows 647 cols 6391 entries
Finished phase 1 with 237 SingleSign rule and 343 generalized
[2026-05-22 20:49:16] [INFO ] Computed 67 invariants in 11 ms
Computed 67 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-13520031043101824883.kers
Total runtime 13 ms.
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, 10 unsolved
At refinement iteration 1 (OVERLAPS) 237/244 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 106/350 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 55/405 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 55/460 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 29/489 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 6/495 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 151/646 variables, 32/66 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/646 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 1/647 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/647 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 1572/2219 variables, 647/714 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2219 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 0/2219 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2219/2219 variables, and 714 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1913 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 647/647 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 237/244 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 106/350 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 55/405 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 55/460 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 29/489 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 6/495 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 151/646 variables, 32/66 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/646 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/646 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 1/647 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/647 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 1572/2219 variables, 647/716 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2219 variables, 10/726 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2219/2219 variables, and 726 constraints, problems are : Problem set: 0 solved, 10 unsolved in 75015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 647/647 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 76969ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 647 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 647/647 places, 1572/1572 transitions.
Applied a total of 0 rules in 44 ms. Remains 647 /647 variables (removed 0) and now considering 1572/1572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 647/647 places, 1572/1572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 647/647 places, 1572/1572 transitions.
Applied a total of 0 rules in 34 ms. Remains 647 /647 variables (removed 0) and now considering 1572/1572 (removed 0) transitions.
[2026-05-22 20:50:33] [INFO ] Invariant cache hit.
[2026-05-22 20:50:33] [INFO ] Implicit Places using invariants in 684 ms returned []
[2026-05-22 20:50:33] [INFO ] Invariant cache hit.
[2026-05-22 20:50:35] [INFO ] Implicit Places using invariants and state equation in 1876 ms returned []
Implicit Place search using SMT with State Equation took 2597 ms to find 0 implicit places.
[2026-05-22 20:50:35] [INFO ] Redundant transitions in 50 ms returned []
Running 1534 sub problems to find dead transitions.
[2026-05-22 20:50:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/646 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/646 variables, 32/65 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/2219 variables, and 66 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 33/35 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 0/647 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/646 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/646 variables, 32/65 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/646 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/2219 variables, and 66 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 33/35 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 0/647 constraints, PredecessorRefiner: 0/1534 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60706ms problems are : Problem set: 0 solved, 1534 unsolved
Search for dead transitions found 0 dead transitions in 60709ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63413 ms. Remains : 647/647 places, 1572/1572 transitions.
Knowledge based reduction with 11 factoid took 352 ms. Reduced automaton from 7 states, 23 edges and 4 AP (stutter insensitive) to 7 states, 23 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 346 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Knowledge-based reduction took 217780 ms.
Stuttering acceptance computed with spot in 329 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 7 out of 714 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 714/714 places, 1632/1632 transitions.
Applied a total of 0 rules in 32 ms. Remains 714 /714 variables (removed 0) and now considering 1632/1632 (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-1456049619404055633.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1404381121199534769.kers'
[2026-05-22 20:51:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1456049619404055633.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1404381121199534769.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1632 rows 714 cols 6563 entries
Finished phase 1 with 327 SingleSign rule and 306 generalized
[2026-05-22 20:51:37] [INFO ] Computed 81 invariants in 26 ms
Computed 81 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-1404381121199534769.kers
Total runtime 29 ms.
[2026-05-22 20:51:38] [INFO ] Implicit Places using invariants in 883 ms returned []
[2026-05-22 20:51:38] [INFO ] Invariant cache hit.
[2026-05-22 20:51:40] [INFO ] Implicit Places using invariants and state equation in 1815 ms returned []
Implicit Place search using SMT with State Equation took 2714 ms to find 0 implicit places.
[2026-05-22 20:51:40] [INFO ] Redundant transitions in 125 ms returned []
Running 1586 sub problems to find dead transitions.
[2026-05-22 20:51:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/713 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/713 variables, 46/79 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 713/2346 variables, and 79 constraints, problems are : Problem set: 0 solved, 1586 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 33/35 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/714 constraints, PredecessorRefiner: 1586/1586 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1586 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/713 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/713 variables, 46/79 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 713/2346 variables, and 79 constraints, problems are : Problem set: 0 solved, 1586 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 33/35 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/714 constraints, PredecessorRefiner: 0/1586 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60671ms problems are : Problem set: 0 solved, 1586 unsolved
Search for dead transitions found 0 dead transitions in 60676ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63566 ms. Remains : 714/714 places, 1632/1632 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 23 factoid took 609 ms. Reduced automaton from 7 states, 23 edges and 4 AP (stutter insensitive) to 7 states, 23 edges and 4 AP (stutter insensitive).
RANDOM walk for 40000 steps (508 resets) in 352 ms. (113 steps per ms) remains 10/16 properties
BEST_FIRST walk for 40004 steps (79 resets) in 198 ms. (201 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (60 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (62 resets) in 91 ms. (434 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (74 resets) in 86 ms. (459 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (82 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (85 resets) in 65 ms. (606 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (66 resets) in 96 ms. (412 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (64 resets) in 70 ms. (563 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (58 resets) in 65 ms. (606 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (88 resets) in 57 ms. (689 steps per ms) remains 10/10 properties
[2026-05-22 20:52:42] [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, 10 unsolved
At refinement iteration 1 (OVERLAPS) 288/295 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 137/432 variables, 15/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 59/491 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 29/520 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 6/526 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/526 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 187/713 variables, 46/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/713 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 1/714 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/714 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 1632/2346 variables, 714/795 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2346 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 0/2346 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2346/2346 variables, and 795 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3062 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 714/714 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 288/295 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 137/432 variables, 15/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 59/491 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 29/520 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 6/526 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/526 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 187/713 variables, 46/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/713 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/713 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 1/714 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/714 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 1632/2346 variables, 714/796 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2346 variables, 10/806 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2346/2346 variables, and 806 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5031 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 714/714 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8107ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 714 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 714/714 places, 1632/1632 transitions.
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 714 transition count 1602
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 67 place count 684 transition count 1595
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 1 with 23 rules applied. Total rules applied 90 place count 684 transition count 1572
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 113 place count 661 transition count 1572
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 115 place count 661 transition count 1572
Applied a total of 115 rules in 112 ms. Remains 661 /714 variables (removed 53) and now considering 1572/1632 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 661/714 places, 1572/1632 transitions.
RANDOM walk for 40000 steps (654 resets) in 315 ms. (126 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (110 resets) in 92 ms. (430 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (87 resets) in 128 ms. (310 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (87 resets) in 104 ms. (380 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (82 resets) in 94 ms. (421 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (108 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (108 resets) in 96 ms. (412 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (88 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (80 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (77 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (111 resets) in 85 ms. (465 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 53158 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :0 out of 10
Probabilistic random walk after 53158 steps, saw 31718 distinct states, run finished after 3012 ms. (steps per millisecond=17 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14839146476712612428.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7439359562470742735.kers'
[2026-05-22 20:52:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14839146476712612428.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7439359562470742735.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1572 rows 661 cols 6580 entries
Finished phase 1 with 269 SingleSign rule and 311 generalized
[2026-05-22 20:52:54] [INFO ] Computed 81 invariants in 26 ms
Computed 81 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-7439359562470742735.kers
Total runtime 28 ms.
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, 10 unsolved
At refinement iteration 1 (OVERLAPS) 237/244 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 106/350 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 55/405 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 55/460 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 29/489 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 6/495 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 165/660 variables, 46/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/660 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 1/661 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/661 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 1572/2233 variables, 661/742 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2233 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 0/2233 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2233/2233 variables, and 742 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2773 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 661/661 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 237/244 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 106/350 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 55/405 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 55/460 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 29/489 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 6/495 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 165/660 variables, 46/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/660 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/660 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 1/661 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/661 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 1572/2233 variables, 661/743 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2233 variables, 10/753 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2233 variables, 1/754 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2233 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 0/2233 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2233/2233 variables, and 754 constraints, problems are : Problem set: 0 solved, 10 unsolved in 17164 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 661/661 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20012ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 32751 ms.
Support contains 7 out of 661 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 661/661 places, 1572/1572 transitions.
Applied a total of 0 rules in 25 ms. Remains 661 /661 variables (removed 0) and now considering 1572/1572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 661/661 places, 1572/1572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 661/661 places, 1572/1572 transitions.
Applied a total of 0 rules in 23 ms. Remains 661 /661 variables (removed 0) and now considering 1572/1572 (removed 0) transitions.
[2026-05-22 20:53:46] [INFO ] Invariant cache hit.
[2026-05-22 20:53:47] [INFO ] Implicit Places using invariants in 628 ms returned [89, 90, 160, 161, 231, 232, 311, 312, 388, 389, 461, 462, 532, 533]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 632 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 647/661 places, 1572/1572 transitions.
Applied a total of 0 rules in 23 ms. Remains 647 /647 variables (removed 0) and now considering 1572/1572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 678 ms. Remains : 647/661 places, 1572/1572 transitions.
RANDOM walk for 40000 steps (671 resets) in 275 ms. (144 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (108 resets) in 76 ms. (519 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (88 resets) in 71 ms. (555 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (84 resets) in 71 ms. (555 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (90 resets) in 61 ms. (645 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (106 resets) in 82 ms. (481 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (109 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (90 resets) in 75 ms. (526 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (80 resets) in 58 ms. (677 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (79 resets) in 52 ms. (754 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (116 resets) in 51 ms. (769 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 135689 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 10
Probabilistic random walk after 135689 steps, saw 75332 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5799917051330592477.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4676483146683529697.kers'
[2026-05-22 20:53:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5799917051330592477.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4676483146683529697.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1572 rows 647 cols 6391 entries
Finished phase 1 with 237 SingleSign rule and 343 generalized
[2026-05-22 20:53:50] [INFO ] Computed 67 invariants in 12 ms
Computed 67 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-4676483146683529697.kers
Total runtime 13 ms.
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, 10 unsolved
At refinement iteration 1 (OVERLAPS) 237/244 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 106/350 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 55/405 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 55/460 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 29/489 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 6/495 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 151/646 variables, 32/66 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/646 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 1/647 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/647 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 1572/2219 variables, 647/714 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2219 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 0/2219 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2219/2219 variables, and 714 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1912 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 647/647 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 237/244 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 106/350 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 55/405 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 55/460 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 29/489 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/489 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 6/495 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/495 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 151/646 variables, 32/66 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/646 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/646 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 1/647 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/647 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 1572/2219 variables, 647/716 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2219 variables, 10/726 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2219/2219 variables, and 726 constraints, problems are : Problem set: 0 solved, 10 unsolved in 75020 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 647/647 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 76962ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 647 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 647/647 places, 1572/1572 transitions.
Applied a total of 0 rules in 23 ms. Remains 647 /647 variables (removed 0) and now considering 1572/1572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 647/647 places, 1572/1572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 647/647 places, 1572/1572 transitions.
Applied a total of 0 rules in 21 ms. Remains 647 /647 variables (removed 0) and now considering 1572/1572 (removed 0) transitions.
[2026-05-22 20:55:07] [INFO ] Invariant cache hit.
[2026-05-22 20:55:08] [INFO ] Implicit Places using invariants in 809 ms returned []
[2026-05-22 20:55:08] [INFO ] Invariant cache hit.
[2026-05-22 20:55:10] [INFO ] Implicit Places using invariants and state equation in 1633 ms returned []
Implicit Place search using SMT with State Equation took 2460 ms to find 0 implicit places.
[2026-05-22 20:55:10] [INFO ] Redundant transitions in 27 ms returned []
Running 1534 sub problems to find dead transitions.
[2026-05-22 20:55:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/646 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/646 variables, 32/65 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 646/2219 variables, and 66 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 33/35 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 0/647 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/646 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/646 variables, 32/65 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/646 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 646/2219 variables, and 66 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 33/35 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 0/647 constraints, PredecessorRefiner: 0/1534 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60646ms problems are : Problem set: 0 solved, 1534 unsolved
Search for dead transitions found 0 dead transitions in 60649ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63168 ms. Remains : 647/647 places, 1572/1572 transitions.
Knowledge based reduction with 23 factoid took 477 ms. Reduced automaton from 7 states, 23 edges and 4 AP (stutter insensitive) to 7 states, 23 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 387 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Knowledge-based reduction took 210673 ms.
Stuttering acceptance computed with spot in 372 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 354 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 1495 reset in 417 ms.
Product exploration explored 100000 steps with 1490 reset in 418 ms.
Built C files in :
/tmp/ltsmin6372821658231345642
[2026-05-22 20:56:13] [INFO ] Too many transitions (1632) to apply POR reductions. Disabling POR matrices.
[2026-05-22 20:56:13] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6372821658231345642
Running compilation step : cd /tmp/ltsmin6372821658231345642;'/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/ltsmin6372821658231345642;'/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/ltsmin6372821658231345642;'/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 714 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 714/714 places, 1632/1632 transitions.
Applied a total of 0 rules in 44 ms. Remains 714 /714 variables (removed 0) and now considering 1632/1632 (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-5707468037082271318.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8971432410642179854.kers'
[2026-05-22 20:56:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5707468037082271318.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8971432410642179854.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1632 rows 714 cols 6563 entries
Finished phase 1 with 327 SingleSign rule and 306 generalized
[2026-05-22 20:56:16] [INFO ] Computed 81 invariants in 11 ms
Computed 81 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-8971432410642179854.kers
Total runtime 14 ms.
[2026-05-22 20:56:17] [INFO ] Implicit Places using invariants in 709 ms returned []
[2026-05-22 20:56:17] [INFO ] Invariant cache hit.
[2026-05-22 20:56:19] [INFO ] Implicit Places using invariants and state equation in 2435 ms returned []
Implicit Place search using SMT with State Equation took 3186 ms to find 0 implicit places.
[2026-05-22 20:56:19] [INFO ] Redundant transitions in 42 ms returned []
Running 1586 sub problems to find dead transitions.
[2026-05-22 20:56:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/713 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/713 variables, 46/79 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 713/2346 variables, and 79 constraints, problems are : Problem set: 0 solved, 1586 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 33/35 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/714 constraints, PredecessorRefiner: 1586/1586 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1586 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/713 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/713 variables, 46/79 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 713/2346 variables, and 79 constraints, problems are : Problem set: 0 solved, 1586 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 33/35 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/714 constraints, PredecessorRefiner: 0/1586 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60656ms problems are : Problem set: 0 solved, 1586 unsolved
Search for dead transitions found 0 dead transitions in 60660ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63971 ms. Remains : 714/714 places, 1632/1632 transitions.
Built C files in :
/tmp/ltsmin17994744323117964065
[2026-05-22 20:57:20] [INFO ] Too many transitions (1632) to apply POR reductions. Disabling POR matrices.
[2026-05-22 20:57:20] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17994744323117964065
Running compilation step : cd /tmp/ltsmin17994744323117964065;'/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/ltsmin17994744323117964065;'/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/ltsmin17994744323117964065;'/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-22 20:57:25] [INFO ] Flatten gal took : 93 ms
[2026-05-22 20:57:25] [INFO ] Flatten gal took : 81 ms
[2026-05-22 20:57:25] [INFO ] Time to serialize gal into /tmp/LTL14052730549730137437.gal : 16 ms
[2026-05-22 20:57:25] [INFO ] Time to serialize properties into /tmp/LTL14557994719665530171.prop : 0 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/LTL14052730549730137437.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13417930017448466817.hoa' '-atoms' '/tmp/LTL14557994719665530171.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...320
Loading property file /tmp/LTL14557994719665530171.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13417930017448466817.hoa
Detected timeout of ITS tools.
[2026-05-22 20:57:40] [INFO ] Flatten gal took : 40 ms
[2026-05-22 20:57:40] [INFO ] Flatten gal took : 41 ms
[2026-05-22 20:57:40] [INFO ] Time to serialize gal into /tmp/LTL9027778724245748219.gal : 10 ms
[2026-05-22 20:57:40] [INFO ] Time to serialize properties into /tmp/LTL17020115976405543460.ltl : 7 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/LTL9027778724245748219.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17020115976405543460.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...276
Read 1 LTL properties
Checking formula 0 : !((G((F((F("((p915==0)||(p1298==1))"))&&(G("(p619==1)"))))||(X(X(F(("((p238==0)||(p679==1))")&&(F("((p1143==0)||(p130==1))")))))))))
Formula 0 simplified : F(G(G!"((p915==0)||(p1298==1))" | F!"(p619==1)") & XXG(!"((p238==0)||(p679==1))" | G!"((p1143==0)||(p130==1))"))
Detected timeout of ITS tools.
[2026-05-22 20:57:55] [INFO ] Flatten gal took : 51 ms
[2026-05-22 20:57:55] [INFO ] Applying decomposition
[2026-05-22 20:57:55] [INFO ] Flatten gal took : 67 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/graph15051755738913761276.txt' '-o' '/tmp/graph15051755738913761276.bin' '-w' '/tmp/graph15051755738913761276.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15051755738913761276.bin' '-l' '-1' '-v' '-w' '/tmp/graph15051755738913761276.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:57:55] [INFO ] Decomposing Gal with order
[2026-05-22 20:57:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:57:56] [INFO ] Removed a total of 3205 redundant transitions.
[2026-05-22 20:57:56] [INFO ] Flatten gal took : 237 ms
[2026-05-22 20:57:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 47 ms.
[2026-05-22 20:57:56] [INFO ] Time to serialize gal into /tmp/LTL14582977369839781475.gal : 15 ms
[2026-05-22 20:57:56] [INFO ] Time to serialize properties into /tmp/LTL4564099711284176877.ltl : 0 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/LTL14582977369839781475.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4564099711284176877.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((F((F("((i10.u103.p915==0)||(i14.u139.p1298==1))"))&&(G("(i7.u72.p619==1)"))))||(X(X(F(("((i5.u30.p238==0)||(i4.u80.p679==1))")&&...208
Formula 0 simplified : F(G(G!"((i10.u103.p915==0)||(i14.u139.p1298==1))" | F!"(i7.u72.p619==1)") & XXG(!"((i5.u30.p238==0)||(i4.u80.p679==1))" | G!"((i12.u...190
Detected timeout of ITS tools.
Treatment of property ASLink-PT-08a-LTLCardinality-02 finished in 618528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(F((X(p1)&&F(p2))))||p0)) U p3)))'
Support contains 8 out of 1608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1608/1608 places, 2400/2400 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1606 transition count 2393
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1606 transition count 2393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1605 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1605 transition count 2392
Applied a total of 6 rules in 140 ms. Remains 1605 /1608 variables (removed 3) and now considering 2392/2400 (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-11087528280307066417.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3445086072806645110.kers'
[2026-05-22 20:58:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11087528280307066417.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3445086072806645110.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 2392 rows 1605 cols 8329 entries
Finished phase 1 with 1042 SingleSign rule and 344 generalized
[2026-05-22 20:58:11] [INFO ] Computed 219 invariants in 50 ms
Computed 219 P flows in 51 ms.
Exported basis to /tmp/petrispot-output-3445086072806645110.kers
Total runtime 54 ms.
[2026-05-22 20:58:12] [INFO ] Implicit Places using invariants in 1341 ms returned [572, 1314]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1359 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1603/1608 places, 2392/2400 transitions.
Applied a total of 0 rules in 47 ms. Remains 1603 /1603 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1547 ms. Remains : 1603/1608 places, 2392/2400 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(F((X(p1)&&F(p2))))||p0)) U p3)))'
Stuttering acceptance computed with spot in 289 ms :[(NOT p3), (NOT p3), (OR (NOT p3) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : ASLink-PT-08a-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 944 ms.
Product exploration explored 100000 steps with 50000 reset in 922 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 4 factoid took 24 ms. Proved property starting from automaton with 6 states, 9 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 31 ms.
FORMULA ASLink-PT-08a-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-08a-LTLCardinality-05 finished in 3846 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&&F((!p1&&X(X(G(!p2))))))||G((F(!p1)&&F(G(!p2)))))))'
Support contains 4 out of 1608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1608/1608 places, 2400/2400 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1607 transition count 2394
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1607 transition count 2394
Applied a total of 2 rules in 123 ms. Remains 1607 /1608 variables (removed 1) and now considering 2394/2400 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-754864608359163758.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5627191632980591183.kers'
[2026-05-22 20:58:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-754864608359163758.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5627191632980591183.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2394 rows 1607 cols 8334 entries
Finished phase 1 with 1044 SingleSign rule and 344 generalized
[2026-05-22 20:58:15] [INFO ] Computed 219 invariants in 16 ms
Computed 219 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-5627191632980591183.kers
Total runtime 24 ms.
[2026-05-22 20:58:17] [INFO ] Implicit Places using invariants in 1592 ms returned [572, 1314]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1605 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1605/1608 places, 2394/2400 transitions.
Applied a total of 0 rules in 45 ms. Remains 1605 /1605 variables (removed 0) and now considering 2394/2394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1789 ms. Remains : 1605/1608 places, 2394/2400 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p0)&&F(G(p1))))||(F((X(X(G(p1)))&&p3))&&p2))))'
Stuttering acceptance computed with spot in 505 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ASLink-PT-08a-LTLCardinality-07
Stuttering criterion allowed to conclude after 184 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-08a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLCardinality-07 finished in 2360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 1 out of 1608 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1608/1608 places, 2400/2400 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 302 transitions
Trivial Post-agglo rules discarded 302 transitions
Performed 302 trivial Post agglomeration. Transition count delta: 302
Iterating post reduction 0 with 302 rules applied. Total rules applied 302 place count 1607 transition count 2097
Reduce places removed 310 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 317 rules applied. Total rules applied 619 place count 1297 transition count 2090
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 627 place count 1290 transition count 2089
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 628 place count 1289 transition count 2089
Performed 231 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 231 Pre rules applied. Total rules applied 628 place count 1289 transition count 1858
Deduced a syphon composed of 231 places in 3 ms
Ensure Unique test removed 68 places
Reduce places removed 299 places and 0 transitions.
Iterating global reduction 4 with 530 rules applied. Total rules applied 1158 place count 990 transition count 1858
Discarding 20 places :
Implicit places reduction removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 4 with 45 rules applied. Total rules applied 1203 place count 970 transition count 1833
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 1228 place count 945 transition count 1833
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 32 Pre rules applied. Total rules applied 1228 place count 945 transition count 1801
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 1292 place count 913 transition count 1801
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 1306 place count 899 transition count 1782
Iterating global reduction 6 with 14 rules applied. Total rules applied 1320 place count 899 transition count 1782
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 6 with 14 rules applied. Total rules applied 1334 place count 898 transition count 1769
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1336 place count 896 transition count 1769
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1337 place count 895 transition count 1768
Iterating global reduction 8 with 1 rules applied. Total rules applied 1338 place count 895 transition count 1768
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1338 place count 895 transition count 1767
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1340 place count 894 transition count 1767
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 2 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 8 with 162 rules applied. Total rules applied 1502 place count 813 transition count 1686
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1503 place count 812 transition count 1685
Iterating global reduction 8 with 1 rules applied. Total rules applied 1504 place count 812 transition count 1685
Applied a total of 1504 rules in 324 ms. Remains 812 /1608 variables (removed 796) and now considering 1685/2400 (removed 715) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7018669646372318908.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12954397097581763873.kers'
[2026-05-22 20:58:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7018669646372318908.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12954397097581763873.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1685 rows 812 cols 6834 entries
Finished phase 1 with 323 SingleSign rule and 367 generalized
[2026-05-22 20:58:18] [INFO ] Computed 122 invariants in 13 ms
Computed 122 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-12954397097581763873.kers
Total runtime 15 ms.
[2026-05-22 20:58:18] [INFO ] Implicit Places using invariants in 977 ms returned [72, 89, 95, 100, 159, 171, 179, 185, 190, 192, 252, 269, 275, 280, 282, 291, 344, 365, 371, 376, 378, 438, 455, 461, 466, 468, 528, 545, 551, 556, 558, 618, 635, 641, 646, 648, 674, 709, 730, 738, 744, 746, 809]
Discarding 43 places :
Implicit Place search using SMT only with invariants took 996 ms to find 43 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 769/1608 places, 1685/2400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 769 transition count 1676
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 760 transition count 1676
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 34 place count 744 transition count 1660
Iterating global reduction 2 with 16 rules applied. Total rules applied 50 place count 744 transition count 1660
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 66 place count 728 transition count 1644
Iterating global reduction 2 with 16 rules applied. Total rules applied 82 place count 728 transition count 1644
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 90 place count 720 transition count 1636
Iterating global reduction 2 with 8 rules applied. Total rules applied 98 place count 720 transition count 1636
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 138 place count 700 transition count 1616
Applied a total of 138 rules in 112 ms. Remains 700 /769 variables (removed 69) and now considering 1616/1685 (removed 69) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12205889642676801734.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2951212691121195420.kers'
[2026-05-22 20:58:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12205889642676801734.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2951212691121195420.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1616 rows 700 cols 6513 entries
Finished phase 1 with 325 SingleSign rule and 296 generalized
[2026-05-22 20:58:19] [INFO ] Computed 79 invariants in 12 ms
Computed 79 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-2951212691121195420.kers
Total runtime 28 ms.
[2026-05-22 20:58:19] [INFO ] Implicit Places using invariants in 768 ms returned []
[2026-05-22 20:58:19] [INFO ] Invariant cache hit.
[2026-05-22 20:58:22] [INFO ] Implicit Places using invariants and state equation in 2438 ms returned []
Implicit Place search using SMT with State Equation took 3245 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 700/1608 places, 1616/2400 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4678 ms. Remains : 700/1608 places, 1616/2400 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Running random walk in product with property : ASLink-PT-08a-LTLCardinality-08
Product exploration explored 100000 steps with 1285 reset in 362 ms.
Product exploration explored 100000 steps with 1281 reset in 329 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (499 resets) in 264 ms. (150 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (83 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 217967 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 1
Probabilistic random walk after 217967 steps, saw 130793 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
[2026-05-22 20:58:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/57 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/99 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 98/197 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 59/256 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 59/315 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/315 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 59/374 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/374 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 59/433 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/433 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 59/492 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/492 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 29/521 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/521 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/527 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/527 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 172/699 variables, 44/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/699 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1/700 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2316/2316 variables, and 779 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1369 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 700/700 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/57 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/99 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 98/197 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 59/256 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 59/315 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/315 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 59/374 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/374 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 59/433 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/433 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 59/492 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/492 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 29/521 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/521 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/527 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/527 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 172/699 variables, 44/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/699 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1/700 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1616/2316 variables, 700/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2316 variables, 1/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2316 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/2316 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2316/2316 variables, and 780 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1310 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 700/700 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2703ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 138 ms.
Support contains 1 out of 700 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 700/700 places, 1616/1616 transitions.
Free-agglomeration rule applied 32 times.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 700 transition count 1584
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 72 place count 668 transition count 1576
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 1 with 23 rules applied. Total rules applied 95 place count 668 transition count 1553
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 118 place count 645 transition count 1553
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 645 transition count 1553
Applied a total of 119 rules in 145 ms. Remains 645 /700 variables (removed 55) and now considering 1553/1616 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 645/700 places, 1553/1616 transitions.
RANDOM walk for 40000 steps (680 resets) in 211 ms. (188 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (115 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 262609 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 1
Probabilistic random walk after 262609 steps, saw 153544 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12119403089638215595.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10939105520205706332.kers'
[2026-05-22 20:58:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12119403089638215595.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10939105520205706332.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1553 rows 645 cols 6528 entries
Finished phase 1 with 267 SingleSign rule and 299 generalized
[2026-05-22 20:58:32] [INFO ] Computed 79 invariants in 43 ms
Computed 79 P flows in 44 ms.
Exported basis to /tmp/petrispot-output-10939105520205706332.kers
Total runtime 49 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 46/89 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 91/180 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 55/235 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 55/290 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 55/345 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 55/400 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/400 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 55/455 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/455 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 29/484 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/484 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/490 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/490 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 154/644 variables, 45/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/644 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/645 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/645 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1553/2198 variables, 645/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2198 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/2198 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2198/2198 variables, and 724 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1606 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 645/645 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 46/89 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 91/180 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 55/235 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 55/290 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 55/345 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 55/400 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/400 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 55/455 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/455 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 29/484 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/484 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/490 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/490 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 154/644 variables, 45/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/644 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/645 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/645 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1553/2198 variables, 645/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2198 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2198 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/2198 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2198/2198 variables, and 725 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1590 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 645/645 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3280ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 157 ms.
Support contains 1 out of 645 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 645/645 places, 1553/1553 transitions.
Applied a total of 0 rules in 20 ms. Remains 645 /645 variables (removed 0) and now considering 1553/1553 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 645/645 places, 1553/1553 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 645/645 places, 1553/1553 transitions.
Applied a total of 0 rules in 20 ms. Remains 645 /645 variables (removed 0) and now considering 1553/1553 (removed 0) transitions.
[2026-05-22 20:58:35] [INFO ] Invariant cache hit.
[2026-05-22 20:58:36] [INFO ] Implicit Places using invariants in 1051 ms returned [88, 89, 161, 162, 232, 233, 303, 304, 374, 375, 445, 446, 516, 517]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 1074 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 631/645 places, 1553/1553 transitions.
Applied a total of 0 rules in 20 ms. Remains 631 /631 variables (removed 0) and now considering 1553/1553 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1114 ms. Remains : 631/645 places, 1553/1553 transitions.
RANDOM walk for 40000 steps (665 resets) in 259 ms. (153 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (112 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 271158 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 1
Probabilistic random walk after 271158 steps, saw 155882 distinct states, run finished after 3018 ms. (steps per millisecond=89 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7221243225380872998.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9291140550973371266.kers'
[2026-05-22 20:58:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7221243225380872998.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9291140550973371266.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1553 rows 631 cols 6339 entries
Finished phase 1 with 239 SingleSign rule and 327 generalized
[2026-05-22 20:58:40] [INFO ] Computed 65 invariants in 11 ms
Computed 65 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-9291140550973371266.kers
Total runtime 14 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 46/89 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 91/180 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 55/235 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 55/290 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 55/345 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 55/400 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/400 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 55/455 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/455 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 29/484 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/484 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/490 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/490 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 140/630 variables, 31/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/630 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/630 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 1/631 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/631 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1553/2184 variables, 631/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2184 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/2184 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2184/2184 variables, and 697 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1486 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 46/89 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 91/180 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 55/235 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 55/290 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 55/345 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 55/400 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/400 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 55/455 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/455 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 29/484 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/484 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/490 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/490 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 140/630 variables, 31/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/630 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/630 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 1/631 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/631 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1553/2184 variables, 631/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2184 variables, 1/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2184 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/2184 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2184/2184 variables, and 698 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1241 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2807ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 215 ms.
Support contains 1 out of 631 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1553/1553 transitions.
Applied a total of 0 rules in 22 ms. Remains 631 /631 variables (removed 0) and now considering 1553/1553 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 631/631 places, 1553/1553 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1553/1553 transitions.
Applied a total of 0 rules in 34 ms. Remains 631 /631 variables (removed 0) and now considering 1553/1553 (removed 0) transitions.
[2026-05-22 20:58:43] [INFO ] Invariant cache hit.
[2026-05-22 20:58:43] [INFO ] Implicit Places using invariants in 745 ms returned []
[2026-05-22 20:58:43] [INFO ] Invariant cache hit.
[2026-05-22 20:58:45] [INFO ] Implicit Places using invariants and state equation in 1888 ms returned []
Implicit Place search using SMT with State Equation took 2661 ms to find 0 implicit places.
[2026-05-22 20:58:45] [INFO ] Redundant transitions in 53 ms returned []
Running 1515 sub problems to find dead transitions.
[2026-05-22 20:58:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 31/63 constraints. Problems are: Problem set: 0 solved, 1515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 630/2184 variables, and 63 constraints, problems are : Problem set: 0 solved, 1515 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 32/34 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/631 constraints, PredecessorRefiner: 1515/1515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1515 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 31/63 constraints. Problems are: Problem set: 0 solved, 1515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 630/2184 variables, and 63 constraints, problems are : Problem set: 0 solved, 1515 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 32/34 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/631 constraints, PredecessorRefiner: 0/1515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60606ms problems are : Problem set: 0 solved, 1515 unsolved
Search for dead transitions found 0 dead transitions in 60613ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63371 ms. Remains : 631/631 places, 1553/1553 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 22 ms. Remains 631 /631 variables (removed 0) and now considering 1553/1553 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-22 20:59:46] [INFO ] Invariant cache hit.
[2026-05-22 20:59:46] [INFO ] [Real]Absence check using 34 positive place invariants in 32 ms returned sat
[2026-05-22 20:59:46] [INFO ] [Real]Absence check using 34 positive and 31 generalized place invariants in 159 ms returned sat
[2026-05-22 20:59:47] [INFO ] After 950ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 20:59:47] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2026-05-22 20:59:47] [INFO ] [Nat]Absence check using 34 positive and 31 generalized place invariants in 18 ms returned sat
[2026-05-22 20:59:48] [INFO ] After 789ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 20:59:48] [INFO ] After 910ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 20:59:48] [INFO ] After 1196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2213 ms.
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
Knowledge-based reduction took 85778 ms.
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Support contains 1 out of 700 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 700/700 places, 1616/1616 transitions.
Applied a total of 0 rules in 21 ms. Remains 700 /700 variables (removed 0) and now considering 1616/1616 (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-10222770213366411529.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13578172210519788740.kers'
[2026-05-22 20:59:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10222770213366411529.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13578172210519788740.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1616 rows 700 cols 6513 entries
Finished phase 1 with 325 SingleSign rule and 296 generalized
[2026-05-22 20:59:49] [INFO ] Computed 79 invariants in 11 ms
Computed 79 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-13578172210519788740.kers
Total runtime 13 ms.
[2026-05-22 20:59:49] [INFO ] Implicit Places using invariants in 635 ms returned []
[2026-05-22 20:59:49] [INFO ] Invariant cache hit.
[2026-05-22 20:59:52] [INFO ] Implicit Places using invariants and state equation in 2570 ms returned []
Implicit Place search using SMT with State Equation took 3207 ms to find 0 implicit places.
[2026-05-22 20:59:52] [INFO ] Redundant transitions in 29 ms returned []
Running 1570 sub problems to find dead transitions.
[2026-05-22 20:59:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/699 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/699 variables, 45/77 constraints. Problems are: Problem set: 0 solved, 1570 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 699/2316 variables, and 77 constraints, problems are : Problem set: 0 solved, 1570 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 32/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 0/700 constraints, PredecessorRefiner: 1570/1570 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1570 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/699 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/699 variables, 45/77 constraints. Problems are: Problem set: 0 solved, 1570 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 699/2316 variables, and 77 constraints, problems are : Problem set: 0 solved, 1570 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 32/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 0/700 constraints, PredecessorRefiner: 0/1570 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60638ms problems are : Problem set: 0 solved, 1570 unsolved
Search for dead transitions found 0 dead transitions in 60642ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63916 ms. Remains : 700/700 places, 1616/1616 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (505 resets) in 232 ms. (171 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (86 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 218415 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 1
Probabilistic random walk after 218415 steps, saw 131021 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
[2026-05-22 21:00:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/57 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/99 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 98/197 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 59/256 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 59/315 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/315 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 59/374 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/374 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 59/433 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/433 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 59/492 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/492 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 29/521 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/521 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/527 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/527 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 172/699 variables, 44/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/699 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1/700 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2316/2316 variables, and 779 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1561 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 700/700 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/57 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/99 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 98/197 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 59/256 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 59/315 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/315 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 59/374 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/374 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 59/433 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/433 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 59/492 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/492 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 29/521 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/521 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/527 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/527 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 172/699 variables, 44/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/699 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1/700 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/700 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1616/2316 variables, 700/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2316 variables, 1/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2316 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/2316 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2316/2316 variables, and 780 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1463 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 700/700 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3045ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 143 ms.
Support contains 1 out of 700 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 700/700 places, 1616/1616 transitions.
Free-agglomeration rule applied 32 times.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 700 transition count 1584
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 72 place count 668 transition count 1576
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 1 with 23 rules applied. Total rules applied 95 place count 668 transition count 1553
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 118 place count 645 transition count 1553
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 645 transition count 1553
Applied a total of 119 rules in 91 ms. Remains 645 /700 variables (removed 55) and now considering 1553/1616 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 645/700 places, 1553/1616 transitions.
RANDOM walk for 40000 steps (663 resets) in 220 ms. (180 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (113 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 262850 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 1
Probabilistic random walk after 262850 steps, saw 153621 distinct states, run finished after 3014 ms. (steps per millisecond=87 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2950014332775393841.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-365399648979605860.kers'
[2026-05-22 21:01:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2950014332775393841.kers, --Pflows, --basisKERS=/tmp/petrispot-output-365399648979605860.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1553 rows 645 cols 6528 entries
Finished phase 1 with 267 SingleSign rule and 299 generalized
[2026-05-22 21:01:02] [INFO ] Computed 79 invariants in 30 ms
Computed 79 P flows in 44 ms.
Exported basis to /tmp/petrispot-output-365399648979605860.kers
Total runtime 48 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 46/89 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 91/180 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 55/235 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 55/290 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 55/345 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 55/400 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/400 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 55/455 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/455 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 29/484 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/484 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/490 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/490 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 154/644 variables, 45/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/644 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/645 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/645 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1553/2198 variables, 645/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2198 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/2198 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2198/2198 variables, and 724 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1603 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 645/645 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 46/89 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 91/180 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 55/235 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 55/290 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 55/345 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 55/400 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/400 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 55/455 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/455 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 29/484 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/484 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/490 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/490 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 154/644 variables, 45/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/644 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/645 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/645 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1553/2198 variables, 645/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2198 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2198 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/2198 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2198/2198 variables, and 725 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1708 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 645/645 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3417ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 141 ms.
Support contains 1 out of 645 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 645/645 places, 1553/1553 transitions.
Applied a total of 0 rules in 21 ms. Remains 645 /645 variables (removed 0) and now considering 1553/1553 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 645/645 places, 1553/1553 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 645/645 places, 1553/1553 transitions.
Applied a total of 0 rules in 22 ms. Remains 645 /645 variables (removed 0) and now considering 1553/1553 (removed 0) transitions.
[2026-05-22 21:01:06] [INFO ] Invariant cache hit.
[2026-05-22 21:01:06] [INFO ] Implicit Places using invariants in 709 ms returned [88, 89, 161, 162, 232, 233, 303, 304, 374, 375, 445, 446, 516, 517]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 714 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 631/645 places, 1553/1553 transitions.
Applied a total of 0 rules in 36 ms. Remains 631 /631 variables (removed 0) and now considering 1553/1553 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 780 ms. Remains : 631/645 places, 1553/1553 transitions.
RANDOM walk for 40000 steps (666 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (122 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 277181 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 1
Probabilistic random walk after 277181 steps, saw 157415 distinct states, run finished after 3002 ms. (steps per millisecond=92 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6470685519909131833.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6749224109723084921.kers'
[2026-05-22 21:01:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6470685519909131833.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6749224109723084921.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1553 rows 631 cols 6339 entries
Finished phase 1 with 239 SingleSign rule and 327 generalized
[2026-05-22 21:01:10] [INFO ] Computed 65 invariants in 35 ms
Computed 65 P flows in 36 ms.
Exported basis to /tmp/petrispot-output-6749224109723084921.kers
Total runtime 52 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 46/89 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 91/180 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 55/235 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 55/290 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 55/345 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 55/400 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/400 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 55/455 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/455 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 29/484 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/484 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/490 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/490 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 140/630 variables, 31/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/630 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/630 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 1/631 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/631 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1553/2184 variables, 631/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2184 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/2184 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2184/2184 variables, and 697 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1687 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 46/89 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 91/180 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 55/235 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 55/290 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 55/345 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 55/400 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/400 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 55/455 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/455 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 29/484 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/484 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 6/490 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/490 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 140/630 variables, 31/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/630 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/630 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 1/631 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/631 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1553/2184 variables, 631/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2184 variables, 1/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2184 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/2184 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2184/2184 variables, and 698 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1166 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 631/631 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2954ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 203 ms.
Support contains 1 out of 631 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1553/1553 transitions.
Applied a total of 0 rules in 22 ms. Remains 631 /631 variables (removed 0) and now considering 1553/1553 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 631/631 places, 1553/1553 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1553/1553 transitions.
Applied a total of 0 rules in 24 ms. Remains 631 /631 variables (removed 0) and now considering 1553/1553 (removed 0) transitions.
[2026-05-22 21:01:13] [INFO ] Invariant cache hit.
[2026-05-22 21:01:14] [INFO ] Implicit Places using invariants in 861 ms returned []
[2026-05-22 21:01:14] [INFO ] Invariant cache hit.
[2026-05-22 21:01:15] [INFO ] Implicit Places using invariants and state equation in 1889 ms returned []
Implicit Place search using SMT with State Equation took 2775 ms to find 0 implicit places.
[2026-05-22 21:01:16] [INFO ] Redundant transitions in 55 ms returned []
Running 1515 sub problems to find dead transitions.
[2026-05-22 21:01:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 31/63 constraints. Problems are: Problem set: 0 solved, 1515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 630/2184 variables, and 63 constraints, problems are : Problem set: 0 solved, 1515 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 32/34 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/631 constraints, PredecessorRefiner: 1515/1515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1515 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 31/63 constraints. Problems are: Problem set: 0 solved, 1515 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 630/2184 variables, and 63 constraints, problems are : Problem set: 0 solved, 1515 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 32/34 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/631 constraints, PredecessorRefiner: 0/1515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60663ms problems are : Problem set: 0 solved, 1515 unsolved
Search for dead transitions found 0 dead transitions in 60667ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63546 ms. Remains : 631/631 places, 1553/1553 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 32 ms. Remains 631 /631 variables (removed 0) and now considering 1553/1553 (removed 0) transitions.
Running SMT prover for 1 properties.
[2026-05-22 21:02:16] [INFO ] Invariant cache hit.
[2026-05-22 21:02:16] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2026-05-22 21:02:16] [INFO ] [Real]Absence check using 34 positive and 31 generalized place invariants in 11 ms returned sat
[2026-05-22 21:02:17] [INFO ] After 879ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 21:02:17] [INFO ] [Nat]Absence check using 34 positive place invariants in 14 ms returned sat
[2026-05-22 21:02:17] [INFO ] [Nat]Absence check using 34 positive and 31 generalized place invariants in 13 ms returned sat
[2026-05-22 21:02:18] [INFO ] After 1048ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 21:02:18] [INFO ] After 1125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 21:02:18] [INFO ] After 1349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2272 ms.
Knowledge based reduction with 3 factoid took 49 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0)]
Knowledge-based reduction took 86230 ms.
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 1286 reset in 298 ms.
Product exploration explored 100000 steps with 1321 reset in 328 ms.
Built C files in :
/tmp/ltsmin49418249996540848
[2026-05-22 21:02:19] [INFO ] Too many transitions (1616) to apply POR reductions. Disabling POR matrices.
[2026-05-22 21:02:19] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin49418249996540848
Running compilation step : cd /tmp/ltsmin49418249996540848;'/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/ltsmin49418249996540848;'/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/ltsmin49418249996540848;'/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 1 out of 700 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 700/700 places, 1616/1616 transitions.
Applied a total of 0 rules in 54 ms. Remains 700 /700 variables (removed 0) and now considering 1616/1616 (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-9483368596964903453.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15790756532202703073.kers'
[2026-05-22 21:02:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9483368596964903453.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15790756532202703073.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1616 rows 700 cols 6513 entries
Finished phase 1 with 325 SingleSign rule and 296 generalized
[2026-05-22 21:02:23] [INFO ] Computed 79 invariants in 34 ms
Computed 79 P flows in 35 ms.
Exported basis to /tmp/petrispot-output-15790756532202703073.kers
Total runtime 36 ms.
[2026-05-22 21:02:23] [INFO ] Implicit Places using invariants in 848 ms returned []
[2026-05-22 21:02:23] [INFO ] Invariant cache hit.
[2026-05-22 21:02:26] [INFO ] Implicit Places using invariants and state equation in 2389 ms returned []
Implicit Place search using SMT with State Equation took 3241 ms to find 0 implicit places.
[2026-05-22 21:02:26] [INFO ] Redundant transitions in 39 ms returned []
Running 1570 sub problems to find dead transitions.
[2026-05-22 21:02:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/699 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/699 variables, 45/77 constraints. Problems are: Problem set: 0 solved, 1570 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 699/2316 variables, and 77 constraints, problems are : Problem set: 0 solved, 1570 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 32/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 0/700 constraints, PredecessorRefiner: 1570/1570 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1570 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/699 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/699 variables, 45/77 constraints. Problems are: Problem set: 0 solved, 1570 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 699/2316 variables, and 77 constraints, problems are : Problem set: 0 solved, 1570 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 32/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 0/700 constraints, PredecessorRefiner: 0/1570 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60686ms problems are : Problem set: 0 solved, 1570 unsolved
Search for dead transitions found 0 dead transitions in 60690ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64034 ms. Remains : 700/700 places, 1616/1616 transitions.
Built C files in :
/tmp/ltsmin6238390543211448067
[2026-05-22 21:03:27] [INFO ] Too many transitions (1616) to apply POR reductions. Disabling POR matrices.
[2026-05-22 21:03:27] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6238390543211448067
Running compilation step : cd /tmp/ltsmin6238390543211448067;'/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/ltsmin6238390543211448067;'/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/ltsmin6238390543211448067;'/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-22 21:03:30] [INFO ] Flatten gal took : 52 ms
[2026-05-22 21:03:30] [INFO ] Flatten gal took : 39 ms
[2026-05-22 21:03:30] [INFO ] Time to serialize gal into /tmp/LTL1144173990950344331.gal : 8 ms
[2026-05-22 21:03:30] [INFO ] Time to serialize properties into /tmp/LTL609442274522294930.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/LTL1144173990950344331.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16030988609271488539.hoa' '-atoms' '/tmp/LTL609442274522294930.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/LTL609442274522294930.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16030988609271488539.hoa
Detected timeout of ITS tools.
[2026-05-22 21:03:45] [INFO ] Flatten gal took : 35 ms
[2026-05-22 21:03:45] [INFO ] Flatten gal took : 29 ms
[2026-05-22 21:03:45] [INFO ] Time to serialize gal into /tmp/LTL14156734082521960934.gal : 7 ms
[2026-05-22 21:03:45] [INFO ] Time to serialize properties into /tmp/LTL9391135388632402821.ltl : 0 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/LTL14156734082521960934.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9391135388632402821.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...276
Read 1 LTL properties
Checking formula 0 : !((G("(p306!=1)")))
Formula 0 simplified : F!"(p306!=1)"
Detected timeout of ITS tools.
[2026-05-22 21:04:00] [INFO ] Flatten gal took : 60 ms
[2026-05-22 21:04:00] [INFO ] Applying decomposition
[2026-05-22 21:04:00] [INFO ] Flatten gal took : 32 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/graph17534242839237122149.txt' '-o' '/tmp/graph17534242839237122149.bin' '-w' '/tmp/graph17534242839237122149.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17534242839237122149.bin' '-l' '-1' '-v' '-w' '/tmp/graph17534242839237122149.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:04:00] [INFO ] Decomposing Gal with order
[2026-05-22 21:04:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:04:00] [INFO ] Removed a total of 3188 redundant transitions.
[2026-05-22 21:04:00] [INFO ] Flatten gal took : 99 ms
[2026-05-22 21:04:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 27 ms.
[2026-05-22 21:04:01] [INFO ] Time to serialize gal into /tmp/LTL7402771510284357823.gal : 12 ms
[2026-05-22 21:04:01] [INFO ] Time to serialize properties into /tmp/LTL4657593880455030253.ltl : 0 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/LTL7402771510284357823.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4657593880455030253.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...254
Read 1 LTL properties
Checking formula 0 : !((G("(i3.u42.p306!=1)")))
Formula 0 simplified : F!"(i3.u42.p306!=1)"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-08a-LTLCardinality-08 finished in 358385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 1608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1608/1608 places, 2400/2400 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1606 transition count 2393
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1606 transition count 2393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1605 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1605 transition count 2392
Applied a total of 6 rules in 192 ms. Remains 1605 /1608 variables (removed 3) and now considering 2392/2400 (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-13523475067902910786.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11417084146203588436.kers'
[2026-05-22 21:04:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13523475067902910786.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11417084146203588436.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2392 rows 1605 cols 8329 entries
Finished phase 1 with 1042 SingleSign rule and 344 generalized
[2026-05-22 21:04:16] [INFO ] Computed 219 invariants in 16 ms
Computed 219 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-11417084146203588436.kers
Total runtime 23 ms.
[2026-05-22 21:04:17] [INFO ] Implicit Places using invariants in 1648 ms returned [572, 1314]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1653 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1603/1608 places, 2392/2400 transitions.
Applied a total of 0 rules in 76 ms. Remains 1603 /1603 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1934 ms. Remains : 1603/1608 places, 2392/2400 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08a-LTLCardinality-09
Product exploration explored 100000 steps with 33333 reset in 807 ms.
Product exploration explored 100000 steps with 33333 reset in 765 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 27 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 35 ms.
FORMULA ASLink-PT-08a-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-08a-LTLCardinality-09 finished in 3801 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((G(p0) U X(X((p1&&X((p2&&G(F(p0))))))))))'
Support contains 4 out of 1608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1608/1608 places, 2400/2400 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1606 transition count 2393
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1606 transition count 2393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1605 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1605 transition count 2392
Applied a total of 6 rules in 136 ms. Remains 1605 /1608 variables (removed 3) and now considering 2392/2400 (removed 8) transitions.
[2026-05-22 21:04:20] [INFO ] Invariant cache hit.
[2026-05-22 21:04:21] [INFO ] Implicit Places using invariants in 1585 ms returned [572, 1314]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1600 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1603/1608 places, 2392/2400 transitions.
Applied a total of 0 rules in 63 ms. Remains 1603 /1603 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1799 ms. Remains : 1603/1608 places, 2392/2400 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((G(p0) U X(X((p1&&X((p2&&G(F(p0))))))))))'
Stuttering acceptance computed with spot in 689 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), true, (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : ASLink-PT-08a-LTLCardinality-10
Stuttering criterion allowed to conclude after 117 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-08a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLCardinality-10 finished in 2604 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(G(p0)))'
Support contains 2 out of 1608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1608/1608 places, 2400/2400 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1606 transition count 2393
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1606 transition count 2393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1605 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1605 transition count 2392
Applied a total of 6 rules in 191 ms. Remains 1605 /1608 variables (removed 3) and now considering 2392/2400 (removed 8) transitions.
[2026-05-22 21:04:22] [INFO ] Invariant cache hit.
[2026-05-22 21:04:24] [INFO ] Implicit Places using invariants in 1492 ms returned [572, 1314]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1495 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1603/1608 places, 2392/2400 transitions.
Applied a total of 0 rules in 55 ms. Remains 1603 /1603 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1742 ms. Remains : 1603/1608 places, 2392/2400 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(G(p0)))'
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-08a-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 41 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-08a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLCardinality-13 finished in 1919 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))&&F(p1)))'
Support contains 2 out of 1608 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1608/1608 places, 2400/2400 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1606 transition count 2393
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1606 transition count 2393
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1605 transition count 2392
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1605 transition count 2392
Applied a total of 6 rules in 175 ms. Remains 1605 /1608 variables (removed 3) and now considering 2392/2400 (removed 8) transitions.
[2026-05-22 21:04:24] [INFO ] Invariant cache hit.
[2026-05-22 21:04:26] [INFO ] Implicit Places using invariants in 1503 ms returned [572, 1314]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1513 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1603/1608 places, 2392/2400 transitions.
Applied a total of 0 rules in 75 ms. Remains 1603 /1603 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1765 ms. Remains : 1603/1608 places, 2392/2400 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))&&F(p1)))'
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : ASLink-PT-08a-LTLCardinality-14
Stuttering criterion allowed to conclude after 98 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-08a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLCardinality-14 finished in 2000 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((X(G(p0))&&F(p1))))'
Support contains 5 out of 1608 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1608/1608 places, 2400/2400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 302 transitions
Trivial Post-agglo rules discarded 302 transitions
Performed 302 trivial Post agglomeration. Transition count delta: 302
Iterating post reduction 0 with 302 rules applied. Total rules applied 302 place count 1608 transition count 2098
Reduce places removed 302 places and 0 transitions.
Iterating post reduction 1 with 302 rules applied. Total rules applied 604 place count 1306 transition count 2098
Performed 212 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 212 Pre rules applied. Total rules applied 604 place count 1306 transition count 1886
Deduced a syphon composed of 212 places in 3 ms
Ensure Unique test removed 68 places
Reduce places removed 280 places and 0 transitions.
Iterating global reduction 2 with 492 rules applied. Total rules applied 1096 place count 1026 transition count 1886
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 20 rules applied. Total rules applied 1116 place count 1015 transition count 1877
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1125 place count 1006 transition count 1877
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 31 Pre rules applied. Total rules applied 1125 place count 1006 transition count 1846
Deduced a syphon composed of 31 places in 3 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 1187 place count 975 transition count 1846
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1193 place count 969 transition count 1835
Iterating global reduction 4 with 6 rules applied. Total rules applied 1199 place count 969 transition count 1835
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 4 with 6 rules applied. Total rules applied 1205 place count 968 transition count 1830
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1207 place count 966 transition count 1830
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1208 place count 965 transition count 1829
Iterating global reduction 6 with 1 rules applied. Total rules applied 1209 place count 965 transition count 1829
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1209 place count 965 transition count 1828
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1211 place count 964 transition count 1828
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 2 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 6 with 178 rules applied. Total rules applied 1389 place count 875 transition count 1739
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1390 place count 874 transition count 1738
Iterating global reduction 6 with 1 rules applied. Total rules applied 1391 place count 874 transition count 1738
Applied a total of 1391 rules in 238 ms. Remains 874 /1608 variables (removed 734) and now considering 1738/2400 (removed 662) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1261115897774899707.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7478095376695786214.kers'
[2026-05-22 21:04:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1261115897774899707.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7478095376695786214.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 1 ms.
// Phase 1: matrix 1738 rows 866 cols 7000 entries
Finished phase 1 with 380 SingleSign rule and 355 generalized
[2026-05-22 21:04:26] [INFO ] Computed 139 invariants in 13 ms
Computed 139 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-7478095376695786214.kers
Total runtime 18 ms.
[2026-05-22 21:04:27] [INFO ] Implicit Places using invariants in 813 ms returned [90, 96, 101, 118, 189, 195, 200, 216, 286, 292, 297, 313, 314, 389, 395, 400, 416, 486, 492, 497, 513, 575, 586, 592, 597, 613, 684, 690, 695, 711, 786, 794, 800, 819, 871]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 815 ms to find 35 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 839/1608 places, 1738/2400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 839 transition count 1733
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 834 transition count 1733
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 10 place count 834 transition count 1717
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 42 place count 818 transition count 1717
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 58 place count 802 transition count 1701
Iterating global reduction 2 with 16 rules applied. Total rules applied 74 place count 802 transition count 1701
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 90 place count 786 transition count 1685
Iterating global reduction 2 with 16 rules applied. Total rules applied 106 place count 786 transition count 1685
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 115 place count 777 transition count 1676
Iterating global reduction 2 with 9 rules applied. Total rules applied 124 place count 777 transition count 1676
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 776 transition count 1675
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 776 transition count 1675
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 775 transition count 1674
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 775 transition count 1674
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 162 place count 758 transition count 1657
Applied a total of 162 rules in 152 ms. Remains 758 /839 variables (removed 81) and now considering 1657/1738 (removed 81) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12171571068073476728.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5334189907341260925.kers'
[2026-05-22 21:04:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12171571068073476728.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5334189907341260925.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1657 rows 758 cols 6737 entries
Finished phase 1 with 340 SingleSign rule and 314 generalized
[2026-05-22 21:04:27] [INFO ] Computed 104 invariants in 25 ms
Computed 104 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-5334189907341260925.kers
Total runtime 29 ms.
[2026-05-22 21:04:28] [INFO ] Implicit Places using invariants in 1017 ms returned [93, 96, 179, 182, 263, 266, 347, 350, 431, 434, 517, 520, 602, 605, 691, 694]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1032 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 742/1608 places, 1657/2400 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 742 transition count 1649
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 734 transition count 1649
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 24 place count 726 transition count 1641
Iterating global reduction 2 with 8 rules applied. Total rules applied 32 place count 726 transition count 1641
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 40 place count 726 transition count 1633
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 725 transition count 1632
Applied a total of 42 rules in 84 ms. Remains 725 /742 variables (removed 17) and now considering 1632/1657 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5547203304693026668.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-660460553491206739.kers'
[2026-05-22 21:04:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5547203304693026668.kers, --Pflows, --basisKERS=/tmp/petrispot-output-660460553491206739.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1632 rows 725 cols 6531 entries
Finished phase 1 with 331 SingleSign rule and 306 generalized
[2026-05-22 21:04:28] [INFO ] Computed 88 invariants in 11 ms
Computed 88 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-660460553491206739.kers
Total runtime 13 ms.
[2026-05-22 21:04:29] [INFO ] Implicit Places using invariants in 727 ms returned [72, 152, 233, 313, 393, 473, 555, 637]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 740 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 717/1608 places, 1632/2400 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 709 transition count 1624
Applied a total of 16 rules in 42 ms. Remains 709 /717 variables (removed 8) and now considering 1624/1632 (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-1403543167310936565.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11581295831135108085.kers'
[2026-05-22 21:04:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1403543167310936565.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11581295831135108085.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1624 rows 709 cols 6555 entries
Finished phase 1 with 331 SingleSign rule and 298 generalized
[2026-05-22 21:04:29] [INFO ] Computed 80 invariants in 11 ms
Computed 80 P flows in 33 ms.
Exported basis to /tmp/petrispot-output-11581295831135108085.kers
Total runtime 35 ms.
[2026-05-22 21:04:30] [INFO ] Implicit Places using invariants in 858 ms returned []
[2026-05-22 21:04:30] [INFO ] Invariant cache hit.
[2026-05-22 21:04:31] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-22 21:04:33] [INFO ] Implicit Places using invariants and state equation in 2677 ms returned []
Implicit Place search using SMT with State Equation took 3559 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 709/1608 places, 1624/2400 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 6674 ms. Remains : 709/1608 places, 1624/2400 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((X(G(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-08a-LTLCardinality-15
Stuttering criterion allowed to conclude after 90 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-08a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-08a-LTLCardinality-15 finished in 6899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((F(p0)&&G(p1)))||X(X(F((p2&&F(p3))))))))'
Spot run failed in 131 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Spot run failed in 44 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-22 21:04:33] [INFO ] Flatten gal took : 38 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2674338657701762604
[2026-05-22 21:04:33] [INFO ] Too many transitions (2400) to apply POR reductions. Disabling POR matrices.
[2026-05-22 21:04:33] [INFO ] Applying decomposition
[2026-05-22 21:04:33] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2674338657701762604
Running compilation step : cd /tmp/ltsmin2674338657701762604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-22 21:04:33] [INFO ] Flatten gal took : 42 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/graph8832848504089740687.txt' '-o' '/tmp/graph8832848504089740687.bin' '-w' '/tmp/graph8832848504089740687.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8832848504089740687.bin' '-l' '-1' '-v' '-w' '/tmp/graph8832848504089740687.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:04:33] [INFO ] Decomposing Gal with order
[2026-05-22 21:04:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:04:34] [INFO ] Removed a total of 3193 redundant transitions.
[2026-05-22 21:04:34] [INFO ] Flatten gal took : 101 ms
[2026-05-22 21:04:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 23 ms.
[2026-05-22 21:04:34] [INFO ] Time to serialize gal into /tmp/LTLCardinality1581754486969868490.gal : 18 ms
[2026-05-22 21:04:34] [INFO ] Time to serialize properties into /tmp/LTLCardinality7850155726394673437.ltl : 0 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/LTLCardinality1581754486969868490.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7850155726394673437.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...276
Read 2 LTL properties
Checking formula 0 : !((G((F((F("((i9.u242.p915==0)||(i13.u360.p1298==1))"))&&(G("(i10.u181.p619==1)"))))||(X(X(F(("((i4.u69.p238==0)||(i7.u225.p679==1))")...210
Formula 0 simplified : F(G(G!"((i9.u242.p915==0)||(i13.u360.p1298==1))" | F!"(i10.u181.p619==1)") & XXG(!"((i4.u69.p238==0)||(i7.u225.p679==1))" | G!"((i11...192
Compilation finished in 5748 ms.
Running link step : cd /tmp/ltsmin2674338657701762604;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 121 ms.
Running LTSmin : cd /tmp/ltsmin2674338657701762604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[]((<>((<>((LTLAPp0==true))&&[]((LTLAPp1==true))))||X(X(<>(((LTLAPp2==true)&&<>((LTLAPp3==true))))))))' '--buchi-type=spotba'
LTSmin run took 1685 ms.
FORMULA ASLink-PT-08a-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin2674338657701762604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[]((LTLAPp4==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin2674338657701762604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[]((LTLAPp4==true))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin2674338657701762604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[]((LTLAPp4==true))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-22 21:31:57] [INFO ] Applying decomposition
[2026-05-22 21:31:57] [INFO ] Flatten gal took : 46 ms
[2026-05-22 21:31:57] [INFO ] Decomposing Gal with order
[2026-05-22 21:31:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:31:57] [INFO ] Removed a total of 2679 redundant transitions.
[2026-05-22 21:31:57] [INFO ] Flatten gal took : 107 ms
[2026-05-22 21:31:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 1030 labels/synchronizations in 42 ms.
[2026-05-22 21:31:57] [INFO ] Time to serialize gal into /tmp/LTLCardinality11913705299541341219.gal : 10 ms
[2026-05-22 21:31:57] [INFO ] Time to serialize properties into /tmp/LTLCardinality13332200291459741496.ltl : 0 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/LTLCardinality11913705299541341219.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13332200291459741496.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...278
Read 1 LTL properties
Checking formula 0 : !((G("(i13.i1.u45.p306!=1)")))
Formula 0 simplified : F!"(i13.i1.u45.p306!=1)"

BK_TIME_CONFINEMENT_REACHED

--------------------
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="ASLink-PT-08a"
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 ASLink-PT-08a, 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 r002-oct2-177944366200395"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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