fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r146-tall-177961074400804
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for HirschbergSinclair-PT-50

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
14436.647 3600000.00 6026119.00 26711.60 ?TFF?FFFFFFTFFFF normal

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.r146-tall-177961074400804.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 HirschbergSinclair-PT-50, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074400804
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 13K Mar 7 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 7 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Mar 7 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 7 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.5K Mar 15 10:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 10:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 7 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Mar 7 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 7 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 10:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 652K 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 HirschbergSinclair-PT-50-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-50-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779763426876

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-50
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 02:43:47] [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-26 02:43:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 02:43:48] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2026-05-26 02:43:48] [INFO ] Transformed 1208 places.
[2026-05-26 02:43:48] [INFO ] Transformed 1102 transitions.
[2026-05-26 02:43:48] [INFO ] Parsed PT model containing 1208 places and 1102 transitions and 3361 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HirschbergSinclair-PT-50-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-50-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-50-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 1208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1208/1208 places, 1102/1102 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 1158 transition count 1102
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 96 place count 1112 transition count 1056
Iterating global reduction 1 with 46 rules applied. Total rules applied 142 place count 1112 transition count 1056
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 185 place count 1069 transition count 1013
Iterating global reduction 1 with 43 rules applied. Total rules applied 228 place count 1069 transition count 1013
Applied a total of 228 rules in 341 ms. Remains 1069 /1208 variables (removed 139) and now considering 1013/1102 (removed 89) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7121391852425647874.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17896751740034614224.kers'
[2026-05-26 02:43:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7121391852425647874.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17896751740034614224.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1013 rows 1069 cols 3041 entries
Finished phase 1 with 1007 SingleSign rule and 6 generalized
[2026-05-26 02:43:48] [INFO ] Computed 56 invariants in 4 ms
Computed 56 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-17896751740034614224.kers
Total runtime 6 ms.
[2026-05-26 02:43:49] [INFO ] Implicit Places using invariants in 614 ms returned []
[2026-05-26 02:43:49] [INFO ] Invariant cache hit.
[2026-05-26 02:43:57] [INFO ] Implicit Places using invariants and state equation in 7663 ms returned []
Implicit Place search using SMT with State Equation took 8307 ms to find 0 implicit places.
Running 963 sub problems to find dead transitions.
[2026-05-26 02:43:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1019 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 963 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1019/2082 variables, and 5 constraints, problems are : Problem set: 0 solved, 963 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 5/56 constraints, State Equation: 0/1069 constraints, PredecessorRefiner: 963/963 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 963 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1019 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 963 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1019 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 963 unsolved
At refinement iteration 2 (OVERLAPS) 50/1069 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 963 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1069/2082 variables, and 56 constraints, problems are : Problem set: 0 solved, 963 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 0/1069 constraints, PredecessorRefiner: 0/963 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60356ms problems are : Problem set: 0 solved, 963 unsolved
Search for dead transitions found 0 dead transitions in 60373ms
Starting structural reductions in LTL mode, iteration 1 : 1069/1208 places, 1013/1102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69061 ms. Remains : 1069/1208 places, 1013/1102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1069/1069 places, 1013/1013 transitions.
Applied a total of 0 rules in 37 ms. Remains 1069 /1069 variables (removed 0) and now considering 1013/1013 (removed 0) transitions.
[2026-05-26 02:44:57] [INFO ] Invariant cache hit.
[2026-05-26 02:44:57] [INFO ] Implicit Places using invariants in 420 ms returned []
[2026-05-26 02:44:57] [INFO ] Invariant cache hit.
[2026-05-26 02:45:05] [INFO ] Implicit Places using invariants and state equation in 7690 ms returned []
Implicit Place search using SMT with State Equation took 8117 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 8156 ms. Remains : 1069/1069 places, 1013/1013 transitions.
Support contains 54 out of 1069 places after structural reductions.
[2026-05-26 02:45:05] [INFO ] Flatten gal took : 96 ms
[2026-05-26 02:45:05] [INFO ] Flatten gal took : 50 ms
[2026-05-26 02:45:06] [INFO ] Input system was already deterministic with 1013 transitions.
Reduction of identical properties reduced properties to check from 35 to 34
RANDOM walk for 40000 steps (36 resets) in 983 ms. (40 steps per ms) remains 1/34 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
[2026-05-26 02:45:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 538/543 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/543 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 423/966 variables, 52/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/966 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1013/1979 variables, 966/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1979 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/2082 variables, 103/1125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2082 variables, 0/1125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2082 variables, 0/1125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2082/2082 variables, and 1125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1005 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 1069/1069 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 538/543 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/543 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 423/966 variables, 52/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/966 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1013/1979 variables, 966/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1979 variables, 0/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 103/2082 variables, 103/1125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2082 variables, 1/1126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2082 variables, 0/1126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2082 variables, 0/1126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2082/2082 variables, and 1126 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1454 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 1069/1069 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2469ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 333 ms.
Support contains 5 out of 1069 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1069/1069 places, 1013/1013 transitions.
Graph (complete) has 2030 edges and 1069 vertex of which 1066 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 427 transitions
Trivial Post-agglo rules discarded 427 transitions
Performed 427 trivial Post agglomeration. Transition count delta: 427
Iterating post reduction 0 with 430 rules applied. Total rules applied 431 place count 1066 transition count 583
Reduce places removed 427 places and 0 transitions.
Graph (complete) has 1121 edges and 639 vertex of which 549 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.1 ms
Discarding 90 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 428 rules applied. Total rules applied 859 place count 549 transition count 583
Drop transitions (Empty/Sink Transition effects.) removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 949 place count 549 transition count 493
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 953 place count 545 transition count 489
Iterating global reduction 3 with 4 rules applied. Total rules applied 957 place count 545 transition count 489
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 959 place count 545 transition count 487
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 937 edges and 543 vertex of which 539 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 3 rules applied. Total rules applied 962 place count 539 transition count 487
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 966 place count 539 transition count 483
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 968 place count 537 transition count 481
Iterating global reduction 6 with 2 rules applied. Total rules applied 970 place count 537 transition count 481
Free-agglomeration rule (complex) applied 47 times.
Iterating global reduction 6 with 47 rules applied. Total rules applied 1017 place count 537 transition count 434
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 6 with 47 rules applied. Total rules applied 1064 place count 490 transition count 434
Reduce places removed 48 places and 48 transitions.
Iterating global reduction 7 with 48 rules applied. Total rules applied 1112 place count 442 transition count 386
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 7 with 21 rules applied. Total rules applied 1133 place count 439 transition count 368
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 1151 place count 421 transition count 368
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 18 Pre rules applied. Total rules applied 1151 place count 421 transition count 350
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 36 rules applied. Total rules applied 1187 place count 403 transition count 350
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 1188 place count 402 transition count 350
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1188 place count 402 transition count 349
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1190 place count 401 transition count 349
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 1196 place count 398 transition count 346
Applied a total of 1196 rules in 235 ms. Remains 398 /1069 variables (removed 671) and now considering 346/1013 (removed 667) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 240 ms. Remains : 398/1069 places, 346/1013 transitions.
RANDOM walk for 40000 steps (112 resets) in 604 ms. (66 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (30 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 11130 steps, run visited all 1 properties in 69 ms. (steps per millisecond=161 )
Probabilistic random walk after 11130 steps, saw 4612 distinct states, run finished after 90 ms. (steps per millisecond=123 ) properties seen :1
Computed a total of 1069 stabilizing places and 1013 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1069 transition count 1013
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 3 out of 1069 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1069/1069 places, 1013/1013 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1062 transition count 1006
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1062 transition count 1006
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 1058 transition count 1002
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 1058 transition count 1002
Applied a total of 22 rules in 133 ms. Remains 1058 /1069 variables (removed 11) and now considering 1002/1013 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7247875868758961551.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9634854823707971528.kers'
[2026-05-26 02:45:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7247875868758961551.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9634854823707971528.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1002 rows 1058 cols 3012 entries
Finished phase 1 with 996 SingleSign rule and 6 generalized
[2026-05-26 02:45:10] [INFO ] Computed 56 invariants in 9 ms
Computed 56 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-9634854823707971528.kers
Total runtime 10 ms.
[2026-05-26 02:45:10] [INFO ] Implicit Places using invariants in 410 ms returned []
[2026-05-26 02:45:11] [INFO ] Invariant cache hit.
[2026-05-26 02:45:22] [INFO ] Implicit Places using invariants and state equation in 11747 ms returned []
Implicit Place search using SMT with State Equation took 12177 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2026-05-26 02:45:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1008 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1008/2060 variables, and 5 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 5/56 constraints, State Equation: 0/1058 constraints, PredecessorRefiner: 952/952 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 952 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1008 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1008 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 50/1058 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1058/2060 variables, and 56 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 0/1058 constraints, PredecessorRefiner: 0/952 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60231ms problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 60234ms
Starting structural reductions in LTL mode, iteration 1 : 1058/1069 places, 1002/1013 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72561 ms. Remains : 1058/1069 places, 1002/1013 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-00
Product exploration explored 100000 steps with 141 reset in 522 ms.
Product exploration explored 100000 steps with 141 reset in 519 ms.
Computed a total of 1058 stabilizing places and 1002 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1058 transition count 1002
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 7 factoid took 59 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
RANDOM walk for 3857 steps (0 resets) in 68 ms. (55 steps per ms) remains 0/3 properties
Knowledge based reduction with 7 factoid took 70 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2026-05-26 02:46:24] [INFO ] Invariant cache hit.
[2026-05-26 02:46:25] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 81 ms returned sat
[2026-05-26 02:46:39] [INFO ] [Real]Absence check using state equation in 14376 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Knowledge-based reduction took 15570 ms.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1058 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1058/1058 places, 1002/1002 transitions.
Applied a total of 0 rules in 52 ms. Remains 1058 /1058 variables (removed 0) and now considering 1002/1002 (removed 0) transitions.
[2026-05-26 02:46:40] [INFO ] Invariant cache hit.
[2026-05-26 02:46:40] [INFO ] Implicit Places using invariants in 335 ms returned []
[2026-05-26 02:46:40] [INFO ] Invariant cache hit.
[2026-05-26 02:46:52] [INFO ] Implicit Places using invariants and state equation in 11685 ms returned []
Implicit Place search using SMT with State Equation took 12024 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 12078 ms. Remains : 1058/1058 places, 1002/1002 transitions.
Computed a total of 1058 stabilizing places and 1002 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1058 transition count 1002
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 6 factoid took 49 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
RANDOM walk for 3774 steps (0 resets) in 56 ms. (66 steps per ms) remains 0/3 properties
Knowledge based reduction with 6 factoid took 72 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2026-05-26 02:46:52] [INFO ] Invariant cache hit.
[2026-05-26 02:46:53] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 83 ms returned sat
[2026-05-26 02:47:07] [INFO ] [Real]Absence check using state equation in 14383 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Knowledge-based reduction took 15552 ms.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 141 reset in 407 ms.
Product exploration explored 100000 steps with 141 reset in 440 ms.
Spot run failed in 73 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/ltsmin7181901895951331047
[2026-05-26 02:47:08] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7181901895951331047
Running compilation step : cd /tmp/ltsmin7181901895951331047;'/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 1781 ms.
Running link step : cd /tmp/ltsmin7181901895951331047;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin7181901895951331047;'/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/stateBased15128147129466649229.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1058 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1058/1058 places, 1002/1002 transitions.
Applied a total of 0 rules in 57 ms. Remains 1058 /1058 variables (removed 0) and now considering 1002/1002 (removed 0) transitions.
[2026-05-26 02:47:23] [INFO ] Invariant cache hit.
[2026-05-26 02:47:24] [INFO ] Implicit Places using invariants in 333 ms returned []
[2026-05-26 02:47:24] [INFO ] Invariant cache hit.
[2026-05-26 02:47:36] [INFO ] Implicit Places using invariants and state equation in 11740 ms returned []
Implicit Place search using SMT with State Equation took 12080 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 12138 ms. Remains : 1058/1058 places, 1002/1002 transitions.
Built C files in :
/tmp/ltsmin15165142785920376223
[2026-05-26 02:47:36] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15165142785920376223
Running compilation step : cd /tmp/ltsmin15165142785920376223;'/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 1675 ms.
Running link step : cd /tmp/ltsmin15165142785920376223;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin15165142785920376223;'/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/stateBased13991829095852335806.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 02:47:51] [INFO ] Flatten gal took : 38 ms
[2026-05-26 02:47:51] [INFO ] Flatten gal took : 42 ms
[2026-05-26 02:47:51] [INFO ] Time to serialize gal into /tmp/LTL3525614692039535803.gal : 16 ms
[2026-05-26 02:47:51] [INFO ] Time to serialize properties into /tmp/LTL17212326829442443222.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3525614692039535803.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7536600756373985286.hoa' '-atoms' '/tmp/LTL17212326829442443222.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL17212326829442443222.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7536600756373985286.hoa
Detected timeout of ITS tools.
[2026-05-26 02:48:06] [INFO ] Flatten gal took : 32 ms
[2026-05-26 02:48:06] [INFO ] Flatten gal took : 31 ms
[2026-05-26 02:48:06] [INFO ] Time to serialize gal into /tmp/LTL13683790918700556018.gal : 7 ms
[2026-05-26 02:48:06] [INFO ] Time to serialize properties into /tmp/LTL7598786694673005068.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13683790918700556018.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7598786694673005068.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(("(rcv_right_election_50_5_28_22>=1)")||(X("((newmsg27>=1)&&(election_50_6_27_to_right_26>=1))"))))))
Formula 0 simplified : XG(!"(rcv_right_election_50_5_28_22>=1)" & X!"((newmsg27>=1)&&(election_50_6_27_to_right_26>=1))")
Detected timeout of ITS tools.
[2026-05-26 02:48:21] [INFO ] Flatten gal took : 26 ms
[2026-05-26 02:48:21] [INFO ] Applying decomposition
[2026-05-26 02:48:21] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11564060377575461215.txt' '-o' '/tmp/graph11564060377575461215.bin' '-w' '/tmp/graph11564060377575461215.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11564060377575461215.bin' '-l' '-1' '-v' '-w' '/tmp/graph11564060377575461215.weights' '-q' '0' '-e' '0.001'
[2026-05-26 02:48:21] [INFO ] Decomposing Gal with order
[2026-05-26 02:48:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 02:48:21] [INFO ] Removed a total of 91 redundant transitions.
[2026-05-26 02:48:21] [INFO ] Flatten gal took : 112 ms
[2026-05-26 02:48:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2026-05-26 02:48:21] [INFO ] Time to serialize gal into /tmp/LTL6205125001397225557.gal : 13 ms
[2026-05-26 02:48:21] [INFO ] Time to serialize properties into /tmp/LTL16029693892231086001.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6205125001397225557.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16029693892231086001.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i6.u21.rcv_right_election_50_5_28_22>=1)")||(X("((i7.i1.u26.newmsg27>=1)&&(i7.i1.u100.election_50_6_27_to_right_26>=1))"))))...157
Formula 0 simplified : XG(!"(i6.u21.rcv_right_election_50_5_28_22>=1)" & X!"((i7.i1.u26.newmsg27>=1)&&(i7.i1.u100.election_50_6_27_to_right_26>=1))")
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-50-LTLFireability-00 finished in 206637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (p1||F(p2))))'
Support contains 5 out of 1069 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1069/1069 places, 1013/1013 transitions.
Reduce places removed 48 places and 48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 431 transitions
Trivial Post-agglo rules discarded 431 transitions
Performed 431 trivial Post agglomeration. Transition count delta: 431
Iterating post reduction 0 with 431 rules applied. Total rules applied 431 place count 1021 transition count 534
Reduce places removed 431 places and 0 transitions.
Iterating post reduction 1 with 431 rules applied. Total rules applied 862 place count 590 transition count 534
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 868 place count 584 transition count 528
Iterating global reduction 2 with 6 rules applied. Total rules applied 874 place count 584 transition count 528
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 876 place count 584 transition count 526
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 878 place count 582 transition count 526
Applied a total of 878 rules in 70 ms. Remains 582 /1069 variables (removed 487) and now considering 526/1013 (removed 487) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-300883814375925499.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17483172527041992959.kers'
[2026-05-26 02:48:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-300883814375925499.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17483172527041992959.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 526 rows 582 cols 1107 entries
Finished phase 1 with 520 SingleSign rule and 6 generalized
[2026-05-26 02:48:37] [INFO ] Computed 56 invariants in 2 ms
Computed 56 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17483172527041992959.kers
Total runtime 3 ms.
[2026-05-26 02:48:37] [INFO ] Implicit Places using invariants in 804 ms returned []
[2026-05-26 02:48:37] [INFO ] Invariant cache hit.
[2026-05-26 02:48:53] [INFO ] Implicit Places using invariants and state equation in 15146 ms returned []
Implicit Place search using SMT with State Equation took 15952 ms to find 0 implicit places.
[2026-05-26 02:48:53] [INFO ] Redundant transitions in 29 ms returned []
Running 433 sub problems to find dead transitions.
[2026-05-26 02:48:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (OVERLAPS) 4/493 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/493 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (OVERLAPS) 437/930 variables, 493/549 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 930/1108 variables, and 549 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 493/582 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 433 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (OVERLAPS) 4/493 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/493 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (OVERLAPS) 437/930 variables, 493/549 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/930 variables, 433/982 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 930/1108 variables, and 982 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 493/582 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 433 unsolved
Search for dead transitions found 0 dead transitions in 60068ms
Starting structural reductions in SI_LTL mode, iteration 1 : 582/1069 places, 526/1013 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76129 ms. Remains : 582/1069 places, 526/1013 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (F(p1)||p2)))'
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-02
Product exploration explored 100000 steps with 787 reset in 696 ms.
Product exploration explored 100000 steps with 780 reset in 788 ms.
Computed a total of 582 stabilizing places and 526 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 582 transition count 526
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 18 factoid took 52 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 523 steps (0 resets) in 11 ms. (43 steps per ms) remains 0/1 properties
Knowledge based reduction with 18 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
[2026-05-26 02:49:55] [INFO ] Invariant cache hit.
[2026-05-26 02:49:55] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 375 ms returned sat
[2026-05-26 02:50:10] [INFO ] [Real]Absence check using state equation in 14345 ms returned unknown
Could not prove EG (NOT p1)
Knowledge-based reduction took 15389 ms.
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 582 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 582/582 places, 526/526 transitions.
Applied a total of 0 rules in 28 ms. Remains 582 /582 variables (removed 0) and now considering 526/526 (removed 0) transitions.
[2026-05-26 02:50:10] [INFO ] Invariant cache hit.
[2026-05-26 02:50:11] [INFO ] Implicit Places using invariants in 727 ms returned []
[2026-05-26 02:50:11] [INFO ] Invariant cache hit.
[2026-05-26 02:50:26] [INFO ] Implicit Places using invariants and state equation in 15081 ms returned []
Implicit Place search using SMT with State Equation took 15818 ms to find 0 implicit places.
[2026-05-26 02:50:26] [INFO ] Redundant transitions in 11 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15866 ms. Remains : 582/582 places, 526/526 transitions.
Computed a total of 582 stabilizing places and 526 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 582 transition count 526
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 49 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 552 steps (0 resets) in 9 ms. (55 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 57 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
[2026-05-26 02:50:26] [INFO ] Invariant cache hit.
[2026-05-26 02:50:27] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 370 ms returned sat
[2026-05-26 02:50:41] [INFO ] [Real]Absence check using state equation in 14352 ms returned unknown
Could not prove EG (NOT p1)
Knowledge-based reduction took 15335 ms.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 779 reset in 683 ms.
Product exploration explored 100000 steps with 778 reset in 738 ms.
Built C files in :
/tmp/ltsmin6960324344153185617
[2026-05-26 02:50:43] [INFO ] Computing symmetric may disable matrix : 526 transitions.
[2026-05-26 02:50:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:50:43] [INFO ] Computing symmetric may enable matrix : 526 transitions.
[2026-05-26 02:50:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:50:43] [INFO ] Computing Do-Not-Accords matrix : 526 transitions.
[2026-05-26 02:50:43] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:50:43] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6960324344153185617
Running compilation step : cd /tmp/ltsmin6960324344153185617;'/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 1183 ms.
Running link step : cd /tmp/ltsmin6960324344153185617;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6960324344153185617;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9045785105431570834.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 582 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 582/582 places, 526/526 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 581 transition count 515
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 571 transition count 515
Applied a total of 20 rules in 32 ms. Remains 571 /582 variables (removed 11) and now considering 515/526 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-456259519228509739.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4723415634635147390.kers'
[2026-05-26 02:50:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-456259519228509739.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4723415634635147390.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 515 rows 571 cols 1063 entries
Finished phase 1 with 509 SingleSign rule and 6 generalized
[2026-05-26 02:50:58] [INFO ] Computed 56 invariants in 2 ms
Computed 56 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4723415634635147390.kers
Total runtime 4 ms.
[2026-05-26 02:50:58] [INFO ] Implicit Places using invariants in 727 ms returned []
[2026-05-26 02:50:58] [INFO ] Invariant cache hit.
[2026-05-26 02:51:13] [INFO ] Implicit Places using invariants and state equation in 14473 ms returned []
Implicit Place search using SMT with State Equation took 15206 ms to find 0 implicit places.
[2026-05-26 02:51:13] [INFO ] Redundant transitions in 3 ms returned []
Running 419 sub problems to find dead transitions.
[2026-05-26 02:51:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (OVERLAPS) 3/478 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (OVERLAPS) 422/900 variables, 478/534 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 900/1086 variables, and 534 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 478/571 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 419 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (OVERLAPS) 3/478 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (OVERLAPS) 422/900 variables, 478/534 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/900 variables, 419/953 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 900/1086 variables, and 953 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 478/571 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60067ms problems are : Problem set: 0 solved, 419 unsolved
Search for dead transitions found 0 dead transitions in 60068ms
Starting structural reductions in SI_LTL mode, iteration 1 : 571/582 places, 515/526 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75316 ms. Remains : 571/582 places, 515/526 transitions.
Built C files in :
/tmp/ltsmin3144081379606205033
[2026-05-26 02:52:13] [INFO ] Computing symmetric may disable matrix : 515 transitions.
[2026-05-26 02:52:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:52:13] [INFO ] Computing symmetric may enable matrix : 515 transitions.
[2026-05-26 02:52:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:52:13] [INFO ] Computing Do-Not-Accords matrix : 515 transitions.
[2026-05-26 02:52:13] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:52:13] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3144081379606205033
Running compilation step : cd /tmp/ltsmin3144081379606205033;'/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 1165 ms.
Running link step : cd /tmp/ltsmin3144081379606205033;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin3144081379606205033;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4331721435315556117.hoa' '--buchi-type=spotba'
LTSmin run took 8030 ms.
FORMULA HirschbergSinclair-PT-50-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-50-LTLFireability-02 finished in 225664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((((p0 U G(p1))&&X(X(F(p2)))) U X(p3)))))'
Support contains 5 out of 1069 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1069/1069 places, 1013/1013 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1062 transition count 1006
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1062 transition count 1006
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 1058 transition count 1002
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 1058 transition count 1002
Applied a total of 22 rules in 135 ms. Remains 1058 /1069 variables (removed 11) and now considering 1002/1013 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10990010799999997949.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17574662676478329692.kers'
[2026-05-26 02:52:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10990010799999997949.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17574662676478329692.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1002 rows 1058 cols 3012 entries
Finished phase 1 with 996 SingleSign rule and 6 generalized
[2026-05-26 02:52:22] [INFO ] Computed 56 invariants in 5 ms
Computed 56 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-17574662676478329692.kers
Total runtime 7 ms.
[2026-05-26 02:52:23] [INFO ] Implicit Places using invariants in 356 ms returned []
[2026-05-26 02:52:23] [INFO ] Invariant cache hit.
[2026-05-26 02:52:34] [INFO ] Implicit Places using invariants and state equation in 11583 ms returned []
Implicit Place search using SMT with State Equation took 11940 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2026-05-26 02:52:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1008 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1008/2060 variables, and 5 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 5/56 constraints, State Equation: 0/1058 constraints, PredecessorRefiner: 952/952 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 952 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1008 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1008 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 50/1058 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1058/2060 variables, and 56 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 0/1058 constraints, PredecessorRefiner: 0/952 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 60183ms
Starting structural reductions in LTL mode, iteration 1 : 1058/1069 places, 1002/1013 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72264 ms. Remains : 1058/1069 places, 1002/1013 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((((p0 U G(p1))&&X(X(F(p2)))) U X(p3)))))'
Stuttering acceptance computed with spot in 419 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-03
Entered a terminal (fully accepting) state of product in 42 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-50-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-50-LTLFireability-03 finished in 72753 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F((F(p1)&&(X(!p0)||p2))))))'
Support contains 5 out of 1069 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1069/1069 places, 1013/1013 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1062 transition count 1006
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1062 transition count 1006
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 1058 transition count 1002
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 1058 transition count 1002
Applied a total of 22 rules in 133 ms. Remains 1058 /1069 variables (removed 11) and now considering 1002/1013 (removed 11) transitions.
[2026-05-26 02:53:35] [INFO ] Invariant cache hit.
[2026-05-26 02:53:35] [INFO ] Implicit Places using invariants in 319 ms returned []
[2026-05-26 02:53:35] [INFO ] Invariant cache hit.
[2026-05-26 02:53:47] [INFO ] Implicit Places using invariants and state equation in 11591 ms returned []
Implicit Place search using SMT with State Equation took 11913 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 1058/1069 places, 1002/1013 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12049 ms. Remains : 1058/1069 places, 1002/1013 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F((F(p1)&&(X(!p0)||p2))))))'
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p1) (AND p0 (NOT p2))), (NOT p1), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-04
Product exploration explored 100000 steps with 296 reset in 396 ms.
Product exploration explored 100000 steps with 287 reset in 450 ms.
Computed a total of 1058 stabilizing places and 1002 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1058 transition count 1002
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 12 factoid took 52 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 2836 steps (0 resets) in 21 ms. (128 steps per ms) remains 0/1 properties
Knowledge based reduction with 12 factoid took 55 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
[2026-05-26 02:53:49] [INFO ] Invariant cache hit.
[2026-05-26 02:53:49] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 75 ms returned sat
[2026-05-26 02:54:04] [INFO ] [Real]Absence check using state equation in 14377 ms returned unknown
Could not prove EG (NOT p0)
Knowledge-based reduction took 15466 ms.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1058 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1058/1058 places, 1002/1002 transitions.
Reduce places removed 48 places and 48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 430 transitions
Trivial Post-agglo rules discarded 430 transitions
Performed 430 trivial Post agglomeration. Transition count delta: 430
Iterating post reduction 0 with 430 rules applied. Total rules applied 430 place count 1010 transition count 524
Reduce places removed 430 places and 0 transitions.
Iterating post reduction 1 with 430 rules applied. Total rules applied 860 place count 580 transition count 524
Applied a total of 860 rules in 37 ms. Remains 580 /1058 variables (removed 478) and now considering 524/1002 (removed 478) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-827886377683089151.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3093284349426598097.kers'
[2026-05-26 02:54:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-827886377683089151.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3093284349426598097.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 524 rows 580 cols 1100 entries
Finished phase 1 with 518 SingleSign rule and 6 generalized
[2026-05-26 02:54:04] [INFO ] Computed 56 invariants in 2 ms
Computed 56 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3093284349426598097.kers
Total runtime 4 ms.
[2026-05-26 02:54:04] [INFO ] Implicit Places using invariants in 788 ms returned []
[2026-05-26 02:54:04] [INFO ] Invariant cache hit.
[2026-05-26 02:54:20] [INFO ] Implicit Places using invariants and state equation in 15136 ms returned []
Implicit Place search using SMT with State Equation took 15926 ms to find 0 implicit places.
[2026-05-26 02:54:20] [INFO ] Redundant transitions in 3 ms returned []
Running 431 sub problems to find dead transitions.
[2026-05-26 02:54:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/487 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (OVERLAPS) 4/491 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (OVERLAPS) 435/926 variables, 491/547 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 926/1104 variables, and 547 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 491/580 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 431 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/487 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (OVERLAPS) 4/491 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (OVERLAPS) 435/926 variables, 491/547 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/926 variables, 431/978 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 926/1104 variables, and 978 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 491/580 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60068ms problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in SI_LTL mode, iteration 1 : 580/1058 places, 524/1002 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76045 ms. Remains : 580/1058 places, 524/1002 transitions.
Computed a total of 580 stabilizing places and 524 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 580 transition count 524
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 41 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 1476 steps (0 resets) in 15 ms. (92 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 66 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
[2026-05-26 02:55:20] [INFO ] Invariant cache hit.
[2026-05-26 02:55:20] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 85 ms returned sat
[2026-05-26 02:55:35] [INFO ] [Real]Absence check using state equation in 14625 ms returned unknown
Could not prove EG (NOT p0)
Knowledge-based reduction took 15354 ms.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 287 reset in 376 ms.
Product exploration explored 100000 steps with 287 reset in 410 ms.
Built C files in :
/tmp/ltsmin5207494019134667077
[2026-05-26 02:55:36] [INFO ] Computing symmetric may disable matrix : 524 transitions.
[2026-05-26 02:55:36] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:55:36] [INFO ] Computing symmetric may enable matrix : 524 transitions.
[2026-05-26 02:55:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:55:36] [INFO ] Computing Do-Not-Accords matrix : 524 transitions.
[2026-05-26 02:55:36] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:55:36] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5207494019134667077
Running compilation step : cd /tmp/ltsmin5207494019134667077;'/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 1172 ms.
Running link step : cd /tmp/ltsmin5207494019134667077;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin5207494019134667077;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5986943330193797274.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 580 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 580/580 places, 524/524 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 579 transition count 514
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 570 transition count 514
Applied a total of 18 rules in 27 ms. Remains 570 /580 variables (removed 10) and now considering 514/524 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7788547062410127755.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12006846452914516164.kers'
[2026-05-26 02:55:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7788547062410127755.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12006846452914516164.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 514 rows 570 cols 1060 entries
Finished phase 1 with 508 SingleSign rule and 6 generalized
[2026-05-26 02:55:51] [INFO ] Computed 56 invariants in 2 ms
Computed 56 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12006846452914516164.kers
Total runtime 4 ms.
[2026-05-26 02:55:52] [INFO ] Implicit Places using invariants in 826 ms returned []
[2026-05-26 02:55:52] [INFO ] Invariant cache hit.
[2026-05-26 02:56:06] [INFO ] Implicit Places using invariants and state equation in 14409 ms returned []
Implicit Place search using SMT with State Equation took 15236 ms to find 0 implicit places.
[2026-05-26 02:56:06] [INFO ] Redundant transitions in 8 ms returned []
Running 418 sub problems to find dead transitions.
[2026-05-26 02:56:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (OVERLAPS) 3/477 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (OVERLAPS) 421/898 variables, 477/533 constraints. Problems are: Problem set: 0 solved, 418 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/1084 variables, and 533 constraints, problems are : Problem set: 0 solved, 418 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 477/570 constraints, PredecessorRefiner: 418/418 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 418 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (OVERLAPS) 3/477 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (OVERLAPS) 421/898 variables, 477/533 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/898 variables, 418/951 constraints. Problems are: Problem set: 0 solved, 418 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/1084 variables, and 951 constraints, problems are : Problem set: 0 solved, 418 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 477/570 constraints, PredecessorRefiner: 418/418 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 418 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Starting structural reductions in SI_LTL mode, iteration 1 : 570/580 places, 514/524 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75348 ms. Remains : 570/580 places, 514/524 transitions.
Built C files in :
/tmp/ltsmin3129798359291386930
[2026-05-26 02:57:06] [INFO ] Computing symmetric may disable matrix : 514 transitions.
[2026-05-26 02:57:06] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:57:06] [INFO ] Computing symmetric may enable matrix : 514 transitions.
[2026-05-26 02:57:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:57:06] [INFO ] Computing Do-Not-Accords matrix : 514 transitions.
[2026-05-26 02:57:06] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 02:57:06] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3129798359291386930
Running compilation step : cd /tmp/ltsmin3129798359291386930;'/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 1166 ms.
Running link step : cd /tmp/ltsmin3129798359291386930;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin3129798359291386930;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14224631793834570316.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 02:57:21] [INFO ] Flatten gal took : 9 ms
[2026-05-26 02:57:21] [INFO ] Flatten gal took : 9 ms
[2026-05-26 02:57:21] [INFO ] Time to serialize gal into /tmp/LTL166819893765372616.gal : 4 ms
[2026-05-26 02:57:21] [INFO ] Time to serialize properties into /tmp/LTL10797834502359191967.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL166819893765372616.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17510189717308351335.hoa' '-atoms' '/tmp/LTL10797834502359191967.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10797834502359191967.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17510189717308351335.hoa
Detected timeout of ITS tools.
[2026-05-26 02:57:37] [INFO ] Flatten gal took : 9 ms
[2026-05-26 02:57:37] [INFO ] Flatten gal took : 9 ms
[2026-05-26 02:57:37] [INFO ] Time to serialize gal into /tmp/LTL9949027172265465913.gal : 3 ms
[2026-05-26 02:57:37] [INFO ] Time to serialize properties into /tmp/LTL6065753080401046370.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9949027172265465913.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6065753080401046370.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F("((newmsg19>=1)&&(election_50_5_31_to_left_20>=1))"))&&(X(F((F("(rcv_left_election_50_5_22_22<1)"))&&(("((newmsg14<1)||(elected_...236
Formula 0 simplified : G!"((newmsg19>=1)&&(election_50_5_31_to_left_20>=1))" | XG(G!"(rcv_left_election_50_5_22_22<1)" | (!"((newmsg14<1)||(elected_50_to_l...222
Detected timeout of ITS tools.
[2026-05-26 02:57:52] [INFO ] Flatten gal took : 7 ms
[2026-05-26 02:57:52] [INFO ] Applying decomposition
[2026-05-26 02:57:52] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16363598626525792640.txt' '-o' '/tmp/graph16363598626525792640.bin' '-w' '/tmp/graph16363598626525792640.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16363598626525792640.bin' '-l' '-1' '-v' '-w' '/tmp/graph16363598626525792640.weights' '-q' '0' '-e' '0.001'
[2026-05-26 02:57:52] [INFO ] Decomposing Gal with order
[2026-05-26 02:57:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 02:57:52] [INFO ] Removed a total of 336 redundant transitions.
[2026-05-26 02:57:52] [INFO ] Flatten gal took : 44 ms
[2026-05-26 02:57:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 8 ms.
[2026-05-26 02:57:52] [INFO ] Time to serialize gal into /tmp/LTL1127054684862560404.gal : 14 ms
[2026-05-26 02:57:52] [INFO ] Time to serialize properties into /tmp/LTL17089632455318479117.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1127054684862560404.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17089632455318479117.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F("((i4.u1.newmsg19>=1)&&(i7.u2.election_50_5_31_to_left_20>=1))"))&&(X(F((F("(i7.u151.rcv_left_election_50_5_22_22<1)"))&&(("((i0...282
Formula 0 simplified : G!"((i4.u1.newmsg19>=1)&&(i7.u2.election_50_5_31_to_left_20>=1))" | XG(G!"(i7.u151.rcv_left_election_50_5_22_22<1)" | (!"((i0.u0.new...268
Reverse transition relation is NOT exact ! Due to transitions t70_t71, t86_t87, t107_t108, t128_t129, t183_t184, t249_t250, t427_t428, t813_t814, t937_t938...891
Computing Next relation with stutter on 1.06581e+36 deadlock states
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-50-LTLFireability-04 finished in 271863 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p1)&&p0) U X(X(p2)))))'
Support contains 3 out of 1069 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1069/1069 places, 1013/1013 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1062 transition count 1006
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1062 transition count 1006
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 1058 transition count 1002
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 1058 transition count 1002
Applied a total of 22 rules in 140 ms. Remains 1058 /1069 variables (removed 11) and now considering 1002/1013 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-282465811631179041.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8756353678701491336.kers'
[2026-05-26 02:58:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-282465811631179041.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8756353678701491336.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1002 rows 1058 cols 3012 entries
Finished phase 1 with 996 SingleSign rule and 6 generalized
[2026-05-26 02:58:07] [INFO ] Computed 56 invariants in 4 ms
Computed 56 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8756353678701491336.kers
Total runtime 7 ms.
[2026-05-26 02:58:07] [INFO ] Implicit Places using invariants in 330 ms returned []
[2026-05-26 02:58:07] [INFO ] Invariant cache hit.
[2026-05-26 02:58:19] [INFO ] Implicit Places using invariants and state equation in 11483 ms returned []
Implicit Place search using SMT with State Equation took 11816 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2026-05-26 02:58:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1008 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1008/2060 variables, and 5 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 5/56 constraints, State Equation: 0/1058 constraints, PredecessorRefiner: 952/952 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 952 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1008 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1008 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 50/1058 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1058/2060 variables, and 56 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 0/1058 constraints, PredecessorRefiner: 0/952 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60160ms problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Starting structural reductions in LTL mode, iteration 1 : 1058/1069 places, 1002/1013 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72127 ms. Remains : 1058/1069 places, 1002/1013 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p1)&&p0) U X(X(p2)))))'
Stuttering acceptance computed with spot in 337 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-05
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-50-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-50-LTLFireability-05 finished in 72508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||(F(p1) U !p2)))&&X(X(X(G(p3))))))'
Support contains 7 out of 1069 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1069/1069 places, 1013/1013 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1062 transition count 1006
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1062 transition count 1006
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 1058 transition count 1002
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 1058 transition count 1002
Applied a total of 22 rules in 125 ms. Remains 1058 /1069 variables (removed 11) and now considering 1002/1013 (removed 11) transitions.
[2026-05-26 02:59:19] [INFO ] Invariant cache hit.
[2026-05-26 02:59:20] [INFO ] Implicit Places using invariants in 323 ms returned []
[2026-05-26 02:59:20] [INFO ] Invariant cache hit.
[2026-05-26 02:59:30] [INFO ] Implicit Places using invariants and state equation in 10640 ms returned []
Implicit Place search using SMT with State Equation took 10966 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 1058/1069 places, 1002/1013 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11093 ms. Remains : 1058/1069 places, 1002/1013 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||(F(p1) U !p2)))&&X(X(X(G(p3))))))'
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p3) (AND (NOT p0) p2)), (NOT p1), p2, (AND (NOT p0) p2), (NOT p3), (NOT p3), (NOT p3), true]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-06
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-50-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-50-LTLFireability-06 finished in 11445 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 4 out of 1069 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1069/1069 places, 1013/1013 transitions.
Reduce places removed 48 places and 48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 430 transitions
Trivial Post-agglo rules discarded 430 transitions
Performed 430 trivial Post agglomeration. Transition count delta: 430
Iterating post reduction 0 with 430 rules applied. Total rules applied 430 place count 1021 transition count 535
Reduce places removed 430 places and 0 transitions.
Iterating post reduction 1 with 430 rules applied. Total rules applied 860 place count 591 transition count 535
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 867 place count 584 transition count 528
Iterating global reduction 2 with 7 rules applied. Total rules applied 874 place count 584 transition count 528
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 877 place count 584 transition count 525
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 880 place count 581 transition count 525
Applied a total of 880 rules in 55 ms. Remains 581 /1069 variables (removed 488) and now considering 525/1013 (removed 488) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9141541956358140318.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16380280903079881194.kers'
[2026-05-26 02:59:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9141541956358140318.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16380280903079881194.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 525 rows 581 cols 1104 entries
Finished phase 1 with 519 SingleSign rule and 6 generalized
[2026-05-26 02:59:31] [INFO ] Computed 56 invariants in 2 ms
Computed 56 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16380280903079881194.kers
Total runtime 3 ms.
[2026-05-26 02:59:32] [INFO ] Implicit Places using invariants in 745 ms returned []
[2026-05-26 02:59:32] [INFO ] Invariant cache hit.
[2026-05-26 02:59:46] [INFO ] Implicit Places using invariants and state equation in 14191 ms returned []
Implicit Place search using SMT with State Equation took 14940 ms to find 0 implicit places.
[2026-05-26 02:59:46] [INFO ] Redundant transitions in 5 ms returned []
Running 432 sub problems to find dead transitions.
[2026-05-26 02:59:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/488 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (OVERLAPS) 4/492 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/492 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (OVERLAPS) 436/928 variables, 492/548 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 928/1106 variables, and 548 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 492/581 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/488 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (OVERLAPS) 4/492 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/492 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (OVERLAPS) 436/928 variables, 492/548 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/928 variables, 432/980 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 928/1106 variables, and 980 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 492/581 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60064ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Starting structural reductions in SI_LTL mode, iteration 1 : 581/1069 places, 525/1013 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75075 ms. Remains : 581/1069 places, 525/1013 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 38 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-07
Stuttering criterion allowed to conclude after 577 steps with 0 reset in 3 ms.
FORMULA HirschbergSinclair-PT-50-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-50-LTLFireability-07 finished in 75153 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)&&G((G(p1)||X(X(p2))))))'
Support contains 5 out of 1069 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1069/1069 places, 1013/1013 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1064 transition count 1008
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1064 transition count 1008
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 1061 transition count 1005
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 1061 transition count 1005
Applied a total of 16 rules in 128 ms. Remains 1061 /1069 variables (removed 8) and now considering 1005/1013 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-723236552352200887.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9835502561087164265.kers'
[2026-05-26 03:00:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-723236552352200887.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9835502561087164265.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1005 rows 1061 cols 3020 entries
Finished phase 1 with 999 SingleSign rule and 6 generalized
[2026-05-26 03:00:46] [INFO ] Computed 56 invariants in 5 ms
Computed 56 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-9835502561087164265.kers
Total runtime 8 ms.
[2026-05-26 03:00:46] [INFO ] Implicit Places using invariants in 335 ms returned []
[2026-05-26 03:00:46] [INFO ] Invariant cache hit.
[2026-05-26 03:00:57] [INFO ] Implicit Places using invariants and state equation in 10840 ms returned []
Implicit Place search using SMT with State Equation took 11192 ms to find 0 implicit places.
Running 955 sub problems to find dead transitions.
[2026-05-26 03:00:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1011 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 955 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1011/2066 variables, and 5 constraints, problems are : Problem set: 0 solved, 955 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 5/56 constraints, State Equation: 0/1061 constraints, PredecessorRefiner: 955/955 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 955 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1011 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 955 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1011 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 955 unsolved
At refinement iteration 2 (OVERLAPS) 50/1061 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 955 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1061/2066 variables, and 56 constraints, problems are : Problem set: 0 solved, 955 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 0/1061 constraints, PredecessorRefiner: 0/955 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60169ms problems are : Problem set: 0 solved, 955 unsolved
Search for dead transitions found 0 dead transitions in 60172ms
Starting structural reductions in LTL mode, iteration 1 : 1061/1069 places, 1005/1013 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71497 ms. Remains : 1061/1069 places, 1005/1013 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)&&G((G(p1)||X(X(p2))))))'
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) p2)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-08
Product exploration explored 100000 steps with 24982 reset in 465 ms.
Product exploration explored 100000 steps with 25132 reset in 480 ms.
Computed a total of 1061 stabilizing places and 1005 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1061 transition count 1005
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 10 factoid took 90 ms. Reduced automaton from 9 states, 17 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (36 resets) in 249 ms. (160 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
[2026-05-26 03:01:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 525/529 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 434/963 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/963 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1005/1968 variables, 963/1019 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1968 variables, 0/1019 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 98/2066 variables, 98/1117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2066 variables, 0/1117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2066 variables, 0/1117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2066/2066 variables, and 1117 constraints, problems are : Problem set: 0 solved, 1 unsolved in 875 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 1061/1061 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 525/529 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 434/963 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/963 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1005/1968 variables, 963/1019 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1968 variables, 0/1019 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 98/2066 variables, 98/1117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2066 variables, 1/1118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2066 variables, 0/1118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2066 variables, 0/1118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2066/2066 variables, and 1118 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1228 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 1061/1061 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2112ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 226 ms.
Support contains 4 out of 1061 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1061/1061 places, 1005/1005 transitions.
Graph (complete) has 2019 edges and 1061 vertex of which 1044 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 434 transitions
Trivial Post-agglo rules discarded 434 transitions
Performed 434 trivial Post agglomeration. Transition count delta: 434
Iterating post reduction 0 with 451 rules applied. Total rules applied 452 place count 1044 transition count 554
Reduce places removed 434 places and 0 transitions.
Graph (complete) has 1069 edges and 610 vertex of which 518 are kept as prefixes of interest. Removing 92 places using SCC suffix rule.1 ms
Discarding 92 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 435 rules applied. Total rules applied 887 place count 518 transition count 554
Drop transitions (Empty/Sink Transition effects.) removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 979 place count 518 transition count 462
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 981 place count 516 transition count 460
Iterating global reduction 3 with 2 rules applied. Total rules applied 983 place count 516 transition count 460
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 985 place count 514 transition count 458
Iterating global reduction 3 with 2 rules applied. Total rules applied 987 place count 514 transition count 458
Free-agglomeration rule (complex) applied 32 times.
Iterating global reduction 3 with 32 rules applied. Total rules applied 1019 place count 514 transition count 426
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 1051 place count 482 transition count 426
Reduce places removed 47 places and 47 transitions.
Iterating global reduction 4 with 47 rules applied. Total rules applied 1098 place count 435 transition count 379
Reduce places removed 16 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 4 with 128 rules applied. Total rules applied 1226 place count 419 transition count 267
Reduce places removed 112 places and 0 transitions.
Iterating post reduction 5 with 112 rules applied. Total rules applied 1338 place count 307 transition count 267
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 16 Pre rules applied. Total rules applied 1338 place count 307 transition count 251
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1370 place count 291 transition count 251
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 1371 place count 290 transition count 251
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1371 place count 290 transition count 250
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1373 place count 289 transition count 250
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1377 place count 287 transition count 248
Applied a total of 1377 rules in 116 ms. Remains 287 /1061 variables (removed 774) and now considering 248/1005 (removed 757) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 287/1061 places, 248/1005 transitions.
RANDOM walk for 40000 steps (156 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 2927 steps (0 resets) in 9 ms. (292 steps per ms) remains 0/1 properties
Negative knowledge disproves property using: (G (OR p1 p2))
Knowledge based reduction with 10 factoid took 110 ms. Proved property starting from automaton with 8 states, 13 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 3102 ms.
FORMULA HirschbergSinclair-PT-50-LTLFireability-08 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property HirschbergSinclair-PT-50-LTLFireability-08 finished in 75894 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(G(p2))))'
Support contains 6 out of 1069 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1069/1069 places, 1013/1013 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1064 transition count 1008
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1064 transition count 1008
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 1061 transition count 1005
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 1061 transition count 1005
Applied a total of 16 rules in 168 ms. Remains 1061 /1069 variables (removed 8) and now considering 1005/1013 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17625510139425601097.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2098003887164460671.kers'
[2026-05-26 03:02:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17625510139425601097.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2098003887164460671.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1005 rows 1061 cols 3020 entries
Finished phase 1 with 999 SingleSign rule and 6 generalized
[2026-05-26 03:02:02] [INFO ] Computed 56 invariants in 5 ms
Computed 56 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-2098003887164460671.kers
Total runtime 8 ms.
[2026-05-26 03:02:02] [INFO ] Implicit Places using invariants in 331 ms returned []
[2026-05-26 03:02:02] [INFO ] Invariant cache hit.
[2026-05-26 03:02:13] [INFO ] Implicit Places using invariants and state equation in 10413 ms returned []
Implicit Place search using SMT with State Equation took 10748 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 1061/1069 places, 1005/1013 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10918 ms. Remains : 1061/1069 places, 1005/1013 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(G(p2))))'
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-10
Product exploration explored 100000 steps with 90 reset in 344 ms.
Product exploration explored 100000 steps with 90 reset in 369 ms.
Computed a total of 1061 stabilizing places and 1005 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1061 transition count 1005
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 20 factoid took 50 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (36 resets) in 301 ms. (132 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 424447 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :0 out of 1
Probabilistic random walk after 424447 steps, saw 119474 distinct states, run finished after 3003 ms. (steps per millisecond=141 ) properties seen :0
[2026-05-26 03:02:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 538/543 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/543 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 420/963 variables, 52/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/963 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1005/1968 variables, 963/1019 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1968 variables, 0/1019 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 98/2066 variables, 98/1117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2066 variables, 0/1117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2066 variables, 0/1117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2066/2066 variables, and 1117 constraints, problems are : Problem set: 0 solved, 1 unsolved in 849 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 1061/1061 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 538/543 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/543 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 420/963 variables, 52/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/963 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1005/1968 variables, 963/1019 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1968 variables, 0/1019 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 98/2066 variables, 98/1117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2066 variables, 1/1118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2066 variables, 0/1118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2066 variables, 0/1118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2066/2066 variables, and 1118 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1265 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 1061/1061 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2129ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 208 ms.
Support contains 5 out of 1061 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1061/1061 places, 1005/1005 transitions.
Graph (complete) has 2019 edges and 1061 vertex of which 1058 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 426 transitions
Trivial Post-agglo rules discarded 426 transitions
Performed 426 trivial Post agglomeration. Transition count delta: 426
Iterating post reduction 0 with 429 rules applied. Total rules applied 430 place count 1058 transition count 576
Reduce places removed 426 places and 0 transitions.
Graph (complete) has 1113 edges and 632 vertex of which 541 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.1 ms
Discarding 91 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 427 rules applied. Total rules applied 857 place count 541 transition count 576
Drop transitions (Empty/Sink Transition effects.) removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Iterating post reduction 2 with 91 rules applied. Total rules applied 948 place count 541 transition count 485
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 950 place count 539 transition count 483
Iterating global reduction 3 with 2 rules applied. Total rules applied 952 place count 539 transition count 483
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 954 place count 537 transition count 481
Iterating global reduction 3 with 2 rules applied. Total rules applied 956 place count 537 transition count 481
Free-agglomeration rule (complex) applied 47 times.
Iterating global reduction 3 with 47 rules applied. Total rules applied 1003 place count 537 transition count 434
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 3 with 47 rules applied. Total rules applied 1050 place count 490 transition count 434
Reduce places removed 48 places and 48 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1098 place count 442 transition count 386
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 4 with 21 rules applied. Total rules applied 1119 place count 439 transition count 368
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 1137 place count 421 transition count 368
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 18 Pre rules applied. Total rules applied 1137 place count 421 transition count 350
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 1173 place count 403 transition count 350
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 1174 place count 402 transition count 350
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1174 place count 402 transition count 349
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1176 place count 401 transition count 349
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1182 place count 398 transition count 346
Applied a total of 1182 rules in 105 ms. Remains 398 /1061 variables (removed 663) and now considering 346/1005 (removed 659) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 398/1061 places, 346/1005 transitions.
RANDOM walk for 40000 steps (112 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (28 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 11130 steps, run visited all 1 properties in 58 ms. (steps per millisecond=191 )
Probabilistic random walk after 11130 steps, saw 4612 distinct states, run finished after 58 ms. (steps per millisecond=191 ) properties seen :1
Negative knowledge disproves property using: (G p2)
Knowledge based reduction with 20 factoid took 33 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 6066 ms.
FORMULA HirschbergSinclair-PT-50-LTLFireability-10 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property HirschbergSinclair-PT-50-LTLFireability-10 finished in 17900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F((p1||G(p2))))))'
Support contains 7 out of 1069 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1069/1069 places, 1013/1013 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1063 transition count 1007
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1063 transition count 1007
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 1059 transition count 1003
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 1059 transition count 1003
Applied a total of 20 rules in 133 ms. Remains 1059 /1069 variables (removed 10) and now considering 1003/1013 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-808753056980278294.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-145704002526524536.kers'
[2026-05-26 03:02:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-808753056980278294.kers, --Pflows, --basisKERS=/tmp/petrispot-output-145704002526524536.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1003 rows 1059 cols 3015 entries
Finished phase 1 with 997 SingleSign rule and 6 generalized
[2026-05-26 03:02:20] [INFO ] Computed 56 invariants in 5 ms
Computed 56 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-145704002526524536.kers
Total runtime 9 ms.
[2026-05-26 03:02:20] [INFO ] Implicit Places using invariants in 362 ms returned []
[2026-05-26 03:02:20] [INFO ] Invariant cache hit.
[2026-05-26 03:02:31] [INFO ] Implicit Places using invariants and state equation in 10545 ms returned []
Implicit Place search using SMT with State Equation took 10910 ms to find 0 implicit places.
Running 953 sub problems to find dead transitions.
[2026-05-26 03:02:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1009 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 953 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1009/2062 variables, and 5 constraints, problems are : Problem set: 0 solved, 953 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 5/56 constraints, State Equation: 0/1059 constraints, PredecessorRefiner: 953/953 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 953 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1009 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 953 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1009 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 953 unsolved
At refinement iteration 2 (OVERLAPS) 50/1059 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 953 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1059/2062 variables, and 56 constraints, problems are : Problem set: 0 solved, 953 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 0/1059 constraints, PredecessorRefiner: 0/953 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60175ms problems are : Problem set: 0 solved, 953 unsolved
Search for dead transitions found 0 dead transitions in 60178ms
Starting structural reductions in LTL mode, iteration 1 : 1059/1069 places, 1003/1013 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71226 ms. Remains : 1059/1069 places, 1003/1013 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F((p1||G(p2))))))'
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 447 ms.
Product exploration explored 100000 steps with 50000 reset in 462 ms.
Computed a total of 1059 stabilizing places and 1003 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1059 transition count 1003
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 11 factoid took 14 ms. Proved property starting from automaton with 3 states, 5 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 264 ms.
FORMULA HirschbergSinclair-PT-50-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-50-LTLFireability-11 finished in 72558 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) U G((p1||X((G(p2) U (p1&&G(p2))))))))))'
Support contains 4 out of 1069 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1069/1069 places, 1013/1013 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1063 transition count 1007
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1063 transition count 1007
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 1060 transition count 1004
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 1060 transition count 1004
Applied a total of 18 rules in 134 ms. Remains 1060 /1069 variables (removed 9) and now considering 1004/1013 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3101990858259659884.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13978878275443534532.kers'
[2026-05-26 03:03:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3101990858259659884.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13978878275443534532.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1004 rows 1060 cols 3017 entries
Finished phase 1 with 998 SingleSign rule and 6 generalized
[2026-05-26 03:03:32] [INFO ] Computed 56 invariants in 4 ms
Computed 56 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-13978878275443534532.kers
Total runtime 8 ms.
[2026-05-26 03:03:33] [INFO ] Implicit Places using invariants in 362 ms returned []
[2026-05-26 03:03:33] [INFO ] Invariant cache hit.
[2026-05-26 03:03:44] [INFO ] Implicit Places using invariants and state equation in 10739 ms returned []
Implicit Place search using SMT with State Equation took 11103 ms to find 0 implicit places.
Running 954 sub problems to find dead transitions.
[2026-05-26 03:03:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1010 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1010/2064 variables, and 5 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 5/56 constraints, State Equation: 0/1060 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 954 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1010 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1010 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 954 unsolved
At refinement iteration 2 (OVERLAPS) 50/1060 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1060/2064 variables, and 56 constraints, problems are : Problem set: 0 solved, 954 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 0/1060 constraints, PredecessorRefiner: 0/954 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 954 unsolved
Search for dead transitions found 0 dead transitions in 60177ms
Starting structural reductions in LTL mode, iteration 1 : 1060/1069 places, 1004/1013 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71420 ms. Remains : 1060/1069 places, 1004/1013 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) U G((p1||X((G(p2) U (p1&&G(p2))))))))))'
Stuttering acceptance computed with spot in 452 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-12
Entered a terminal (fully accepting) state of product in 638 steps with 0 reset in 3 ms.
FORMULA HirschbergSinclair-PT-50-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-50-LTLFireability-12 finished in 71931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U p1)))'
Support contains 3 out of 1069 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1069/1069 places, 1013/1013 transitions.
Reduce places removed 48 places and 48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 435 transitions
Trivial Post-agglo rules discarded 435 transitions
Performed 435 trivial Post agglomeration. Transition count delta: 435
Iterating post reduction 0 with 435 rules applied. Total rules applied 435 place count 1021 transition count 530
Reduce places removed 435 places and 0 transitions.
Iterating post reduction 1 with 435 rules applied. Total rules applied 870 place count 586 transition count 530
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 877 place count 579 transition count 523
Iterating global reduction 2 with 7 rules applied. Total rules applied 884 place count 579 transition count 523
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 887 place count 579 transition count 520
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 890 place count 576 transition count 520
Applied a total of 890 rules in 43 ms. Remains 576 /1069 variables (removed 493) and now considering 520/1013 (removed 493) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-228983167249417208.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11806722264446689259.kers'
[2026-05-26 03:04:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-228983167249417208.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11806722264446689259.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 520 rows 576 cols 1084 entries
Finished phase 1 with 514 SingleSign rule and 6 generalized
[2026-05-26 03:04:44] [INFO ] Computed 56 invariants in 5 ms
Computed 56 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-11806722264446689259.kers
Total runtime 9 ms.
[2026-05-26 03:04:45] [INFO ] Implicit Places using invariants in 773 ms returned []
[2026-05-26 03:04:45] [INFO ] Invariant cache hit.
[2026-05-26 03:04:45] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-26 03:05:03] [INFO ] Implicit Places using invariants and state equation in 17925 ms returned []
Implicit Place search using SMT with State Equation took 18699 ms to find 0 implicit places.
[2026-05-26 03:05:03] [INFO ] Redundant transitions in 3 ms returned []
Running 426 sub problems to find dead transitions.
[2026-05-26 03:05:03] [INFO ] Invariant cache hit.
[2026-05-26 03:05:03] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 3/485 variables, 52/56 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/485 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 429/914 variables, 485/541 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/914 variables, 7/548 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 914/1096 variables, and 548 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 485/576 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 3/485 variables, 52/56 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/485 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (OVERLAPS) 429/914 variables, 485/541 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/914 variables, 7/548 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 914/1096 variables, and 958 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 485/576 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 410/426 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60081ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 60082ms
Starting structural reductions in SI_LTL mode, iteration 1 : 576/1069 places, 520/1013 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78835 ms. Remains : 576/1069 places, 520/1013 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U p1)))'
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-13
Entered a terminal (fully accepting) state of product in 30 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-50-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-50-LTLFireability-13 finished in 78964 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 1069 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1069/1069 places, 1013/1013 transitions.
Reduce places removed 50 places and 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 448 transitions
Trivial Post-agglo rules discarded 448 transitions
Performed 448 trivial Post agglomeration. Transition count delta: 448
Iterating post reduction 0 with 448 rules applied. Total rules applied 448 place count 1019 transition count 515
Reduce places removed 448 places and 0 transitions.
Iterating post reduction 1 with 448 rules applied. Total rules applied 896 place count 571 transition count 515
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 902 place count 565 transition count 509
Iterating global reduction 2 with 6 rules applied. Total rules applied 908 place count 565 transition count 509
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 911 place count 565 transition count 506
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 914 place count 562 transition count 506
Applied a total of 914 rules in 50 ms. Remains 562 /1069 variables (removed 507) and now considering 506/1013 (removed 507) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5373386354119087697.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2023557791914282501.kers'
[2026-05-26 03:06:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5373386354119087697.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2023557791914282501.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 506 rows 562 cols 1025 entries
Finished phase 1 with 500 SingleSign rule and 6 generalized
[2026-05-26 03:06:03] [INFO ] Computed 56 invariants in 2 ms
Computed 56 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2023557791914282501.kers
Total runtime 3 ms.
[2026-05-26 03:06:04] [INFO ] Implicit Places using invariants in 943 ms returned []
[2026-05-26 03:06:04] [INFO ] Invariant cache hit.
[2026-05-26 03:06:22] [INFO ] Implicit Places using invariants and state equation in 17755 ms returned []
Implicit Place search using SMT with State Equation took 18702 ms to find 0 implicit places.
[2026-05-26 03:06:22] [INFO ] Redundant transitions in 7 ms returned []
Running 406 sub problems to find dead transitions.
[2026-05-26 03:06:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 2/464 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/464 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (OVERLAPS) 409/873 variables, 464/520 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 873/1068 variables, and 520 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 464/562 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 2/464 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/464 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (OVERLAPS) 409/873 variables, 464/520 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/873 variables, 406/926 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 873/1068 variables, and 926 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 464/562 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 60056ms
Starting structural reductions in SI_LTL mode, iteration 1 : 562/1069 places, 506/1013 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78824 ms. Remains : 562/1069 places, 506/1013 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 28 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLFireability-15
Product exploration explored 100000 steps with 1689 reset in 863 ms.
Product exploration explored 100000 steps with 1673 reset in 914 ms.
Computed a total of 562 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 562 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 299 steps (0 resets) in 7 ms. (37 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2026-05-26 03:07:24] [INFO ] Invariant cache hit.
[2026-05-26 03:07:25] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 87 ms returned unsat
Proved EG (NOT p0) asserting that LTL formula F !(NOT p0) is false.
Negative knowledge disproves property using: (F p0)
Knowledge-based reduction took 784 ms.
FORMULA HirschbergSinclair-PT-50-LTLFireability-15 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property HirschbergSinclair-PT-50-LTLFireability-15 finished in 81453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Spot run failed in 44 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F((F(p1)&&(X(!p0)||p2))))))'
Spot run failed in 36 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-26 03:07:25] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
[2026-05-26 03:07:25] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin15278143314976868485
[2026-05-26 03:07:25] [INFO ] Computing symmetric may disable matrix : 1013 transitions.
[2026-05-26 03:07:25] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 03:07:25] [INFO ] Computing symmetric may enable matrix : 1013 transitions.
[2026-05-26 03:07:25] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 03:07:25] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10551865504476313126.txt' '-o' '/tmp/graph10551865504476313126.bin' '-w' '/tmp/graph10551865504476313126.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10551865504476313126.bin' '-l' '-1' '-v' '-w' '/tmp/graph10551865504476313126.weights' '-q' '0' '-e' '0.001'
[2026-05-26 03:07:25] [INFO ] Decomposing Gal with order
[2026-05-26 03:07:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 03:07:25] [INFO ] Removed a total of 93 redundant transitions.
[2026-05-26 03:07:25] [INFO ] Computing Do-Not-Accords matrix : 1013 transitions.
[2026-05-26 03:07:25] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 03:07:25] [INFO ] Built C files in 255ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15278143314976868485
Running compilation step : cd /tmp/ltsmin15278143314976868485;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-26 03:07:25] [INFO ] Flatten gal took : 79 ms
[2026-05-26 03:07:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2026-05-26 03:07:25] [INFO ] Time to serialize gal into /tmp/LTLFireability4824304127417459187.gal : 9 ms
[2026-05-26 03:07:25] [INFO ] Time to serialize properties into /tmp/LTLFireability12946518688194866204.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4824304127417459187.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12946518688194866204.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((X(F(("(i5.u52.rcv_right_election_50_5_28_22>=1)")||(X("((i6.i1.u22.newmsg27>=1)&&(i6.i0.u96.election_50_6_27_to_right_26>=1))")))))...156
Formula 0 simplified : XG(!"(i5.u52.rcv_right_election_50_5_28_22>=1)" & X!"((i6.i1.u22.newmsg27>=1)&&(i6.i0.u96.election_50_6_27_to_right_26>=1))")
Compilation finished in 3036 ms.
Running link step : cd /tmp/ltsmin15278143314976868485;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin15278143314976868485;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(<>(((LTLAPp0==true)||X((LTLAPp1==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t5, t10, t12, t15, t16, t20, t21, t24, t28, t32, t38, t40, t45, t47, t49, t140, t862,...1874
Computing Next relation with stutter on 4.24334e+36 deadlock states
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin15278143314976868485;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(<>(((LTLAPp0==true)||X((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15278143314976868485;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(<>((LTLAPp2==true))&&X(<>((<>((LTLAPp3==true))&&(X(!(LTLAPp2==true))||(LTLAPp4==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-26 03:35:17] [INFO ] Flatten gal took : 19 ms
[2026-05-26 03:35:17] [INFO ] Time to serialize gal into /tmp/LTLFireability1252840532477230826.gal : 5 ms
[2026-05-26 03:35:17] [INFO ] Time to serialize properties into /tmp/LTLFireability273076479347112566.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1252840532477230826.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability273076479347112566.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...296
Read 2 LTL properties
Checking formula 0 : !((X(F(("(rcv_right_election_50_5_28_22>=1)")||(X("((newmsg27>=1)&&(election_50_6_27_to_right_26>=1))"))))))
Formula 0 simplified : XG(!"(rcv_right_election_50_5_28_22>=1)" & X!"((newmsg27>=1)&&(election_50_6_27_to_right_26>=1))")
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin15278143314976868485;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(<>((LTLAPp2==true))&&X(<>((<>((LTLAPp3==true))&&(X(!(LTLAPp2==true))||(LTLAPp4==true))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin15278143314976868485;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(<>(((LTLAPp0==true)||X((LTLAPp1==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...987
Computing Next relation with stutter on 4.24334e+36 deadlock states

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HirschbergSinclair-PT-50"
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 HirschbergSinclair-PT-50, 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 r146-tall-177961074400804"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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