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.r178-oct2-177969020100332.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 MedleyB-PT-B07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020100332
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 9.5K Mar 7 18:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K Mar 7 18:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 7 18:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 11:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Mar 7 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 7 18:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 7 18:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:34 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 3.7M Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyB-PT-B07-LTLFireability-00
FORMULA_NAME MedleyB-PT-B07-LTLFireability-01
FORMULA_NAME MedleyB-PT-B07-LTLFireability-02
FORMULA_NAME MedleyB-PT-B07-LTLFireability-03
FORMULA_NAME MedleyB-PT-B07-LTLFireability-04
FORMULA_NAME MedleyB-PT-B07-LTLFireability-05
FORMULA_NAME MedleyB-PT-B07-LTLFireability-06
FORMULA_NAME MedleyB-PT-B07-LTLFireability-07
FORMULA_NAME MedleyB-PT-B07-LTLFireability-08
FORMULA_NAME MedleyB-PT-B07-LTLFireability-09
FORMULA_NAME MedleyB-PT-B07-LTLFireability-10
FORMULA_NAME MedleyB-PT-B07-LTLFireability-11
FORMULA_NAME MedleyB-PT-B07-LTLFireability-12
FORMULA_NAME MedleyB-PT-B07-LTLFireability-13
FORMULA_NAME MedleyB-PT-B07-LTLFireability-14
FORMULA_NAME MedleyB-PT-B07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779707849391

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 11:17:31] [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-25 11:17:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 11:17:31] [INFO ] Load time of PNML (sax parser for PT used): 379 ms
[2026-05-25 11:17:31] [INFO ] Transformed 2133 places.
[2026-05-25 11:17:31] [INFO ] Transformed 6753 transitions.
[2026-05-25 11:17:31] [INFO ] Found NUPN structural information;
[2026-05-25 11:17:31] [INFO ] Parsed PT model containing 2133 places and 6753 transitions and 67789 arcs in 544 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA MedleyB-PT-B07-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B07-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B07-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B07-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B07-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA MedleyB-PT-B07-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 2133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2133/2133 places, 6753/6753 transitions.
Discarding 170 places :
Symmetric choice reduction at 0 with 170 rule applications. Total rules 170 place count 1963 transition count 6583
Iterating global reduction 0 with 170 rules applied. Total rules applied 340 place count 1963 transition count 6583
Discarding 105 places :
Symmetric choice reduction at 0 with 105 rule applications. Total rules 445 place count 1858 transition count 6478
Iterating global reduction 0 with 105 rules applied. Total rules applied 550 place count 1858 transition count 6478
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 611 place count 1797 transition count 6417
Iterating global reduction 0 with 61 rules applied. Total rules applied 672 place count 1797 transition count 6417
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 727 place count 1742 transition count 6362
Iterating global reduction 0 with 55 rules applied. Total rules applied 782 place count 1742 transition count 6362
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 830 place count 1694 transition count 6314
Iterating global reduction 0 with 48 rules applied. Total rules applied 878 place count 1694 transition count 6314
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 926 place count 1646 transition count 6266
Iterating global reduction 0 with 48 rules applied. Total rules applied 974 place count 1646 transition count 6266
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 1022 place count 1598 transition count 6218
Iterating global reduction 0 with 48 rules applied. Total rules applied 1070 place count 1598 transition count 6218
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 1118 place count 1550 transition count 6170
Iterating global reduction 0 with 48 rules applied. Total rules applied 1166 place count 1550 transition count 6170
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 1207 place count 1509 transition count 6129
Iterating global reduction 0 with 41 rules applied. Total rules applied 1248 place count 1509 transition count 6129
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 1282 place count 1475 transition count 6095
Iterating global reduction 0 with 34 rules applied. Total rules applied 1316 place count 1475 transition count 6095
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 1322 place count 1475 transition count 6089
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 1335 place count 1462 transition count 6076
Iterating global reduction 1 with 13 rules applied. Total rules applied 1348 place count 1462 transition count 6076
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 1361 place count 1449 transition count 6063
Iterating global reduction 1 with 13 rules applied. Total rules applied 1374 place count 1449 transition count 6063
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 1381 place count 1442 transition count 6056
Iterating global reduction 1 with 7 rules applied. Total rules applied 1388 place count 1442 transition count 6056
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 1395 place count 1435 transition count 6049
Iterating global reduction 1 with 7 rules applied. Total rules applied 1402 place count 1435 transition count 6049
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 1409 place count 1428 transition count 6042
Iterating global reduction 1 with 7 rules applied. Total rules applied 1416 place count 1428 transition count 6042
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 1423 place count 1421 transition count 6035
Iterating global reduction 1 with 7 rules applied. Total rules applied 1430 place count 1421 transition count 6035
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 1437 place count 1414 transition count 6028
Iterating global reduction 1 with 7 rules applied. Total rules applied 1444 place count 1414 transition count 6028
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 1451 place count 1407 transition count 6021
Iterating global reduction 1 with 7 rules applied. Total rules applied 1458 place count 1407 transition count 6021
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 1465 place count 1400 transition count 6014
Iterating global reduction 1 with 7 rules applied. Total rules applied 1472 place count 1400 transition count 6014
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 1479 place count 1393 transition count 6007
Iterating global reduction 1 with 7 rules applied. Total rules applied 1486 place count 1393 transition count 6007
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 1493 place count 1386 transition count 6000
Iterating global reduction 1 with 7 rules applied. Total rules applied 1500 place count 1386 transition count 6000
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 1507 place count 1379 transition count 5993
Iterating global reduction 1 with 7 rules applied. Total rules applied 1514 place count 1379 transition count 5993
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 1521 place count 1379 transition count 5986
Applied a total of 1521 rules in 2787 ms. Remains 1379 /2133 variables (removed 754) and now considering 5986/6753 (removed 767) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16121229784662872885.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17064983737386136954.kers'
[2026-05-25 11:17:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16121229784662872885.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17064983737386136954.kers]
Culled 0 columns in 7 ms.
// Phase 1: matrix 5986 rows 1379 cols 66199 entries
Finished phase 1 with 1371 SingleSign rule and 0 generalized
[2026-05-25 11:17:34] [INFO ] Computed 8 invariants in 51 ms
Computed 8 P flows in 55 ms.
Exported basis to /tmp/petrispot-output-17064983737386136954.kers
Total runtime 62 ms.
[2026-05-25 11:17:35] [INFO ] Implicit Places using invariants in 913 ms returned []
[2026-05-25 11:17:35] [INFO ] Invariant cache hit.
[2026-05-25 11:17:38] [INFO ] Implicit Places using invariants and state equation in 3090 ms returned []
Implicit Place search using SMT with State Equation took 4075 ms to find 0 implicit places.
Running 5985 sub problems to find dead transitions.
[2026-05-25 11:17:39] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1378/7365 variables, and 0 constraints, problems are : Problem set: 0 solved, 5985 unsolved in 30167 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1379 constraints, PredecessorRefiner: 5985/1569 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5985 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1378/7365 variables, and 0 constraints, problems are : Problem set: 0 solved, 5985 unsolved in 30087 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1379 constraints, PredecessorRefiner: 4416/1569 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 69944ms problems are : Problem set: 0 solved, 5985 unsolved
Search for dead transitions found 0 dead transitions in 70059ms
Starting structural reductions in LTL mode, iteration 1 : 1379/2133 places, 5986/6753 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77016 ms. Remains : 1379/2133 places, 5986/6753 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1379/1379 places, 5986/5986 transitions.
Applied a total of 0 rules in 74 ms. Remains 1379 /1379 variables (removed 0) and now considering 5986/5986 (removed 0) transitions.
[2026-05-25 11:18:49] [INFO ] Invariant cache hit.
[2026-05-25 11:18:49] [INFO ] Implicit Places using invariants in 813 ms returned []
[2026-05-25 11:18:49] [INFO ] Invariant cache hit.
[2026-05-25 11:18:52] [INFO ] Implicit Places using invariants and state equation in 2928 ms returned []
Implicit Place search using SMT with State Equation took 3749 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3840 ms. Remains : 1379/1379 places, 5986/5986 transitions.
Support contains 57 out of 1379 places after structural reductions.
[2026-05-25 11:18:53] [INFO ] Flatten gal took : 605 ms
[2026-05-25 11:18:54] [INFO ] Flatten gal took : 399 ms
[2026-05-25 11:18:55] [INFO ] Input system was already deterministic with 5986 transitions.
Support contains 55 out of 1379 places (down from 57) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 32 to 30
RANDOM walk for 40000 steps (305 resets) in 2374 ms. (16 steps per ms) remains 27/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
[2026-05-25 11:18:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 1313/1365 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1365 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 14/1379 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1379/7365 variables, and 8 constraints, problems are : Problem set: 0 solved, 27 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/1379 constraints, PredecessorRefiner: 27/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 1313/1365 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1365 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 14/1379 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1379/7365 variables, and 8 constraints, problems are : Problem set: 0 solved, 27 unsolved in 5045 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/1379 constraints, PredecessorRefiner: 23/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10165ms problems are : Problem set: 0 solved, 27 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 1379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1379/1379 places, 5986/5986 transitions.
Graph (trivial) has 1303 edges and 1379 vertex of which 112 / 1379 are part of one of the 21 SCC in 11 ms
Free SCC test removed 91 places
Drop transitions (Empty/Sink Transition effects.) removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Graph (complete) has 2530 edges and 1288 vertex of which 1281 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.29 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 910 transitions
Trivial Post-agglo rules discarded 910 transitions
Performed 910 trivial Post agglomeration. Transition count delta: 910
Iterating post reduction 0 with 917 rules applied. Total rules applied 919 place count 1281 transition count 4943
Reduce places removed 910 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 931 rules applied. Total rules applied 1850 place count 371 transition count 4922
Reduce places removed 7 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 2 with 25 rules applied. Total rules applied 1875 place count 364 transition count 4904
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 1893 place count 346 transition count 4904
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 73 Pre rules applied. Total rules applied 1893 place count 346 transition count 4831
Deduced a syphon composed of 73 places in 3 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 2039 place count 273 transition count 4831
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 2141 place count 222 transition count 4780
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 2154 place count 222 transition count 4767
Discarding 28 places :
Symmetric choice reduction at 5 with 28 rule applications. Total rules 2182 place count 194 transition count 4726
Iterating global reduction 5 with 28 rules applied. Total rules applied 2210 place count 194 transition count 4726
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 2217 place count 194 transition count 4719
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 2237 place count 174 transition count 4699
Iterating global reduction 6 with 20 rules applied. Total rules applied 2257 place count 174 transition count 4699
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2271 place count 160 transition count 4685
Iterating global reduction 6 with 14 rules applied. Total rules applied 2285 place count 160 transition count 4685
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2292 place count 160 transition count 4678
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 2308 place count 152 transition count 4670
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 2314 place count 149 transition count 4678
Free-agglomeration rule applied 27 times.
Iterating global reduction 7 with 27 rules applied. Total rules applied 2341 place count 149 transition count 4651
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 7 with 27 rules applied. Total rules applied 2368 place count 122 transition count 4651
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 2375 place count 115 transition count 4644
Iterating global reduction 8 with 7 rules applied. Total rules applied 2382 place count 115 transition count 4644
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 2384 place count 115 transition count 4642
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 2387 place count 115 transition count 4639
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 2390 place count 112 transition count 4639
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 9 with 14 rules applied. Total rules applied 2404 place count 112 transition count 4639
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 2408 place count 112 transition count 4635
Applied a total of 2408 rules in 1758 ms. Remains 112 /1379 variables (removed 1267) and now considering 4635/5986 (removed 1351) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1759 ms. Remains : 112/1379 places, 4635/5986 transitions.
RANDOM walk for 40000 steps (1556 resets) in 2567 ms. (15 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (17 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (16 resets) in 25 ms. (153 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (16 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (17 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (17 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (15 resets) in 13 ms. (285 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4004 steps (15 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (16 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (14 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (17 resets) in 9 ms. (400 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4004 steps (15 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (16 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (16 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4003 steps (16 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (16 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (15 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (18 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (17 resets) in 9 ms. (400 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4004 steps (18 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (16 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (17 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (18 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3426487298865671204.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13355860330142676180.kers'
[2026-05-25 11:19:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3426487298865671204.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13355860330142676180.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 7 ms.
// Phase 1: matrix 4635 rows 111 cols 62878 entries
Finished phase 1 with 104 SingleSign rule and 0 generalized
[2026-05-25 11:19:08] [INFO ] Computed 8 invariants in 27 ms
Computed 8 P flows in 28 ms.
Exported basis to /tmp/petrispot-output-13355860330142676180.kers
Total runtime 35 ms.
[2026-05-25 11:19:09] [INFO ] State equation strengthened by 152 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 67/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 4635/4747 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4747 variables, 152/272 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4747 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/4747 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4747/4747 variables, and 272 constraints, problems are : Problem set: 0 solved, 23 unsolved in 11108 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 23/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 67/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 4635/4747 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4747 variables, 152/272 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4747 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4747 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/4747 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4747/4747 variables, and 274 constraints, problems are : Problem set: 0 solved, 23 unsolved in 17451 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 112/112 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 23/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28963ms problems are : Problem set: 0 solved, 23 unsolved
Fused 23 Parikh solutions to 20 different solutions.
Parikh walk visited 21 properties in 643 ms.
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 4635/4635 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 112 transition count 4616
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 93 transition count 4616
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 52 place count 79 transition count 498
Iterating global reduction 2 with 14 rules applied. Total rules applied 66 place count 79 transition count 498
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 80 place count 79 transition count 484
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 88 place count 75 transition count 480
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 90 place count 75 transition count 478
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 91 place count 74 transition count 477
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 74 transition count 477
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 94 place count 74 transition count 475
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 95 place count 73 transition count 473
Iterating global reduction 4 with 1 rules applied. Total rules applied 96 place count 73 transition count 473
Free-agglomeration rule applied 35 times.
Iterating global reduction 4 with 35 rules applied. Total rules applied 131 place count 73 transition count 438
Reduce places removed 35 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 129 transitions.
Iterating post reduction 4 with 164 rules applied. Total rules applied 295 place count 38 transition count 309
Drop transitions (Redundant composition of simpler transitions.) removed 125 transitions
Redundant transition composition rules discarded 125 transitions
Iterating global reduction 5 with 125 rules applied. Total rules applied 420 place count 38 transition count 184
Applied a total of 420 rules in 259 ms. Remains 38 /112 variables (removed 74) and now considering 184/4635 (removed 4451) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 259 ms. Remains : 38/112 places, 184/4635 transitions.
RANDOM walk for 4559 steps (0 resets) in 63 ms. (71 steps per ms) remains 0/2 properties
Computed a total of 287 stabilizing places and 301 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((G(p1)||X((X(X(!p2)) U ((!p3&&X(X(!p2)))||X(X(G(!p2))))))))&&p0)))'
Support contains 14 out of 1379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1379/1379 places, 5986/5986 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1376 transition count 5983
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1376 transition count 5983
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 1373 transition count 5980
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 1373 transition count 5980
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 1371 transition count 5978
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 1371 transition count 5978
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1370 transition count 5977
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1370 transition count 5977
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1369 transition count 5976
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1369 transition count 5976
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1368 transition count 5975
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1368 transition count 5975
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1367 transition count 5974
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1367 transition count 5974
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1366 transition count 5973
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1366 transition count 5973
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1365 transition count 5972
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1365 transition count 5972
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1365 transition count 5971
Applied a total of 29 rules in 753 ms. Remains 1365 /1379 variables (removed 14) and now considering 5971/5986 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13179510043456927110.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10137766529704946246.kers'
[2026-05-25 11:19:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13179510043456927110.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10137766529704946246.kers]
Culled 0 columns in 9 ms.
// Phase 1: matrix 5971 rows 1365 cols 66169 entries
Finished phase 1 with 1357 SingleSign rule and 0 generalized
[2026-05-25 11:19:40] [INFO ] Computed 8 invariants in 67 ms
Computed 8 P flows in 67 ms.
Exported basis to /tmp/petrispot-output-10137766529704946246.kers
Total runtime 74 ms.
[2026-05-25 11:19:41] [INFO ] Implicit Places using invariants in 1715 ms returned []
[2026-05-25 11:19:41] [INFO ] Invariant cache hit.
[2026-05-25 11:19:46] [INFO ] Implicit Places using invariants and state equation in 4397 ms returned []
Implicit Place search using SMT with State Equation took 6139 ms to find 0 implicit places.
Running 5970 sub problems to find dead transitions.
[2026-05-25 11:19:46] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1364/7336 variables, and 0 constraints, problems are : Problem set: 0 solved, 5970 unsolved in 30125 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1365 constraints, PredecessorRefiner: 5970/1554 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5970 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1364/7336 variables, and 0 constraints, problems are : Problem set: 0 solved, 5970 unsolved in 30119 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1365 constraints, PredecessorRefiner: 4416/1554 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 70545ms problems are : Problem set: 0 solved, 5970 unsolved
Search for dead transitions found 0 dead transitions in 70590ms
Starting structural reductions in LTL mode, iteration 1 : 1365/1379 places, 5971/5986 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77505 ms. Remains : 1365/1379 places, 5971/5986 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((G(p1)||X((X(X(!p2)) U ((!p3&&X(X(!p2)))||X(X(G(!p2))))))))&&p0)))'
Stuttering acceptance computed with spot in 878 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), true, (AND (NOT p1) p2), p2, (AND p2 (NOT p1)), p2, p2, (AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyB-PT-B07-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 5 ms.
FORMULA MedleyB-PT-B07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B07-LTLFireability-00 finished in 78615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 13 out of 1379 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1379/1379 places, 5986/5986 transitions.
Graph (trivial) has 1366 edges and 1379 vertex of which 112 / 1379 are part of one of the 21 SCC in 2 ms
Free SCC test removed 91 places
Ensure Unique test removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 949 transitions
Trivial Post-agglo rules discarded 949 transitions
Performed 949 trivial Post agglomeration. Transition count delta: 949
Iterating post reduction 0 with 949 rules applied. Total rules applied 950 place count 1287 transition count 4931
Reduce places removed 949 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 970 rules applied. Total rules applied 1920 place count 338 transition count 4910
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1927 place count 331 transition count 4910
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 69 Pre rules applied. Total rules applied 1927 place count 331 transition count 4841
Deduced a syphon composed of 69 places in 2 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 2065 place count 262 transition count 4841
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2071 place count 256 transition count 4835
Iterating global reduction 3 with 6 rules applied. Total rules applied 2077 place count 256 transition count 4835
Performed 56 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 2189 place count 200 transition count 4778
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 2224 place count 165 transition count 2684
Iterating global reduction 3 with 35 rules applied. Total rules applied 2259 place count 165 transition count 2684
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 2273 place count 165 transition count 2670
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 2294 place count 144 transition count 2642
Iterating global reduction 4 with 21 rules applied. Total rules applied 2315 place count 144 transition count 2642
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 2336 place count 123 transition count 2614
Iterating global reduction 4 with 21 rules applied. Total rules applied 2357 place count 123 transition count 2614
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 2364 place count 123 transition count 2607
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 2386 place count 112 transition count 2614
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2387 place count 111 transition count 2600
Iterating global reduction 5 with 1 rules applied. Total rules applied 2388 place count 111 transition count 2600
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2389 place count 111 transition count 2599
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 2396 place count 111 transition count 2592
Applied a total of 2396 rules in 865 ms. Remains 111 /1379 variables (removed 1268) and now considering 2592/5986 (removed 3394) transitions.
[2026-05-25 11:20:58] [INFO ] Flow matrix only has 2584 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15651177259256765559.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1874313403632864807.kers'
[2026-05-25 11:20:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15651177259256765559.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1874313403632864807.kers]
Normalized transition count is 2583 out of 2584 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 3 ms.
// Phase 1: matrix 2583 rows 110 cols 33690 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-25 11:20:58] [INFO ] Computed 2 invariants in 13 ms
Computed 2 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-1874313403632864807.kers
Total runtime 17 ms.
[2026-05-25 11:20:59] [INFO ] Implicit Places using invariants in 623 ms returned []
[2026-05-25 11:20:59] [INFO ] Flow matrix only has 2584 transitions (discarded 8 similar events)
[2026-05-25 11:20:59] [INFO ] Invariant cache hit.
[2026-05-25 11:21:00] [INFO ] State equation strengthened by 127 read => feed constraints.
[2026-05-25 11:21:01] [INFO ] Implicit Places using invariants and state equation in 2368 ms returned []
Implicit Place search using SMT with State Equation took 3027 ms to find 0 implicit places.
[2026-05-25 11:21:02] [INFO ] Redundant transitions in 198 ms returned []
Running 2575 sub problems to find dead transitions.
[2026-05-25 11:21:02] [INFO ] Flow matrix only has 2584 transitions (discarded 8 similar events)
[2026-05-25 11:21:02] [INFO ] Invariant cache hit.
[2026-05-25 11:21:02] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2575 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 110/2695 variables, and 1 constraints, problems are : Problem set: 0 solved, 2575 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/111 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 2575/212 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2575 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2575 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2575 unsolved
At refinement iteration 2 (OVERLAPS) 1/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2575 unsolved
SMT process timed out in 64924ms, After SMT, problems are : Problem set: 0 solved, 2575 unsolved
Search for dead transitions found 0 dead transitions in 64932ms
Starting structural reductions in SI_LTL mode, iteration 1 : 111/1379 places, 2592/5986 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69042 ms. Remains : 111/1379 places, 2592/5986 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyB-PT-B07-LTLFireability-02
Product exploration explored 100000 steps with 7389 reset in 611 ms.
Product exploration explored 100000 steps with 7433 reset in 557 ms.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge based reduction with 5 factoid took 55 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (2960 resets) in 1221 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (254 resets) in 282 ms. (141 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (257 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 209445 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 2
Probabilistic random walk after 209445 steps, saw 49859 distinct states, run finished after 3007 ms. (steps per millisecond=69 ) properties seen :0
[2026-05-25 11:22:11] [INFO ] Flow matrix only has 2584 transitions (discarded 8 similar events)
[2026-05-25 11:22:11] [INFO ] Invariant cache hit.
[2026-05-25 11:22:12] [INFO ] State equation strengthened by 127 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2582/2691 variables, 109/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2691 variables, 126/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2691 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/2694 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2694 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2694 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/2695 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2695 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2695 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2695/2695 variables, and 240 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2065 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2582/2691 variables, 109/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2691 variables, 126/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2691 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/2694 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2694 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2694 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/2695 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2695 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2695 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2695/2695 variables, and 240 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2905 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5180ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Parikh walk visited 2 properties in 30 ms.
Knowledge based reduction with 5 factoid took 107 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 9013 ms.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 13 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 2592/2592 transitions.
Applied a total of 0 rules in 144 ms. Remains 111 /111 variables (removed 0) and now considering 2592/2592 (removed 0) transitions.
[2026-05-25 11:22:17] [INFO ] Flow matrix only has 2584 transitions (discarded 8 similar events)
[2026-05-25 11:22:17] [INFO ] Invariant cache hit.
[2026-05-25 11:22:18] [INFO ] Implicit Places using invariants in 619 ms returned []
[2026-05-25 11:22:18] [INFO ] Flow matrix only has 2584 transitions (discarded 8 similar events)
[2026-05-25 11:22:18] [INFO ] Invariant cache hit.
[2026-05-25 11:22:19] [INFO ] State equation strengthened by 127 read => feed constraints.
[2026-05-25 11:22:20] [INFO ] Implicit Places using invariants and state equation in 2263 ms returned []
Implicit Place search using SMT with State Equation took 2885 ms to find 0 implicit places.
[2026-05-25 11:22:20] [INFO ] Redundant transitions in 151 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3215 ms. Remains : 111/111 places, 2592/2592 transitions.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge based reduction with 5 factoid took 103 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (2951 resets) in 404 ms. (98 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (245 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (262 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 226077 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 2
Probabilistic random walk after 226077 steps, saw 52417 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
[2026-05-25 11:22:24] [INFO ] Flow matrix only has 2584 transitions (discarded 8 similar events)
[2026-05-25 11:22:24] [INFO ] Invariant cache hit.
[2026-05-25 11:22:24] [INFO ] State equation strengthened by 127 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2582/2691 variables, 109/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2691 variables, 126/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2691 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/2694 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2694 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2694 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/2695 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2695 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2695 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2695/2695 variables, and 240 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1890 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2582/2691 variables, 109/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2691 variables, 126/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2691 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/2694 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2694 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2694 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/2695 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2695 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2695 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2695/2695 variables, and 240 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2638 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4731ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Parikh walk visited 2 properties in 19 ms.
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 8272 ms.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 7419 reset in 590 ms.
Product exploration explored 100000 steps with 7408 reset in 563 ms.
Built C files in :
/tmp/ltsmin10990542550439177948
[2026-05-25 11:22:30] [INFO ] Too many transitions (2592) to apply POR reductions. Disabling POR matrices.
[2026-05-25 11:22:30] [INFO ] Built C files in 152ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10990542550439177948
Running compilation step : cd /tmp/ltsmin10990542550439177948;'/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/ltsmin10990542550439177948;'/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/ltsmin10990542550439177948;'/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 13 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 2592/2592 transitions.
Applied a total of 0 rules in 152 ms. Remains 111 /111 variables (removed 0) and now considering 2592/2592 (removed 0) transitions.
[2026-05-25 11:22:33] [INFO ] Flow matrix only has 2584 transitions (discarded 8 similar events)
[2026-05-25 11:22:33] [INFO ] Invariant cache hit.
[2026-05-25 11:22:34] [INFO ] Implicit Places using invariants in 771 ms returned []
[2026-05-25 11:22:34] [INFO ] Flow matrix only has 2584 transitions (discarded 8 similar events)
[2026-05-25 11:22:34] [INFO ] Invariant cache hit.
[2026-05-25 11:22:35] [INFO ] State equation strengthened by 127 read => feed constraints.
[2026-05-25 11:22:37] [INFO ] Implicit Places using invariants and state equation in 2488 ms returned []
Implicit Place search using SMT with State Equation took 3273 ms to find 0 implicit places.
[2026-05-25 11:22:37] [INFO ] Redundant transitions in 69 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3526 ms. Remains : 111/111 places, 2592/2592 transitions.
Built C files in :
/tmp/ltsmin12139434741432828245
[2026-05-25 11:22:37] [INFO ] Too many transitions (2592) to apply POR reductions. Disabling POR matrices.
[2026-05-25 11:22:37] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12139434741432828245
Running compilation step : cd /tmp/ltsmin12139434741432828245;'/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/ltsmin12139434741432828245;'/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/ltsmin12139434741432828245;'/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-25 11:22:41] [INFO ] Flatten gal took : 221 ms
[2026-05-25 11:22:41] [INFO ] Flatten gal took : 169 ms
[2026-05-25 11:22:41] [INFO ] Time to serialize gal into /tmp/LTL11029374767426263881.gal : 56 ms
[2026-05-25 11:22:41] [INFO ] Time to serialize properties into /tmp/LTL7591572518667609490.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/LTL11029374767426263881.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11072712469874174334.hoa' '-atoms' '/tmp/LTL7591572518667609490.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/LTL7591572518667609490.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11072712469874174334.hoa
Detected timeout of ITS tools.
[2026-05-25 11:22:56] [INFO ] Flatten gal took : 160 ms
[2026-05-25 11:22:56] [INFO ] Flatten gal took : 171 ms
[2026-05-25 11:22:56] [INFO ] Time to serialize gal into /tmp/LTL6057063875549335055.gal : 31 ms
[2026-05-25 11:22:56] [INFO ] Time to serialize properties into /tmp/LTL13240922270683196631.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6057063875549335055.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13240922270683196631.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("((((p119==0)||(p420==0))||((p721==0)||(p1022==0)))||(((p1346==0)||(p1647==0))||(p1948==0)))"))&&(F(G("((((p97==0)||(p398==0))...229
Formula 0 simplified : F(G!"((((p119==0)||(p420==0))||((p721==0)||(p1022==0)))||(((p1346==0)||(p1647==0))||(p1948==0)))" | GF!"((((p97==0)||(p398==0))||((p...219
Detected timeout of ITS tools.
[2026-05-25 11:23:12] [INFO ] Flatten gal took : 204 ms
[2026-05-25 11:23:12] [INFO ] Applying decomposition
[2026-05-25 11:23:12] [INFO ] Flatten gal took : 220 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/graph7041356972346678518.txt' '-o' '/tmp/graph7041356972346678518.bin' '-w' '/tmp/graph7041356972346678518.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7041356972346678518.bin' '-l' '-1' '-v' '-w' '/tmp/graph7041356972346678518.weights' '-q' '0' '-e' '0.001'
[2026-05-25 11:23:12] [INFO ] Decomposing Gal with order
[2026-05-25 11:23:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 11:23:13] [INFO ] Removed a total of 17141 redundant transitions.
[2026-05-25 11:23:13] [INFO ] Flatten gal took : 608 ms
[2026-05-25 11:23:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 71 labels/synchronizations in 97 ms.
[2026-05-25 11:23:13] [INFO ] Time to serialize gal into /tmp/LTL6446513276492457761.gal : 7 ms
[2026-05-25 11:23:13] [INFO ] Time to serialize properties into /tmp/LTL911715381051622940.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/LTL6446513276492457761.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL911715381051622940.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...253
Read 1 LTL properties
Checking formula 0 : !((G((F("((((i1.u1.p119==0)||(i1.u6.p420==0))||((i2.u8.p721==0)||(i1.u11.p1022==0)))||(((i2.u13.p1346==0)||(i2.u16.p1647==0))||(i2.u20...321
Formula 0 simplified : F(G!"((((i1.u1.p119==0)||(i1.u6.p420==0))||((i2.u8.p721==0)||(i1.u11.p1022==0)))||(((i2.u13.p1346==0)||(i2.u16.p1647==0))||(i2.u20.p...311
Detected timeout of ITS tools.
Treatment of property MedleyB-PT-B07-LTLFireability-02 finished in 151000 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(F(!p0))||(F(!p0)&&X((X(F(p1))||(X(!p2) U ((!p2&&X(!p2))||X(G(!p2))))))))))'
Support contains 14 out of 1379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1379/1379 places, 5986/5986 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1377 transition count 5984
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1377 transition count 5984
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 1375 transition count 5982
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1375 transition count 5982
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 1373 transition count 5980
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 1373 transition count 5980
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1372 transition count 5979
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1372 transition count 5979
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1371 transition count 5978
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1371 transition count 5978
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1370 transition count 5977
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1370 transition count 5977
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1369 transition count 5976
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1369 transition count 5976
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1368 transition count 5975
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1368 transition count 5975
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1367 transition count 5974
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1367 transition count 5974
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 1367 transition count 5973
Applied a total of 25 rules in 1016 ms. Remains 1367 /1379 variables (removed 12) and now considering 5973/5986 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10584144617759303472.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1610182624615446101.kers'
[2026-05-25 11:23:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10584144617759303472.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1610182624615446101.kers]
Culled 0 columns in 9 ms.
// Phase 1: matrix 5973 rows 1367 cols 66173 entries
Finished phase 1 with 1359 SingleSign rule and 0 generalized
[2026-05-25 11:23:30] [INFO ] Computed 8 invariants in 70 ms
Computed 8 P flows in 70 ms.
Exported basis to /tmp/petrispot-output-1610182624615446101.kers
Total runtime 79 ms.
[2026-05-25 11:23:31] [INFO ] Implicit Places using invariants in 1774 ms returned []
[2026-05-25 11:23:31] [INFO ] Invariant cache hit.
[2026-05-25 11:23:35] [INFO ] Implicit Places using invariants and state equation in 3735 ms returned []
Implicit Place search using SMT with State Equation took 5527 ms to find 0 implicit places.
Running 5972 sub problems to find dead transitions.
[2026-05-25 11:23:35] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1366/7340 variables, and 0 constraints, problems are : Problem set: 0 solved, 5972 unsolved in 30123 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1367 constraints, PredecessorRefiner: 5972/1556 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5972 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1366/7340 variables, and 0 constraints, problems are : Problem set: 0 solved, 5972 unsolved in 30160 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1367 constraints, PredecessorRefiner: 4416/1556 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 70219ms problems are : Problem set: 0 solved, 5972 unsolved
Search for dead transitions found 0 dead transitions in 70253ms
Starting structural reductions in LTL mode, iteration 1 : 1367/1379 places, 5973/5986 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76830 ms. Remains : 1367/1379 places, 5973/5986 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&X((X(F(p1))||(X(!p2) U ((!p2&&X(!p2))||X(G(!p2))))))))))'
Stuttering acceptance computed with spot in 526 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyB-PT-B07-LTLFireability-04
Product exploration explored 100000 steps with 33333 reset in 629 ms.
Product exploration explored 100000 steps with 33333 reset in 550 ms.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 11 factoid took 24 ms. Proved property starting from automaton with 8 states, 18 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 87 ms.
FORMULA MedleyB-PT-B07-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyB-PT-B07-LTLFireability-04 finished in 78739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G((p0||X(p0)))) U (F(p1)&&G(p2))))))'
Support contains 13 out of 1379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1379/1379 places, 5986/5986 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1376 transition count 5983
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1376 transition count 5983
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 1373 transition count 5980
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 1373 transition count 5980
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 1371 transition count 5978
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 1371 transition count 5978
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1370 transition count 5977
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1370 transition count 5977
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1369 transition count 5976
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1369 transition count 5976
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1368 transition count 5975
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1368 transition count 5975
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1367 transition count 5974
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1367 transition count 5974
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1366 transition count 5973
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1366 transition count 5973
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1365 transition count 5972
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1365 transition count 5972
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1365 transition count 5971
Applied a total of 29 rules in 859 ms. Remains 1365 /1379 variables (removed 14) and now considering 5971/5986 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2281855619784793118.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16353913454043510369.kers'
[2026-05-25 11:24:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2281855619784793118.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16353913454043510369.kers]
Culled 0 columns in 20 ms.
// Phase 1: matrix 5971 rows 1365 cols 66169 entries
Finished phase 1 with 1357 SingleSign rule and 0 generalized
[2026-05-25 11:24:48] [INFO ] Computed 8 invariants in 98 ms
Computed 8 P flows in 99 ms.
Exported basis to /tmp/petrispot-output-16353913454043510369.kers
Total runtime 119 ms.
[2026-05-25 11:24:50] [INFO ] Implicit Places using invariants in 1671 ms returned []
[2026-05-25 11:24:50] [INFO ] Invariant cache hit.
[2026-05-25 11:24:54] [INFO ] Implicit Places using invariants and state equation in 4444 ms returned []
Implicit Place search using SMT with State Equation took 6137 ms to find 0 implicit places.
Running 5970 sub problems to find dead transitions.
[2026-05-25 11:24:54] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1364/7336 variables, and 0 constraints, problems are : Problem set: 0 solved, 5970 unsolved in 30125 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1365 constraints, PredecessorRefiner: 5970/1554 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5970 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1364/7336 variables, and 0 constraints, problems are : Problem set: 0 solved, 5970 unsolved in 30124 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1365 constraints, PredecessorRefiner: 4416/1554 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 70299ms problems are : Problem set: 0 solved, 5970 unsolved
Search for dead transitions found 0 dead transitions in 70319ms
Starting structural reductions in LTL mode, iteration 1 : 1365/1379 places, 5971/5986 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77345 ms. Remains : 1365/1379 places, 5971/5986 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G((X(p0)||p0))) U (F(p1)&&G(p2))))))'
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : MedleyB-PT-B07-LTLFireability-05
Stuttering criterion allowed to conclude after 123 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B07-LTLFireability-05 finished in 77751 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 7 out of 1379 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1379/1379 places, 5986/5986 transitions.
Graph (trivial) has 1372 edges and 1379 vertex of which 112 / 1379 are part of one of the 21 SCC in 0 ms
Free SCC test removed 91 places
Ensure Unique test removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 955 transitions
Trivial Post-agglo rules discarded 955 transitions
Performed 955 trivial Post agglomeration. Transition count delta: 955
Iterating post reduction 0 with 955 rules applied. Total rules applied 956 place count 1287 transition count 4925
Reduce places removed 955 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 976 rules applied. Total rules applied 1932 place count 332 transition count 4904
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1939 place count 325 transition count 4904
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 69 Pre rules applied. Total rules applied 1939 place count 325 transition count 4835
Deduced a syphon composed of 69 places in 2 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 2077 place count 256 transition count 4835
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2083 place count 250 transition count 4829
Iterating global reduction 3 with 6 rules applied. Total rules applied 2089 place count 250 transition count 4829
Performed 56 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 2201 place count 194 transition count 4772
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 2239 place count 156 transition count 1139
Iterating global reduction 3 with 38 rules applied. Total rules applied 2277 place count 156 transition count 1139
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 2294 place count 156 transition count 1122
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 2315 place count 135 transition count 1094
Iterating global reduction 4 with 21 rules applied. Total rules applied 2336 place count 135 transition count 1094
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 2357 place count 114 transition count 1066
Iterating global reduction 4 with 21 rules applied. Total rules applied 2378 place count 114 transition count 1066
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 2385 place count 114 transition count 1059
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 2407 place count 103 transition count 1066
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2408 place count 102 transition count 1052
Iterating global reduction 5 with 1 rules applied. Total rules applied 2409 place count 102 transition count 1052
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2410 place count 102 transition count 1051
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 2417 place count 102 transition count 1044
Applied a total of 2417 rules in 518 ms. Remains 102 /1379 variables (removed 1277) and now considering 1044/5986 (removed 4942) transitions.
[2026-05-25 11:26:06] [INFO ] Flow matrix only has 1036 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16240074842105767859.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5130564583760429549.kers'
[2026-05-25 11:26:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16240074842105767859.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5130564583760429549.kers]
Normalized transition count is 1035 out of 1036 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 1035 rows 101 cols 12126 entries
Finished phase 1 with 100 SingleSign rule and 0 generalized
[2026-05-25 11:26:06] [INFO ] Computed 2 invariants in 5 ms
Computed 2 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5130564583760429549.kers
Total runtime 7 ms.
[2026-05-25 11:26:06] [INFO ] Implicit Places using invariants in 461 ms returned []
[2026-05-25 11:26:06] [INFO ] Flow matrix only has 1036 transitions (discarded 8 similar events)
[2026-05-25 11:26:06] [INFO ] Invariant cache hit.
[2026-05-25 11:26:06] [INFO ] State equation strengthened by 127 read => feed constraints.
[2026-05-25 11:26:07] [INFO ] Implicit Places using invariants and state equation in 1219 ms returned []
Implicit Place search using SMT with State Equation took 1709 ms to find 0 implicit places.
[2026-05-25 11:26:07] [INFO ] Redundant transitions in 10 ms returned []
Running 1027 sub problems to find dead transitions.
[2026-05-25 11:26:07] [INFO ] Flow matrix only has 1036 transitions (discarded 8 similar events)
[2026-05-25 11:26:07] [INFO ] Invariant cache hit.
[2026-05-25 11:26:07] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
SMT process timed out in 31601ms, After SMT, problems are : Problem set: 0 solved, 1027 unsolved
Search for dead transitions found 0 dead transitions in 31612ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/1379 places, 1044/5986 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33861 ms. Remains : 102/1379 places, 1044/5986 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 48 ms :[(NOT p0)]
Running random walk in product with property : MedleyB-PT-B07-LTLFireability-06
Product exploration explored 100000 steps with 7658 reset in 411 ms.
Product exploration explored 100000 steps with 7670 reset in 294 ms.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (3072 resets) in 210 ms. (189 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (268 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 866865 steps, run timeout after 3001 ms. (steps per millisecond=288 ) properties seen :0 out of 1
Probabilistic random walk after 866865 steps, saw 168966 distinct states, run finished after 3001 ms. (steps per millisecond=288 ) properties seen :0
[2026-05-25 11:26:43] [INFO ] Flow matrix only has 1036 transitions (discarded 8 similar events)
[2026-05-25 11:26:43] [INFO ] Invariant cache hit.
[2026-05-25 11:26:43] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1034/1134 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1134 variables, 126/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1134 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1137 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1137 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1137 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1138 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1138 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1138 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1138/1138 variables, and 231 constraints, problems are : Problem set: 0 solved, 1 unsolved in 901 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/0 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1034/1134 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1134 variables, 126/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1134 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1137 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1137 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1137 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1138 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1138 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1138 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1138/1138 variables, and 231 constraints, problems are : Problem set: 0 solved, 1 unsolved in 797 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1756ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 27 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Parikh walk visited 1 properties in 1 ms.
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0)]
Knowledge-based reduction took 5159 ms.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Support contains 7 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 1044/1044 transitions.
Applied a total of 0 rules in 78 ms. Remains 102 /102 variables (removed 0) and now considering 1044/1044 (removed 0) transitions.
[2026-05-25 11:26:45] [INFO ] Flow matrix only has 1036 transitions (discarded 8 similar events)
[2026-05-25 11:26:45] [INFO ] Invariant cache hit.
[2026-05-25 11:26:45] [INFO ] Implicit Places using invariants in 437 ms returned []
[2026-05-25 11:26:45] [INFO ] Flow matrix only has 1036 transitions (discarded 8 similar events)
[2026-05-25 11:26:45] [INFO ] Invariant cache hit.
[2026-05-25 11:26:46] [INFO ] State equation strengthened by 127 read => feed constraints.
[2026-05-25 11:26:46] [INFO ] Implicit Places using invariants and state equation in 1041 ms returned []
Implicit Place search using SMT with State Equation took 1480 ms to find 0 implicit places.
[2026-05-25 11:26:46] [INFO ] Redundant transitions in 10 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1573 ms. Remains : 102/102 places, 1044/1044 transitions.
Computed a total of 4 stabilizing places and 22 stable transitions
Computed a total of 4 stabilizing places and 22 stable transitions
Knowledge based reduction with 3 factoid took 40 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (3092 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (271 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 841796 steps, run timeout after 3001 ms. (steps per millisecond=280 ) properties seen :0 out of 1
Probabilistic random walk after 841796 steps, saw 163667 distinct states, run finished after 3001 ms. (steps per millisecond=280 ) properties seen :0
[2026-05-25 11:26:50] [INFO ] Flow matrix only has 1036 transitions (discarded 8 similar events)
[2026-05-25 11:26:50] [INFO ] Invariant cache hit.
[2026-05-25 11:26:50] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1034/1134 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1134 variables, 126/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1134 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1137 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1137 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1137 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1138 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1138 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1138 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1138/1138 variables, and 231 constraints, problems are : Problem set: 0 solved, 1 unsolved in 898 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/0 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1034/1134 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1134 variables, 126/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1134 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1137 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1137 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1137 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1138 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1138 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1138 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1138/1138 variables, and 231 constraints, problems are : Problem set: 0 solved, 1 unsolved in 828 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1807ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 27 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Parikh walk visited 1 properties in 1 ms.
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Knowledge-based reduction took 5077 ms.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7698 reset in 342 ms.
Product exploration explored 100000 steps with 7656 reset in 329 ms.
Built C files in :
/tmp/ltsmin14273351169343484496
[2026-05-25 11:26:52] [INFO ] Computing symmetric may disable matrix : 1044 transitions.
[2026-05-25 11:26:53] [INFO ] Computation of Complete disable matrix. took 100 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 11:26:53] [INFO ] Computing symmetric may enable matrix : 1044 transitions.
[2026-05-25 11:26:53] [INFO ] Computation of Complete enable matrix. took 44 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 11:26:53] [INFO ] Computing Do-Not-Accords matrix : 1044 transitions.
[2026-05-25 11:26:53] [INFO ] Computation of Completed DNA matrix. took 56 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 11:26:53] [INFO ] Built C files in 540ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14273351169343484496
Running compilation step : cd /tmp/ltsmin14273351169343484496;'/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/ltsmin14273351169343484496;'/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/ltsmin14273351169343484496;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 7 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 1044/1044 transitions.
Applied a total of 0 rules in 79 ms. Remains 102 /102 variables (removed 0) and now considering 1044/1044 (removed 0) transitions.
[2026-05-25 11:26:56] [INFO ] Flow matrix only has 1036 transitions (discarded 8 similar events)
[2026-05-25 11:26:56] [INFO ] Invariant cache hit.
[2026-05-25 11:26:56] [INFO ] Implicit Places using invariants in 388 ms returned []
[2026-05-25 11:26:56] [INFO ] Flow matrix only has 1036 transitions (discarded 8 similar events)
[2026-05-25 11:26:56] [INFO ] Invariant cache hit.
[2026-05-25 11:26:57] [INFO ] State equation strengthened by 127 read => feed constraints.
[2026-05-25 11:26:57] [INFO ] Implicit Places using invariants and state equation in 1000 ms returned []
Implicit Place search using SMT with State Equation took 1402 ms to find 0 implicit places.
[2026-05-25 11:26:57] [INFO ] Redundant transitions in 18 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1506 ms. Remains : 102/102 places, 1044/1044 transitions.
Built C files in :
/tmp/ltsmin13024060810291534280
[2026-05-25 11:26:58] [INFO ] Computing symmetric may disable matrix : 1044 transitions.
[2026-05-25 11:26:58] [INFO ] Computation of Complete disable matrix. took 114 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 11:26:58] [INFO ] Computing symmetric may enable matrix : 1044 transitions.
[2026-05-25 11:26:58] [INFO ] Computation of Complete enable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 11:26:58] [INFO ] Computing Do-Not-Accords matrix : 1044 transitions.
[2026-05-25 11:26:58] [INFO ] Computation of Completed DNA matrix. took 71 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 11:26:58] [INFO ] Built C files in 489ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13024060810291534280
Running compilation step : cd /tmp/ltsmin13024060810291534280;'/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/ltsmin13024060810291534280;'/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/ltsmin13024060810291534280;'/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-25 11:27:01] [INFO ] Flatten gal took : 72 ms
[2026-05-25 11:27:01] [INFO ] Flatten gal took : 73 ms
[2026-05-25 11:27:01] [INFO ] Time to serialize gal into /tmp/LTL4910083275004885414.gal : 14 ms
[2026-05-25 11:27:01] [INFO ] Time to serialize properties into /tmp/LTL9851768663544399009.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/LTL4910083275004885414.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13922494631860779612.hoa' '-atoms' '/tmp/LTL9851768663544399009.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9851768663544399009.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13922494631860779612.hoa
Detected timeout of ITS tools.
[2026-05-25 11:27:17] [INFO ] Flatten gal took : 58 ms
[2026-05-25 11:27:17] [INFO ] Flatten gal took : 60 ms
[2026-05-25 11:27:17] [INFO ] Time to serialize gal into /tmp/LTL11802890601519959064.gal : 12 ms
[2026-05-25 11:27:17] [INFO ] Time to serialize properties into /tmp/LTL1305778318787063029.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/LTL11802890601519959064.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1305778318787063029.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((((p119!=1)||(p398!=1))||((p721!=1)||(p1000!=1)))||(((p1301!=1)||(p1647!=1))||(p1925!=1)))"))))
Formula 0 simplified : GF!"((((p119!=1)||(p398!=1))||((p721!=1)||(p1000!=1)))||(((p1301!=1)||(p1647!=1))||(p1925!=1)))"
Detected timeout of ITS tools.
[2026-05-25 11:27:32] [INFO ] Flatten gal took : 91 ms
[2026-05-25 11:27:32] [INFO ] Applying decomposition
[2026-05-25 11:27:32] [INFO ] Flatten gal took : 63 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/graph8752156649708816970.txt' '-o' '/tmp/graph8752156649708816970.bin' '-w' '/tmp/graph8752156649708816970.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8752156649708816970.bin' '-l' '-1' '-v' '-w' '/tmp/graph8752156649708816970.weights' '-q' '0' '-e' '0.001'
[2026-05-25 11:27:32] [INFO ] Decomposing Gal with order
[2026-05-25 11:27:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 11:27:32] [INFO ] Removed a total of 6372 redundant transitions.
[2026-05-25 11:27:32] [INFO ] Flatten gal took : 136 ms
[2026-05-25 11:27:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 20 ms.
[2026-05-25 11:27:32] [INFO ] Time to serialize gal into /tmp/LTL13334552043660288954.gal : 3 ms
[2026-05-25 11:27:32] [INFO ] Time to serialize properties into /tmp/LTL1461135342233245935.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/LTL13334552043660288954.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1461135342233245935.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("((((u0.p119!=1)||(i0.u3.p398!=1))||((u6.p721!=1)||(i0.u10.p1000!=1)))||(((i0.u13.p1301!=1)||(u17.p1647!=1))||(i0.u19.p1925!=1)...162
Formula 0 simplified : GF!"((((u0.p119!=1)||(i0.u3.p398!=1))||((u6.p721!=1)||(i0.u10.p1000!=1)))||(((i0.u13.p1301!=1)||(u17.p1647!=1))||(i0.u19.p1925!=1)))...156
Detected timeout of ITS tools.
Treatment of property MedleyB-PT-B07-LTLFireability-06 finished in 102538 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((!p0 U (!p1||G(!p0)))))))'
Support contains 14 out of 1379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1379/1379 places, 5986/5986 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1376 transition count 5983
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1376 transition count 5983
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 1373 transition count 5980
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 1373 transition count 5980
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 1371 transition count 5978
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 1371 transition count 5978
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1370 transition count 5977
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1370 transition count 5977
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1369 transition count 5976
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1369 transition count 5976
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1368 transition count 5975
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1368 transition count 5975
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1367 transition count 5974
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1367 transition count 5974
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1366 transition count 5973
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1366 transition count 5973
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1365 transition count 5972
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1365 transition count 5972
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1365 transition count 5971
Applied a total of 29 rules in 814 ms. Remains 1365 /1379 variables (removed 14) and now considering 5971/5986 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17645151076661851524.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-521829185631911483.kers'
[2026-05-25 11:27:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17645151076661851524.kers, --Pflows, --basisKERS=/tmp/petrispot-output-521829185631911483.kers]
Culled 0 columns in 9 ms.
// Phase 1: matrix 5971 rows 1365 cols 66169 entries
Finished phase 1 with 1357 SingleSign rule and 0 generalized
[2026-05-25 11:27:48] [INFO ] Computed 8 invariants in 80 ms
Computed 8 P flows in 80 ms.
Exported basis to /tmp/petrispot-output-521829185631911483.kers
Total runtime 103 ms.
[2026-05-25 11:27:50] [INFO ] Implicit Places using invariants in 1679 ms returned []
[2026-05-25 11:27:50] [INFO ] Invariant cache hit.
[2026-05-25 11:27:55] [INFO ] Implicit Places using invariants and state equation in 4495 ms returned []
Implicit Place search using SMT with State Equation took 6201 ms to find 0 implicit places.
Running 5970 sub problems to find dead transitions.
[2026-05-25 11:27:55] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1364/7336 variables, and 0 constraints, problems are : Problem set: 0 solved, 5970 unsolved in 30095 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1365 constraints, PredecessorRefiner: 5970/1554 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5970 unsolved
(s1214 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1364/7336 variables, and 0 constraints, problems are : Problem set: 0 solved, 5970 unsolved in 30139 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1365 constraints, PredecessorRefiner: 4416/1554 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 69835ms problems are : Problem set: 0 solved, 5970 unsolved
Search for dead transitions found 0 dead transitions in 69861ms
Starting structural reductions in LTL mode, iteration 1 : 1365/1379 places, 5971/5986 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76903 ms. Remains : 1365/1379 places, 5971/5986 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((!p0 U (!p1||G(!p0))))&&!p0)))'
Stuttering acceptance computed with spot in 133 ms :[p0, (AND p0 p1)]
Running random walk in product with property : MedleyB-PT-B07-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 587 ms.
Product exploration explored 100000 steps with 50000 reset in 664 ms.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 9 factoid took 26 ms. Proved property starting from automaton with 2 states, 4 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 88 ms.
FORMULA MedleyB-PT-B07-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyB-PT-B07-LTLFireability-07 finished in 78458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((X(F(p0))&&F(X(p1))) U p2)&&(X(G(p3)) U p0)))'
Support contains 21 out of 1379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1379/1379 places, 5986/5986 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1376 transition count 5983
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1376 transition count 5983
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 1373 transition count 5980
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 1373 transition count 5980
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 1371 transition count 5978
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 1371 transition count 5978
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1370 transition count 5977
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1370 transition count 5977
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1369 transition count 5976
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1369 transition count 5976
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1368 transition count 5975
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1368 transition count 5975
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1367 transition count 5974
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1367 transition count 5974
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1366 transition count 5973
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1366 transition count 5973
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1365 transition count 5972
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1365 transition count 5972
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1365 transition count 5971
Applied a total of 29 rules in 821 ms. Remains 1365 /1379 variables (removed 14) and now considering 5971/5986 (removed 15) transitions.
[2026-05-25 11:29:07] [INFO ] Invariant cache hit.
[2026-05-25 11:29:08] [INFO ] Implicit Places using invariants in 1340 ms returned []
[2026-05-25 11:29:08] [INFO ] Invariant cache hit.
[2026-05-25 11:29:12] [INFO ] Implicit Places using invariants and state equation in 4208 ms returned []
Implicit Place search using SMT with State Equation took 5597 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 1365/1379 places, 5971/5986 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6419 ms. Remains : 1365/1379 places, 5971/5986 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((X(F(p0))&&F(X(p1))) U p2)&&(X(G(p3)) U p0)))'
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p3) (NOT p0)), (NOT p0), (NOT p1), true, (NOT p3)]
Running random walk in product with property : MedleyB-PT-B07-LTLFireability-08
Stuttering criterion allowed to conclude after 159 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B07-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B07-LTLFireability-08 finished in 6778 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)||(p1&&G(p2)))) U p3))'
Support contains 20 out of 1379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1379/1379 places, 5986/5986 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1376 transition count 5983
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1376 transition count 5983
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 1373 transition count 5980
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 1373 transition count 5980
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 1371 transition count 5978
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 1371 transition count 5978
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1370 transition count 5977
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1370 transition count 5977
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1369 transition count 5976
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1369 transition count 5976
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1368 transition count 5975
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1368 transition count 5975
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1367 transition count 5974
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1367 transition count 5974
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1366 transition count 5973
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1366 transition count 5973
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1365 transition count 5972
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1365 transition count 5972
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 1365 transition count 5971
Applied a total of 29 rules in 808 ms. Remains 1365 /1379 variables (removed 14) and now considering 5971/5986 (removed 15) transitions.
[2026-05-25 11:29:14] [INFO ] Invariant cache hit.
[2026-05-25 11:29:15] [INFO ] Implicit Places using invariants in 1521 ms returned []
[2026-05-25 11:29:15] [INFO ] Invariant cache hit.
[2026-05-25 11:29:19] [INFO ] Implicit Places using invariants and state equation in 4255 ms returned []
Implicit Place search using SMT with State Equation took 5791 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 1365/1379 places, 5971/5986 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6599 ms. Remains : 1365/1379 places, 5971/5986 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)||(G(p1)&&p2))) U p3))'
Stuttering acceptance computed with spot in 260 ms :[(NOT p3), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : MedleyB-PT-B07-LTLFireability-10
Product exploration explored 100000 steps with 28603 reset in 605 ms.
Product exploration explored 100000 steps with 28531 reset in 537 ms.
Computed a total of 287 stabilizing places and 301 stable transitions
Computed a total of 287 stabilizing places and 301 stable transitions
Knowledge based reduction with 21 factoid took 136 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 6 states, 13 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (304 resets) in 405 ms. (98 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (46 resets) in 137 ms. (289 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (44 resets) in 192 ms. (207 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (45 resets) in 73 ms. (540 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (45 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (45 resets) in 497 ms. (80 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (46 resets) in 78 ms. (506 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (47 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
[2026-05-25 11:29:22] [INFO ] Invariant cache hit.
Problem apf5 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 1331/1351 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1351 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 14/1365 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1365 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 5971/7336 variables, 1365/1373 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7336/7336 variables, and 1373 constraints, problems are : Problem set: 2 solved, 5 unsolved in 5052 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1365/1365 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1332/1351 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1351 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 14/1365 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1365 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 5971/7336 variables, 1365/1373 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7336 variables, 0/1373 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 7336/7336 variables, and 1373 constraints, problems are : Problem set: 2 solved, 5 unsolved in 5046 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 1365/1365 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10133ms problems are : Problem set: 2 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 1365 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1365/1365 places, 5971/5971 transitions.
Graph (trivial) has 1345 edges and 1365 vertex of which 112 / 1365 are part of one of the 21 SCC in 0 ms
Free SCC test removed 91 places
Drop transitions (Empty/Sink Transition effects.) removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Graph (complete) has 2515 edges and 1274 vertex of which 1267 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.7 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 942 transitions
Trivial Post-agglo rules discarded 942 transitions
Performed 942 trivial Post agglomeration. Transition count delta: 942
Iterating post reduction 0 with 949 rules applied. Total rules applied 951 place count 1267 transition count 4896
Reduce places removed 942 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 963 rules applied. Total rules applied 1914 place count 325 transition count 4875
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1921 place count 318 transition count 4875
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 1921 place count 318 transition count 4797
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 2077 place count 240 transition count 4797
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2078 place count 240 transition count 4796
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 2178 place count 190 transition count 4746
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 2192 place count 190 transition count 4732
Discarding 31 places :
Symmetric choice reduction at 5 with 31 rule applications. Total rules 2223 place count 159 transition count 3475
Iterating global reduction 5 with 31 rules applied. Total rules applied 2254 place count 159 transition count 3475
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 2264 place count 159 transition count 3465
Discarding 21 places :
Symmetric choice reduction at 6 with 21 rule applications. Total rules 2285 place count 138 transition count 3444
Iterating global reduction 6 with 21 rules applied. Total rules applied 2306 place count 138 transition count 3444
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2320 place count 124 transition count 3430
Iterating global reduction 6 with 14 rules applied. Total rules applied 2334 place count 124 transition count 3430
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2341 place count 124 transition count 3423
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 2355 place count 117 transition count 3416
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 2361 place count 114 transition count 3424
Free-agglomeration rule applied 48 times.
Iterating global reduction 7 with 48 rules applied. Total rules applied 2409 place count 114 transition count 3376
Reduce places removed 48 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 53 rules applied. Total rules applied 2462 place count 66 transition count 3371
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 2469 place count 59 transition count 3364
Iterating global reduction 8 with 7 rules applied. Total rules applied 2476 place count 59 transition count 3364
Drop transitions (Redundant composition of simpler transitions.) removed 331 transitions
Redundant transition composition rules discarded 331 transitions
Iterating global reduction 8 with 331 rules applied. Total rules applied 2807 place count 59 transition count 3033
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2809 place count 58 transition count 3032
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 2813 place count 56 transition count 3050
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 2816 place count 56 transition count 3047
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 2819 place count 53 transition count 3047
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 2824 place count 53 transition count 3047
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 2828 place count 53 transition count 3043
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2831 place count 50 transition count 3037
Iterating global reduction 9 with 3 rules applied. Total rules applied 2834 place count 50 transition count 3037
Applied a total of 2834 rules in 7430 ms. Remains 50 /1365 variables (removed 1315) and now considering 3037/5971 (removed 2934) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7430 ms. Remains : 50/1365 places, 3037/5971 transitions.
RANDOM walk for 35798 steps (1670 resets) in 824 ms. (43 steps per ms) remains 0/5 properties
Found 2 invariant AP formulas.
Negative knowledge disproves property using: (G p0)
Knowledge based reduction with 23 factoid took 110 ms. Proved property starting from automaton with 6 states, 13 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 18636 ms.
FORMULA MedleyB-PT-B07-LTLFireability-10 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property MedleyB-PT-B07-LTLFireability-10 finished in 26713 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 U G(p1))&&X(((G(p3)&&p2) U p4)))))'
Support contains 19 out of 1379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1379/1379 places, 5986/5986 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1377 transition count 5984
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1377 transition count 5984
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 1375 transition count 5982
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1375 transition count 5982
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1374 transition count 5981
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1374 transition count 5981
Applied a total of 10 rules in 351 ms. Remains 1374 /1379 variables (removed 5) and now considering 5981/5986 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14170597182714711245.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2133635145827859343.kers'
[2026-05-25 11:29:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14170597182714711245.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2133635145827859343.kers]
Culled 0 columns in 7 ms.
// Phase 1: matrix 5981 rows 1374 cols 66189 entries
Finished phase 1 with 1366 SingleSign rule and 0 generalized
[2026-05-25 11:29:40] [INFO ] Computed 8 invariants in 53 ms
Computed 8 P flows in 53 ms.
Exported basis to /tmp/petrispot-output-2133635145827859343.kers
Total runtime 62 ms.
[2026-05-25 11:29:41] [INFO ] Implicit Places using invariants in 1619 ms returned []
[2026-05-25 11:29:41] [INFO ] Invariant cache hit.
[2026-05-25 11:29:46] [INFO ] Implicit Places using invariants and state equation in 4475 ms returned []
Implicit Place search using SMT with State Equation took 6101 ms to find 0 implicit places.
Running 5980 sub problems to find dead transitions.
[2026-05-25 11:29:46] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1373/7355 variables, and 0 constraints, problems are : Problem set: 0 solved, 5980 unsolved in 30122 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1374 constraints, PredecessorRefiner: 5980/1564 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5980 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1373/7355 variables, and 0 constraints, problems are : Problem set: 0 solved, 5980 unsolved in 30108 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1374 constraints, PredecessorRefiner: 4416/1564 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 69175ms problems are : Problem set: 0 solved, 5980 unsolved
Search for dead transitions found 0 dead transitions in 69202ms
Starting structural reductions in LTL mode, iteration 1 : 1374/1379 places, 5981/5986 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75681 ms. Remains : 1374/1379 places, 5981/5986 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U G(p1))&&X(((G(p3)&&p2) U p4)))))'
Stuttering acceptance computed with spot in 996 ms :[(OR (NOT p1) (NOT p4)), (NOT p1), (NOT p4), (NOT p1), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p3) (NOT p4))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND p0 (NOT p1) (NOT p3) (NOT p4))]
Running random walk in product with property : MedleyB-PT-B07-LTLFireability-14
Stuttering criterion allowed to conclude after 175 steps with 0 reset in 4 ms.
FORMULA MedleyB-PT-B07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B07-LTLFireability-14 finished in 76791 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U (F(p1)&&(p2||F(p3)))))'
Support contains 13 out of 1379 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1379/1379 places, 5986/5986 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1377 transition count 5984
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1377 transition count 5984
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 1375 transition count 5982
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1375 transition count 5982
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1374 transition count 5981
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1374 transition count 5981
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1373 transition count 5980
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1373 transition count 5980
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1372 transition count 5979
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1372 transition count 5979
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1371 transition count 5978
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1371 transition count 5978
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1370 transition count 5977
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1370 transition count 5977
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1369 transition count 5976
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1369 transition count 5976
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1368 transition count 5975
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1368 transition count 5975
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 1368 transition count 5974
Applied a total of 23 rules in 943 ms. Remains 1368 /1379 variables (removed 11) and now considering 5974/5986 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4499886451590556442.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-719410563789376850.kers'
[2026-05-25 11:30:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4499886451590556442.kers, --Pflows, --basisKERS=/tmp/petrispot-output-719410563789376850.kers]
Culled 0 columns in 21 ms.
// Phase 1: matrix 5974 rows 1368 cols 66175 entries
Finished phase 1 with 1360 SingleSign rule and 0 generalized
[2026-05-25 11:30:57] [INFO ] Computed 8 invariants in 102 ms
Computed 8 P flows in 102 ms.
Exported basis to /tmp/petrispot-output-719410563789376850.kers
Total runtime 110 ms.
[2026-05-25 11:30:59] [INFO ] Implicit Places using invariants in 1618 ms returned []
[2026-05-25 11:30:59] [INFO ] Invariant cache hit.
[2026-05-25 11:31:04] [INFO ] Implicit Places using invariants and state equation in 4996 ms returned []
Implicit Place search using SMT with State Equation took 6646 ms to find 0 implicit places.
Running 5973 sub problems to find dead transitions.
[2026-05-25 11:31:04] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1367/7342 variables, and 0 constraints, problems are : Problem set: 0 solved, 5973 unsolved in 30125 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1368 constraints, PredecessorRefiner: 5973/1557 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5973 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1367/7342 variables, and 0 constraints, problems are : Problem set: 0 solved, 5973 unsolved in 30111 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/1368 constraints, PredecessorRefiner: 4416/1557 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 69439ms problems are : Problem set: 0 solved, 5973 unsolved
Search for dead transitions found 0 dead transitions in 69461ms
Starting structural reductions in LTL mode, iteration 1 : 1368/1379 places, 5974/5986 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77074 ms. Remains : 1368/1379 places, 5974/5986 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U (F(p1)&&(p2||F(p3)))))'
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (NOT p3), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : MedleyB-PT-B07-LTLFireability-15
Stuttering criterion allowed to conclude after 106 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B07-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B07-LTLFireability-15 finished in 77396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Spot run failed in 79 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(G(p0)))'
Spot run failed in 42 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-25 11:32:14] [INFO ] Flatten gal took : 252 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7887617213551292524
[2026-05-25 11:32:14] [INFO ] Too many transitions (5986) to apply POR reductions. Disabling POR matrices.
[2026-05-25 11:32:14] [INFO ] Built C files in 125ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7887617213551292524
Running compilation step : cd /tmp/ltsmin7887617213551292524;'/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-25 11:32:14] [INFO ] Applying decomposition
[2026-05-25 11:32:15] [INFO ] Flatten gal took : 222 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/graph17880557142491905708.txt' '-o' '/tmp/graph17880557142491905708.bin' '-w' '/tmp/graph17880557142491905708.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17880557142491905708.bin' '-l' '-1' '-v' '-w' '/tmp/graph17880557142491905708.weights' '-q' '0' '-e' '0.001'
[2026-05-25 11:32:16] [INFO ] Decomposing Gal with order
[2026-05-25 11:32:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 11:32:16] [INFO ] Removed a total of 31734 redundant transitions.
[2026-05-25 11:32:16] [INFO ] Flatten gal took : 455 ms
[2026-05-25 11:32:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 136 ms.
[2026-05-25 11:32:17] [INFO ] Time to serialize gal into /tmp/LTLFireability10398849478538197278.gal : 35 ms
[2026-05-25 11:32:17] [INFO ] Time to serialize properties into /tmp/LTLFireability18342538173651870474.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/LTLFireability10398849478538197278.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18342538173651870474.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((G((F("((((i4.u4.p119==0)||(i4.u84.p420==0))||((i4.u183.p721==0)||(i4.u249.p1022==0)))||(((i4.u333.p1346==0)||(i4.u415.p1647==0))||(...337
Formula 0 simplified : F(G!"((((i4.u4.p119==0)||(i4.u84.p420==0))||((i4.u183.p721==0)||(i4.u249.p1022==0)))||(((i4.u333.p1346==0)||(i4.u415.p1647==0))||(i4...327
Compilation finished in 30782 ms.
Running link step : cd /tmp/ltsmin7887617213551292524;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 86 ms.
Running LTSmin : cd /tmp/ltsmin7887617213551292524;'/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/ltsmin7887617213551292524;'/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/ltsmin7887617213551292524;'/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' '<>([]((LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-25 11:57:17] [INFO ] Applying decomposition
[2026-05-25 11:57:20] [INFO ] Flatten gal took : 3220 ms
[2026-05-25 11:57:21] [INFO ] Decomposing Gal with order
[2026-05-25 11:57:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 11:57:30] [INFO ] Removed a total of 31567 redundant transitions.
[2026-05-25 11:57:31] [INFO ] Flatten gal took : 6793 ms
[2026-05-25 11:57:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 626 labels/synchronizations in 496 ms.
[2026-05-25 11:57:31] [INFO ] Time to serialize gal into /tmp/LTLFireability18026271209966772355.gal : 25 ms
[2026-05-25 11:57:31] [INFO ] Time to serialize properties into /tmp/LTLFireability16401549730718030253.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18026271209966772355.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16401549730718030253.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 2 LTL properties
Checking formula 0 : !((G((F("((((i0.i0.i0.i0.i0.i0.u7.p119==0)||(i0.i0.i0.i0.i0.i0.u8.p420==0))||((i0.i0.i0.i0.i0.u9.p721==0)||(i0.i0.i0.i0.u10.p1022==0))...441
Formula 0 simplified : F(G!"((((i0.i0.i0.i0.i0.i0.u7.p119==0)||(i0.i0.i0.i0.i0.i0.u8.p420==0))||((i0.i0.i0.i0.i0.u9.p721==0)||(i0.i0.i0.i0.u10.p1022==0)))|...431
Reverse transition relation is NOT exact ! Due to transitions t1365, i0.u13.t56, i0.u13.t101, i0.u13.t111, i0.u13.t126, i0.u13.t135, i0.u13.t188, i0.u13.t1...1529
Computing Next relation with stutter on 1.62816e+08 deadlock states
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin7887617213551292524;'/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' '<>([]((LTLAPp2==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin7887617213551292524;'/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'

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="MedleyB-PT-B07"
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 MedleyB-PT-B07, 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 r178-oct2-177969020100332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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