Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r066-tall-177946967600228.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is CloudReconfiguration-PT-316, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967600228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.2K Mar 6 08:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 6 08:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 6 08:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 6 08:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 08:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 08:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 08:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 6 08:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Mar 6 08:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 6 08:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Mar 6 08:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 08:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 660K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779512348203

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-316
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 04:59:09] [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-23 04:59:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 04:59:09] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2026-05-23 04:59:09] [INFO ] Transformed 2585 places.
[2026-05-23 04:59:09] [INFO ] Transformed 3095 transitions.
[2026-05-23 04:59:09] [INFO ] Found NUPN structural information;
[2026-05-23 04:59:09] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 255 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CloudReconfiguration-PT-316-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-316-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-316-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-316-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-316-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Discarding 517 places :
Symmetric choice reduction at 0 with 517 rule applications. Total rules 517 place count 2068 transition count 2578
Iterating global reduction 0 with 517 rules applied. Total rules applied 1034 place count 2068 transition count 2578
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 1063 place count 2068 transition count 2549
Discarding 238 places :
Symmetric choice reduction at 1 with 238 rule applications. Total rules 1301 place count 1830 transition count 2311
Iterating global reduction 1 with 238 rules applied. Total rules applied 1539 place count 1830 transition count 2311
Discarding 86 places :
Symmetric choice reduction at 1 with 86 rule applications. Total rules 1625 place count 1744 transition count 2225
Iterating global reduction 1 with 86 rules applied. Total rules applied 1711 place count 1744 transition count 2225
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 1728 place count 1744 transition count 2208
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 1774 place count 1698 transition count 2162
Iterating global reduction 2 with 46 rules applied. Total rules applied 1820 place count 1698 transition count 2162
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1828 place count 1698 transition count 2154
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1864 place count 1662 transition count 2114
Iterating global reduction 3 with 36 rules applied. Total rules applied 1900 place count 1662 transition count 2114
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1925 place count 1637 transition count 2089
Iterating global reduction 3 with 25 rules applied. Total rules applied 1950 place count 1637 transition count 2089
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1974 place count 1613 transition count 2065
Iterating global reduction 3 with 24 rules applied. Total rules applied 1998 place count 1613 transition count 2065
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 2022 place count 1589 transition count 2041
Iterating global reduction 3 with 24 rules applied. Total rules applied 2046 place count 1589 transition count 2041
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 2067 place count 1568 transition count 2007
Iterating global reduction 3 with 21 rules applied. Total rules applied 2088 place count 1568 transition count 2007
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2095 place count 1561 transition count 1996
Iterating global reduction 3 with 7 rules applied. Total rules applied 2102 place count 1561 transition count 1996
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2109 place count 1554 transition count 1987
Iterating global reduction 3 with 7 rules applied. Total rules applied 2116 place count 1554 transition count 1987
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2118 place count 1554 transition count 1985
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2120 place count 1552 transition count 1983
Iterating global reduction 4 with 2 rules applied. Total rules applied 2122 place count 1552 transition count 1983
Applied a total of 2122 rules in 1628 ms. Remains 1552 /2585 variables (removed 1033) and now considering 1983/3095 (removed 1112) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9531931160092201692.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15665804937038277790.kers'
[2026-05-23 04:59:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9531931160092201692.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15665804937038277790.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1983 rows 1552 cols 4139 entries
Finished phase 1 with 1547 SingleSign rule and 1 generalized
[2026-05-23 04:59:11] [INFO ] Computed 4 invariants in 12 ms
Computed 4 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-15665804937038277790.kers
Total runtime 14 ms.
[2026-05-23 04:59:12] [INFO ] Implicit Places using invariants in 473 ms returned []
[2026-05-23 04:59:12] [INFO ] Invariant cache hit.
[2026-05-23 04:59:13] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned []
Implicit Place search using SMT with State Equation took 1564 ms to find 0 implicit places.
Running 1982 sub problems to find dead transitions.
[2026-05-23 04:59:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1551 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1982 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1551/3535 variables, and 4 constraints, problems are : Problem set: 0 solved, 1982 unsolved in 30068 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1552 constraints, PredecessorRefiner: 1982/1982 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1982 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1551 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1982 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1551/3535 variables, and 4 constraints, problems are : Problem set: 0 solved, 1982 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1552 constraints, PredecessorRefiner: 0/1982 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60703ms problems are : Problem set: 0 solved, 1982 unsolved
Search for dead transitions found 0 dead transitions in 60723ms
Starting structural reductions in LTL mode, iteration 1 : 1552/2585 places, 1983/3095 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63957 ms. Remains : 1552/2585 places, 1983/3095 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1552/1552 places, 1983/1983 transitions.
Applied a total of 0 rules in 77 ms. Remains 1552 /1552 variables (removed 0) and now considering 1983/1983 (removed 0) transitions.
[2026-05-23 05:00:13] [INFO ] Invariant cache hit.
[2026-05-23 05:00:14] [INFO ] Implicit Places using invariants in 261 ms returned []
[2026-05-23 05:00:14] [INFO ] Invariant cache hit.
[2026-05-23 05:00:15] [INFO ] Implicit Places using invariants and state equation in 1027 ms returned []
Implicit Place search using SMT with State Equation took 1293 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1372 ms. Remains : 1552/1552 places, 1983/1983 transitions.
Support contains 33 out of 1552 places after structural reductions.
[2026-05-23 05:00:15] [INFO ] Flatten gal took : 131 ms
[2026-05-23 05:00:15] [INFO ] Flatten gal took : 65 ms
[2026-05-23 05:00:15] [INFO ] Input system was already deterministic with 1983 transitions.
RANDOM walk for 40000 steps (302 resets) in 1835 ms. (21 steps per ms) remains 19/29 properties
BEST_FIRST walk for 4001 steps (9 resets) in 65 ms. (60 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (10 resets) in 65 ms. (60 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (10 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (10 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (11 resets) in 39 ms. (100 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (10 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (9 resets) in 33 ms. (117 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (12 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (11 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (10 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 40 ms. (97 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (10 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (9 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (11 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (11 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
[2026-05-23 05:00:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1516/1541 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1541 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 1973/3514 variables, 1541/1545 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3514 variables, 0/1545 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 2/3516 variables, 1/1546 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3516 variables, 0/1546 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 2/3518 variables, 1/1547 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3518 variables, 0/1547 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 2/3520 variables, 1/1548 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3520 variables, 0/1548 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 2/3522 variables, 1/1549 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3522/3535 variables, and 1549 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5018 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1545/1552 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1516/1541 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1541 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 1973/3514 variables, 1541/1545 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3514 variables, 19/1564 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3514 variables, 0/1564 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 2/3516 variables, 1/1565 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3516/3535 variables, and 1565 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5009 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1542/1552 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10049ms problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 1552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1552/1552 places, 1983/1983 transitions.
Graph (trivial) has 1835 edges and 1552 vertex of which 646 / 1552 are part of one of the 58 SCC in 53 ms
Free SCC test removed 588 places
Drop transitions (Empty/Sink Transition effects.) removed 743 transitions
Reduce isomorphic transitions removed 743 transitions.
Graph (complete) has 1415 edges and 964 vertex of which 955 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 506 rules applied. Total rules applied 508 place count 955 transition count 730
Reduce places removed 500 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 1 with 551 rules applied. Total rules applied 1059 place count 455 transition count 679
Reduce places removed 33 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 2 with 49 rules applied. Total rules applied 1108 place count 422 transition count 663
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 18 rules applied. Total rules applied 1126 place count 406 transition count 661
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 1129 place count 405 transition count 659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1130 place count 404 transition count 659
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 53 Pre rules applied. Total rules applied 1130 place count 404 transition count 606
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 6 with 106 rules applied. Total rules applied 1236 place count 351 transition count 606
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1245 place count 342 transition count 594
Iterating global reduction 6 with 9 rules applied. Total rules applied 1254 place count 342 transition count 594
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 1256 place count 342 transition count 592
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1258 place count 340 transition count 592
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1263 place count 335 transition count 587
Iterating global reduction 8 with 5 rules applied. Total rules applied 1268 place count 335 transition count 587
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 1273 place count 335 transition count 582
Performed 158 Post agglomeration using F-continuation condition with reduction of 92 identical transitions.
Deduced a syphon composed of 158 places in 0 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 9 with 316 rules applied. Total rules applied 1589 place count 177 transition count 332
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 1611 place count 177 transition count 310
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 1615 place count 173 transition count 306
Iterating global reduction 10 with 4 rules applied. Total rules applied 1619 place count 173 transition count 306
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1620 place count 172 transition count 305
Iterating global reduction 10 with 1 rules applied. Total rules applied 1621 place count 172 transition count 305
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1622 place count 172 transition count 304
Performed 13 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 26 rules applied. Total rules applied 1648 place count 159 transition count 289
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 11 with 13 rules applied. Total rules applied 1661 place count 159 transition count 276
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 12 with 2 rules applied. Total rules applied 1663 place count 158 transition count 275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1665 place count 158 transition count 273
Performed 34 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 13 with 68 rules applied. Total rules applied 1733 place count 124 transition count 295
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 13 with 27 rules applied. Total rules applied 1760 place count 124 transition count 268
Discarding 19 places :
Symmetric choice reduction at 14 with 19 rule applications. Total rules 1779 place count 105 transition count 230
Iterating global reduction 14 with 19 rules applied. Total rules applied 1798 place count 105 transition count 230
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 14 with 7 rules applied. Total rules applied 1805 place count 105 transition count 223
Discarding 4 places :
Symmetric choice reduction at 15 with 4 rule applications. Total rules 1809 place count 101 transition count 215
Iterating global reduction 15 with 4 rules applied. Total rules applied 1813 place count 101 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 1814 place count 101 transition count 214
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 1816 place count 100 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 1817 place count 100 transition count 232
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 17 with 8 rules applied. Total rules applied 1825 place count 100 transition count 224
Free-agglomeration rule applied 4 times.
Iterating global reduction 17 with 4 rules applied. Total rules applied 1829 place count 100 transition count 220
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 1833 place count 96 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 18 with 3 rules applied. Total rules applied 1836 place count 96 transition count 217
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 18 with 4 rules applied. Total rules applied 1840 place count 96 transition count 217
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 1841 place count 95 transition count 216
Applied a total of 1841 rules in 202 ms. Remains 95 /1552 variables (removed 1457) and now considering 216/1983 (removed 1767) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 95/1552 places, 216/1983 transitions.
RANDOM walk for 40000 steps (4056 resets) in 688 ms. (58 steps per ms) remains 2/19 properties
BEST_FIRST walk for 40003 steps (854 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (896 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
[2026-05-23 05:00:26] [INFO ] Flow matrix only has 207 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16395428110029099052.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9235787256592420427.kers'
[2026-05-23 05:00:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16395428110029099052.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9235787256592420427.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 207 rows 95 cols 641 entries
Finished phase 1 with 92 SingleSign rule and 0 generalized
[2026-05-23 05:00:26] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9235787256592420427.kers
Total runtime 1 ms.
[2026-05-23 05:00:26] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 20/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 61/83 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 101/184 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 99/283 variables, 50/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 13/296 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/296 variables, 10/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/296 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
After SMT solving in domain Real declared 302/302 variables, and 104 constraints, problems are : Problem set: 2 solved, 0 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 95/95 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 232ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2162 edges and 1552 vertex of which 1543 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.24 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 3 out of 1552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1552/1552 places, 1983/1983 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1541 transition count 1972
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1541 transition count 1972
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 1534 transition count 1965
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 1534 transition count 1965
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 1528 transition count 1959
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 1528 transition count 1959
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 1528 transition count 1958
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 1523 transition count 1952
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 1523 transition count 1952
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 1523 transition count 1951
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 1519 transition count 1947
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 1519 transition count 1947
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 71 place count 1516 transition count 1943
Iterating global reduction 2 with 3 rules applied. Total rules applied 74 place count 1516 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 1513 transition count 1938
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 1513 transition count 1938
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 83 place count 1510 transition count 1934
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 1510 transition count 1934
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 88 place count 1508 transition count 1931
Iterating global reduction 2 with 2 rules applied. Total rules applied 90 place count 1508 transition count 1931
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 1508 transition count 1930
Applied a total of 91 rules in 640 ms. Remains 1508 /1552 variables (removed 44) and now considering 1930/1983 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10280307305064440638.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11899371355773845323.kers'
[2026-05-23 05:00:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10280307305064440638.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11899371355773845323.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1930 rows 1508 cols 4031 entries
Finished phase 1 with 1503 SingleSign rule and 1 generalized
[2026-05-23 05:00:28] [INFO ] Computed 4 invariants in 13 ms
Computed 4 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-11899371355773845323.kers
Total runtime 15 ms.
[2026-05-23 05:00:28] [INFO ] Implicit Places using invariants in 275 ms returned []
[2026-05-23 05:00:28] [INFO ] Invariant cache hit.
[2026-05-23 05:00:29] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1218 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2026-05-23 05:00:29] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 1929/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1507 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1507/3438 variables, and 4 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1508 constraints, PredecessorRefiner: 0/1929 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60486ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 60492ms
Starting structural reductions in LTL mode, iteration 1 : 1508/1552 places, 1930/1983 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62358 ms. Remains : 1508/1552 places, 1930/1983 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Stuttering acceptance computed with spot in 331 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-00
Product exploration explored 100000 steps with 25000 reset in 349 ms.
Product exploration explored 100000 steps with 25000 reset in 325 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1508 vertex of which 1499 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.9 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge based reduction with 1 factoid took 54 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (301 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (92 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 431498 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :0 out of 1
Probabilistic random walk after 431498 steps, saw 105035 distinct states, run finished after 3006 ms. (steps per millisecond=143 ) properties seen :0
[2026-05-23 05:01:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 677/680 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 817/1497 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1497 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1920/3417 variables, 1497/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3437 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3437 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/3438 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3438 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3438 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3438/3438 variables, and 1512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1331 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1508/1508 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 677/680 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 817/1497 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1497 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1920/3417 variables, 1497/1501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3417 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3417 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/3419 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3419 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/3421 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3421 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/3423 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3423 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/3425 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3425 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3427 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3427 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/3429 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3429 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3431 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3431 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/3433 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3433 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/3435 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3435 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/3437 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3437 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/3438 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3438 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/3438 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3438/3438 variables, and 1513 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2319 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1508/1508 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3661ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 108 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=54 )
Parikh walk visited 1 properties in 9 ms.
Knowledge based reduction with 1 factoid took 65 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 7099 ms.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 1508 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1508/1508 places, 1930/1930 transitions.
Applied a total of 0 rules in 61 ms. Remains 1508 /1508 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
[2026-05-23 05:01:38] [INFO ] Invariant cache hit.
[2026-05-23 05:01:38] [INFO ] Implicit Places using invariants in 226 ms returned []
[2026-05-23 05:01:38] [INFO ] Invariant cache hit.
[2026-05-23 05:01:39] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1134 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1196 ms. Remains : 1508/1508 places, 1930/1930 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2107 edges and 1508 vertex of which 1499 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.12 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge based reduction with 1 factoid took 45 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 32252 steps (257 resets) in 232 ms. (138 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 56 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 355 ms.
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 255 ms.
Product exploration explored 100000 steps with 25000 reset in 258 ms.
Spot run failed in 75 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin8044790167596644961
[2026-05-23 05:01:40] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8044790167596644961
Running compilation step : cd /tmp/ltsmin8044790167596644961;'/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/ltsmin8044790167596644961;'/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/ltsmin8044790167596644961;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 1508 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1508/1508 places, 1930/1930 transitions.
Applied a total of 0 rules in 58 ms. Remains 1508 /1508 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
[2026-05-23 05:01:44] [INFO ] Invariant cache hit.
[2026-05-23 05:01:44] [INFO ] Implicit Places using invariants in 205 ms returned []
[2026-05-23 05:01:44] [INFO ] Invariant cache hit.
[2026-05-23 05:01:45] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1041 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1100 ms. Remains : 1508/1508 places, 1930/1930 transitions.
Built C files in :
/tmp/ltsmin3759171738674264825
[2026-05-23 05:01:45] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3759171738674264825
Running compilation step : cd /tmp/ltsmin3759171738674264825;'/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/ltsmin3759171738674264825;'/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/ltsmin3759171738674264825;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 05:01:48] [INFO ] Flatten gal took : 51 ms
[2026-05-23 05:01:48] [INFO ] Flatten gal took : 45 ms
[2026-05-23 05:01:48] [INFO ] Time to serialize gal into /tmp/LTL14448326423447885856.gal : 16 ms
[2026-05-23 05:01:48] [INFO ] Time to serialize properties into /tmp/LTL15289017527442609529.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14448326423447885856.gal' '-t' 'CGAL' '-hoa' '/tmp/aut224484753024317863.hoa' '-atoms' '/tmp/LTL15289017527442609529.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/LTL15289017527442609529.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut224484753024317863.hoa
Detected timeout of ITS tools.
[2026-05-23 05:02:03] [INFO ] Flatten gal took : 37 ms
[2026-05-23 05:02:03] [INFO ] Flatten gal took : 34 ms
[2026-05-23 05:02:03] [INFO ] Time to serialize gal into /tmp/LTL15131124077981849649.gal : 8 ms
[2026-05-23 05:02:03] [INFO ] Time to serialize properties into /tmp/LTL11709611804500994586.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15131124077981849649.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11709611804500994586.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(((p2294==1)||(p2098==0))||((p2025==1)&&(p2098==1)))"))))))
Formula 0 simplified : XXXG!"(((p2294==1)||(p2098==0))||((p2025==1)&&(p2098==1)))"
Detected timeout of ITS tools.
[2026-05-23 05:02:18] [INFO ] Flatten gal took : 27 ms
[2026-05-23 05:02:18] [INFO ] Applying decomposition
[2026-05-23 05:02:18] [INFO ] Flatten gal took : 29 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2332526304377370411.txt' '-o' '/tmp/graph2332526304377370411.bin' '-w' '/tmp/graph2332526304377370411.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2332526304377370411.bin' '-l' '-1' '-v' '-w' '/tmp/graph2332526304377370411.weights' '-q' '0' '-e' '0.001'
[2026-05-23 05:02:18] [INFO ] Decomposing Gal with order
[2026-05-23 05:02:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 05:02:19] [INFO ] Removed a total of 514 redundant transitions.
[2026-05-23 05:02:19] [INFO ] Flatten gal took : 135 ms
[2026-05-23 05:02:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 26 ms.
[2026-05-23 05:02:19] [INFO ] Time to serialize gal into /tmp/LTL9939207436694954162.gal : 20 ms
[2026-05-23 05:02:19] [INFO ] Time to serialize properties into /tmp/LTL16895552048999399484.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/LTL9939207436694954162.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16895552048999399484.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 : !((X(X(X(F("(((i35.i1.i2.u558.p2294==1)||(i30.u483.p2098==0))||((i29.i1.i2.u475.p2025==1)&&(i30.u483.p2098==1)))"))))))
Formula 0 simplified : XXXG!"(((i35.i1.i2.u558.p2294==1)||(i30.u483.p2098==0))||((i29.i1.i2.u475.p2025==1)&&(i30.u483.p2098==1)))"
Reverse transition relation is NOT exact ! Due to transitions t26, t216, t268, t328, t377, t450, t655, t736, t768, t969, t1144, t1225, t1256, t1334, t1405,...2047
Computing Next relation with stutter on 89440 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
523 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.39133,196776,1,0,311580,5797,18938,573036,509,50072,1812671
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CloudReconfiguration-PT-316-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudReconfiguration-PT-316-LTLFireability-00 finished in 117799 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)))'
Support contains 2 out of 1552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1552/1552 places, 1983/1983 transitions.
Graph (trivial) has 1892 edges and 1552 vertex of which 696 / 1552 are part of one of the 63 SCC in 7 ms
Free SCC test removed 633 places
Ensure Unique test removed 736 transitions
Reduce isomorphic transitions removed 736 transitions.
Graph (complete) has 1421 edges and 919 vertex of which 910 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 500 transitions
Trivial Post-agglo rules discarded 500 transitions
Performed 500 trivial Post agglomeration. Transition count delta: 500
Iterating post reduction 0 with 500 rules applied. Total rules applied 502 place count 909 transition count 741
Reduce places removed 500 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 526 rules applied. Total rules applied 1028 place count 409 transition count 715
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1041 place count 396 transition count 715
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 1041 place count 396 transition count 669
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1133 place count 350 transition count 669
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 1150 place count 333 transition count 641
Iterating global reduction 3 with 17 rules applied. Total rules applied 1167 place count 333 transition count 641
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 1170 place count 333 transition count 638
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1173 place count 330 transition count 638
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1182 place count 321 transition count 625
Iterating global reduction 5 with 9 rules applied. Total rules applied 1191 place count 321 transition count 625
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1196 place count 321 transition count 620
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1198 place count 319 transition count 616
Iterating global reduction 6 with 2 rules applied. Total rules applied 1200 place count 319 transition count 616
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1202 place count 317 transition count 612
Iterating global reduction 6 with 2 rules applied. Total rules applied 1204 place count 317 transition count 612
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1206 place count 315 transition count 608
Iterating global reduction 6 with 2 rules applied. Total rules applied 1208 place count 315 transition count 608
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1210 place count 313 transition count 604
Iterating global reduction 6 with 2 rules applied. Total rules applied 1212 place count 313 transition count 604
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1214 place count 311 transition count 600
Iterating global reduction 6 with 2 rules applied. Total rules applied 1216 place count 311 transition count 600
Performed 146 Post agglomeration using F-continuation condition with reduction of 82 identical transitions.
Deduced a syphon composed of 146 places in 0 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 6 with 292 rules applied. Total rules applied 1508 place count 165 transition count 372
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 1522 place count 165 transition count 358
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1528 place count 159 transition count 347
Iterating global reduction 7 with 6 rules applied. Total rules applied 1534 place count 159 transition count 347
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1535 place count 158 transition count 346
Iterating global reduction 7 with 1 rules applied. Total rules applied 1536 place count 158 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1537 place count 158 transition count 345
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 1563 place count 145 transition count 329
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 1576 place count 145 transition count 316
Performed 18 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 36 rules applied. Total rules applied 1612 place count 127 transition count 350
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 1631 place count 127 transition count 331
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 1640 place count 118 transition count 313
Iterating global reduction 10 with 9 rules applied. Total rules applied 1649 place count 118 transition count 313
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 1655 place count 118 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 11 with 37 rules applied. Total rules applied 1692 place count 118 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1693 place count 117 transition count 269
Applied a total of 1693 rules in 149 ms. Remains 117 /1552 variables (removed 1435) and now considering 269/1983 (removed 1714) transitions.
[2026-05-23 05:02:25] [INFO ] Flow matrix only has 213 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10693961001923814544.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9776627279237110119.kers'
[2026-05-23 05:02:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10693961001923814544.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9776627279237110119.kers]
Normalized transition count is 212 out of 213 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 212 rows 117 cols 621 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-23 05:02:25] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9776627279237110119.kers
Total runtime 1 ms.
[2026-05-23 05:02:25] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-23 05:02:25] [INFO ] Flow matrix only has 213 transitions (discarded 56 similar events)
[2026-05-23 05:02:25] [INFO ] Invariant cache hit.
[2026-05-23 05:02:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 05:02:25] [INFO ] Implicit Places using invariants and state equation in 155 ms returned [11, 44]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 230 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/1552 places, 269/1983 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 267
Applied a total of 2 rules in 28 ms. Remains 113 /115 variables (removed 2) and now considering 267/269 (removed 2) transitions.
[2026-05-23 05:02:25] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2985093945615256630.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17569646187843348807.kers'
[2026-05-23 05:02:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2985093945615256630.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17569646187843348807.kers]
Normalized transition count is 210 out of 211 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 210 rows 113 cols 624 entries
Finished phase 1 with 113 SingleSign rule and 0 generalized
[2026-05-23 05:02:25] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17569646187843348807.kers
Total runtime 1 ms.
[2026-05-23 05:02:25] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-23 05:02:25] [INFO ] Flow matrix only has 211 transitions (discarded 56 similar events)
[2026-05-23 05:02:25] [INFO ] Invariant cache hit.
[2026-05-23 05:02:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 05:02:26] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 113/1552 places, 267/1983 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 640 ms. Remains : 113/1552 places, 267/1983 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)))'
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-316-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLFireability-01 finished in 781 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' '!(((p0&&X(p1)) U G((p2||X((X(X(p0)) U (p2&&X(X(p0)))))))))'
Support contains 3 out of 1552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1552/1552 places, 1983/1983 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1541 transition count 1972
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1541 transition count 1972
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 1533 transition count 1964
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 1533 transition count 1964
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 1527 transition count 1958
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 1527 transition count 1958
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 1527 transition count 1957
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 56 place count 1522 transition count 1951
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 1522 transition count 1951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 1522 transition count 1950
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 1518 transition count 1946
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 1518 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 1515 transition count 1942
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 1515 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 79 place count 1512 transition count 1937
Iterating global reduction 2 with 3 rules applied. Total rules applied 82 place count 1512 transition count 1937
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 1509 transition count 1933
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 1509 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 1507 transition count 1930
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 1507 transition count 1930
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 93 place count 1507 transition count 1929
Applied a total of 93 rules in 660 ms. Remains 1507 /1552 variables (removed 45) and now considering 1929/1983 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12437552735113837980.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17930081145645488125.kers'
[2026-05-23 05:02:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12437552735113837980.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17930081145645488125.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1929 rows 1507 cols 4029 entries
Finished phase 1 with 1502 SingleSign rule and 1 generalized
[2026-05-23 05:02:26] [INFO ] Computed 4 invariants in 10 ms
Computed 4 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-17930081145645488125.kers
Total runtime 14 ms.
[2026-05-23 05:02:27] [INFO ] Implicit Places using invariants in 253 ms returned []
[2026-05-23 05:02:27] [INFO ] Invariant cache hit.
[2026-05-23 05:02:28] [INFO ] Implicit Places using invariants and state equation in 939 ms returned []
Implicit Place search using SMT with State Equation took 1194 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2026-05-23 05:02:28] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30044 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60457ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60462ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1552 places, 1929/1983 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62325 ms. Remains : 1507/1552 places, 1929/1983 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' '!(((p0&&X(p1)) U G((p2||X((X(X(p0)) U (p2&&X(X(p0)))))))))'
Stuttering acceptance computed with spot in 551 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p2) p0 (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-02
Product exploration explored 100000 steps with 768 reset in 196 ms.
Product exploration explored 100000 steps with 782 reset in 208 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2106 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge based reduction with 23 factoid took 128 ms. Reduced automaton from 13 states, 29 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (319 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (92 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (93 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 393229 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 2
Probabilistic random walk after 393229 steps, saw 95264 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
[2026-05-23 05:03:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 678/680 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 816/1496 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1919/3415 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/3436 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3436/3436 variables, and 1511 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4595 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 678/680 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 816/1496 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1919/3415 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3415 variables, 2/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3415 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/3417 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3417 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/3419 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3419 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/3421 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3421 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/3423 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3423 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3425 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3425 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3427 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3427 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3429 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3429 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3431 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3431 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3433 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3433 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3435 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3435 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/3436 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3436 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/3436 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3436/3436 variables, and 1513 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3724 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8330ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 153 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=153 )
Parikh walk visited 2 properties in 46 ms.
Knowledge based reduction with 23 factoid took 114 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 11959 ms.
Stuttering acceptance computed with spot in 202 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), true]
Support contains 2 out of 1507 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1507/1507 places, 1929/1929 transitions.
Applied a total of 0 rules in 54 ms. Remains 1507 /1507 variables (removed 0) and now considering 1929/1929 (removed 0) transitions.
[2026-05-23 05:03:41] [INFO ] Invariant cache hit.
[2026-05-23 05:03:41] [INFO ] Implicit Places using invariants in 227 ms returned []
[2026-05-23 05:03:41] [INFO ] Invariant cache hit.
[2026-05-23 05:03:42] [INFO ] Implicit Places using invariants and state equation in 972 ms returned []
Implicit Place search using SMT with State Equation took 1201 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1258 ms. Remains : 1507/1507 places, 1929/1929 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2106 edges and 1507 vertex of which 1498 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (303 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (96 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (93 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 405560 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :0 out of 2
Probabilistic random walk after 405560 steps, saw 98113 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
[2026-05-23 05:03:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 678/680 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 816/1496 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1919/3415 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3415 variables, 0/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/3417 variables, 1/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3417 variables, 0/1501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/3419 variables, 1/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3419 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/3421 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3421 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/3423 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3423 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3425 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3425 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/3427 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3427 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/3429 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3429 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 2/3431 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3431 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/3433 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3433 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 2/3435 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3435 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 1/3436 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/3436 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3436/3436 variables, and 1511 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4299 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 678/680 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/680 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 816/1496 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1496 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1919/3415 variables, 1496/1500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3415 variables, 2/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3415 variables, 0/1502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/3417 variables, 1/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3417 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/3419 variables, 1/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3419 variables, 0/1504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/3421 variables, 1/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3421 variables, 0/1505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/3423 variables, 1/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3423 variables, 0/1506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3425 variables, 1/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3425 variables, 0/1507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/3427 variables, 1/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3427 variables, 0/1508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/3429 variables, 1/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3429 variables, 0/1509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/3431 variables, 1/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3431 variables, 0/1510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 2/3433 variables, 1/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3433 variables, 0/1511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 2/3435 variables, 1/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3435 variables, 0/1512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/3436 variables, 1/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/3436 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/3436 variables, 0/1513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3436/3436 variables, and 1513 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3538 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 1507/1507 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7846ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 179 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=89 )
Parikh walk visited 2 properties in 54 ms.
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), true]
Knowledge-based reduction took 11407 ms.
Stuttering acceptance computed with spot in 236 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 230 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 775 reset in 160 ms.
Product exploration explored 100000 steps with 761 reset in 275 ms.
Spot run failed in 45 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin17554903111989401063
[2026-05-23 05:03:55] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17554903111989401063
Running compilation step : cd /tmp/ltsmin17554903111989401063;'/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/ltsmin17554903111989401063;'/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/ltsmin17554903111989401063;'/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 2 out of 1507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1507/1507 places, 1929/1929 transitions.
Applied a total of 0 rules in 56 ms. Remains 1507 /1507 variables (removed 0) and now considering 1929/1929 (removed 0) transitions.
[2026-05-23 05:03:58] [INFO ] Invariant cache hit.
[2026-05-23 05:03:58] [INFO ] Implicit Places using invariants in 227 ms returned []
[2026-05-23 05:03:58] [INFO ] Invariant cache hit.
[2026-05-23 05:03:59] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1232 ms. Remains : 1507/1507 places, 1929/1929 transitions.
Built C files in :
/tmp/ltsmin1386330264886043738
[2026-05-23 05:03:59] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1386330264886043738
Running compilation step : cd /tmp/ltsmin1386330264886043738;'/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/ltsmin1386330264886043738;'/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/ltsmin1386330264886043738;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 05:04:02] [INFO ] Flatten gal took : 27 ms
[2026-05-23 05:04:02] [INFO ] Flatten gal took : 24 ms
[2026-05-23 05:04:02] [INFO ] Time to serialize gal into /tmp/LTL10475923034233082916.gal : 6 ms
[2026-05-23 05:04:02] [INFO ] Time to serialize properties into /tmp/LTL15158000640818795329.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10475923034233082916.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14238454226770471226.hoa' '-atoms' '/tmp/LTL15158000640818795329.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15158000640818795329.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14238454226770471226.hoa
Detected timeout of ITS tools.
[2026-05-23 05:04:17] [INFO ] Flatten gal took : 22 ms
[2026-05-23 05:04:17] [INFO ] Flatten gal took : 23 ms
[2026-05-23 05:04:17] [INFO ] Time to serialize gal into /tmp/LTL14231157679767369856.gal : 6 ms
[2026-05-23 05:04:17] [INFO ] Time to serialize properties into /tmp/LTL1370886800909646569.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/LTL14231157679767369856.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1370886800909646569.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 : !(((("(p1130==1)")&&(X("(p638==1)")))U(G(("(p1063!=1)")||(X((X(X("(p1130==1)")))U(("(p1063!=1)")&&(X(X("(p1130==1)"))))))))))
Formula 0 simplified : (!"(p1130==1)" | X!"(p638==1)") R F(!"(p1063!=1)" & X(!"(p1063!=1)" W XX!"(p1130==1)"))
Detected timeout of ITS tools.
[2026-05-23 05:04:32] [INFO ] Flatten gal took : 20 ms
[2026-05-23 05:04:32] [INFO ] Applying decomposition
[2026-05-23 05:04:33] [INFO ] Flatten gal took : 20 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/graph13488187459079326019.txt' '-o' '/tmp/graph13488187459079326019.bin' '-w' '/tmp/graph13488187459079326019.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13488187459079326019.bin' '-l' '-1' '-v' '-w' '/tmp/graph13488187459079326019.weights' '-q' '0' '-e' '0.001'
[2026-05-23 05:04:33] [INFO ] Decomposing Gal with order
[2026-05-23 05:04:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 05:04:33] [INFO ] Removed a total of 521 redundant transitions.
[2026-05-23 05:04:33] [INFO ] Flatten gal took : 59 ms
[2026-05-23 05:04:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 9 ms.
[2026-05-23 05:04:33] [INFO ] Time to serialize gal into /tmp/LTL12485421948746086183.gal : 12 ms
[2026-05-23 05:04:33] [INFO ] Time to serialize properties into /tmp/LTL17167878675755795630.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/LTL12485421948746086183.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17167878675755795630.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...256
Read 1 LTL properties
Checking formula 0 : !(((("(i15.u265.p1130==1)")&&(X("(i18.i1.i0.i1.u130.p638==1)")))U(G(("(i16.u255.p1063!=1)")||(X((X(X("(i15.u265.p1130==1)")))U(("(i16....209
Formula 0 simplified : (!"(i15.u265.p1130==1)" | X!"(i18.i1.i0.i1.u130.p638==1)") R F(!"(i16.u255.p1063!=1)" & X(!"(i16.u255.p1063!=1)" W XX!"(i15.u265.p11...164
Reverse transition relation is NOT exact ! Due to transitions t26, t216, t268, t282, t287, t328, t377, t450, t655, t684, t736, t768, t797, t846, t969, t117...1628
Computing Next relation with stutter on 89440 deadlock states
Detected timeout of ITS tools.
Treatment of property CloudReconfiguration-PT-316-LTLFireability-02 finished in 142269 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(G(p1)))))'
Support contains 2 out of 1552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1552/1552 places, 1983/1983 transitions.
Graph (trivial) has 1890 edges and 1552 vertex of which 696 / 1552 are part of one of the 63 SCC in 4 ms
Free SCC test removed 633 places
Ensure Unique test removed 736 transitions
Reduce isomorphic transitions removed 736 transitions.
Graph (complete) has 1421 edges and 919 vertex of which 910 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 499 transitions
Trivial Post-agglo rules discarded 499 transitions
Performed 499 trivial Post agglomeration. Transition count delta: 499
Iterating post reduction 0 with 499 rules applied. Total rules applied 501 place count 909 transition count 742
Reduce places removed 499 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 525 rules applied. Total rules applied 1026 place count 410 transition count 716
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 1041 place count 397 transition count 714
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1043 place count 395 transition count 714
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1043 place count 395 transition count 668
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1135 place count 349 transition count 668
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 1153 place count 331 transition count 639
Iterating global reduction 4 with 18 rules applied. Total rules applied 1171 place count 331 transition count 639
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1174 place count 331 transition count 636
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1177 place count 328 transition count 636
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1187 place count 318 transition count 622
Iterating global reduction 6 with 10 rules applied. Total rules applied 1197 place count 318 transition count 622
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 7 rules applied. Total rules applied 1204 place count 318 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1205 place count 317 transition count 615
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1207 place count 315 transition count 611
Iterating global reduction 8 with 2 rules applied. Total rules applied 1209 place count 315 transition count 611
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1211 place count 313 transition count 607
Iterating global reduction 8 with 2 rules applied. Total rules applied 1213 place count 313 transition count 607
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1215 place count 311 transition count 603
Iterating global reduction 8 with 2 rules applied. Total rules applied 1217 place count 311 transition count 603
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1219 place count 309 transition count 599
Iterating global reduction 8 with 2 rules applied. Total rules applied 1221 place count 309 transition count 599
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1222 place count 308 transition count 597
Iterating global reduction 8 with 1 rules applied. Total rules applied 1223 place count 308 transition count 597
Performed 141 Post agglomeration using F-continuation condition with reduction of 80 identical transitions.
Deduced a syphon composed of 141 places in 0 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 8 with 282 rules applied. Total rules applied 1505 place count 167 transition count 376
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1519 place count 167 transition count 362
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1524 place count 162 transition count 356
Iterating global reduction 9 with 5 rules applied. Total rules applied 1529 place count 162 transition count 356
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1530 place count 161 transition count 355
Iterating global reduction 9 with 1 rules applied. Total rules applied 1531 place count 161 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1532 place count 161 transition count 354
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 10 with 26 rules applied. Total rules applied 1558 place count 148 transition count 338
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 1572 place count 148 transition count 324
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 1574 place count 146 transition count 318
Iterating global reduction 11 with 2 rules applied. Total rules applied 1576 place count 146 transition count 318
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1578 place count 145 transition count 317
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 11 with 36 rules applied. Total rules applied 1614 place count 127 transition count 355
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 11 with 19 rules applied. Total rules applied 1633 place count 127 transition count 336
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1642 place count 118 transition count 318
Iterating global reduction 12 with 9 rules applied. Total rules applied 1651 place count 118 transition count 318
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1657 place count 118 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 13 with 39 rules applied. Total rules applied 1696 place count 118 transition count 273
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 1698 place count 118 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 1699 place count 118 transition count 272
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1700 place count 117 transition count 271
Applied a total of 1700 rules in 140 ms. Remains 117 /1552 variables (removed 1435) and now considering 271/1983 (removed 1712) transitions.
[2026-05-23 05:04:48] [INFO ] Flow matrix only has 215 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9274102302892001864.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4638959480437906038.kers'
[2026-05-23 05:04:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9274102302892001864.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4638959480437906038.kers]
Normalized transition count is 214 out of 215 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 214 rows 117 cols 623 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-23 05:04:48] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4638959480437906038.kers
Total runtime 1 ms.
[2026-05-23 05:04:48] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-23 05:04:48] [INFO ] Flow matrix only has 215 transitions (discarded 56 similar events)
[2026-05-23 05:04:48] [INFO ] Invariant cache hit.
[2026-05-23 05:04:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 05:04:48] [INFO ] Implicit Places using invariants and state equation in 112 ms returned [11, 44]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 207 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/1552 places, 271/1983 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 269
Applied a total of 2 rules in 5 ms. Remains 113 /115 variables (removed 2) and now considering 269/271 (removed 2) transitions.
[2026-05-23 05:04:48] [INFO ] Flow matrix only has 213 transitions (discarded 56 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1175686368272526996.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3193898174959185413.kers'
[2026-05-23 05:04:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1175686368272526996.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3193898174959185413.kers]
Normalized transition count is 212 out of 213 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 212 rows 113 cols 626 entries
Finished phase 1 with 113 SingleSign rule and 0 generalized
[2026-05-23 05:04:48] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3193898174959185413.kers
Total runtime 1 ms.
[2026-05-23 05:04:48] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-23 05:04:48] [INFO ] Flow matrix only has 213 transitions (discarded 56 similar events)
[2026-05-23 05:04:48] [INFO ] Invariant cache hit.
[2026-05-23 05:04:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 05:04:48] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 113/1552 places, 269/1983 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 569 ms. Remains : 113/1552 places, 269/1983 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&&X(G(p1)))))'
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-03
Stuttering criterion allowed to conclude after 52 steps with 6 reset in 0 ms.
FORMULA CloudReconfiguration-PT-316-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLFireability-03 finished in 686 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' '!((p0 U X((p1||F(G(p2))))))'
Support contains 3 out of 1552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1552/1552 places, 1983/1983 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1541 transition count 1972
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1541 transition count 1972
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 1534 transition count 1965
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 1534 transition count 1965
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 1529 transition count 1960
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 1529 transition count 1960
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 1524 transition count 1954
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 1524 transition count 1954
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 1524 transition count 1953
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 1520 transition count 1949
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 1520 transition count 1949
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 68 place count 1517 transition count 1945
Iterating global reduction 1 with 3 rules applied. Total rules applied 71 place count 1517 transition count 1945
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 74 place count 1514 transition count 1940
Iterating global reduction 1 with 3 rules applied. Total rules applied 77 place count 1514 transition count 1940
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 80 place count 1511 transition count 1936
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 1511 transition count 1936
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 85 place count 1509 transition count 1933
Iterating global reduction 1 with 2 rules applied. Total rules applied 87 place count 1509 transition count 1933
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 88 place count 1509 transition count 1932
Applied a total of 88 rules in 587 ms. Remains 1509 /1552 variables (removed 43) and now considering 1932/1983 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4935737033393701325.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15780810262506314534.kers'
[2026-05-23 05:04:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4935737033393701325.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15780810262506314534.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1932 rows 1509 cols 4035 entries
Finished phase 1 with 1504 SingleSign rule and 1 generalized
[2026-05-23 05:04:49] [INFO ] Computed 4 invariants in 13 ms
Computed 4 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-15780810262506314534.kers
Total runtime 15 ms.
[2026-05-23 05:04:49] [INFO ] Implicit Places using invariants in 232 ms returned []
[2026-05-23 05:04:49] [INFO ] Invariant cache hit.
[2026-05-23 05:04:50] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1176 ms to find 0 implicit places.
Running 1931 sub problems to find dead transitions.
[2026-05-23 05:04:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3441 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 1931/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1931 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1931 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1508/3441 variables, and 4 constraints, problems are : Problem set: 0 solved, 1931 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60416ms problems are : Problem set: 0 solved, 1931 unsolved
Search for dead transitions found 0 dead transitions in 60420ms
Starting structural reductions in LTL mode, iteration 1 : 1509/1552 places, 1932/1983 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62192 ms. Remains : 1509/1552 places, 1932/1983 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' '!((p0 U X((p1||F(G(p2))))))'
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-05
Stuttering criterion allowed to conclude after 91 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-316-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLFireability-05 finished in 62386 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)) U G(p1)))'
Support contains 3 out of 1552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1552/1552 places, 1983/1983 transitions.
Graph (trivial) has 1886 edges and 1552 vertex of which 696 / 1552 are part of one of the 63 SCC in 1 ms
Free SCC test removed 633 places
Ensure Unique test removed 736 transitions
Reduce isomorphic transitions removed 736 transitions.
Graph (complete) has 1421 edges and 919 vertex of which 910 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 496 transitions
Trivial Post-agglo rules discarded 496 transitions
Performed 496 trivial Post agglomeration. Transition count delta: 496
Iterating post reduction 0 with 496 rules applied. Total rules applied 498 place count 909 transition count 745
Reduce places removed 496 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 522 rules applied. Total rules applied 1020 place count 413 transition count 719
Reduce places removed 13 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 16 rules applied. Total rules applied 1036 place count 400 transition count 716
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1039 place count 397 transition count 716
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1039 place count 397 transition count 670
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1131 place count 351 transition count 670
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 1149 place count 333 transition count 641
Iterating global reduction 4 with 18 rules applied. Total rules applied 1167 place count 333 transition count 641
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1170 place count 333 transition count 638
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1173 place count 330 transition count 638
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1182 place count 321 transition count 625
Iterating global reduction 6 with 9 rules applied. Total rules applied 1191 place count 321 transition count 625
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1196 place count 321 transition count 620
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1198 place count 319 transition count 616
Iterating global reduction 7 with 2 rules applied. Total rules applied 1200 place count 319 transition count 616
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1202 place count 317 transition count 612
Iterating global reduction 7 with 2 rules applied. Total rules applied 1204 place count 317 transition count 612
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1206 place count 315 transition count 608
Iterating global reduction 7 with 2 rules applied. Total rules applied 1208 place count 315 transition count 608
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1210 place count 313 transition count 604
Iterating global reduction 7 with 2 rules applied. Total rules applied 1212 place count 313 transition count 604
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1214 place count 311 transition count 600
Iterating global reduction 7 with 2 rules applied. Total rules applied 1216 place count 311 transition count 600
Performed 145 Post agglomeration using F-continuation condition with reduction of 83 identical transitions.
Deduced a syphon composed of 145 places in 0 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 7 with 290 rules applied. Total rules applied 1506 place count 166 transition count 372
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 1520 place count 166 transition count 358
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1526 place count 160 transition count 347
Iterating global reduction 8 with 6 rules applied. Total rules applied 1532 place count 160 transition count 347
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1533 place count 159 transition count 346
Iterating global reduction 8 with 1 rules applied. Total rules applied 1534 place count 159 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1535 place count 159 transition count 345
Performed 13 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 1561 place count 146 transition count 329
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 9 with 13 rules applied. Total rules applied 1574 place count 146 transition count 316
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1575 place count 145 transition count 312
Iterating global reduction 10 with 1 rules applied. Total rules applied 1576 place count 145 transition count 312
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1578 place count 144 transition count 311
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1580 place count 144 transition count 309
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 11 with 34 rules applied. Total rules applied 1614 place count 127 transition count 334
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 16 rules applied. Total rules applied 1630 place count 127 transition count 318
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1639 place count 118 transition count 300
Iterating global reduction 12 with 9 rules applied. Total rules applied 1648 place count 118 transition count 300
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 1654 place count 118 transition count 294
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 13 with 33 rules applied. Total rules applied 1687 place count 118 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1688 place count 117 transition count 260
Applied a total of 1688 rules in 106 ms. Remains 117 /1552 variables (removed 1435) and now considering 260/1983 (removed 1723) transitions.
[2026-05-23 05:05:51] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8813799944125643099.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18120902218113355886.kers'
[2026-05-23 05:05:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8813799944125643099.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18120902218113355886.kers]
Normalized transition count is 202 out of 203 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 202 rows 117 cols 592 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-23 05:05:51] [INFO ] Computed 0 invariants in 8 ms
Computed 0 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-18120902218113355886.kers
Total runtime 9 ms.
[2026-05-23 05:05:51] [INFO ] Implicit Places using invariants in 174 ms returned []
[2026-05-23 05:05:51] [INFO ] Flow matrix only has 203 transitions (discarded 57 similar events)
[2026-05-23 05:05:51] [INFO ] Invariant cache hit.
[2026-05-23 05:05:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 05:05:51] [INFO ] Implicit Places using invariants and state equation in 121 ms returned [9, 44]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 308 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/1552 places, 260/1983 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 258
Applied a total of 2 rules in 4 ms. Remains 113 /115 variables (removed 2) and now considering 258/260 (removed 2) transitions.
[2026-05-23 05:05:51] [INFO ] Flow matrix only has 201 transitions (discarded 57 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9473038252808152127.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3571840774162962821.kers'
[2026-05-23 05:05:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9473038252808152127.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3571840774162962821.kers]
Normalized transition count is 200 out of 201 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 200 rows 113 cols 592 entries
Finished phase 1 with 113 SingleSign rule and 0 generalized
[2026-05-23 05:05:51] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3571840774162962821.kers
Total runtime 1 ms.
[2026-05-23 05:05:51] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-23 05:05:51] [INFO ] Flow matrix only has 201 transitions (discarded 57 similar events)
[2026-05-23 05:05:51] [INFO ] Invariant cache hit.
[2026-05-23 05:05:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 05:05:52] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 113/1552 places, 258/1983 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 581 ms. Remains : 113/1552 places, 258/1983 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)) U G(p1)))'
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-316-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLFireability-06 finished in 700 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((!p1 U (p2||G(!p1))))))'
Support contains 3 out of 1552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1552/1552 places, 1983/1983 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1542 transition count 1973
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1542 transition count 1973
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 1536 transition count 1967
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 1536 transition count 1967
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 1532 transition count 1963
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 1532 transition count 1963
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 1532 transition count 1962
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 1529 transition count 1958
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 1529 transition count 1958
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 1529 transition count 1957
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 1527 transition count 1955
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 1527 transition count 1955
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 1526 transition count 1954
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 1526 transition count 1954
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 1525 transition count 1953
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 1525 transition count 1953
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 1524 transition count 1952
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 1524 transition count 1952
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 1523 transition count 1950
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 1523 transition count 1950
Applied a total of 60 rules in 571 ms. Remains 1523 /1552 variables (removed 29) and now considering 1950/1983 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10800094700351673568.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4055440353734533044.kers'
[2026-05-23 05:05:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10800094700351673568.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4055440353734533044.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1950 rows 1523 cols 4071 entries
Finished phase 1 with 1518 SingleSign rule and 1 generalized
[2026-05-23 05:05:52] [INFO ] Computed 4 invariants in 14 ms
Computed 4 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-4055440353734533044.kers
Total runtime 19 ms.
[2026-05-23 05:05:53] [INFO ] Implicit Places using invariants in 228 ms returned []
[2026-05-23 05:05:53] [INFO ] Invariant cache hit.
[2026-05-23 05:05:53] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1128 ms to find 0 implicit places.
Running 1949 sub problems to find dead transitions.
[2026-05-23 05:05:53] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1522 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1949 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1522/3473 variables, and 4 constraints, problems are : Problem set: 0 solved, 1949 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1523 constraints, PredecessorRefiner: 1949/1949 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1949 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1522 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1949 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1522/3473 variables, and 4 constraints, problems are : Problem set: 0 solved, 1949 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1523 constraints, PredecessorRefiner: 0/1949 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60420ms problems are : Problem set: 0 solved, 1949 unsolved
Search for dead transitions found 0 dead transitions in 60423ms
Starting structural reductions in LTL mode, iteration 1 : 1523/1552 places, 1950/1983 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62128 ms. Remains : 1523/1552 places, 1950/1983 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)&&X((!p1 U (p2||G(!p1))))))'
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1), true]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudReconfiguration-PT-316-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLFireability-07 finished in 62324 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 3 out of 1552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1552/1552 places, 1983/1983 transitions.
Graph (trivial) has 1885 edges and 1552 vertex of which 677 / 1552 are part of one of the 61 SCC in 1 ms
Free SCC test removed 616 places
Ensure Unique test removed 716 transitions
Reduce isomorphic transitions removed 716 transitions.
Graph (complete) has 1441 edges and 936 vertex of which 927 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 508 transitions
Trivial Post-agglo rules discarded 508 transitions
Performed 508 trivial Post agglomeration. Transition count delta: 508
Iterating post reduction 0 with 508 rules applied. Total rules applied 510 place count 926 transition count 753
Reduce places removed 508 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 532 rules applied. Total rules applied 1042 place count 418 transition count 729
Reduce places removed 12 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 15 rules applied. Total rules applied 1057 place count 406 transition count 726
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 1062 place count 403 transition count 724
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 1065 place count 402 transition count 722
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1066 place count 401 transition count 722
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 48 Pre rules applied. Total rules applied 1066 place count 401 transition count 674
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 1162 place count 353 transition count 674
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1178 place count 337 transition count 649
Iterating global reduction 6 with 16 rules applied. Total rules applied 1194 place count 337 transition count 649
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 1196 place count 337 transition count 647
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1198 place count 335 transition count 647
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1207 place count 326 transition count 635
Iterating global reduction 8 with 9 rules applied. Total rules applied 1216 place count 326 transition count 635
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 7 rules applied. Total rules applied 1223 place count 326 transition count 628
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1224 place count 325 transition count 628
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1226 place count 323 transition count 624
Iterating global reduction 10 with 2 rules applied. Total rules applied 1228 place count 323 transition count 624
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1230 place count 321 transition count 620
Iterating global reduction 10 with 2 rules applied. Total rules applied 1232 place count 321 transition count 620
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1234 place count 319 transition count 616
Iterating global reduction 10 with 2 rules applied. Total rules applied 1236 place count 319 transition count 616
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1238 place count 317 transition count 612
Iterating global reduction 10 with 2 rules applied. Total rules applied 1240 place count 317 transition count 612
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1241 place count 316 transition count 610
Iterating global reduction 10 with 1 rules applied. Total rules applied 1242 place count 316 transition count 610
Performed 149 Post agglomeration using F-continuation condition with reduction of 83 identical transitions.
Deduced a syphon composed of 149 places in 0 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 10 with 298 rules applied. Total rules applied 1540 place count 167 transition count 378
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 10 with 16 rules applied. Total rules applied 1556 place count 167 transition count 362
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 1561 place count 162 transition count 356
Iterating global reduction 11 with 5 rules applied. Total rules applied 1566 place count 162 transition count 356
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1567 place count 161 transition count 355
Iterating global reduction 11 with 1 rules applied. Total rules applied 1568 place count 161 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1569 place count 161 transition count 354
Performed 13 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 12 with 26 rules applied. Total rules applied 1595 place count 148 transition count 339
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 12 with 14 rules applied. Total rules applied 1609 place count 148 transition count 325
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1610 place count 147 transition count 321
Iterating global reduction 13 with 1 rules applied. Total rules applied 1611 place count 147 transition count 321
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 13 with 2 rules applied. Total rules applied 1613 place count 146 transition count 320
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1615 place count 146 transition count 318
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 14 with 36 rules applied. Total rules applied 1651 place count 128 transition count 354
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 14 with 19 rules applied. Total rules applied 1670 place count 128 transition count 335
Discarding 9 places :
Symmetric choice reduction at 15 with 9 rule applications. Total rules 1679 place count 119 transition count 317
Iterating global reduction 15 with 9 rules applied. Total rules applied 1688 place count 119 transition count 317
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 1693 place count 119 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 16 with 39 rules applied. Total rules applied 1732 place count 119 transition count 273
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 16 with 3 rules applied. Total rules applied 1735 place count 119 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 1736 place count 119 transition count 272
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 1737 place count 118 transition count 271
Applied a total of 1737 rules in 83 ms. Remains 118 /1552 variables (removed 1434) and now considering 271/1983 (removed 1712) transitions.
[2026-05-23 05:06:54] [INFO ] Flow matrix only has 216 transitions (discarded 55 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5654753552164306202.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11991203771265190066.kers'
[2026-05-23 05:06:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5654753552164306202.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11991203771265190066.kers]
Normalized transition count is 215 out of 216 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 215 rows 118 cols 625 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-23 05:06:54] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11991203771265190066.kers
Total runtime 2 ms.
[2026-05-23 05:06:54] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-23 05:06:54] [INFO ] Flow matrix only has 216 transitions (discarded 55 similar events)
[2026-05-23 05:06:54] [INFO ] Invariant cache hit.
[2026-05-23 05:06:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 05:06:54] [INFO ] Implicit Places using invariants and state equation in 140 ms returned [11, 44]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 193 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/1552 places, 271/1983 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 269
Applied a total of 2 rules in 4 ms. Remains 114 /116 variables (removed 2) and now considering 269/271 (removed 2) transitions.
[2026-05-23 05:06:54] [INFO ] Flow matrix only has 214 transitions (discarded 55 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16335314010373439791.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16566214025441831183.kers'
[2026-05-23 05:06:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16335314010373439791.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16566214025441831183.kers]
Normalized transition count is 213 out of 214 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 213 rows 114 cols 628 entries
Finished phase 1 with 114 SingleSign rule and 0 generalized
[2026-05-23 05:06:54] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16566214025441831183.kers
Total runtime 1 ms.
[2026-05-23 05:06:54] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-23 05:06:54] [INFO ] Flow matrix only has 214 transitions (discarded 55 similar events)
[2026-05-23 05:06:54] [INFO ] Invariant cache hit.
[2026-05-23 05:06:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 05:06:54] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 114/1552 places, 269/1983 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 434 ms. Remains : 114/1552 places, 269/1983 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 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-08
Stuttering criterion allowed to conclude after 1975 steps with 183 reset in 10 ms.
FORMULA CloudReconfiguration-PT-316-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLFireability-08 finished in 580 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(((p1 U p2)&&p0)))||G(p3)))'
Support contains 4 out of 1552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1552/1552 places, 1983/1983 transitions.
Graph (trivial) has 1886 edges and 1552 vertex of which 689 / 1552 are part of one of the 62 SCC in 1 ms
Free SCC test removed 627 places
Ensure Unique test removed 729 transitions
Reduce isomorphic transitions removed 729 transitions.
Graph (complete) has 1428 edges and 925 vertex of which 916 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 497 transitions
Trivial Post-agglo rules discarded 497 transitions
Performed 497 trivial Post agglomeration. Transition count delta: 497
Iterating post reduction 0 with 497 rules applied. Total rules applied 499 place count 915 transition count 751
Reduce places removed 497 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 521 rules applied. Total rules applied 1020 place count 418 transition count 727
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 1034 place count 406 transition count 725
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1036 place count 404 transition count 725
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1036 place count 404 transition count 678
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1130 place count 357 transition count 678
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 1148 place count 339 transition count 649
Iterating global reduction 4 with 18 rules applied. Total rules applied 1166 place count 339 transition count 649
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 1169 place count 339 transition count 646
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1172 place count 336 transition count 646
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1182 place count 326 transition count 632
Iterating global reduction 6 with 10 rules applied. Total rules applied 1192 place count 326 transition count 632
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 7 rules applied. Total rules applied 1199 place count 326 transition count 625
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1200 place count 325 transition count 625
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1202 place count 323 transition count 621
Iterating global reduction 8 with 2 rules applied. Total rules applied 1204 place count 323 transition count 621
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1206 place count 321 transition count 617
Iterating global reduction 8 with 2 rules applied. Total rules applied 1208 place count 321 transition count 617
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1210 place count 319 transition count 613
Iterating global reduction 8 with 2 rules applied. Total rules applied 1212 place count 319 transition count 613
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1214 place count 317 transition count 609
Iterating global reduction 8 with 2 rules applied. Total rules applied 1216 place count 317 transition count 609
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1218 place count 315 transition count 605
Iterating global reduction 8 with 2 rules applied. Total rules applied 1220 place count 315 transition count 605
Performed 146 Post agglomeration using F-continuation condition with reduction of 84 identical transitions.
Deduced a syphon composed of 146 places in 0 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 8 with 292 rules applied. Total rules applied 1512 place count 169 transition count 375
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1526 place count 169 transition count 361
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1531 place count 164 transition count 355
Iterating global reduction 9 with 5 rules applied. Total rules applied 1536 place count 164 transition count 355
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1537 place count 163 transition count 354
Iterating global reduction 9 with 1 rules applied. Total rules applied 1538 place count 163 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1539 place count 163 transition count 353
Performed 14 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 10 with 28 rules applied. Total rules applied 1567 place count 149 transition count 336
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 1581 place count 149 transition count 322
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1582 place count 148 transition count 318
Iterating global reduction 11 with 1 rules applied. Total rules applied 1583 place count 148 transition count 318
Performed 18 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 11 with 36 rules applied. Total rules applied 1619 place count 130 transition count 352
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 11 with 18 rules applied. Total rules applied 1637 place count 130 transition count 334
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 1646 place count 121 transition count 316
Iterating global reduction 12 with 9 rules applied. Total rules applied 1655 place count 121 transition count 316
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 1660 place count 121 transition count 311
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 13 with 37 rules applied. Total rules applied 1697 place count 121 transition count 274
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 1698 place count 121 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1699 place count 120 transition count 273
Applied a total of 1699 rules in 69 ms. Remains 120 /1552 variables (removed 1432) and now considering 273/1983 (removed 1710) transitions.
[2026-05-23 05:06:55] [INFO ] Flow matrix only has 218 transitions (discarded 55 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9867791810212090167.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11625096763953644105.kers'
[2026-05-23 05:06:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9867791810212090167.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11625096763953644105.kers]
Normalized transition count is 217 out of 218 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 217 rows 120 cols 629 entries
Finished phase 1 with 120 SingleSign rule and 0 generalized
[2026-05-23 05:06:55] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11625096763953644105.kers
Total runtime 1 ms.
[2026-05-23 05:06:55] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-23 05:06:55] [INFO ] Flow matrix only has 218 transitions (discarded 55 similar events)
[2026-05-23 05:06:55] [INFO ] Invariant cache hit.
[2026-05-23 05:06:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 05:06:55] [INFO ] Implicit Places using invariants and state equation in 123 ms returned [11, 45]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 175 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/1552 places, 273/1983 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 271
Applied a total of 2 rules in 6 ms. Remains 116 /118 variables (removed 2) and now considering 271/273 (removed 2) transitions.
[2026-05-23 05:06:55] [INFO ] Flow matrix only has 216 transitions (discarded 55 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15131955675006615326.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12221630637333079304.kers'
[2026-05-23 05:06:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15131955675006615326.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12221630637333079304.kers]
Normalized transition count is 215 out of 216 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 215 rows 116 cols 632 entries
Finished phase 1 with 116 SingleSign rule and 0 generalized
[2026-05-23 05:06:55] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12221630637333079304.kers
Total runtime 1 ms.
[2026-05-23 05:06:55] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-23 05:06:55] [INFO ] Flow matrix only has 216 transitions (discarded 55 similar events)
[2026-05-23 05:06:55] [INFO ] Invariant cache hit.
[2026-05-23 05:06:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 05:06:55] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 116/1552 places, 271/1983 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 397 ms. Remains : 116/1552 places, 271/1983 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(((p1 U p2)&&p0)))||G(p3)))'
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-316-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLFireability-11 finished in 575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&(p1 U (p2||G(p1)))))'
Support contains 3 out of 1552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1552/1552 places, 1983/1983 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1541 transition count 1972
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1541 transition count 1972
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 1533 transition count 1964
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 1533 transition count 1964
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 1527 transition count 1958
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 1527 transition count 1958
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 1527 transition count 1957
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 56 place count 1522 transition count 1951
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 1522 transition count 1951
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 1522 transition count 1950
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 1518 transition count 1946
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 1518 transition count 1946
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 1515 transition count 1942
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 1515 transition count 1942
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 79 place count 1512 transition count 1937
Iterating global reduction 2 with 3 rules applied. Total rules applied 82 place count 1512 transition count 1937
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 1509 transition count 1933
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 1509 transition count 1933
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 1507 transition count 1930
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 1507 transition count 1930
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 93 place count 1507 transition count 1929
Applied a total of 93 rules in 636 ms. Remains 1507 /1552 variables (removed 45) and now considering 1929/1983 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11422398112892491960.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8187933089165796081.kers'
[2026-05-23 05:06:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11422398112892491960.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8187933089165796081.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1929 rows 1507 cols 4029 entries
Finished phase 1 with 1502 SingleSign rule and 1 generalized
[2026-05-23 05:06:56] [INFO ] Computed 4 invariants in 14 ms
Computed 4 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-8187933089165796081.kers
Total runtime 19 ms.
[2026-05-23 05:06:56] [INFO ] Implicit Places using invariants in 252 ms returned []
[2026-05-23 05:06:56] [INFO ] Invariant cache hit.
[2026-05-23 05:06:57] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1207 ms to find 0 implicit places.
Running 1928 sub problems to find dead transitions.
[2026-05-23 05:06:57] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 1928/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1928 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1506 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1928 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1506/3436 variables, and 4 constraints, problems are : Problem set: 0 solved, 1928 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1507 constraints, PredecessorRefiner: 0/1928 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60422ms problems are : Problem set: 0 solved, 1928 unsolved
Search for dead transitions found 0 dead transitions in 60424ms
Starting structural reductions in LTL mode, iteration 1 : 1507/1552 places, 1929/1983 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62279 ms. Remains : 1507/1552 places, 1929/1983 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&(p1 U (p2||G(p1)))))'
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p0)]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CloudReconfiguration-PT-316-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudReconfiguration-PT-316-LTLFireability-12 finished in 62504 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 (p1&&X(!p1))) U p2))'
Support contains 3 out of 1552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1552/1552 places, 1983/1983 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1542 transition count 1973
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1542 transition count 1973
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 1535 transition count 1966
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 1535 transition count 1966
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 1529 transition count 1960
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 1529 transition count 1960
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 1529 transition count 1959
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 52 place count 1524 transition count 1953
Iterating global reduction 1 with 5 rules applied. Total rules applied 57 place count 1524 transition count 1953
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 1524 transition count 1952
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 62 place count 1520 transition count 1948
Iterating global reduction 2 with 4 rules applied. Total rules applied 66 place count 1520 transition count 1948
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 69 place count 1517 transition count 1944
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 1517 transition count 1944
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 75 place count 1514 transition count 1939
Iterating global reduction 2 with 3 rules applied. Total rules applied 78 place count 1514 transition count 1939
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 81 place count 1511 transition count 1935
Iterating global reduction 2 with 3 rules applied. Total rules applied 84 place count 1511 transition count 1935
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 86 place count 1509 transition count 1932
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 1509 transition count 1932
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 1509 transition count 1931
Applied a total of 89 rules in 582 ms. Remains 1509 /1552 variables (removed 43) and now considering 1931/1983 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-476532304723959502.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5245728143117242221.kers'
[2026-05-23 05:07:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-476532304723959502.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5245728143117242221.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1931 rows 1509 cols 4033 entries
Finished phase 1 with 1504 SingleSign rule and 1 generalized
[2026-05-23 05:07:58] [INFO ] Computed 4 invariants in 15 ms
Computed 4 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-5245728143117242221.kers
Total runtime 19 ms.
[2026-05-23 05:07:59] [INFO ] Implicit Places using invariants in 238 ms returned []
[2026-05-23 05:07:59] [INFO ] Invariant cache hit.
[2026-05-23 05:07:59] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1174 ms to find 0 implicit places.
Running 1930 sub problems to find dead transitions.
[2026-05-23 05:07:59] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1508/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 1930/1930 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1930 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1930 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1508/3440 variables, and 4 constraints, problems are : Problem set: 0 solved, 1930 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/1509 constraints, PredecessorRefiner: 0/1930 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60412ms problems are : Problem set: 0 solved, 1930 unsolved
Search for dead transitions found 0 dead transitions in 60416ms
Starting structural reductions in LTL mode, iteration 1 : 1509/1552 places, 1931/1983 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62178 ms. Remains : 1509/1552 places, 1931/1983 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 (p1&&X(!p1))) U p2))'
Stuttering acceptance computed with spot in 209 ms :[(NOT p2), (NOT p0), true, (AND (NOT p0) p1), p1]
Running random walk in product with property : CloudReconfiguration-PT-316-LTLFireability-15
Product exploration explored 100000 steps with 4309 reset in 215 ms.
Product exploration explored 100000 steps with 4304 reset in 227 ms.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2108 edges and 1509 vertex of which 1500 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge based reduction with 19 factoid took 85 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
RANDOM walk for 9352 steps (73 resets) in 62 ms. (148 steps per ms) remains 0/9 properties
Knowledge based reduction with 19 factoid took 196 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), (NOT p0), true, (AND (NOT p0) p1), p1]
[2026-05-23 05:09:01] [INFO ] Invariant cache hit.
[2026-05-23 05:09:02] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 11 ms returned sat
[2026-05-23 05:09:02] [INFO ] [Real]Absence check using state equation in 716 ms returned sat
[2026-05-23 05:09:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 05:09:03] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 11 ms returned sat
[2026-05-23 05:09:04] [INFO ] [Nat]Absence check using state equation in 703 ms returned sat
[2026-05-23 05:09:04] [INFO ] Computed and/alt/rep : 1924/2354/1924 causal constraints (skipped 6 transitions) in 90 ms.
Could not prove EG (NOT p2)
Knowledge-based reduction took 16859 ms.
Stuttering acceptance computed with spot in 205 ms :[(NOT p2), (NOT p0), true, (AND (NOT p0) p1), p1]
Support contains 3 out of 1509 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1509/1509 places, 1931/1931 transitions.
Applied a total of 0 rules in 61 ms. Remains 1509 /1509 variables (removed 0) and now considering 1931/1931 (removed 0) transitions.
[2026-05-23 05:09:18] [INFO ] Invariant cache hit.
[2026-05-23 05:09:18] [INFO ] Implicit Places using invariants in 206 ms returned []
[2026-05-23 05:09:18] [INFO ] Invariant cache hit.
[2026-05-23 05:09:19] [INFO ] Implicit Places using invariants and state equation in 871 ms returned []
Implicit Place search using SMT with State Equation took 1078 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1140 ms. Remains : 1509/1509 places, 1931/1931 transitions.
Computed a total of 27 stabilizing places and 29 stable transitions
Graph (complete) has 2108 edges and 1509 vertex of which 1500 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Computed a total of 27 stabilizing places and 29 stable transitions
Knowledge based reduction with 19 factoid took 79 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
RANDOM walk for 7549 steps (58 resets) in 66 ms. (112 steps per ms) remains 0/9 properties
Knowledge based reduction with 19 factoid took 205 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(NOT p2), (NOT p0), true, (AND (NOT p0) p1), p1]
[2026-05-23 05:09:19] [INFO ] Invariant cache hit.
[2026-05-23 05:09:20] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 12 ms returned sat
[2026-05-23 05:09:21] [INFO ] [Real]Absence check using state equation in 735 ms returned sat
[2026-05-23 05:09:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 05:09:21] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 10 ms returned sat
[2026-05-23 05:09:22] [INFO ] [Nat]Absence check using state equation in 687 ms returned sat
[2026-05-23 05:09:22] [INFO ] Computed and/alt/rep : 1924/2354/1924 causal constraints (skipped 6 transitions) in 103 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1143)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:593)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeFacts.computeEGknowledge(KnowledgeFacts.java:240)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeOrchestrator.applyKnowledgeBasedReductions(KnowledgeOrchestrator.java:52)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-23 05:09:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Knowledge-based reduction took 16983 ms.
Stuttering acceptance computed with spot in 209 ms :[(NOT p2), (NOT p0), true, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 193 ms :[(NOT p2), (NOT p0), true, (AND (NOT p0) p1), p1]
Product exploration explored 100000 steps with 4301 reset in 177 ms.
Product exploration explored 100000 steps with 4296 reset in 194 ms.
Spot run failed in 47 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin11043298308437358433
[2026-05-23 05:09:37] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11043298308437358433
Running compilation step : cd /tmp/ltsmin11043298308437358433;'/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/ltsmin11043298308437358433;'/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/ltsmin11043298308437358433;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 1509 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1509/1509 places, 1931/1931 transitions.
Applied a total of 0 rules in 56 ms. Remains 1509 /1509 variables (removed 0) and now considering 1931/1931 (removed 0) transitions.
[2026-05-23 05:09:40] [INFO ] Invariant cache hit.
[2026-05-23 05:09:40] [INFO ] Implicit Places using invariants in 228 ms returned []
[2026-05-23 05:09:40] [INFO ] Invariant cache hit.
[2026-05-23 05:09:41] [INFO ] Implicit Places using invariants and state equation in 888 ms returned []
Implicit Place search using SMT with State Equation took 1120 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1178 ms. Remains : 1509/1509 places, 1931/1931 transitions.
Built C files in :
/tmp/ltsmin13569115397368508188
[2026-05-23 05:09:41] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13569115397368508188
Running compilation step : cd /tmp/ltsmin13569115397368508188;'/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/ltsmin13569115397368508188;'/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/ltsmin13569115397368508188;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 05:09:44] [INFO ] Flatten gal took : 20 ms
[2026-05-23 05:09:44] [INFO ] Flatten gal took : 19 ms
[2026-05-23 05:09:44] [INFO ] Time to serialize gal into /tmp/LTL1106237719406193781.gal : 5 ms
[2026-05-23 05:09:44] [INFO ] Time to serialize properties into /tmp/LTL4413365861702880485.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1106237719406193781.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12408697391379107460.hoa' '-atoms' '/tmp/LTL4413365861702880485.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/LTL4413365861702880485.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12408697391379107460.hoa
Detected timeout of ITS tools.
[2026-05-23 05:09:59] [INFO ] Flatten gal took : 19 ms
[2026-05-23 05:09:59] [INFO ] Flatten gal took : 19 ms
[2026-05-23 05:09:59] [INFO ] Time to serialize gal into /tmp/LTL16111414343106731609.gal : 4 ms
[2026-05-23 05:09:59] [INFO ] Time to serialize properties into /tmp/LTL8335397815253586656.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/LTL16111414343106731609.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8335397815253586656.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("(p578==1)"))U(("(p29==1)")&&(X("(p29!=1)"))))U("(p602==1)")))
Formula 0 simplified : (G!"(p578==1)" R (!"(p29==1)" | X!"(p29!=1)")) R !"(p602==1)"
Detected timeout of ITS tools.
[2026-05-23 05:10:14] [INFO ] Flatten gal took : 22 ms
[2026-05-23 05:10:14] [INFO ] Applying decomposition
[2026-05-23 05:10:14] [INFO ] Flatten gal took : 18 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/graph10494637554396895451.txt' '-o' '/tmp/graph10494637554396895451.bin' '-w' '/tmp/graph10494637554396895451.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10494637554396895451.bin' '-l' '-1' '-v' '-w' '/tmp/graph10494637554396895451.weights' '-q' '0' '-e' '0.001'
[2026-05-23 05:10:14] [INFO ] Decomposing Gal with order
[2026-05-23 05:10:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 05:10:14] [INFO ] Removed a total of 537 redundant transitions.
[2026-05-23 05:10:14] [INFO ] Flatten gal took : 69 ms
[2026-05-23 05:10:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 8 ms.
[2026-05-23 05:10:14] [INFO ] Time to serialize gal into /tmp/LTL4154644017703326309.gal : 12 ms
[2026-05-23 05:10:14] [INFO ] Time to serialize properties into /tmp/LTL59178292773463003.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/LTL4154644017703326309.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL59178292773463003.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...252
Read 1 LTL properties
Checking formula 0 : !((((F("(i8.u115.p578==1)"))U(("(i2.u8.p29==1)")&&(X("(i2.u8.p29!=1)"))))U("(i8.u125.p602==1)")))
Formula 0 simplified : (G!"(i8.u115.p578==1)" R (!"(i2.u8.p29==1)" | X!"(i2.u8.p29!=1)")) R !"(i8.u125.p602==1)"
Reverse transition relation is NOT exact ! Due to transitions t26, t121, t187, t216, t239, t244, t268, t328, t347, t352, t377, t450, t556, t655, t707, t736...1761
Computing Next relation with stutter on 89440 deadlock states
37 unique states visited
37 strongly connected components in search stack
37 transitions explored
37 items max in DFS search stack
1344 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.6019,506784,1,0,876954,4897,18366,2.23107e+06,484,28677,2837992
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-316-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Detected timeout of ITS tools.
Treatment of property CloudReconfiguration-PT-316-LTLFireability-15 finished in 151835 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' '!(((p0&&X(p1)) U G((p2||X((X(X(p0)) U (p2&&X(X(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-23 05:10:30] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7379959287285964362
[2026-05-23 05:10:30] [INFO ] Too many transitions (1983) to apply POR reductions. Disabling POR matrices.
[2026-05-23 05:10:30] [INFO ] Applying decomposition
[2026-05-23 05:10:30] [INFO ] Flatten gal took : 20 ms
[2026-05-23 05:10:30] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7379959287285964362
Running compilation step : cd /tmp/ltsmin7379959287285964362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph1524671973909891547.txt' '-o' '/tmp/graph1524671973909891547.bin' '-w' '/tmp/graph1524671973909891547.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1524671973909891547.bin' '-l' '-1' '-v' '-w' '/tmp/graph1524671973909891547.weights' '-q' '0' '-e' '0.001'
[2026-05-23 05:10:30] [INFO ] Decomposing Gal with order
[2026-05-23 05:10:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 05:10:30] [INFO ] Removed a total of 521 redundant transitions.
[2026-05-23 05:10:30] [INFO ] Flatten gal took : 46 ms
[2026-05-23 05:10:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 15 ms.
[2026-05-23 05:10:30] [INFO ] Time to serialize gal into /tmp/LTLFireability11247299638222854294.gal : 13 ms
[2026-05-23 05:10:30] [INFO ] Time to serialize properties into /tmp/LTLFireability9908755174138246956.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/LTLFireability11247299638222854294.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9908755174138246956.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((("(i16.i0.i8.u276.p1130==1)")&&(X("(i29.i0.i2.u136.p638==1)")))U(G(("(i17.u261.p1063!=1)")||(X((X(X("(i16.i0.i8.u276.p1130==1)")))...224
Formula 0 simplified : (!"(i16.i0.i8.u276.p1130==1)" | X!"(i29.i0.i2.u136.p638==1)") R F(!"(i17.u261.p1063!=1)" & X(!"(i17.u261.p1063!=1)" W XX!"(i16.i0.i8...173
Compilation finished in 3589 ms.
Running link step : cd /tmp/ltsmin7379959287285964362;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin7379959287285964362;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(((LTLAPp0==true)&&X((LTLAPp1==true))) U [](((LTLAPp2==true)||X((X(X((LTLAPp0==true))) U ((LTLAPp2==true)&&X(X((LTLAPp0==true)))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t26, t121, t187, t216, t239, t244, t268, t328, t347, t352, t377, t450, t499, t655, t707, t797...2435
Computing Next relation with stutter on 93680 deadlock states
64 unique states visited
64 strongly connected components in search stack
64 transitions explored
64 items max in DFS search stack
1300 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.1914,477164,1,0,870752,8617,23662,2.49409e+06,560,46934,2196727
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudReconfiguration-PT-316-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 696900 ms.

BK_STOP 1779513046304

--------------------
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="CloudReconfiguration-PT-316"
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 CloudReconfiguration-PT-316, 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 r066-tall-177946967600228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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