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-177944366200364.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-06a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366200364
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 6.0K Mar 5 14:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Mar 5 14:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 5 14:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 5 14:23 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.6K Mar 15 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Mar 5 14:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 5 14:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 5 14:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 5 14:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:09 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 597K 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-06a-LTLFireability-00
FORMULA_NAME ASLink-PT-06a-LTLFireability-01
FORMULA_NAME ASLink-PT-06a-LTLFireability-02
FORMULA_NAME ASLink-PT-06a-LTLFireability-03
FORMULA_NAME ASLink-PT-06a-LTLFireability-04
FORMULA_NAME ASLink-PT-06a-LTLFireability-05
FORMULA_NAME ASLink-PT-06a-LTLFireability-06
FORMULA_NAME ASLink-PT-06a-LTLFireability-07
FORMULA_NAME ASLink-PT-06a-LTLFireability-08
FORMULA_NAME ASLink-PT-06a-LTLFireability-09
FORMULA_NAME ASLink-PT-06a-LTLFireability-10
FORMULA_NAME ASLink-PT-06a-LTLFireability-11
FORMULA_NAME ASLink-PT-06a-LTLFireability-12
FORMULA_NAME ASLink-PT-06a-LTLFireability-13
FORMULA_NAME ASLink-PT-06a-LTLFireability-14
FORMULA_NAME ASLink-PT-06a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779478288806

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-06a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 19:31:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 19:31:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 19:31:30] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2026-05-22 19:31:30] [INFO ] Transformed 1406 places.
[2026-05-22 19:31:30] [INFO ] Transformed 2100 transitions.
[2026-05-22 19:31:30] [INFO ] Found NUPN structural information;
[2026-05-22 19:31:30] [INFO ] Parsed PT model containing 1406 places and 2100 transitions and 7896 arcs in 256 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 22 transitions
Reduce redundant transitions removed 22 transitions.
FORMULA ASLink-PT-06a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 65 out of 1406 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1406/1406 places, 2078/2078 transitions.
Ensure Unique test removed 23 places
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 1371 transition count 2078
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 43 place count 1363 transition count 2047
Ensure Unique test removed 1 places
Iterating global reduction 1 with 9 rules applied. Total rules applied 52 place count 1362 transition count 2047
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 1362 transition count 2045
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1361 transition count 2037
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1361 transition count 2037
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1360 transition count 2029
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1360 transition count 2029
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 1359 transition count 2021
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 1359 transition count 2021
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 1358 transition count 2013
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 1358 transition count 2013
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 1357 transition count 2005
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 1357 transition count 2005
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 1356 transition count 1997
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 1356 transition count 1997
Applied a total of 66 rules in 703 ms. Remains 1356 /1406 variables (removed 50) and now considering 1997/2078 (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-16478399983650128955.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5940206385087192066.kers'
[2026-05-22 19:31:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16478399983650128955.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5940206385087192066.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 4 ms.
// Phase 1: matrix 1997 rows 1355 cols 7460 entries
Finished phase 1 with 543 SingleSign rule and 579 generalized
[2026-05-22 19:31:31] [INFO ] Computed 234 invariants in 37 ms
Computed 234 P flows in 38 ms.
Exported basis to /tmp/petrispot-output-5940206385087192066.kers
Total runtime 40 ms.
[2026-05-22 19:31:33] [INFO ] Implicit Places using invariants in 1543 ms returned [1, 19, 20, 23, 33, 69, 198, 214, 219, 220, 240, 258, 387, 404, 409, 411, 429, 447, 576, 592, 597, 618, 636, 765, 781, 786, 787, 807, 825, 954, 970, 975, 976, 977, 995, 1013, 1142, 1147, 1159, 1164, 1165, 1194, 1196, 1199, 1217, 1219, 1220, 1237, 1245, 1253, 1259, 1265, 1271, 1277, 1285, 1291, 1297, 1305]
Discarding 58 places :
Implicit Place search using SMT only with invariants took 1594 ms to find 58 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1298/1406 places, 1997/2078 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1285 transition count 1984
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1285 transition count 1984
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 1275 transition count 1974
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 1275 transition count 1974
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1270 transition count 1969
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1270 transition count 1969
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 1268 transition count 1967
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 1268 transition count 1967
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 1266 transition count 1965
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 1266 transition count 1965
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1265 transition count 1964
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1265 transition count 1964
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1264 transition count 1963
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1264 transition count 1963
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1263 transition count 1962
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1263 transition count 1962
Applied a total of 70 rules in 340 ms. Remains 1263 /1298 variables (removed 35) and now considering 1962/1997 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13399374373080081048.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1471379189320276913.kers'
[2026-05-22 19:31:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13399374373080081048.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1471379189320276913.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 1962 rows 1262 cols 6969 entries
Finished phase 1 with 753 SingleSign rule and 334 generalized
[2026-05-22 19:31:33] [INFO ] Computed 176 invariants in 14 ms
Computed 176 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-1471379189320276913.kers
Total runtime 18 ms.
[2026-05-22 19:31:34] [INFO ] Implicit Places using invariants in 914 ms returned []
[2026-05-22 19:31:34] [INFO ] Invariant cache hit.
[2026-05-22 19:31:37] [INFO ] Implicit Places using invariants and state equation in 3437 ms returned []
Implicit Place search using SMT with State Equation took 4382 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1263/1406 places, 1962/2078 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7032 ms. Remains : 1263/1406 places, 1962/2078 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1263/1263 places, 1962/1962 transitions.
Applied a total of 0 rules in 52 ms. Remains 1263 /1263 variables (removed 0) and now considering 1962/1962 (removed 0) transitions.
[2026-05-22 19:31:37] [INFO ] Invariant cache hit.
[2026-05-22 19:31:38] [INFO ] Implicit Places using invariants in 819 ms returned []
[2026-05-22 19:31:38] [INFO ] Invariant cache hit.
[2026-05-22 19:31:41] [INFO ] Implicit Places using invariants and state equation in 3301 ms returned []
Implicit Place search using SMT with State Equation took 4130 ms to find 0 implicit places.
Running 1961 sub problems to find dead transitions.
[2026-05-22 19:31:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1262 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 1961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1262/3225 variables, and 124 constraints, problems are : Problem set: 0 solved, 1961 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 0/27 constraints, Generalized P Invariants (flows): 124/149 constraints, State Equation: 0/1263 constraints, PredecessorRefiner: 1961/1961 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1262 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 1961 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1262/3225 variables, and 124 constraints, problems are : Problem set: 0 solved, 1961 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 0/27 constraints, Generalized P Invariants (flows): 124/149 constraints, State Equation: 0/1263 constraints, PredecessorRefiner: 0/1961 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61041ms problems are : Problem set: 0 solved, 1961 unsolved
Search for dead transitions found 0 dead transitions in 61082ms
Finished structural reductions in LTL mode , in 1 iterations and 65319 ms. Remains : 1263/1263 places, 1962/1962 transitions.
Support contains 65 out of 1263 places after structural reductions.
[2026-05-22 19:32:43] [INFO ] Flatten gal took : 147 ms
[2026-05-22 19:32:43] [INFO ] Flatten gal took : 84 ms
[2026-05-22 19:32:43] [INFO ] Input system was already deterministic with 1962 transitions.
Support contains 64 out of 1263 places (down from 65) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 36 to 34
RANDOM walk for 40000 steps (223 resets) in 1474 ms. (27 steps per ms) remains 20/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
[2026-05-22 19:32:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 239/278 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 174/452 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/452 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 768/1220 variables, 138/165 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/1220 variables, 3/168 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1220 variables, 0/168 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 43/1263 variables, 11/179 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1263 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 1962/3225 variables, 1263/1442 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3225/3225 variables, and 1442 constraints, problems are : Problem set: 1 solved, 19 unsolved in 5034 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 149/149 constraints, State Equation: 1263/1263 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 240/277 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 174/451 variables, 19/27 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/451 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 766/1217 variables, 137/164 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1217 variables, 3/167 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1217 variables, 1/168 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1217 variables, 0/168 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 46/1263 variables, 12/180 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1263 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 11 (OVERLAPS) 1962/3225 variables, 1263/1443 constraints. Problems are: Problem set: 5 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3225/3225 variables, and 1458 constraints, problems are : Problem set: 5 solved, 15 unsolved in 5031 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 149/149 constraints, State Equation: 1263/1263 constraints, PredecessorRefiner: 15/20 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10085ms problems are : Problem set: 5 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 1263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1263/1263 places, 1962/1962 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 208 rules applied. Total rules applied 208 place count 1262 transition count 1755
Reduce places removed 207 places and 0 transitions.
Iterating post reduction 1 with 207 rules applied. Total rules applied 415 place count 1055 transition count 1755
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 415 place count 1055 transition count 1601
Deduced a syphon composed of 154 places in 2 ms
Ensure Unique test removed 52 places
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 775 place count 849 transition count 1601
Discarding 3 places :
Implicit places reduction removed 3 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 12 rules applied. Total rules applied 787 place count 846 transition count 1592
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 796 place count 837 transition count 1592
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 796 place count 837 transition count 1576
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 828 place count 821 transition count 1576
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 831 place count 818 transition count 1568
Iterating global reduction 4 with 3 rules applied. Total rules applied 834 place count 818 transition count 1568
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 836 place count 817 transition count 1567
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 837 place count 816 transition count 1567
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 837 place count 816 transition count 1566
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 839 place count 815 transition count 1566
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 7 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 6 with 136 rules applied. Total rules applied 975 place count 747 transition count 1498
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 976 place count 746 transition count 1497
Iterating global reduction 6 with 1 rules applied. Total rules applied 977 place count 746 transition count 1497
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 982 place count 746 transition count 1492
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 987 place count 741 transition count 1492
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 7 with 21 rules applied. Total rules applied 1008 place count 741 transition count 1471
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 1029 place count 720 transition count 1471
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1031 place count 720 transition count 1469
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 8 with 18 rules applied. Total rules applied 1049 place count 720 transition count 1469
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1050 place count 719 transition count 1468
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1060 place count 710 transition count 1467
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 26 Pre rules applied. Total rules applied 1060 place count 710 transition count 1441
Deduced a syphon composed of 26 places in 2 ms
Ensure Unique test removed 7 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 9 with 59 rules applied. Total rules applied 1119 place count 677 transition count 1441
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 9 with 4 rules applied. Total rules applied 1123 place count 673 transition count 1441
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1132 place count 664 transition count 1432
Iterating global reduction 10 with 9 rules applied. Total rules applied 1141 place count 664 transition count 1432
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1147 place count 664 transition count 1426
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1150 place count 661 transition count 1423
Iterating global reduction 11 with 3 rules applied. Total rules applied 1153 place count 661 transition count 1423
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1156 place count 658 transition count 1420
Iterating global reduction 11 with 3 rules applied. Total rules applied 1159 place count 658 transition count 1420
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 1162 place count 658 transition count 1417
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 1170 place count 654 transition count 1413
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1171 place count 654 transition count 1412
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1172 place count 654 transition count 1411
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1173 place count 653 transition count 1411
Applied a total of 1173 rules in 695 ms. Remains 653 /1263 variables (removed 610) and now considering 1411/1962 (removed 551) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 695 ms. Remains : 653/1263 places, 1411/1962 transitions.
RANDOM walk for 40000 steps (617 resets) in 454 ms. (87 steps per ms) remains 11/15 properties
BEST_FIRST walk for 40004 steps (132 resets) in 138 ms. (287 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (125 resets) in 120 ms. (330 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (128 resets) in 111 ms. (357 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (126 resets) in 124 ms. (320 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (133 resets) in 141 ms. (281 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (114 resets) in 108 ms. (367 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (129 resets) in 117 ms. (339 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (126 resets) in 137 ms. (289 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (116 resets) in 86 ms. (459 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (127 resets) in 83 ms. (476 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (122 resets) in 63 ms. (625 steps per ms) remains 11/11 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7031737162367796769.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12034119054840997907.kers'
[2026-05-22 19:32:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7031737162367796769.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12034119054840997907.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 1411 rows 648 cols 5758 entries
Finished phase 1 with 212 SingleSign rule and 342 generalized
[2026-05-22 19:32:55] [INFO ] Computed 99 invariants in 9 ms
Computed 99 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-12034119054840997907.kers
Total runtime 10 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 228/250 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 120/370 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 7/377 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 251/628 variables, 61/89 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/628 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/628 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 15/643 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/643 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 10/653 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/653 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 1411/2064 variables, 653/754 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2064 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 0/2064 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2064/2064 variables, and 754 constraints, problems are : Problem set: 0 solved, 11 unsolved in 3890 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 653/653 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 2/2 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/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 228/250 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 120/370 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 7/377 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 251/628 variables, 61/90 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/628 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/628 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 15/643 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/643 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 10/653 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/653 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/653 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
At refinement iteration 16 (OVERLAPS) 1411/2064 variables, 653/755 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2064 variables, 1/756 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2064 variables, 1/757 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2064 variables, 0/757 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/2064 variables, 0/757 constraints. Problems are: Problem set: 10 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2064/2064 variables, and 757 constraints, problems are : Problem set: 10 solved, 1 unsolved in 3740 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 653/653 constraints, PredecessorRefiner: 1/11 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7678ms problems are : Problem set: 10 solved, 1 unsolved
Parikh walk visited 0 properties in 91 ms.
Support contains 2 out of 653 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 653/653 places, 1411/1411 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 651 transition count 1397
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 651 transition count 1397
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 650 transition count 1397
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 5 place count 650 transition count 1396
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 649 transition count 1396
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 648 transition count 1388
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 648 transition count 1388
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 647 transition count 1380
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 647 transition count 1380
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 646 transition count 1372
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 646 transition count 1372
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 645 transition count 1364
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 645 transition count 1364
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 644 transition count 1356
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 644 transition count 1356
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 643 transition count 1348
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 643 transition count 1348
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 642 transition count 1340
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 642 transition count 1340
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 641 transition count 1332
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 641 transition count 1332
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 640 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 640 transition count 1324
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 639 transition count 1323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 638 transition count 1322
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 638 transition count 1322
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 638 transition count 1321
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 637 transition count 1320
Applied a total of 32 rules in 225 ms. Remains 637 /653 variables (removed 16) and now considering 1320/1411 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 637/653 places, 1320/1411 transitions.
RANDOM walk for 40000 steps (630 resets) in 286 ms. (139 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (128 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 307120 steps, run visited all 1 properties in 1405 ms. (steps per millisecond=218 )
Probabilistic random walk after 307120 steps, saw 199220 distinct states, run finished after 1409 ms. (steps per millisecond=217 ) properties seen :1
Successfully simplified 17 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA ASLink-PT-06a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA ASLink-PT-06a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p1)))&&p0)))'
Support contains 3 out of 1263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1263/1263 places, 1962/1962 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1262 transition count 1962
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 1258 transition count 1936
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 1258 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 1257 transition count 1928
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 1257 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 1256 transition count 1920
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 1256 transition count 1920
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 1255 transition count 1912
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 1255 transition count 1912
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 1254 transition count 1904
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 1254 transition count 1904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 1253 transition count 1896
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 1253 transition count 1896
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 1252 transition count 1888
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 1252 transition count 1888
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 1251 transition count 1880
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 1251 transition count 1880
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 1250 transition count 1872
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 1250 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 1249 transition count 1864
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 1249 transition count 1864
Applied a total of 27 rules in 379 ms. Remains 1249 /1263 variables (removed 14) and now considering 1864/1962 (removed 98) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18139957723203277446.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8254185818489404927.kers'
[2026-05-22 19:33:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18139957723203277446.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8254185818489404927.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1864 rows 1249 cols 6577 entries
Finished phase 1 with 747 SingleSign rule and 327 generalized
[2026-05-22 19:33:05] [INFO ] Computed 175 invariants in 12 ms
Computed 175 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-8254185818489404927.kers
Total runtime 17 ms.
[2026-05-22 19:33:07] [INFO ] Implicit Places using invariants in 1148 ms returned [46, 211, 393, 576, 758, 1121, 1159]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1152 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1242/1263 places, 1864/1962 transitions.
Applied a total of 0 rules in 62 ms. Remains 1242 /1242 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1594 ms. Remains : 1242/1263 places, 1864/1962 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(p1)))&&p0)))'
Stuttering acceptance computed with spot in 386 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ASLink-PT-06a-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-06a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06a-LTLFireability-00 finished in 2061 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(X(X(X(p1)))))))))'
Support contains 4 out of 1263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1263/1263 places, 1962/1962 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1262 transition count 1962
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 1259 transition count 1942
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 1259 transition count 1942
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 1258 transition count 1934
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 1258 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 1257 transition count 1926
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 1257 transition count 1926
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 1256 transition count 1918
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 1256 transition count 1918
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 1255 transition count 1910
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 1255 transition count 1910
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 1254 transition count 1902
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 1254 transition count 1902
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 1253 transition count 1894
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 1253 transition count 1894
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 1252 transition count 1886
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 1252 transition count 1886
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 1251 transition count 1878
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 1251 transition count 1878
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 1250 transition count 1870
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 1250 transition count 1870
Applied a total of 25 rules in 420 ms. Remains 1250 /1263 variables (removed 13) and now considering 1870/1962 (removed 92) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15800869260679814207.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3467571882352193009.kers'
[2026-05-22 19:33:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15800869260679814207.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3467571882352193009.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1870 rows 1250 cols 6601 entries
Finished phase 1 with 749 SingleSign rule and 326 generalized
[2026-05-22 19:33:07] [INFO ] Computed 175 invariants in 13 ms
Computed 175 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-3467571882352193009.kers
Total runtime 30 ms.
[2026-05-22 19:33:08] [INFO ] Implicit Places using invariants in 1026 ms returned [46, 211, 393, 575, 759, 1122, 1160]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1028 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1243/1263 places, 1870/1962 transitions.
Applied a total of 0 rules in 42 ms. Remains 1243 /1243 variables (removed 0) and now considering 1870/1870 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1490 ms. Remains : 1243/1263 places, 1870/1962 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(X(X(X(p0))))&&p1)))))'
Stuttering acceptance computed with spot in 463 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-06a-LTLFireability-01
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-06a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06a-LTLFireability-01 finished in 1990 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 1263 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1263/1263 places, 1962/1962 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 209 rules applied. Total rules applied 209 place count 1262 transition count 1753
Reduce places removed 209 places and 0 transitions.
Iterating post reduction 1 with 209 rules applied. Total rules applied 418 place count 1053 transition count 1753
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 418 place count 1053 transition count 1599
Deduced a syphon composed of 154 places in 2 ms
Ensure Unique test removed 52 places
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 778 place count 847 transition count 1599
Discarding 3 places :
Implicit places reduction removed 3 places
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 2 with 11 rules applied. Total rules applied 789 place count 844 transition count 1591
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 797 place count 836 transition count 1591
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 797 place count 836 transition count 1574
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 831 place count 819 transition count 1574
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 837 place count 813 transition count 1546
Iterating global reduction 4 with 6 rules applied. Total rules applied 843 place count 813 transition count 1546
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 847 place count 810 transition count 1545
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 848 place count 809 transition count 1545
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 848 place count 809 transition count 1544
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 850 place count 808 transition count 1544
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 851 place count 807 transition count 1536
Iterating global reduction 6 with 1 rules applied. Total rules applied 852 place count 807 transition count 1536
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 853 place count 806 transition count 1528
Iterating global reduction 6 with 1 rules applied. Total rules applied 854 place count 806 transition count 1528
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 855 place count 805 transition count 1520
Iterating global reduction 6 with 1 rules applied. Total rules applied 856 place count 805 transition count 1520
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 857 place count 804 transition count 1512
Iterating global reduction 6 with 1 rules applied. Total rules applied 858 place count 804 transition count 1512
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 859 place count 803 transition count 1504
Iterating global reduction 6 with 1 rules applied. Total rules applied 860 place count 803 transition count 1504
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 861 place count 802 transition count 1496
Iterating global reduction 6 with 1 rules applied. Total rules applied 862 place count 802 transition count 1496
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 863 place count 801 transition count 1488
Iterating global reduction 6 with 1 rules applied. Total rules applied 864 place count 801 transition count 1488
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 865 place count 800 transition count 1480
Iterating global reduction 6 with 1 rules applied. Total rules applied 866 place count 800 transition count 1480
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 867 place count 799 transition count 1472
Iterating global reduction 6 with 1 rules applied. Total rules applied 868 place count 799 transition count 1472
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 2 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 6 with 138 rules applied. Total rules applied 1006 place count 730 transition count 1403
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1009 place count 727 transition count 1400
Iterating global reduction 6 with 3 rules applied. Total rules applied 1012 place count 727 transition count 1400
Applied a total of 1012 rules in 374 ms. Remains 727 /1263 variables (removed 536) and now considering 1400/1962 (removed 562) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11842987423526372150.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7497473020052405072.kers'
[2026-05-22 19:33:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11842987423526372150.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7497473020052405072.kers]
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 1 ms.
// Phase 1: matrix 1400 rows 718 cols 5611 entries
Finished phase 1 with 290 SingleSign rule and 320 generalized
[2026-05-22 19:33:09] [INFO ] Computed 117 invariants in 9 ms
Computed 117 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-7497473020052405072.kers
Total runtime 13 ms.
[2026-05-22 19:33:10] [INFO ] Implicit Places using invariants in 869 ms returned [38, 95, 103, 109, 125, 126, 233, 234, 336, 337, 338, 413, 419, 424, 440, 441, 516, 522, 527, 543, 613, 619, 624, 643, 644, 681, 701]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 873 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 700/1263 places, 1400/1962 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 700 transition count 1379
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 679 transition count 1378
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 678 transition count 1378
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 44 place count 678 transition count 1353
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 94 place count 653 transition count 1353
Discarding 4 places :
Implicit places reduction removed 4 places
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 3 with 8 rules applied. Total rules applied 102 place count 649 transition count 1349
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 4 with 8 rules applied. Total rules applied 110 place count 645 transition count 1345
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 114 place count 641 transition count 1345
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 125 place count 630 transition count 1334
Iterating global reduction 6 with 11 rules applied. Total rules applied 136 place count 630 transition count 1334
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 139 place count 630 transition count 1331
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 147 place count 622 transition count 1323
Iterating global reduction 7 with 8 rules applied. Total rules applied 155 place count 622 transition count 1323
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 159 place count 618 transition count 1319
Iterating global reduction 7 with 4 rules applied. Total rules applied 163 place count 618 transition count 1319
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 197 place count 601 transition count 1302
Applied a total of 197 rules in 176 ms. Remains 601 /700 variables (removed 99) and now considering 1302/1400 (removed 98) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2254427085186646316.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-895753208275506616.kers'
[2026-05-22 19:33:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2254427085186646316.kers, --Pflows, --basisKERS=/tmp/petrispot-output-895753208275506616.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1302 rows 601 cols 5299 entries
Finished phase 1 with 259 SingleSign rule and 256 generalized
[2026-05-22 19:33:11] [INFO ] Computed 86 invariants in 12 ms
Computed 86 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-895753208275506616.kers
Total runtime 27 ms.
[2026-05-22 19:33:11] [INFO ] Implicit Places using invariants in 554 ms returned [93, 96, 173, 179, 184, 186, 189, 266, 272, 277, 279, 282, 363, 366, 447, 450, 531, 534, 598]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 569 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 582/1263 places, 1302/1962 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 582 transition count 1296
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 576 transition count 1296
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 23 place count 565 transition count 1285
Iterating global reduction 2 with 11 rules applied. Total rules applied 34 place count 565 transition count 1285
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 40 place count 565 transition count 1279
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 44 place count 561 transition count 1275
Iterating global reduction 3 with 4 rules applied. Total rules applied 48 place count 561 transition count 1275
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 50 place count 559 transition count 1273
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 559 transition count 1273
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 58 place count 556 transition count 1270
Applied a total of 58 rules in 71 ms. Remains 556 /582 variables (removed 26) and now considering 1270/1302 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9693469971566582753.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15192505446547171611.kers'
[2026-05-22 19:33:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9693469971566582753.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15192505446547171611.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1270 rows 556 cols 5093 entries
Finished phase 1 with 251 SingleSign rule and 238 generalized
[2026-05-22 19:33:11] [INFO ] Computed 67 invariants in 10 ms
Computed 67 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-15192505446547171611.kers
Total runtime 11 ms.
[2026-05-22 19:33:12] [INFO ] Implicit Places using invariants in 431 ms returned [72, 151, 231, 311, 391, 471]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 435 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 550/1263 places, 1270/1962 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 544 transition count 1264
Applied a total of 12 rules in 36 ms. Remains 544 /550 variables (removed 6) and now considering 1264/1270 (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-14860722814295846714.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8265694180345449990.kers'
[2026-05-22 19:33:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14860722814295846714.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8265694180345449990.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1264 rows 544 cols 5111 entries
Finished phase 1 with 251 SingleSign rule and 232 generalized
[2026-05-22 19:33:12] [INFO ] Computed 61 invariants in 9 ms
Computed 61 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-8265694180345449990.kers
Total runtime 12 ms.
[2026-05-22 19:33:12] [INFO ] Implicit Places using invariants in 448 ms returned []
[2026-05-22 19:33:12] [INFO ] Invariant cache hit.
[2026-05-22 19:33:13] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-22 19:33:14] [INFO ] Implicit Places using invariants and state equation in 1636 ms returned []
Implicit Place search using SMT with State Equation took 2088 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 544/1263 places, 1264/1962 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 4623 ms. Remains : 544/1263 places, 1264/1962 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-06a-LTLFireability-02
Product exploration explored 100000 steps with 1378 reset in 367 ms.
Product exploration explored 100000 steps with 1356 reset in 307 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 7 factoid took 117 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (562 resets) in 385 ms. (103 steps per ms) remains 1/4 properties
BEST_FIRST walk for 33304 steps (92 resets) in 222 ms. (149 steps per ms) remains 0/1 properties
Knowledge based reduction with 7 factoid took 111 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 511 ms.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1264/1264 transitions.
Applied a total of 0 rules in 38 ms. Remains 544 /544 variables (removed 0) and now considering 1264/1264 (removed 0) transitions.
[2026-05-22 19:33:15] [INFO ] Invariant cache hit.
[2026-05-22 19:33:16] [INFO ] Implicit Places using invariants in 543 ms returned []
[2026-05-22 19:33:16] [INFO ] Invariant cache hit.
[2026-05-22 19:33:16] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-22 19:33:17] [INFO ] Implicit Places using invariants and state equation in 1510 ms returned []
Implicit Place search using SMT with State Equation took 2068 ms to find 0 implicit places.
[2026-05-22 19:33:17] [INFO ] Redundant transitions in 80 ms returned []
Running 1263 sub problems to find dead transitions.
[2026-05-22 19:33:17] [INFO ] Invariant cache hit.
[2026-05-22 19:33:17] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/543 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1263 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 543/1808 variables, and 33 constraints, problems are : Problem set: 0 solved, 1263 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 0/26 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/544 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 1263/1263 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/543 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/1808 variables, and 33 constraints, problems are : Problem set: 0 solved, 1263 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/26 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/544 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 0/1263 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60448ms problems are : Problem set: 0 solved, 1263 unsolved
Search for dead transitions found 0 dead transitions in 60451ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62660 ms. Remains : 544/544 places, 1264/1264 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 7 factoid took 136 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (550 resets) in 187 ms. (212 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (105 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
[2026-05-22 19:34:18] [INFO ] Invariant cache hit.
[2026-05-22 19:34:18] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/90 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 320/410 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/544 variables, 35/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/544 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1264/1808 variables, 544/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1808 variables, 6/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1808 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1808 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1808/1808 variables, and 611 constraints, problems are : Problem set: 0 solved, 1 unsolved in 505 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 544/544 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/90 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 320/410 variables, 23/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/544 variables, 35/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/544 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1264/1808 variables, 544/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1808 variables, 6/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1808/1808 variables, and 612 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1494 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 544/544 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2007ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 292 ms.
Support contains 3 out of 544 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 544/544 places, 1264/1264 transitions.
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 544 transition count 1240
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 54 place count 520 transition count 1234
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 1 with 18 rules applied. Total rules applied 72 place count 520 transition count 1216
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 90 place count 502 transition count 1216
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 91 place count 502 transition count 1216
Applied a total of 91 rules in 68 ms. Remains 502 /544 variables (removed 42) and now considering 1216/1264 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 502/544 places, 1216/1264 transitions.
RANDOM walk for 31303 steps (538 resets) in 120 ms. (258 steps per ms) remains 0/1 properties
Knowledge based reduction with 7 factoid took 128 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 2855 ms.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1337 reset in 234 ms.
Product exploration explored 100000 steps with 1339 reset in 225 ms.
Built C files in :
/tmp/ltsmin12003481945156360733
[2026-05-22 19:34:21] [INFO ] Computing symmetric may disable matrix : 1264 transitions.
[2026-05-22 19:34:21] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:34:21] [INFO ] Computing symmetric may enable matrix : 1264 transitions.
[2026-05-22 19:34:21] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:34:22] [INFO ] Computing Do-Not-Accords matrix : 1264 transitions.
[2026-05-22 19:34:22] [INFO ] Computation of Completed DNA matrix. took 45 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:34:22] [INFO ] Built C files in 352ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12003481945156360733
Running compilation step : cd /tmp/ltsmin12003481945156360733;'/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/ltsmin12003481945156360733;'/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/ltsmin12003481945156360733;'/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 3 out of 544 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 544/544 places, 1264/1264 transitions.
Applied a total of 0 rules in 18 ms. Remains 544 /544 variables (removed 0) and now considering 1264/1264 (removed 0) transitions.
[2026-05-22 19:34:25] [INFO ] Invariant cache hit.
[2026-05-22 19:34:25] [INFO ] Implicit Places using invariants in 387 ms returned []
[2026-05-22 19:34:25] [INFO ] Invariant cache hit.
[2026-05-22 19:34:25] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-22 19:34:26] [INFO ] Implicit Places using invariants and state equation in 1309 ms returned []
Implicit Place search using SMT with State Equation took 1699 ms to find 0 implicit places.
[2026-05-22 19:34:26] [INFO ] Redundant transitions in 20 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1759 ms. Remains : 544/544 places, 1264/1264 transitions.
Built C files in :
/tmp/ltsmin4180998876795823345
[2026-05-22 19:34:26] [INFO ] Computing symmetric may disable matrix : 1264 transitions.
[2026-05-22 19:34:26] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:34:26] [INFO ] Computing symmetric may enable matrix : 1264 transitions.
[2026-05-22 19:34:26] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:34:27] [INFO ] Computing Do-Not-Accords matrix : 1264 transitions.
[2026-05-22 19:34:27] [INFO ] Computation of Completed DNA matrix. took 71 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:34:27] [INFO ] Built C files in 355ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4180998876795823345
Running compilation step : cd /tmp/ltsmin4180998876795823345;'/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/ltsmin4180998876795823345;'/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/ltsmin4180998876795823345;'/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 19:34:30] [INFO ] Flatten gal took : 72 ms
[2026-05-22 19:34:30] [INFO ] Flatten gal took : 49 ms
[2026-05-22 19:34:30] [INFO ] Time to serialize gal into /tmp/LTL12840413803986400883.gal : 15 ms
[2026-05-22 19:34:30] [INFO ] Time to serialize properties into /tmp/LTL13424395719568962163.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/LTL12840413803986400883.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2673156512155255800.hoa' '-atoms' '/tmp/LTL13424395719568962163.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...319
Loading property file /tmp/LTL13424395719568962163.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2673156512155255800.hoa
Detected timeout of ITS tools.
[2026-05-22 19:34:45] [INFO ] Flatten gal took : 34 ms
[2026-05-22 19:34:45] [INFO ] Flatten gal took : 45 ms
[2026-05-22 19:34:45] [INFO ] Time to serialize gal into /tmp/LTL12290210825079702509.gal : 10 ms
[2026-05-22 19:34:45] [INFO ] Time to serialize properties into /tmp/LTL13834278328330743628.ltl : 6 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/LTL12290210825079702509.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13834278328330743628.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p1284!=1)")||(G("((p1036!=1)||(p1189!=1))"))))))
Formula 0 simplified : G(F!"((p1036!=1)||(p1189!=1))" & FG!"(p1284!=1)")
Detected timeout of ITS tools.
[2026-05-22 19:35:01] [INFO ] Flatten gal took : 57 ms
[2026-05-22 19:35:01] [INFO ] Applying decomposition
[2026-05-22 19:35:01] [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/graph4891535351389303402.txt' '-o' '/tmp/graph4891535351389303402.bin' '-w' '/tmp/graph4891535351389303402.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4891535351389303402.bin' '-l' '-1' '-v' '-w' '/tmp/graph4891535351389303402.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:35:01] [INFO ] Decomposing Gal with order
[2026-05-22 19:35:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:35:01] [INFO ] Removed a total of 2550 redundant transitions.
[2026-05-22 19:35:01] [INFO ] Flatten gal took : 127 ms
[2026-05-22 19:35:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 30 ms.
[2026-05-22 19:35:01] [INFO ] Time to serialize gal into /tmp/LTL6608796536661320844.gal : 12 ms
[2026-05-22 19:35:01] [INFO ] Time to serialize properties into /tmp/LTL4898831126958838103.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/LTL6608796536661320844.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4898831126958838103.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(F(("(i12.u138.p1284!=1)")||(G("((i12.u118.p1036!=1)||(i12.u120.p1189!=1))"))))))
Formula 0 simplified : G(F!"((i12.u118.p1036!=1)||(i12.u120.p1189!=1))" & FG!"(i12.u138.p1284!=1)")
Detected timeout of ITS tools.
Treatment of property ASLink-PT-06a-LTLFireability-02 finished in 127030 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1263 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1263/1263 places, 1962/1962 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 209 transitions
Trivial Post-agglo rules discarded 209 transitions
Performed 209 trivial Post agglomeration. Transition count delta: 209
Iterating post reduction 0 with 209 rules applied. Total rules applied 209 place count 1261 transition count 1752
Reduce places removed 216 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 219 rules applied. Total rules applied 428 place count 1045 transition count 1749
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 431 place count 1042 transition count 1749
Performed 174 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 174 Pre rules applied. Total rules applied 431 place count 1042 transition count 1575
Deduced a syphon composed of 174 places in 2 ms
Ensure Unique test removed 53 places
Reduce places removed 227 places and 0 transitions.
Iterating global reduction 3 with 401 rules applied. Total rules applied 832 place count 815 transition count 1575
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 3 with 35 rules applied. Total rules applied 867 place count 801 transition count 1554
Reduce places removed 23 places and 0 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 4 with 25 rules applied. Total rules applied 892 place count 778 transition count 1552
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 894 place count 776 transition count 1552
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 26 Pre rules applied. Total rules applied 894 place count 776 transition count 1526
Deduced a syphon composed of 26 places in 4 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 946 place count 750 transition count 1526
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 961 place count 735 transition count 1489
Iterating global reduction 6 with 15 rules applied. Total rules applied 976 place count 735 transition count 1489
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 10 rules applied. Total rules applied 986 place count 732 transition count 1482
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 987 place count 731 transition count 1482
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 987 place count 731 transition count 1481
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 989 place count 730 transition count 1481
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 993 place count 726 transition count 1470
Iterating global reduction 8 with 4 rules applied. Total rules applied 997 place count 726 transition count 1470
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1001 place count 722 transition count 1459
Iterating global reduction 8 with 4 rules applied. Total rules applied 1005 place count 722 transition count 1459
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1008 place count 722 transition count 1456
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1009 place count 721 transition count 1448
Iterating global reduction 9 with 1 rules applied. Total rules applied 1010 place count 721 transition count 1448
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1011 place count 720 transition count 1440
Iterating global reduction 9 with 1 rules applied. Total rules applied 1012 place count 720 transition count 1440
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1013 place count 719 transition count 1432
Iterating global reduction 9 with 1 rules applied. Total rules applied 1014 place count 719 transition count 1432
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1015 place count 718 transition count 1424
Iterating global reduction 9 with 1 rules applied. Total rules applied 1016 place count 718 transition count 1424
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1017 place count 717 transition count 1416
Iterating global reduction 9 with 1 rules applied. Total rules applied 1018 place count 717 transition count 1416
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1019 place count 716 transition count 1408
Iterating global reduction 9 with 1 rules applied. Total rules applied 1020 place count 716 transition count 1408
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1021 place count 715 transition count 1400
Iterating global reduction 9 with 1 rules applied. Total rules applied 1022 place count 715 transition count 1400
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 9 with 128 rules applied. Total rules applied 1150 place count 651 transition count 1336
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1153 place count 648 transition count 1333
Iterating global reduction 9 with 3 rules applied. Total rules applied 1156 place count 648 transition count 1333
Applied a total of 1156 rules in 313 ms. Remains 648 /1263 variables (removed 615) and now considering 1333/1962 (removed 629) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11463413388264531434.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14507477883340673193.kers'
[2026-05-22 19:35:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11463413388264531434.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14507477883340673193.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1333 rows 648 cols 5403 entries
Finished phase 1 with 242 SingleSign rule and 310 generalized
[2026-05-22 19:35:16] [INFO ] Computed 96 invariants in 9 ms
Computed 96 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-14507477883340673193.kers
Total runtime 21 ms.
[2026-05-22 19:35:17] [INFO ] Implicit Places using invariants in 687 ms returned [38, 73, 94, 102, 108, 116, 169, 190, 196, 201, 203, 263, 280, 286, 291, 293, 302, 355, 376, 382, 387, 389, 398, 451, 472, 478, 483, 485, 545, 562, 568, 573, 575, 587, 644]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 690 ms to find 35 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 613/1263 places, 1333/1962 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 613 transition count 1311
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 591 transition count 1311
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 56 place count 579 transition count 1299
Iterating global reduction 2 with 12 rules applied. Total rules applied 68 place count 579 transition count 1299
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 80 place count 567 transition count 1287
Iterating global reduction 2 with 12 rules applied. Total rules applied 92 place count 567 transition count 1287
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 98 place count 561 transition count 1281
Iterating global reduction 2 with 6 rules applied. Total rules applied 104 place count 561 transition count 1281
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 142 place count 542 transition count 1262
Applied a total of 142 rules in 66 ms. Remains 542 /613 variables (removed 71) and now considering 1262/1333 (removed 71) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7787542644701663505.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5082363356328127042.kers'
[2026-05-22 19:35:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7787542644701663505.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5082363356328127042.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1262 rows 542 cols 5087 entries
Finished phase 1 with 249 SingleSign rule and 232 generalized
[2026-05-22 19:35:17] [INFO ] Computed 61 invariants in 7 ms
Computed 61 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-5082363356328127042.kers
Total runtime 9 ms.
[2026-05-22 19:35:18] [INFO ] Implicit Places using invariants in 378 ms returned []
[2026-05-22 19:35:18] [INFO ] Invariant cache hit.
[2026-05-22 19:35:19] [INFO ] Implicit Places using invariants and state equation in 1210 ms returned []
Implicit Place search using SMT with State Equation took 1617 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 542/1263 places, 1262/1962 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2687 ms. Remains : 542/1263 places, 1262/1962 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-06a-LTLFireability-03
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-06a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06a-LTLFireability-03 finished in 2808 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&&X(X(F(p1)))&&G(p2))||G(F(p1)))))'
Support contains 5 out of 1263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1263/1263 places, 1962/1962 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1259 transition count 1936
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1259 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1258 transition count 1928
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1258 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1257 transition count 1920
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1257 transition count 1920
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1256 transition count 1912
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1256 transition count 1912
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1255 transition count 1904
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1255 transition count 1904
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1254 transition count 1896
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1254 transition count 1896
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1253 transition count 1888
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1253 transition count 1888
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1252 transition count 1880
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1252 transition count 1880
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1251 transition count 1872
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1251 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1250 transition count 1864
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1250 transition count 1864
Applied a total of 26 rules in 397 ms. Remains 1250 /1263 variables (removed 13) and now considering 1864/1962 (removed 98) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12357557532589202558.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16291724601394978944.kers'
[2026-05-22 19:35:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12357557532589202558.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16291724601394978944.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 3 ms.
// Phase 1: matrix 1864 rows 1249 cols 6577 entries
Finished phase 1 with 747 SingleSign rule and 327 generalized
[2026-05-22 19:35:19] [INFO ] Computed 176 invariants in 36 ms
Computed 176 P flows in 37 ms.
Exported basis to /tmp/petrispot-output-16291724601394978944.kers
Total runtime 41 ms.
[2026-05-22 19:35:20] [INFO ] Implicit Places using invariants in 979 ms returned [46, 211, 394, 576, 577, 759, 1122, 1160]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 991 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1242/1263 places, 1864/1962 transitions.
Applied a total of 0 rules in 46 ms. Remains 1242 /1242 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1434 ms. Remains : 1242/1263 places, 1864/1962 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))||(X(X(F(p0)))&&G(p2)&&p1))))'
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ASLink-PT-06a-LTLFireability-04
Product exploration explored 100000 steps with 3756 reset in 446 ms.
Product exploration explored 100000 steps with 3575 reset in 503 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 12 factoid took 154 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 7 to 5
RANDOM walk for 40000 steps (216 resets) in 246 ms. (161 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (29 resets) in 475 ms. (84 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9038945675324350318.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15910202538035335146.kers'
[2026-05-22 19:35:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9038945675324350318.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15910202538035335146.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 1864 rows 1241 cols 6474 entries
Finished phase 1 with 819 SingleSign rule and 255 generalized
[2026-05-22 19:35:22] [INFO ] Computed 168 invariants in 11 ms
Computed 168 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-15910202538035335146.kers
Total runtime 13 ms.
Problem apf4 is UNSAT
After SMT solving in domain Real declared 4/3106 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 17 ms.
Refiners :[Positive P Invariants (semi-flows): 0/29 constraints, Generalized P Invariants (flows): 0/139 constraints, State Equation: 0/1242 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge based reduction with 14 factoid took 179 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 707 ms.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 1242 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1242/1242 places, 1864/1864 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 243 transitions
Trivial Post-agglo rules discarded 243 transitions
Performed 243 trivial Post agglomeration. Transition count delta: 243
Iterating post reduction 0 with 243 rules applied. Total rules applied 243 place count 1242 transition count 1621
Reduce places removed 243 places and 0 transitions.
Iterating post reduction 1 with 243 rules applied. Total rules applied 486 place count 999 transition count 1621
Performed 165 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 165 Pre rules applied. Total rules applied 486 place count 999 transition count 1456
Deduced a syphon composed of 165 places in 1 ms
Ensure Unique test removed 53 places
Reduce places removed 218 places and 0 transitions.
Iterating global reduction 2 with 383 rules applied. Total rules applied 869 place count 781 transition count 1456
Discarding 10 places :
Implicit places reduction removed 10 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 19 rules applied. Total rules applied 888 place count 771 transition count 1447
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 897 place count 762 transition count 1447
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 897 place count 762 transition count 1423
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 945 place count 738 transition count 1423
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 950 place count 733 transition count 1418
Iterating global reduction 4 with 5 rules applied. Total rules applied 955 place count 733 transition count 1418
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 959 place count 733 transition count 1414
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 960 place count 732 transition count 1414
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 960 place count 732 transition count 1413
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 962 place count 731 transition count 1413
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 6 with 130 rules applied. Total rules applied 1092 place count 666 transition count 1348
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1094 place count 666 transition count 1348
Applied a total of 1094 rules in 124 ms. Remains 666 /1242 variables (removed 576) and now considering 1348/1864 (removed 516) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17181214807468917524.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18151121662897862441.kers'
[2026-05-22 19:35:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17181214807468917524.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18151121662897862441.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 1348 rows 660 cols 5432 entries
Finished phase 1 with 295 SingleSign rule and 266 generalized
[2026-05-22 19:35:22] [INFO ] Computed 105 invariants in 8 ms
Computed 105 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-18151121662897862441.kers
Total runtime 12 ms.
[2026-05-22 19:35:23] [INFO ] Implicit Places using invariants in 642 ms returned [90, 96, 101, 117, 187, 193, 198, 287, 293, 298, 315, 385, 391, 396, 412, 483, 489, 494, 511, 581, 587, 592, 611, 663]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 644 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 642/1242 places, 1348/1864 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 642 transition count 1347
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 641 transition count 1347
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 2 place count 641 transition count 1337
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 22 place count 631 transition count 1337
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 630 transition count 1336
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 25 place count 629 transition count 1336
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 39 place count 615 transition count 1322
Iterating global reduction 4 with 14 rules applied. Total rules applied 53 place count 615 transition count 1322
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 66 place count 602 transition count 1309
Iterating global reduction 4 with 13 rules applied. Total rules applied 79 place count 602 transition count 1309
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 80 place count 602 transition count 1308
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 86 place count 596 transition count 1302
Iterating global reduction 5 with 6 rules applied. Total rules applied 92 place count 596 transition count 1302
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 112 place count 586 transition count 1292
Applied a total of 112 rules in 95 ms. Remains 586 /642 variables (removed 56) and now considering 1292/1348 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15940101232657837833.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2909694952258543416.kers'
[2026-05-22 19:35:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15940101232657837833.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2909694952258543416.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 1292 rows 585 cols 5253 entries
Finished phase 1 with 263 SingleSign rule and 243 generalized
[2026-05-22 19:35:23] [INFO ] Computed 80 invariants in 19 ms
Computed 80 P flows in 20 ms.
Exported basis to /tmp/petrispot-output-2909694952258543416.kers
Total runtime 21 ms.
[2026-05-22 19:35:24] [INFO ] Implicit Places using invariants in 629 ms returned [93, 96, 246, 268, 349, 352, 435, 438, 519, 522]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 639 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 576/1242 places, 1292/1864 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 576 transition count 1288
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 572 transition count 1288
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 568 transition count 1284
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 568 transition count 1284
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 20 place count 568 transition count 1280
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 566 transition count 1278
Applied a total of 24 rules in 53 ms. Remains 566 /576 variables (removed 10) and now considering 1278/1292 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3098379967347002107.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14282878374713162259.kers'
[2026-05-22 19:35:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3098379967347002107.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14282878374713162259.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 12 ms.
// Phase 1: matrix 1278 rows 565 cols 5140 entries
Finished phase 1 with 258 SingleSign rule and 238 generalized
[2026-05-22 19:35:24] [INFO ] Computed 70 invariants in 26 ms
Computed 70 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-14282878374713162259.kers
Total runtime 28 ms.
[2026-05-22 19:35:24] [INFO ] Implicit Places using invariants in 466 ms returned [72, 320, 401, 482]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 488 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 562/1242 places, 1278/1864 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 558 transition count 1274
Applied a total of 8 rules in 28 ms. Remains 558 /562 variables (removed 4) and now considering 1274/1278 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6373468511216455878.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1322149996718684738.kers'
[2026-05-22 19:35:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6373468511216455878.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1322149996718684738.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 1274 rows 557 cols 5145 entries
Finished phase 1 with 258 SingleSign rule and 234 generalized
[2026-05-22 19:35:24] [INFO ] Computed 66 invariants in 16 ms
Computed 66 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-1322149996718684738.kers
Total runtime 17 ms.
[2026-05-22 19:35:25] [INFO ] Implicit Places using invariants in 622 ms returned []
[2026-05-22 19:35:25] [INFO ] Invariant cache hit.
[2026-05-22 19:35:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-22 19:35:27] [INFO ] Implicit Places using invariants and state equation in 1607 ms returned []
Implicit Place search using SMT with State Equation took 2235 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 558/1242 places, 1274/1864 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 4316 ms. Remains : 558/1242 places, 1274/1864 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 2 factoid took 66 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 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 72 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 89 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 238 ms.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6609 reset in 351 ms.
Product exploration explored 100000 steps with 6798 reset in 337 ms.
Built C files in :
/tmp/ltsmin11362653656262424914
[2026-05-22 19:35:28] [INFO ] Computing symmetric may disable matrix : 1274 transitions.
[2026-05-22 19:35:28] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:35:28] [INFO ] Computing symmetric may enable matrix : 1274 transitions.
[2026-05-22 19:35:28] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:35:28] [INFO ] Computing Do-Not-Accords matrix : 1274 transitions.
[2026-05-22 19:35:28] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:35:28] [INFO ] Built C files in 260ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11362653656262424914
Running compilation step : cd /tmp/ltsmin11362653656262424914;'/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/ltsmin11362653656262424914;'/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/ltsmin11362653656262424914;'/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 558 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 558/558 places, 1274/1274 transitions.
Ensure Unique test 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 0 with 2 rules applied. Total rules applied 2 place count 557 transition count 1272
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 555 transition count 1272
Applied a total of 4 rules in 39 ms. Remains 555 /558 variables (removed 3) and now considering 1272/1274 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-522872488028079157.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8423628263862934609.kers'
[2026-05-22 19:35:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-522872488028079157.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8423628263862934609.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1272 rows 554 cols 5138 entries
Finished phase 1 with 256 SingleSign rule and 234 generalized
[2026-05-22 19:35:31] [INFO ] Computed 65 invariants in 8 ms
Computed 65 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-8423628263862934609.kers
Total runtime 10 ms.
[2026-05-22 19:35:31] [INFO ] Implicit Places using invariants in 429 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 443 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 554/558 places, 1272/1274 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 554 transition count 1270
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 552 transition count 1270
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 0 with 2 rules applied. Total rules applied 6 place count 551 transition count 1269
Applied a total of 6 rules in 31 ms. Remains 551 /554 variables (removed 3) and now considering 1269/1272 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10083591515227710840.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9123001744294490432.kers'
[2026-05-22 19:35:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10083591515227710840.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9123001744294490432.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1269 rows 551 cols 5132 entries
Finished phase 1 with 254 SingleSign rule and 233 generalized
[2026-05-22 19:35:32] [INFO ] Computed 64 invariants in 24 ms
Computed 64 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-9123001744294490432.kers
Total runtime 26 ms.
[2026-05-22 19:35:32] [INFO ] Implicit Places using invariants in 582 ms returned [170, 173]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 584 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 549/558 places, 1269/1274 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 549 transition count 1268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 548 transition count 1268
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 547 transition count 1267
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 547 transition count 1267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 547 transition count 1266
Applied a total of 5 rules in 34 ms. Remains 547 /549 variables (removed 2) and now considering 1266/1269 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2004823837689547132.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5016464842940007015.kers'
[2026-05-22 19:35:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2004823837689547132.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5016464842940007015.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1266 rows 547 cols 5104 entries
Finished phase 1 with 253 SingleSign rule and 232 generalized
[2026-05-22 19:35:32] [INFO ] Computed 62 invariants in 7 ms
Computed 62 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-5016464842940007015.kers
Total runtime 9 ms.
[2026-05-22 19:35:33] [INFO ] Implicit Places using invariants in 509 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 523 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 546/558 places, 1266/1274 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 545 transition count 1265
Applied a total of 2 rules in 48 ms. Remains 545 /546 variables (removed 1) and now considering 1265/1266 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1500752706811122666.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10178144584528875670.kers'
[2026-05-22 19:35:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1500752706811122666.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10178144584528875670.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1265 rows 545 cols 5107 entries
Finished phase 1 with 253 SingleSign rule and 231 generalized
[2026-05-22 19:35:33] [INFO ] Computed 61 invariants in 8 ms
Computed 61 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-10178144584528875670.kers
Total runtime 9 ms.
[2026-05-22 19:35:33] [INFO ] Implicit Places using invariants in 364 ms returned []
[2026-05-22 19:35:33] [INFO ] Invariant cache hit.
[2026-05-22 19:35:33] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-22 19:35:34] [INFO ] Implicit Places using invariants and state equation in 1273 ms returned []
Implicit Place search using SMT with State Equation took 1673 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 545/558 places, 1265/1274 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 3389 ms. Remains : 545/558 places, 1265/1274 transitions.
Built C files in :
/tmp/ltsmin18203381083261913069
[2026-05-22 19:35:34] [INFO ] Computing symmetric may disable matrix : 1265 transitions.
[2026-05-22 19:35:34] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:35:34] [INFO ] Computing symmetric may enable matrix : 1265 transitions.
[2026-05-22 19:35:34] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:35:35] [INFO ] Computing Do-Not-Accords matrix : 1265 transitions.
[2026-05-22 19:35:35] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:35:35] [INFO ] Built C files in 261ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18203381083261913069
Running compilation step : cd /tmp/ltsmin18203381083261913069;'/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/ltsmin18203381083261913069;'/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/ltsmin18203381083261913069;'/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 19:35:38] [INFO ] Flatten gal took : 28 ms
[2026-05-22 19:35:38] [INFO ] Flatten gal took : 24 ms
[2026-05-22 19:35:38] [INFO ] Time to serialize gal into /tmp/LTL7394438728706929743.gal : 6 ms
[2026-05-22 19:35:38] [INFO ] Time to serialize properties into /tmp/LTL7544514457480656520.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/LTL7394438728706929743.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6285916508410575487.hoa' '-atoms' '/tmp/LTL7544514457480656520.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/LTL7544514457480656520.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6285916508410575487.hoa
Detected timeout of ITS tools.
[2026-05-22 19:35:53] [INFO ] Flatten gal took : 25 ms
[2026-05-22 19:35:53] [INFO ] Flatten gal took : 23 ms
[2026-05-22 19:35:53] [INFO ] Time to serialize gal into /tmp/LTL15970077070249899808.gal : 7 ms
[2026-05-22 19:35:53] [INFO ] Time to serialize properties into /tmp/LTL207839998487829752.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/LTL15970077070249899808.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL207839998487829752.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(p875!=1)")))||(((X(X(F("(p875!=1)"))))&&(G("((p401==1)&&(p419==1))")))&&("(((p401!=1)||(p419!=1))&&((p233!=1)||(p478!=1)))...161
Formula 0 simplified : G(FG!"(p875!=1)" & (!"(((p401!=1)||(p419!=1))&&((p233!=1)||(p478!=1)))" | XXG!"(p875!=1)" | F!"((p401==1)&&(p419==1))"))
Detected timeout of ITS tools.
[2026-05-22 19:36:08] [INFO ] Flatten gal took : 21 ms
[2026-05-22 19:36:08] [INFO ] Applying decomposition
[2026-05-22 19:36:08] [INFO ] Flatten gal took : 22 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/graph17858201854480036086.txt' '-o' '/tmp/graph17858201854480036086.bin' '-w' '/tmp/graph17858201854480036086.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17858201854480036086.bin' '-l' '-1' '-v' '-w' '/tmp/graph17858201854480036086.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:36:08] [INFO ] Decomposing Gal with order
[2026-05-22 19:36:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:36:08] [INFO ] Removed a total of 2498 redundant transitions.
[2026-05-22 19:36:08] [INFO ] Flatten gal took : 78 ms
[2026-05-22 19:36:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 18 ms.
[2026-05-22 19:36:08] [INFO ] Time to serialize gal into /tmp/LTL5100794066089971531.gal : 7 ms
[2026-05-22 19:36:08] [INFO ] Time to serialize properties into /tmp/LTL1171887472461042929.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5100794066089971531.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1171887472461042929.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 : !((F((G(F("(i9.u100.p875!=1)")))||(((X(X(F("(i9.u100.p875!=1)"))))&&(G("((i1.u48.p401==1)&&(i1.u48.p419==1))")))&&("(((i1.u48.p401!=1)...219
Formula 0 simplified : G(FG!"(i9.u100.p875!=1)" & (!"(((i1.u48.p401!=1)||(i1.u48.p419!=1))&&((i4.u26.p233!=1)||(i4.u64.p478!=1)))" | XXG!"(i9.u100.p875!=1)...201
Detected timeout of ITS tools.
Treatment of property ASLink-PT-06a-LTLFireability-04 finished in 64429 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 1263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1263/1263 places, 1962/1962 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1262 transition count 1962
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 1258 transition count 1936
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 1258 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 1257 transition count 1928
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 1257 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 1256 transition count 1920
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 1256 transition count 1920
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 1255 transition count 1912
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 1255 transition count 1912
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 1254 transition count 1904
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 1254 transition count 1904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 1253 transition count 1896
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 1253 transition count 1896
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 1252 transition count 1888
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 1252 transition count 1888
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 1251 transition count 1880
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 1251 transition count 1880
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 1250 transition count 1872
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 1250 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 1249 transition count 1864
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 1249 transition count 1864
Applied a total of 27 rules in 366 ms. Remains 1249 /1263 variables (removed 14) and now considering 1864/1962 (removed 98) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14872177994765283506.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-941056968177941817.kers'
[2026-05-22 19:36:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14872177994765283506.kers, --Pflows, --basisKERS=/tmp/petrispot-output-941056968177941817.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1864 rows 1249 cols 6577 entries
Finished phase 1 with 747 SingleSign rule and 327 generalized
[2026-05-22 19:36:24] [INFO ] Computed 175 invariants in 18 ms
Computed 175 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-941056968177941817.kers
Total runtime 20 ms.
[2026-05-22 19:36:25] [INFO ] Implicit Places using invariants in 959 ms returned [46, 211, 393, 575, 576, 758, 1159]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 963 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1242/1263 places, 1864/1962 transitions.
Applied a total of 0 rules in 64 ms. Remains 1242 /1242 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1394 ms. Remains : 1242/1263 places, 1864/1962 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 137 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-06a-LTLFireability-05
Stuttering criterion allowed to conclude after 295 steps with 2 reset in 1 ms.
FORMULA ASLink-PT-06a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06a-LTLFireability-05 finished in 1567 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((!p0 U (G(!p0)||(!p0&&G(p1)))))))'
Support contains 4 out of 1263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1263/1263 places, 1962/1962 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1262 transition count 1962
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 1258 transition count 1936
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 1258 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 1257 transition count 1928
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 1257 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 1256 transition count 1920
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 1256 transition count 1920
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 1255 transition count 1912
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 1255 transition count 1912
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 1254 transition count 1904
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 1254 transition count 1904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 1253 transition count 1896
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 1253 transition count 1896
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 1252 transition count 1888
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 1252 transition count 1888
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 1251 transition count 1880
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 1251 transition count 1880
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 1250 transition count 1872
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 1250 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 1249 transition count 1864
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 1249 transition count 1864
Applied a total of 27 rules in 364 ms. Remains 1249 /1263 variables (removed 14) and now considering 1864/1962 (removed 98) transitions.
[2026-05-22 19:36:25] [INFO ] Invariant cache hit.
[2026-05-22 19:36:26] [INFO ] Implicit Places using invariants in 830 ms returned [211, 393, 575, 576, 758, 1121]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 832 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1243/1263 places, 1864/1962 transitions.
Applied a total of 0 rules in 56 ms. Remains 1243 /1243 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1253 ms. Remains : 1243/1263 places, 1864/1962 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((!p0 U (G(!p0)||(!p0&&G(p1)))))))'
Stuttering acceptance computed with spot in 241 ms :[true, p0, (AND p0 (NOT p1)), (NOT p1), p0, p0]
Running random walk in product with property : ASLink-PT-06a-LTLFireability-11
Entered a terminal (fully accepting) state of product in 59620 steps with 325 reset in 179 ms.
FORMULA ASLink-PT-06a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06a-LTLFireability-11 finished in 1712 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(!p0))))'
Support contains 2 out of 1263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1263/1263 places, 1962/1962 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1262 transition count 1962
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 1258 transition count 1936
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 1258 transition count 1936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 1257 transition count 1928
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 1257 transition count 1928
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 1256 transition count 1920
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 1256 transition count 1920
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 1255 transition count 1912
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 1255 transition count 1912
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 1254 transition count 1904
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 1254 transition count 1904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 1253 transition count 1896
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 1253 transition count 1896
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 1252 transition count 1888
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 1252 transition count 1888
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 1251 transition count 1880
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 1251 transition count 1880
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 1250 transition count 1872
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 1250 transition count 1872
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 1249 transition count 1864
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 1249 transition count 1864
Applied a total of 27 rules in 354 ms. Remains 1249 /1263 variables (removed 14) and now considering 1864/1962 (removed 98) transitions.
[2026-05-22 19:36:27] [INFO ] Invariant cache hit.
[2026-05-22 19:36:28] [INFO ] Implicit Places using invariants in 850 ms returned [46, 211, 575, 576, 758, 1121, 1159]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 851 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1242/1263 places, 1864/1962 transitions.
Applied a total of 0 rules in 32 ms. Remains 1242 /1242 variables (removed 0) and now considering 1864/1864 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1237 ms. Remains : 1242/1263 places, 1864/1962 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(p0))))'
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : ASLink-PT-06a-LTLFireability-12
Entered a terminal (fully accepting) state of product in 15 steps with 3 reset in 1 ms.
FORMULA ASLink-PT-06a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06a-LTLFireability-12 finished in 1463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Spot run failed in 85 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' '!(F(((!p0&&X(X(F(p1)))&&G(p2))||G(F(p1)))))'
Spot run failed in 70 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 19:36:28] [INFO ] Flatten gal took : 53 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin424998380455797457
[2026-05-22 19:36:28] [INFO ] Too many transitions (1962) to apply POR reductions. Disabling POR matrices.
[2026-05-22 19:36:28] [INFO ] Applying decomposition
[2026-05-22 19:36:28] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin424998380455797457
Running compilation step : cd /tmp/ltsmin424998380455797457;'/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 19:36:28] [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/graph6888314176497365407.txt' '-o' '/tmp/graph6888314176497365407.bin' '-w' '/tmp/graph6888314176497365407.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6888314176497365407.bin' '-l' '-1' '-v' '-w' '/tmp/graph6888314176497365407.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:36:29] [INFO ] Decomposing Gal with order
[2026-05-22 19:36:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:36:29] [INFO ] Removed a total of 2701 redundant transitions.
[2026-05-22 19:36:29] [INFO ] Flatten gal took : 84 ms
[2026-05-22 19:36:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 43 ms.
[2026-05-22 19:36:29] [INFO ] Time to serialize gal into /tmp/LTLFireability203634948102582397.gal : 13 ms
[2026-05-22 19:36:29] [INFO ] Time to serialize properties into /tmp/LTLFireability18003245111386387571.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability203634948102582397.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18003245111386387571.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(("(i16.u353.p1284!=1)")||(G("((i16.u318.p1036!=1)||(i16.u320.p1189!=1))"))))))
Formula 0 simplified : G(F!"((i16.u318.p1036!=1)||(i16.u320.p1189!=1))" & FG!"(i16.u353.p1284!=1)")
Compilation finished in 4016 ms.
Running link step : cd /tmp/ltsmin424998380455797457;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin424998380455797457;'/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' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin424998380455797457;'/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' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin424998380455797457;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '<>(((!(LTLAPp2==true)&&X(X(<>((LTLAPp3==true))))&&[]((LTLAPp4==true)))||[](<>((LTLAPp3==true)))))' '--buchi-type=spotba'
LTSmin run took 826 ms.
FORMULA ASLink-PT-06a-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin424998380455797457;'/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' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-22 19:58:08] [INFO ] Applying decomposition
[2026-05-22 19:58:08] [INFO ] Flatten gal took : 48 ms
[2026-05-22 19:58:08] [INFO ] Decomposing Gal with order
[2026-05-22 19:58:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:58:08] [INFO ] Removed a total of 2296 redundant transitions.
[2026-05-22 19:58:08] [INFO ] Flatten gal took : 88 ms
[2026-05-22 19:58:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 815 labels/synchronizations in 37 ms.
[2026-05-22 19:58:09] [INFO ] Time to serialize gal into /tmp/LTLFireability16216853653128809969.gal : 10 ms
[2026-05-22 19:58:09] [INFO ] Time to serialize properties into /tmp/LTLFireability8691071810074404354.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/LTLFireability16216853653128809969.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8691071810074404354.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i55.u280.p1284!=1)")||(G("((u180.p1036!=1)||(u210.p1189!=1))"))))))
Formula 0 simplified : G(F!"((u180.p1036!=1)||(u210.p1189!=1))" & FG!"(i55.u280.p1284!=1)")
Reverse transition relation is NOT exact ! Due to transitions t1203, t1280, t1454, t1455, t1458, t1460, t1463, t1475, t1484, t1534, t1560, t1590, t1613, t1...993
Computing Next relation with stutter on 8.76172e+15 deadlock states
Detected timeout of ITS tools.
[2026-05-22 20:19:48] [INFO ] Flatten gal took : 53 ms
[2026-05-22 20:19:48] [INFO ] Input system was already deterministic with 1962 transitions.
[2026-05-22 20:19:48] [INFO ] Transformed 1263 places.
[2026-05-22 20:19:48] [INFO ] Transformed 1962 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-22 20:20:18] [INFO ] Time to serialize gal into /tmp/LTLFireability2794190617307089633.gal : 19 ms
[2026-05-22 20:20:18] [INFO ] Time to serialize properties into /tmp/LTLFireability7566463634022231605.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/LTLFireability2794190617307089633.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7566463634022231605.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("(p1284!=1)")||(G("((p1036!=1)||(p1189!=1))"))))))
Formula 0 simplified : G(F!"((p1036!=1)||(p1189!=1))" & FG!"(p1284!=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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-06a"
export BK_EXAMINATION="LTLFireability"
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-06a, examination is LTLFireability"
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-177944366200364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-06a.tgz
mv ASLink-PT-06a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;