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.r098-tall-177955695800860.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 DoubleExponent-PT-002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695800860
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.8K Mar 6 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 6 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 6 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 6 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 09:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 6 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Mar 6 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 6 16:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Mar 6 16:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 09:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:36 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 33K 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 DoubleExponent-PT-002-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779676059988

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 02:27:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 02:27:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 02:27:41] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2026-05-25 02:27:41] [INFO ] Transformed 110 places.
[2026-05-25 02:27:41] [INFO ] Transformed 98 transitions.
[2026-05-25 02:27:41] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DoubleExponent-PT-002-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 98
Applied a total of 4 rules in 26 ms. Remains 106 /110 variables (removed 4) and now considering 98/98 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14870694046139609302.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2336570215630970355.kers'
[2026-05-25 02:27:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14870694046139609302.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2336570215630970355.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 106 cols 272 entries
Finished phase 1 with 83 SingleSign rule and 12 generalized
[2026-05-25 02:27:41] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2336570215630970355.kers
Total runtime 2 ms.
[2026-05-25 02:27:41] [INFO ] Implicit Places using invariants in 230 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 293 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/110 places, 98/98 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 338 ms. Remains : 105/110 places, 98/98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8419830132417308777.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14615022519080567416.kers'
[2026-05-25 02:27:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8419830132417308777.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14615022519080567416.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 105 cols 269 entries
Finished phase 1 with 84 SingleSign rule and 11 generalized
[2026-05-25 02:27:41] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14615022519080567416.kers
Total runtime 1 ms.
[2026-05-25 02:27:42] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-25 02:27:42] [INFO ] Invariant cache hit.
[2026-05-25 02:27:42] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2026-05-25 02:27:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/203 variables, 105/117 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 5/122 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 123 constraints, problems are : Problem set: 0 solved, 97 unsolved in 10189 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/203 variables, 105/122 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 97/219 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/203 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 222 constraints, problems are : Problem set: 0 solved, 97 unsolved in 22639 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 32887ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 32910ms
Finished structural reductions in LTL mode , in 1 iterations and 33201 ms. Remains : 105/105 places, 98/98 transitions.
Support contains 34 out of 105 places after structural reductions.
[2026-05-25 02:28:15] [INFO ] Flatten gal took : 25 ms
[2026-05-25 02:28:15] [INFO ] Flatten gal took : 28 ms
[2026-05-25 02:28:15] [INFO ] Input system was already deterministic with 98 transitions.
Reduction of identical properties reduced properties to check from 28 to 27
RANDOM walk for 40000 steps (1320 resets) in 1254 ms. (31 steps per ms) remains 13/27 properties
BEST_FIRST walk for 40000 steps (1156 resets) in 339 ms. (117 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1135 resets) in 302 ms. (132 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1130 resets) in 540 ms. (73 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (1148 resets) in 401 ms. (99 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (1129 resets) in 235 ms. (169 steps per ms) remains 7/13 properties
BEST_FIRST walk for 40000 steps (1127 resets) in 227 ms. (175 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1142 resets) in 167 ms. (238 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (1134 resets) in 191 ms. (208 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1149 resets) in 159 ms. (250 steps per ms) remains 7/7 properties
[2026-05-25 02:28:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 6/26 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 58/84 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 87/171 variables, 84/94 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 25/196 variables, 17/111 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 4/200 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 3/203 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/203 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/203 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 115 constraints, problems are : Problem set: 0 solved, 7 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 6/26 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 58/84 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 87/171 variables, 84/96 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 25/196 variables, 17/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 5/120 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/196 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/196 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/196 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 4/200 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/200 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 3/203 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/203 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 0/203 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 126 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1039 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1516ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 2467 ms.
Support contains 10 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 98/98 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 105 transition count 82
Reduce places removed 16 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 19 rules applied. Total rules applied 35 place count 89 transition count 79
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 38 place count 86 transition count 79
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 38 place count 86 transition count 73
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 50 place count 80 transition count 73
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 82 place count 64 transition count 57
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 86 place count 62 transition count 57
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 91 place count 62 transition count 52
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 96 place count 57 transition count 52
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 103 place count 57 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 56 transition count 51
Applied a total of 104 rules in 2464 ms. Remains 56 /105 variables (removed 49) and now considering 51/98 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2464 ms. Remains : 56/105 places, 51/98 transitions.
RANDOM walk for 40000 steps (3082 resets) in 761 ms. (52 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40001 steps (2369 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (2363 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (2370 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (2349 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11461198548233255484.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16205029501594759500.kers'
[2026-05-25 02:28:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11461198548233255484.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16205029501594759500.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 51 rows 56 cols 203 entries
Finished phase 1 with 36 SingleSign rule and 10 generalized
[2026-05-25 02:28:23] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16205029501594759500.kers
Total runtime 0 ms.
[2026-05-25 02:28:23] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 26/45 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4/49 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 50/99 variables, 49/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 8/107 variables, 7/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/107 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 69 constraints, problems are : Problem set: 0 solved, 4 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 26/45 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4/49 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 50/99 variables, 49/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 8/107 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/107 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/107 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 74 constraints, problems are : Problem set: 0 solved, 4 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 352ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 592 ms.
Support contains 6 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 51/51 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 56 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 55 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 53 transition count 48
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 53 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 52 transition count 47
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 52 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 51 transition count 46
Applied a total of 10 rules in 10 ms. Remains 51 /56 variables (removed 5) and now considering 46/51 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 51/56 places, 46/51 transitions.
RANDOM walk for 40000 steps (4558 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (3125 resets) in 74 ms. (533 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3104 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (3124 resets) in 58 ms. (677 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3115 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 1750 steps, run visited all 4 properties in 12 ms. (steps per millisecond=145 )
Probabilistic random walk after 1750 steps, saw 904 distinct states, run finished after 16 ms. (steps per millisecond=109 ) properties seen :4
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 170 edges and 105 vertex of which 103 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 104 transition count 74
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 47 place count 81 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 80 transition count 73
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 48 place count 80 transition count 69
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 56 place count 76 transition count 69
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 98 place count 55 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 53 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 52 transition count 47
Applied a total of 103 rules in 13 ms. Remains 52 /105 variables (removed 53) and now considering 47/98 (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-17701312197425608858.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3437187765363187068.kers'
[2026-05-25 02:28:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17701312197425608858.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3437187765363187068.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 47 rows 50 cols 165 entries
Finished phase 1 with 31 SingleSign rule and 11 generalized
[2026-05-25 02:28:25] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3437187765363187068.kers
Total runtime 0 ms.
[2026-05-25 02:28:25] [INFO ] Implicit Places using invariants in 40 ms returned [37]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/105 places, 47/98 transitions.
Graph (complete) has 145 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 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 3 place count 49 transition count 45
Applied a total of 3 rules in 6 ms. Remains 49 /51 variables (removed 2) and now considering 45/47 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8473064601018027091.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1679857652846306141.kers'
[2026-05-25 02:28:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8473064601018027091.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1679857652846306141.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 45 rows 47 cols 157 entries
Finished phase 1 with 31 SingleSign rule and 9 generalized
[2026-05-25 02:28:25] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1679857652846306141.kers
Total runtime 0 ms.
[2026-05-25 02:28:25] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 02:28:25] [INFO ] Invariant cache hit.
[2026-05-25 02:28:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 02:28:25] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/105 places, 45/98 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 169 ms. Remains : 49/105 places, 45/98 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 2003 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-00
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 2 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-00 finished in 2253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X(F(p1))))))'
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13368403187014912702.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10096484767008435071.kers'
[2026-05-25 02:28:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13368403187014912702.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10096484767008435071.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 105 cols 269 entries
Finished phase 1 with 84 SingleSign rule and 11 generalized
[2026-05-25 02:28:27] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10096484767008435071.kers
Total runtime 1 ms.
[2026-05-25 02:28:27] [INFO ] Implicit Places using invariants in 175 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 178 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/105 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 7 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13883320974806065981.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11811197300781722051.kers'
[2026-05-25 02:28:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13883320974806065981.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11811197300781722051.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 103 cols 264 entries
Finished phase 1 with 83 SingleSign rule and 11 generalized
[2026-05-25 02:28:27] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11811197300781722051.kers
Total runtime 1 ms.
[2026-05-25 02:28:27] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-25 02:28:27] [INFO ] Invariant cache hit.
[2026-05-25 02:28:27] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/105 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 400 ms. Remains : 103/105 places, 97/98 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X(F(p1))))))'
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-01
Product exploration explored 100000 steps with 25000 reset in 263 ms.
Product exploration explored 100000 steps with 25000 reset in 137 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 2 factoid took 61 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (1313 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (1137 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1727 steps, run visited all 1 properties in 8 ms. (steps per millisecond=215 )
Probabilistic random walk after 1727 steps, saw 873 distinct states, run finished after 8 ms. (steps per millisecond=215 ) properties seen :1
Knowledge based reduction with 2 factoid took 73 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 130 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 454 ms.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 103 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2026-05-25 02:28:29] [INFO ] Invariant cache hit.
[2026-05-25 02:28:29] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-25 02:28:29] [INFO ] Invariant cache hit.
[2026-05-25 02:28:29] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2026-05-25 02:28:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/200 variables, 103/114 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 5/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (OVERLAPS) 0/200 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 123 constraints, problems are : Problem set: 0 solved, 96 unsolved in 10015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/200 variables, 103/120 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 96/216 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 3/219 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (OVERLAPS) 0/200 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 221 constraints, problems are : Problem set: 0 solved, 96 unsolved in 19615 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 29652ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 29652ms
Finished structural reductions in LTL mode , in 1 iterations and 29845 ms. Remains : 103/103 places, 97/97 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 1 factoid took 50 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 (1330 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1120 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1727 steps, run visited all 1 properties in 9 ms. (steps per millisecond=191 )
Probabilistic random walk after 1727 steps, saw 873 distinct states, run finished after 9 ms. (steps per millisecond=191 ) properties seen :1
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).
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 303 ms.
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 134 ms.
Product exploration explored 100000 steps with 25000 reset in 99 ms.
Spot run failed in 80 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/ltsmin16808906448546170150
[2026-05-25 02:28:59] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16808906448546170150
Running compilation step : cd /tmp/ltsmin16808906448546170150;'/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'
Compilation finished in 346 ms.
Running link step : cd /tmp/ltsmin16808906448546170150;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin16808906448546170150;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased15046852244701016046.hoa' '--buchi-type=spotba'
LTSmin run took 34 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-002-LTLFireability-01 finished in 32836 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 104 transition count 72
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 79 transition count 72
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 50 place count 79 transition count 68
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 58 place count 75 transition count 68
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 100 place count 54 transition count 47
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 104 place count 52 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 51 transition count 46
Applied a total of 105 rules in 19 ms. Remains 51 /105 variables (removed 54) and now considering 46/98 (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-15365365112337902962.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6606268029849836677.kers'
[2026-05-25 02:29:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15365365112337902962.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6606268029849836677.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 46 rows 50 cols 168 entries
Finished phase 1 with 29 SingleSign rule and 12 generalized
[2026-05-25 02:29:00] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6606268029849836677.kers
Total runtime 0 ms.
[2026-05-25 02:29:00] [INFO ] Implicit Places using invariants in 50 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/105 places, 46/98 transitions.
Graph (complete) has 140 edges and 50 vertex of which 49 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 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 3 place count 48 transition count 44
Applied a total of 3 rules in 3 ms. Remains 48 /50 variables (removed 2) and now considering 44/46 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11240221953593843748.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-945483470734031579.kers'
[2026-05-25 02:29:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11240221953593843748.kers, --Pflows, --basisKERS=/tmp/petrispot-output-945483470734031579.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 44 rows 47 cols 160 entries
Finished phase 1 with 29 SingleSign rule and 10 generalized
[2026-05-25 02:29:00] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-945483470734031579.kers
Total runtime 0 ms.
[2026-05-25 02:29:00] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 02:29:00] [INFO ] Invariant cache hit.
[2026-05-25 02:29:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 02:29:00] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/105 places, 44/98 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 219 ms. Remains : 48/105 places, 44/98 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-02
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-02 finished in 279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(G((p1||X(p2)))) U (p2&&X(X(p3))))&&p0)))'
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13354696044011487112.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11263832547076936815.kers'
[2026-05-25 02:29:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13354696044011487112.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11263832547076936815.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 105 cols 269 entries
Finished phase 1 with 84 SingleSign rule and 11 generalized
[2026-05-25 02:29:00] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11263832547076936815.kers
Total runtime 3 ms.
[2026-05-25 02:29:00] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-25 02:29:00] [INFO ] Invariant cache hit.
[2026-05-25 02:29:00] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2026-05-25 02:29:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/203 variables, 105/117 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 5/122 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 123 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6840 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/203 variables, 105/122 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 97/219 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/203 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 222 constraints, problems are : Problem set: 0 solved, 97 unsolved in 22365 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 29214ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 29215ms
Finished structural reductions in LTL mode , in 1 iterations and 29464 ms. Remains : 105/105 places, 98/98 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(G((p1||X(p2)))) U (p2&&X(X(p3))))&&p0)))'
Stuttering acceptance computed with spot in 998 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2)), (OR (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (NOT p3)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-03
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-03 finished in 30541 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))||F(!p1)) U (G((X(X(p0))||F(!p1)))||(p2&&(X(X(p0))||F(!p1))))) U (G((X(X(p0))||F(!p1)))||(((X(X(p0))||F(!p1)) U (G((X(X(p0))||F(!p1)))||(p2&&(X(X(p0))||F(!p1)))))&&p3))))'
Support contains 7 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2026-05-25 02:29:31] [INFO ] Invariant cache hit.
[2026-05-25 02:29:31] [INFO ] Implicit Places using invariants in 41 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/105 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 2 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4192319718621052458.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11479739692769232959.kers'
[2026-05-25 02:29:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4192319718621052458.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11479739692769232959.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 103 cols 264 entries
Finished phase 1 with 83 SingleSign rule and 11 generalized
[2026-05-25 02:29:31] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11479739692769232959.kers
Total runtime 1 ms.
[2026-05-25 02:29:31] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-25 02:29:31] [INFO ] Invariant cache hit.
[2026-05-25 02:29:31] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/105 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 202 ms. Remains : 103/105 places, 97/98 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))||F(!p1)) U (G((X(X(p0))||F(!p1)))||(p2&&(X(X(p0))||F(!p1))))) U (G((X(X(p0))||F(!p1)))||(((X(X(p0))||F(!p1)) U (G((X(X(p0))||F(!p1)))||(p2&&(X(X(p0))||F(!p1)))))&&p3))))'
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-04
Product exploration explored 100000 steps with 3353 reset in 127 ms.
Product exploration explored 100000 steps with 3324 reset in 134 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 11 factoid took 84 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (1318 resets) in 169 ms. (235 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40000 steps (1140 resets) in 120 ms. (330 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1112 resets) in 142 ms. (279 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1124 resets) in 146 ms. (272 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1090 resets) in 116 ms. (341 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1139 resets) in 153 ms. (259 steps per ms) remains 5/5 properties
[2026-05-25 02:29:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 9/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 7/23 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 52/75 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 82/157 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 33/190 variables, 22/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 8/198 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf1 is UNSAT
Problem apf3 is UNSAT
At refinement iteration 13 (OVERLAPS) 2/200 variables, 2/112 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 1/113 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/200 variables, 0/113 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/200 variables, 0/113 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 113 constraints, problems are : Problem set: 2 solved, 3 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/18 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 12/30 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 15/45 variables, 2/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 30/75 variables, 4/9 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 82/157 variables, 75/84 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/84 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 33/190 variables, 22/106 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 3/109 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 0/109 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 8/198 variables, 4/113 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/198 variables, 0/113 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/200 variables, 2/115 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/200 variables, 1/116 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/200 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/200 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 116 constraints, problems are : Problem set: 2 solved, 3 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 596ms problems are : Problem set: 2 solved, 3 unsolved
Parikh walk visited 0 properties in 409 ms.
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 97/97 transitions.
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 101 transition count 73
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 46 place count 79 transition count 73
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 46 place count 79 transition count 67
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 58 place count 73 transition count 67
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 94 place count 55 transition count 49
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 98 place count 53 transition count 49
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 53 transition count 45
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 106 place count 49 transition count 45
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 114 place count 49 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 48 transition count 44
Applied a total of 115 rules in 12 ms. Remains 48 /103 variables (removed 55) and now considering 44/97 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 48/103 places, 44/97 transitions.
RANDOM walk for 40000 steps (4502 resets) in 57 ms. (689 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (3009 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15898113245630110692.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6351520098594700550.kers'
[2026-05-25 02:29:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15898113245630110692.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6351520098594700550.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 44 rows 46 cols 169 entries
Finished phase 1 with 31 SingleSign rule and 8 generalized
[2026-05-25 02:29:33] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6351520098594700550.kers
Total runtime 0 ms.
[2026-05-25 02:29:33] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/43 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 44/87 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/92 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/92 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 64 constraints, problems are : Problem set: 0 solved, 1 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 48/48 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 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) 25/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/43 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 44/87 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/92 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/92 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/92 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 66 constraints, problems are : Problem set: 0 solved, 1 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 48/48 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 340ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 44/44 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 48 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 47 transition count 43
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 47 transition count 42
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 46 transition count 42
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 2 with 2 rules applied. Total rules applied 6 place count 45 transition count 41
Applied a total of 6 rules in 4 ms. Remains 45 /48 variables (removed 3) and now considering 41/44 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 45/48 places, 41/44 transitions.
RANDOM walk for 40000 steps (4569 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3189 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 631 steps, run visited all 1 properties in 5 ms. (steps per millisecond=126 )
Probabilistic random walk after 631 steps, saw 325 distinct states, run finished after 5 ms. (steps per millisecond=126 ) properties seen :1
Found 2 invariant AP formulas.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 13 factoid took 11 ms. Proved property starting from automaton with 5 states, 8 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 1862 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-002-LTLFireability-04 finished in 2624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(X(p0)) U ((p0&&X(X(p0)))||X(X(G(p0))))))||(X(F(p1))&&(X(X(p0)) U ((p0&&X(X(p0)))||X(X(G(p0))))))))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15734740009570640722.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7982669823924045095.kers'
[2026-05-25 02:29:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15734740009570640722.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7982669823924045095.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 105 cols 269 entries
Finished phase 1 with 84 SingleSign rule and 11 generalized
[2026-05-25 02:29:33] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7982669823924045095.kers
Total runtime 2 ms.
[2026-05-25 02:29:33] [INFO ] Implicit Places using invariants in 54 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/105 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 3 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15855614507364289806.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4434241196900003157.kers'
[2026-05-25 02:29:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15855614507364289806.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4434241196900003157.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 103 cols 264 entries
Finished phase 1 with 83 SingleSign rule and 11 generalized
[2026-05-25 02:29:33] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4434241196900003157.kers
Total runtime 1 ms.
[2026-05-25 02:29:33] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-25 02:29:33] [INFO ] Invariant cache hit.
[2026-05-25 02:29:33] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/105 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 227 ms. Remains : 103/105 places, 97/98 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(X(p0)) U ((p0&&X(X(p0)))||X(X(G(p0))))))||(X(F(p1))&&(X(X(p0)) U ((p0&&X(X(p0)))||X(X(G(p0))))))))'
Stuttering acceptance computed with spot in 401 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-05
Stuttering criterion allowed to conclude after 7650 steps with 1899 reset in 15 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-05 finished in 687 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 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 104 transition count 73
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 80 transition count 73
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 48 place count 80 transition count 70
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 54 place count 77 transition count 70
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 98 place count 55 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 54 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 53 transition count 47
Applied a total of 101 rules in 9 ms. Remains 53 /105 variables (removed 52) and now considering 47/98 (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-16848634834631234342.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4400178469322687034.kers'
[2026-05-25 02:29:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16848634834631234342.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4400178469322687034.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 47 rows 51 cols 163 entries
Finished phase 1 with 32 SingleSign rule and 11 generalized
[2026-05-25 02:29:34] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4400178469322687034.kers
Total runtime 0 ms.
[2026-05-25 02:29:34] [INFO ] Implicit Places using invariants in 41 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/105 places, 47/98 transitions.
Graph (complete) has 144 edges and 52 vertex of which 51 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 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 3 place count 50 transition count 45
Applied a total of 3 rules in 2 ms. Remains 50 /52 variables (removed 2) and now considering 45/47 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8420416018108556213.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4581800533180605199.kers'
[2026-05-25 02:29:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8420416018108556213.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4581800533180605199.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 45 rows 48 cols 155 entries
Finished phase 1 with 32 SingleSign rule and 9 generalized
[2026-05-25 02:29:34] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4581800533180605199.kers
Total runtime 0 ms.
[2026-05-25 02:29:34] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-25 02:29:34] [INFO ] Invariant cache hit.
[2026-05-25 02:29:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 02:29:34] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/105 places, 45/98 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 152 ms. Remains : 50/105 places, 45/98 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 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-06
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-06 finished in 244 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 U p2)&&X(!X(p1)))))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1877211050655461771.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1278308497538422232.kers'
[2026-05-25 02:29:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1877211050655461771.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1278308497538422232.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 105 cols 269 entries
Finished phase 1 with 84 SingleSign rule and 11 generalized
[2026-05-25 02:29:34] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1278308497538422232.kers
Total runtime 2 ms.
[2026-05-25 02:29:34] [INFO ] Implicit Places using invariants in 53 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/105 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 3 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17111868372063467476.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13403906625689898571.kers'
[2026-05-25 02:29:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17111868372063467476.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13403906625689898571.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 103 cols 264 entries
Finished phase 1 with 83 SingleSign rule and 11 generalized
[2026-05-25 02:29:34] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13403906625689898571.kers
Total runtime 0 ms.
[2026-05-25 02:29:34] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-25 02:29:34] [INFO ] Invariant cache hit.
[2026-05-25 02:29:34] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/105 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 237 ms. Remains : 103/105 places, 97/98 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 U p2)&&X(!X(p1)))))'
Stuttering acceptance computed with spot in 379 ms :[(OR p1 p2), (NOT p0), (AND (NOT p0) (NOT p2) p1), p1, p2, (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), p1, p1, (AND p1 p2)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-08
Product exploration explored 100000 steps with 33333 reset in 80 ms.
Product exploration explored 100000 steps with 33333 reset in 119 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 17 factoid took 10 ms. Proved property starting from automaton with 10 states, 30 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 12 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-002-LTLFireability-08 finished in 867 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 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 104 transition count 75
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 45 place count 82 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 81 transition count 74
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 46 place count 81 transition count 71
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 52 place count 78 transition count 71
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 88 place count 60 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 92 place count 58 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 57 transition count 52
Applied a total of 93 rules in 8 ms. Remains 57 /105 variables (removed 48) and now considering 52/98 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11001048021637555522.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1102903880649290535.kers'
[2026-05-25 02:29:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11001048021637555522.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1102903880649290535.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 52 rows 57 cols 186 entries
Finished phase 1 with 36 SingleSign rule and 11 generalized
[2026-05-25 02:29:35] [INFO ] Computed 10 invariants in 6 ms
Computed 10 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-1102903880649290535.kers
Total runtime 7 ms.
[2026-05-25 02:29:35] [INFO ] Implicit Places using invariants in 45 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/105 places, 52/98 transitions.
Graph (complete) has 151 edges and 56 vertex of which 55 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 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 3 place count 54 transition count 50
Applied a total of 3 rules in 3 ms. Remains 54 /56 variables (removed 2) and now considering 50/52 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5277248526038380574.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3441322900927102356.kers'
[2026-05-25 02:29:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5277248526038380574.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3441322900927102356.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 50 rows 54 cols 178 entries
Finished phase 1 with 36 SingleSign rule and 9 generalized
[2026-05-25 02:29:35] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3441322900927102356.kers
Total runtime 0 ms.
[2026-05-25 02:29:35] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-25 02:29:35] [INFO ] Invariant cache hit.
[2026-05-25 02:29:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 02:29:35] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/105 places, 50/98 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 159 ms. Remains : 54/105 places, 50/98 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 86 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-09
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLFireability-09 finished in 269 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 p1)||X(X(F(p2)))))'
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5551565006604645407.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4367992487962477874.kers'
[2026-05-25 02:29:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5551565006604645407.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4367992487962477874.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 105 cols 269 entries
Finished phase 1 with 84 SingleSign rule and 11 generalized
[2026-05-25 02:29:35] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4367992487962477874.kers
Total runtime 0 ms.
[2026-05-25 02:29:35] [INFO ] Implicit Places using invariants in 46 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/105 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 3 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7909927638615435925.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1515138714231814900.kers'
[2026-05-25 02:29:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7909927638615435925.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1515138714231814900.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 103 cols 264 entries
Finished phase 1 with 83 SingleSign rule and 11 generalized
[2026-05-25 02:29:35] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1515138714231814900.kers
Total runtime 0 ms.
[2026-05-25 02:29:35] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-25 02:29:35] [INFO ] Invariant cache hit.
[2026-05-25 02:29:35] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/105 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 200 ms. Remains : 103/105 places, 97/98 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 p1)||X(X(F(p2)))))'
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-12
Product exploration explored 100000 steps with 10000 reset in 57 ms.
Product exploration explored 100000 steps with 10000 reset in 71 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 10 factoid took 68 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
RANDOM walk for 36 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
Knowledge based reduction with 10 factoid took 65 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p2), (NOT p2), (NOT p2)]
[2026-05-25 02:29:36] [INFO ] Invariant cache hit.
[2026-05-25 02:29:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:29:36] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2026-05-25 02:29:36] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2026-05-25 02:29:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:29:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:29:36] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2026-05-25 02:29:36] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2026-05-25 02:29:36] [INFO ] Computed and/alt/rep : 96/182/96 causal constraints (skipped 0 transitions) in 8 ms.
[2026-05-25 02:29:37] [INFO ] Added : 52 causal constraints over 11 iterations in 338 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 880 ms.
Stuttering acceptance computed with spot in 115 ms :[(NOT p2), (NOT p2), (NOT p2)]
Support contains 2 out of 103 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 97/97 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2026-05-25 02:29:37] [INFO ] Invariant cache hit.
[2026-05-25 02:29:37] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-25 02:29:37] [INFO ] Invariant cache hit.
[2026-05-25 02:29:37] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2026-05-25 02:29:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/200 variables, 103/114 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 5/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (OVERLAPS) 0/200 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 123 constraints, problems are : Problem set: 0 solved, 96 unsolved in 9742 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/200 variables, 103/120 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 96/216 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 3/219 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (OVERLAPS) 0/200 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 221 constraints, problems are : Problem set: 0 solved, 96 unsolved in 18903 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 28658ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 28659ms
Finished structural reductions in LTL mode , in 1 iterations and 28817 ms. Remains : 103/103 places, 97/97 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge based reduction with 2 factoid took 43 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
RANDOM walk for 36 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p2), (NOT p2), (NOT p2)]
[2026-05-25 02:30:06] [INFO ] Invariant cache hit.
[2026-05-25 02:30:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:30:06] [INFO ] [Real]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2026-05-25 02:30:06] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2026-05-25 02:30:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 02:30:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2026-05-25 02:30:06] [INFO ] [Nat]Absence check using 2 positive and 7 generalized place invariants in 2 ms returned sat
[2026-05-25 02:30:06] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2026-05-25 02:30:06] [INFO ] Computed and/alt/rep : 96/182/96 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-25 02:30:06] [INFO ] Added : 52 causal constraints over 11 iterations in 316 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 843 ms.
Stuttering acceptance computed with spot in 131 ms :[(NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 10000 reset in 62 ms.
Product exploration explored 100000 steps with 10000 reset in 67 ms.
Spot run failed in 50 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/ltsmin3804770021327930416
[2026-05-25 02:30:07] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3804770021327930416
Running compilation step : cd /tmp/ltsmin3804770021327930416;'/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'
Compilation finished in 201 ms.
Running link step : cd /tmp/ltsmin3804770021327930416;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin3804770021327930416;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased4798000909887739975.hoa' '--buchi-type=spotba'
LTSmin run took 15 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-002-LTLFireability-12 finished in 31903 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(X(p1))) U (G((!p0||X(X(p1))))||(p2&&(!p0||X(X(p1)))))))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-62374185601470373.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10234276653580835429.kers'
[2026-05-25 02:30:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-62374185601470373.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10234276653580835429.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 105 cols 269 entries
Finished phase 1 with 84 SingleSign rule and 11 generalized
[2026-05-25 02:30:07] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10234276653580835429.kers
Total runtime 1 ms.
[2026-05-25 02:30:07] [INFO ] Implicit Places using invariants in 49 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/105 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 1 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5529956568743712293.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13965063604325964851.kers'
[2026-05-25 02:30:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5529956568743712293.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13965063604325964851.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 103 cols 264 entries
Finished phase 1 with 83 SingleSign rule and 11 generalized
[2026-05-25 02:30:07] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13965063604325964851.kers
Total runtime 1 ms.
[2026-05-25 02:30:07] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-25 02:30:07] [INFO ] Invariant cache hit.
[2026-05-25 02:30:07] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/105 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 224 ms. Remains : 103/105 places, 97/98 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(X(p1))) U (G((!p0||X(X(p1))))||(p2&&(!p0||X(X(p1)))))))'
Stuttering acceptance computed with spot in 144 ms :[(AND p0 (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-13
Product exploration explored 100000 steps with 33333 reset in 69 ms.
Product exploration explored 100000 steps with 33333 reset in 74 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Detected a total of 7/103 stabilizing places and 7/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 20 ms. Proved property starting from automaton with 4 states, 5 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 24 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-002-LTLFireability-13 finished in 560 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(G(((X(!p0) U p1) U p1)))) U !X(p2)))'
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1765328265605269728.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4722897662894821564.kers'
[2026-05-25 02:30:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1765328265605269728.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4722897662894821564.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 105 cols 269 entries
Finished phase 1 with 84 SingleSign rule and 11 generalized
[2026-05-25 02:30:08] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4722897662894821564.kers
Total runtime 1 ms.
[2026-05-25 02:30:08] [INFO ] Implicit Places using invariants in 44 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/105 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Applied a total of 2 rules in 2 ms. Remains 103 /104 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15932032460432051512.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13079075012762286420.kers'
[2026-05-25 02:30:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15932032460432051512.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13079075012762286420.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 103 cols 264 entries
Finished phase 1 with 83 SingleSign rule and 11 generalized
[2026-05-25 02:30:08] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13079075012762286420.kers
Total runtime 1 ms.
[2026-05-25 02:30:08] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-25 02:30:08] [INFO ] Invariant cache hit.
[2026-05-25 02:30:08] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 103/105 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 196 ms. Remains : 103/105 places, 97/98 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(G(((X(!p0) U p1) U p1)))) U !X(p2)))'
Stuttering acceptance computed with spot in 184 ms :[p2, p2, (NOT p1), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-002-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 65 ms.
Product exploration explored 100000 steps with 50000 reset in 67 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 8 factoid took 18 ms. Proved property starting from automaton with 4 states, 8 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 20 ms.
FORMULA DoubleExponent-PT-002-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-002-LTLFireability-14 finished in 565 ms.
All properties solved by simple procedures.
Total runtime 147516 ms.

BK_STOP 1779676213304

--------------------
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="DoubleExponent-PT-002"
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 DoubleExponent-PT-002, 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 r098-tall-177955695800860"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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