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-177961074400771.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-30, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074400771
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 796K
-rw-r--r-- 1 mcc users 9.0K Mar 7 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 7 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 7 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.5K Mar 15 10:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 10:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 15 10:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 17:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Mar 7 17:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 7 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Mar 7 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 10:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 15 10:50 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 357K 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-30-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779754652020

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-30
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-26 00:17:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 00:17:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 00:17:33] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2026-05-26 00:17:33] [INFO ] Transformed 670 places.
[2026-05-26 00:17:33] [INFO ] Transformed 605 transitions.
[2026-05-26 00:17:33] [INFO ] Parsed PT model containing 670 places and 605 transitions and 1849 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA HirschbergSinclair-PT-30-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-30-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-30-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-30-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 670 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 670/670 places, 605/605 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 642 transition count 605
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 55 place count 615 transition count 578
Iterating global reduction 1 with 27 rules applied. Total rules applied 82 place count 615 transition count 578
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 105 place count 592 transition count 555
Iterating global reduction 1 with 23 rules applied. Total rules applied 128 place count 592 transition count 555
Applied a total of 128 rules in 163 ms. Remains 592 /670 variables (removed 78) and now considering 555/605 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4092554501661363960.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12913201951763090540.kers'
[2026-05-26 00:17:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4092554501661363960.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12913201951763090540.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 555 rows 592 cols 1669 entries
Finished phase 1 with 550 SingleSign rule and 5 generalized
[2026-05-26 00:17:33] [INFO ] Computed 37 invariants in 3 ms
Computed 37 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12913201951763090540.kers
Total runtime 5 ms.
[2026-05-26 00:17:34] [INFO ] Implicit Places using invariants in 453 ms returned []
[2026-05-26 00:17:34] [INFO ] Invariant cache hit.
[2026-05-26 00:17:41] [INFO ] Implicit Places using invariants and state equation in 7164 ms returned []
Implicit Place search using SMT with State Equation took 7649 ms to find 0 implicit places.
Running 525 sub problems to find dead transitions.
[2026-05-26 00:17:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 525 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 525 unsolved
At refinement iteration 2 (OVERLAPS) 4/564 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 525 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/564 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 525 unsolved
At refinement iteration 4 (OVERLAPS) 28/592 variables, 31/37 constraints. Problems are: Problem set: 0 solved, 525 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/1147 variables, and 37 constraints, problems are : Problem set: 0 solved, 525 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/592 constraints, PredecessorRefiner: 525/525 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 525 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 525 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/560 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 525 unsolved
At refinement iteration 2 (OVERLAPS) 4/564 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 525 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/564 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 525 unsolved
At refinement iteration 4 (OVERLAPS) 28/592 variables, 31/37 constraints. Problems are: Problem set: 0 solved, 525 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/592 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 525 unsolved
At refinement iteration 6 (OVERLAPS) 555/1147 variables, 592/629 constraints. Problems are: Problem set: 0 solved, 525 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1147 variables, 525/1154 constraints. Problems are: Problem set: 0 solved, 525 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1147/1147 variables, and 1154 constraints, problems are : Problem set: 0 solved, 525 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 592/592 constraints, PredecessorRefiner: 525/525 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60219ms problems are : Problem set: 0 solved, 525 unsolved
Search for dead transitions found 0 dead transitions in 60231ms
Starting structural reductions in LTL mode, iteration 1 : 592/670 places, 555/605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68088 ms. Remains : 592/670 places, 555/605 transitions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 555/555 transitions.
Applied a total of 0 rules in 30 ms. Remains 592 /592 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2026-05-26 00:18:41] [INFO ] Invariant cache hit.
[2026-05-26 00:18:41] [INFO ] Implicit Places using invariants in 196 ms returned []
[2026-05-26 00:18:41] [INFO ] Invariant cache hit.
[2026-05-26 00:18:48] [INFO ] Implicit Places using invariants and state equation in 7033 ms returned []
Implicit Place search using SMT with State Equation took 7232 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 7264 ms. Remains : 592/592 places, 555/555 transitions.
Support contains 41 out of 592 places after structural reductions.
[2026-05-26 00:18:49] [INFO ] Flatten gal took : 62 ms
[2026-05-26 00:18:49] [INFO ] Flatten gal took : 32 ms
[2026-05-26 00:18:49] [INFO ] Input system was already deterministic with 555 transitions.
Support contains 38 out of 592 places (down from 41) after GAL structural reductions.
RANDOM walk for 40000 steps (64 resets) in 2174 ms. (18 steps per ms) remains 12/27 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 12/12 properties
[2026-05-26 00:18:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 399/412 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 5/417 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 114/531 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 3/534 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
After SMT solving in domain Real declared 1089/1147 variables, and 571 constraints, problems are : Problem set: 12 solved, 0 unsolved in 1070 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 534/592 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1078ms problems are : Problem set: 12 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA HirschbergSinclair-PT-30-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 12 atomic propositions for a total of 11 simplifications.
FORMULA HirschbergSinclair-PT-30-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-30-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-30-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-30-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 592 stabilizing places and 555 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 592 transition count 555
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA HirschbergSinclair-PT-30-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 555/555 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 590 transition count 555
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 583 transition count 548
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 583 transition count 548
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 580 transition count 545
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 580 transition count 545
Applied a total of 22 rules in 49 ms. Remains 580 /592 variables (removed 12) and now considering 545/555 (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-16137743178435730939.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10842695607406483735.kers'
[2026-05-26 00:18:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16137743178435730939.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10842695607406483735.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 545 rows 580 cols 1640 entries
Finished phase 1 with 540 SingleSign rule and 5 generalized
[2026-05-26 00:18:51] [INFO ] Computed 35 invariants in 2 ms
Computed 35 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10842695607406483735.kers
Total runtime 4 ms.
[2026-05-26 00:18:51] [INFO ] Implicit Places using invariants in 208 ms returned []
[2026-05-26 00:18:51] [INFO ] Invariant cache hit.
[2026-05-26 00:19:00] [INFO ] Implicit Places using invariants and state equation in 8085 ms returned []
Implicit Place search using SMT with State Equation took 8297 ms to find 0 implicit places.
Running 515 sub problems to find dead transitions.
[2026-05-26 00:19:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1125/1125 variables, and 615 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 515 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1125 variables, 515/1130 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1125/1125 variables, and 1130 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60104ms problems are : Problem set: 0 solved, 515 unsolved
Search for dead transitions found 0 dead transitions in 60107ms
Starting structural reductions in LTL mode, iteration 1 : 580/592 places, 545/555 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68458 ms. Remains : 580/592 places, 545/555 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-02
Product exploration explored 100000 steps with 195 reset in 346 ms.
Product exploration explored 100000 steps with 196 reset in 313 ms.
Computed a total of 580 stabilizing places and 545 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 580 transition count 545
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 3 factoid took 47 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
RANDOM walk for 2048 steps (0 resets) in 15 ms. (128 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2026-05-26 00:20:01] [INFO ] Invariant cache hit.
[2026-05-26 00:20:01] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 40 ms returned sat
[2026-05-26 00:20:07] [INFO ] [Real]Absence check using state equation in 5655 ms returned sat
[2026-05-26 00:20:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 00:20:07] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 31 ms returned sat
[2026-05-26 00:20:22] [INFO ] [Nat]Absence check using state equation in 14742 ms returned unknown
Could not prove EG (NOT p0)
Knowledge-based reduction took 21364 ms.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 545/545 transitions.
Applied a total of 0 rules in 16 ms. Remains 580 /580 variables (removed 0) and now considering 545/545 (removed 0) transitions.
[2026-05-26 00:20:22] [INFO ] Invariant cache hit.
[2026-05-26 00:20:22] [INFO ] Implicit Places using invariants in 195 ms returned []
[2026-05-26 00:20:22] [INFO ] Invariant cache hit.
[2026-05-26 00:20:30] [INFO ] Implicit Places using invariants and state equation in 8127 ms returned []
Implicit Place search using SMT with State Equation took 8335 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 8353 ms. Remains : 580/580 places, 545/545 transitions.
Computed a total of 580 stabilizing places and 545 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 580 transition count 545
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 3 factoid took 48 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
RANDOM walk for 2039 steps (0 resets) in 16 ms. (119 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2026-05-26 00:20:31] [INFO ] Invariant cache hit.
[2026-05-26 00:20:31] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 40 ms returned sat
[2026-05-26 00:20:37] [INFO ] [Real]Absence check using state equation in 5650 ms returned sat
[2026-05-26 00:20:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 00:20:37] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 32 ms returned sat
[2026-05-26 00:20:52] [INFO ] [Nat]Absence check using state equation in 14753 ms returned unknown
Could not prove EG (NOT p0)
Knowledge-based reduction took 21323 ms.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 196 reset in 247 ms.
Product exploration explored 100000 steps with 196 reset in 281 ms.
Spot run failed in 75 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin17688407547376997950
[2026-05-26 00:20:53] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17688407547376997950
Running compilation step : cd /tmp/ltsmin17688407547376997950;'/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 925 ms.
Running link step : cd /tmp/ltsmin17688407547376997950;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin17688407547376997950;'/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/stateBased14604874829543546009.hoa' '--buchi-type=spotba'
LTSmin run took 147 ms.
FORMULA HirschbergSinclair-PT-30-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-02 finished in 122558 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)&&F((p1&&X(X(X(p2)))))))'
Support contains 4 out of 592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 555/555 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 590 transition count 555
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 583 transition count 548
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 583 transition count 548
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 580 transition count 545
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 580 transition count 545
Applied a total of 22 rules in 59 ms. Remains 580 /592 variables (removed 12) and now considering 545/555 (removed 10) transitions.
[2026-05-26 00:20:54] [INFO ] Invariant cache hit.
[2026-05-26 00:20:54] [INFO ] Implicit Places using invariants in 209 ms returned []
[2026-05-26 00:20:54] [INFO ] Invariant cache hit.
[2026-05-26 00:21:02] [INFO ] Implicit Places using invariants and state equation in 7812 ms returned []
Implicit Place search using SMT with State Equation took 8023 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 580/592 places, 545/555 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8082 ms. Remains : 580/592 places, 545/555 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)&&F((p1&&X(X(X(p2)))))))'
Stuttering acceptance computed with spot in 402 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-06
Product exploration explored 100000 steps with 3440 reset in 387 ms.
Product exploration explored 100000 steps with 3539 reset in 433 ms.
Computed a total of 580 stabilizing places and 545 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 580 transition count 545
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 217 ms. Reduced automaton from 10 states, 20 edges and 3 AP (stutter sensitive) to 10 states, 19 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (64 resets) in 497 ms. (80 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 1/1 properties
[2026-05-26 00:21:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 486/489 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/523 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/523 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 545/1068 variables, 523/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1068 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 57/1125 variables, 57/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1125 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1125 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1125/1125 variables, and 615 constraints, problems are : Problem set: 0 solved, 1 unsolved in 421 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 486/489 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/523 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/523 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 545/1068 variables, 523/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1068 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 57/1125 variables, 57/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1125 variables, 1/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1125 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1125 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1125/1125 variables, and 616 constraints, problems are : Problem set: 0 solved, 1 unsolved in 927 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1354ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 148 ms.
Support contains 3 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 545/545 transitions.
Graph (complete) has 1099 edges and 580 vertex of which 579 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 224 transitions
Trivial Post-agglo rules discarded 224 transitions
Performed 224 trivial Post agglomeration. Transition count delta: 224
Iterating post reduction 0 with 225 rules applied. Total rules applied 226 place count 579 transition count 320
Reduce places removed 224 places and 0 transitions.
Graph (complete) has 620 edges and 355 vertex of which 299 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.0 ms
Discarding 56 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 227 rules applied. Total rules applied 453 place count 299 transition count 318
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 58 rules applied. Total rules applied 511 place count 297 transition count 262
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 512 place count 296 transition count 261
Iterating global reduction 3 with 1 rules applied. Total rules applied 513 place count 296 transition count 261
Free-agglomeration rule (complex) applied 30 times.
Iterating global reduction 3 with 30 rules applied. Total rules applied 543 place count 296 transition count 231
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 573 place count 266 transition count 231
Reduce places removed 29 places and 29 transitions.
Iterating global reduction 4 with 29 rules applied. Total rules applied 602 place count 237 transition count 202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 603 place count 236 transition count 202
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 603 place count 236 transition count 191
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 625 place count 225 transition count 191
Applied a total of 625 rules in 61 ms. Remains 225 /580 variables (removed 355) and now considering 191/545 (removed 354) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 225/580 places, 191/545 transitions.
RANDOM walk for 40000 steps (211 resets) in 346 ms. (115 steps per ms) remains 1/1 properties
BEST_FIRST walk for 1510 steps (0 resets) in 6 ms. (215 steps per ms) remains 0/1 properties
Knowledge based reduction with 6 factoid took 451 ms. Reduced automaton from 10 states, 19 edges and 3 AP (stutter sensitive) to 10 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 372 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2026-05-26 00:21:06] [INFO ] Invariant cache hit.
[2026-05-26 00:21:07] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 278 ms returned sat
[2026-05-26 00:21:21] [INFO ] [Real]Absence check using state equation in 14508 ms returned unknown
Could not prove EG (NOT p0)
[2026-05-26 00:21:21] [INFO ] Invariant cache hit.
[2026-05-26 00:21:22] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 351 ms returned sat
[2026-05-26 00:21:36] [INFO ] [Real]Absence check using state equation in 14443 ms returned unknown
Could not prove EG (NOT p2)
Knowledge-based reduction took 33070 ms.
Stuttering acceptance computed with spot in 369 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 4 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 545/545 transitions.
Applied a total of 0 rules in 18 ms. Remains 580 /580 variables (removed 0) and now considering 545/545 (removed 0) transitions.
[2026-05-26 00:21:36] [INFO ] Invariant cache hit.
[2026-05-26 00:21:37] [INFO ] Implicit Places using invariants in 182 ms returned []
[2026-05-26 00:21:37] [INFO ] Invariant cache hit.
[2026-05-26 00:21:44] [INFO ] Implicit Places using invariants and state equation in 7787 ms returned []
Implicit Place search using SMT with State Equation took 7972 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 7990 ms. Remains : 580/580 places, 545/545 transitions.
Computed a total of 580 stabilizing places and 545 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 580 transition count 545
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 234 ms. Reduced automaton from 10 states, 19 edges and 3 AP (stutter sensitive) to 10 states, 19 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (64 resets) in 168 ms. (236 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
[2026-05-26 00:21:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 486/489 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/523 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/523 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 545/1068 variables, 523/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1068 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 57/1125 variables, 57/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1125 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1125 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1125/1125 variables, and 615 constraints, problems are : Problem set: 0 solved, 1 unsolved in 402 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 486/489 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/489 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/523 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/523 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 545/1068 variables, 523/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1068 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 57/1125 variables, 57/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1125 variables, 1/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1125 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1125 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1125/1125 variables, and 616 constraints, problems are : Problem set: 0 solved, 1 unsolved in 939 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1346ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 130 ms.
Support contains 3 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 545/545 transitions.
Graph (complete) has 1099 edges and 580 vertex of which 579 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 224 transitions
Trivial Post-agglo rules discarded 224 transitions
Performed 224 trivial Post agglomeration. Transition count delta: 224
Iterating post reduction 0 with 225 rules applied. Total rules applied 226 place count 579 transition count 320
Reduce places removed 224 places and 0 transitions.
Graph (complete) has 620 edges and 355 vertex of which 299 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.0 ms
Discarding 56 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 227 rules applied. Total rules applied 453 place count 299 transition count 318
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 58 rules applied. Total rules applied 511 place count 297 transition count 262
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 512 place count 296 transition count 261
Iterating global reduction 3 with 1 rules applied. Total rules applied 513 place count 296 transition count 261
Free-agglomeration rule (complex) applied 30 times.
Iterating global reduction 3 with 30 rules applied. Total rules applied 543 place count 296 transition count 231
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 573 place count 266 transition count 231
Reduce places removed 29 places and 29 transitions.
Iterating global reduction 4 with 29 rules applied. Total rules applied 602 place count 237 transition count 202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 603 place count 236 transition count 202
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 603 place count 236 transition count 191
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 625 place count 225 transition count 191
Applied a total of 625 rules in 52 ms. Remains 225 /580 variables (removed 355) and now considering 191/545 (removed 354) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 225/580 places, 191/545 transitions.
RANDOM walk for 35891 steps (189 resets) in 75 ms. (472 steps per ms) remains 0/1 properties
Knowledge based reduction with 6 factoid took 459 ms. Reduced automaton from 10 states, 19 edges and 3 AP (stutter sensitive) to 10 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 340 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2026-05-26 00:21:47] [INFO ] Invariant cache hit.
[2026-05-26 00:21:48] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 277 ms returned sat
[2026-05-26 00:22:02] [INFO ] [Real]Absence check using state equation in 14527 ms returned unknown
Could not prove EG (NOT p0)
[2026-05-26 00:22:02] [INFO ] Invariant cache hit.
[2026-05-26 00:22:03] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 351 ms returned sat
[2026-05-26 00:22:17] [INFO ] [Real]Absence check using state equation in 14443 ms returned unknown
Could not prove EG (NOT p2)
Knowledge-based reduction took 32835 ms.
Stuttering acceptance computed with spot in 360 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 3380 reset in 407 ms.
Product exploration explored 100000 steps with 3395 reset in 428 ms.
Spot run failed in 46 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/ltsmin13781415509826294358
[2026-05-26 00:22:19] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13781415509826294358
Running compilation step : cd /tmp/ltsmin13781415509826294358;'/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 835 ms.
Running link step : cd /tmp/ltsmin13781415509826294358;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13781415509826294358;'/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/stateBased13068790068713996561.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 545/545 transitions.
Applied a total of 0 rules in 12 ms. Remains 580 /580 variables (removed 0) and now considering 545/545 (removed 0) transitions.
[2026-05-26 00:22:34] [INFO ] Invariant cache hit.
[2026-05-26 00:22:34] [INFO ] Implicit Places using invariants in 180 ms returned []
[2026-05-26 00:22:34] [INFO ] Invariant cache hit.
[2026-05-26 00:22:42] [INFO ] Implicit Places using invariants and state equation in 7747 ms returned []
Implicit Place search using SMT with State Equation took 7929 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 7942 ms. Remains : 580/580 places, 545/545 transitions.
Built C files in :
/tmp/ltsmin284305730343324875
[2026-05-26 00:22:42] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin284305730343324875
Running compilation step : cd /tmp/ltsmin284305730343324875;'/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 825 ms.
Running link step : cd /tmp/ltsmin284305730343324875;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin284305730343324875;'/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/stateBased11786151257121634515.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 00:22:57] [INFO ] Flatten gal took : 27 ms
[2026-05-26 00:22:57] [INFO ] Flatten gal took : 22 ms
[2026-05-26 00:22:57] [INFO ] Time to serialize gal into /tmp/LTL12681333389059618329.gal : 18 ms
[2026-05-26 00:22:57] [INFO ] Time to serialize properties into /tmp/LTL8878646846630018372.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/LTL12681333389059618329.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7834342209638593156.hoa' '-atoms' '/tmp/LTL8878646846630018372.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/LTL8878646846630018372.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7834342209638593156.hoa
Detected timeout of ITS tools.
[2026-05-26 00:23:12] [INFO ] Flatten gal took : 20 ms
[2026-05-26 00:23:12] [INFO ] Flatten gal took : 20 ms
[2026-05-26 00:23:12] [INFO ] Time to serialize gal into /tmp/LTL14550905967145214088.gal : 4 ms
[2026-05-26 00:23:12] [INFO ] Time to serialize properties into /tmp/LTL12646123668428093131.ltl : 3 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/LTL14550905967145214088.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12646123668428093131.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((F("(newmsg4>=1)"))&&(F(("(election_30_5_12_to_right_11<=election_30_5_21_to_right_20)")&&(X(X(X("(newmsg1>=1)"))))))))
Formula 0 simplified : G!"(newmsg4>=1)" | G(!"(election_30_5_12_to_right_11<=election_30_5_21_to_right_20)" | XXX!"(newmsg1>=1)")
Detected timeout of ITS tools.
[2026-05-26 00:23:27] [INFO ] Flatten gal took : 24 ms
[2026-05-26 00:23:27] [INFO ] Applying decomposition
[2026-05-26 00:23:27] [INFO ] Flatten gal took : 17 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/graph1511720549865525696.txt' '-o' '/tmp/graph1511720549865525696.bin' '-w' '/tmp/graph1511720549865525696.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1511720549865525696.bin' '-l' '-1' '-v' '-w' '/tmp/graph1511720549865525696.weights' '-q' '0' '-e' '0.001'
[2026-05-26 00:23:27] [INFO ] Decomposing Gal with order
[2026-05-26 00:23:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 00:23:28] [INFO ] Removed a total of 50 redundant transitions.
[2026-05-26 00:23:28] [INFO ] Flatten gal took : 86 ms
[2026-05-26 00:23:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2026-05-26 00:23:28] [INFO ] Time to serialize gal into /tmp/LTL9414386211748184205.gal : 19 ms
[2026-05-26 00:23:28] [INFO ] Time to serialize properties into /tmp/LTL7421073304668876998.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/LTL9414386211748184205.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7421073304668876998.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("(gi0.gi0.gi1.gu3.newmsg4>=1)"))&&(F(("(gu53.election_30_5_12_to_right_11<=gu53.election_30_5_21_to_right_20)")&&(X(X(X("(gi0.gi...185
Formula 0 simplified : G!"(gi0.gi0.gi1.gu3.newmsg4>=1)" | G(!"(gu53.election_30_5_12_to_right_11<=gu53.election_30_5_21_to_right_20)" | XXX!"(gi0.gi0.gi0.g...171
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-06 finished in 169130 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 592 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 592/592 places, 555/555 transitions.
Graph (complete) has 1114 edges and 592 vertex of which 590 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 30 places and 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 239 place count 560 transition count 287
Reduce places removed 238 places and 0 transitions.
Iterating post reduction 1 with 238 rules applied. Total rules applied 477 place count 322 transition count 287
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 484 place count 315 transition count 280
Iterating global reduction 2 with 7 rules applied. Total rules applied 491 place count 315 transition count 280
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 495 place count 315 transition count 276
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 499 place count 311 transition count 276
Applied a total of 499 rules in 50 ms. Remains 311 /592 variables (removed 281) and now considering 276/555 (removed 279) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1049316075546530567.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5163533361049966616.kers'
[2026-05-26 00:23:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1049316075546530567.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5163533361049966616.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 276 rows 311 cols 564 entries
Finished phase 1 with 271 SingleSign rule and 5 generalized
[2026-05-26 00:23:43] [INFO ] Computed 35 invariants in 1 ms
Computed 35 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5163533361049966616.kers
Total runtime 1 ms.
[2026-05-26 00:23:43] [INFO ] Implicit Places using invariants in 348 ms returned []
[2026-05-26 00:23:43] [INFO ] Invariant cache hit.
[2026-05-26 00:23:46] [INFO ] Implicit Places using invariants and state equation in 3098 ms returned []
Implicit Place search using SMT with State Equation took 3447 ms to find 0 implicit places.
[2026-05-26 00:23:46] [INFO ] Redundant transitions in 17 ms returned []
Running 217 sub problems to find dead transitions.
[2026-05-26 00:23:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 219/473 variables, 254/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/473 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/587 variables, and 289 constraints, problems are : Problem set: 0 solved, 217 unsolved in 19779 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 254/311 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 219/473 variables, 254/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 217/506 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 473/587 variables, and 506 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 254/311 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49815ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 49816ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/592 places, 276/555 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53336 ms. Remains : 311/592 places, 276/555 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 44 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-08
Stuttering criterion allowed to conclude after 297 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-30-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-08 finished in 53409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U (F((p1||X(p2))) U X(p3)))))'
Support contains 7 out of 592 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 592/592 places, 555/555 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 591 transition count 555
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 585 transition count 549
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 585 transition count 549
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 583 transition count 547
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 583 transition count 547
Applied a total of 17 rules in 51 ms. Remains 583 /592 variables (removed 9) and now considering 547/555 (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-12071877680406040451.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14378935755119201830.kers'
[2026-05-26 00:24:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12071877680406040451.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14378935755119201830.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 547 rows 583 cols 1646 entries
Finished phase 1 with 542 SingleSign rule and 5 generalized
[2026-05-26 00:24:36] [INFO ] Computed 36 invariants in 2 ms
Computed 36 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14378935755119201830.kers
Total runtime 3 ms.
[2026-05-26 00:24:37] [INFO ] Implicit Places using invariants in 238 ms returned []
[2026-05-26 00:24:37] [INFO ] Invariant cache hit.
[2026-05-26 00:24:44] [INFO ] Implicit Places using invariants and state equation in 7824 ms returned []
Implicit Place search using SMT with State Equation took 8065 ms to find 0 implicit places.
Running 517 sub problems to find dead transitions.
[2026-05-26 00:24:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (OVERLAPS) 2/554 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/554 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (OVERLAPS) 29/583 variables, 31/36 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 583/1130 variables, and 36 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/583 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 517 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (OVERLAPS) 2/554 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/554 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (OVERLAPS) 29/583 variables, 31/36 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (OVERLAPS) 547/1130 variables, 583/619 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1130 variables, 517/1136 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1130/1130 variables, and 1136 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60080ms problems are : Problem set: 0 solved, 517 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in LTL mode, iteration 1 : 583/592 places, 547/555 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68213 ms. Remains : 583/592 places, 547/555 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U (F((p1||X(p2))) U X(p3)))))'
Stuttering acceptance computed with spot in 235 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-09
Product exploration explored 100000 steps with 33333 reset in 312 ms.
Product exploration explored 100000 steps with 33333 reset in 307 ms.
Computed a total of 583 stabilizing places and 547 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 583 transition count 547
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 13 factoid took 12 ms. Proved property starting from automaton with 6 states, 10 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 146 ms.
FORMULA HirschbergSinclair-PT-30-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-09 finished in 69269 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(G(p2))))'
Support contains 6 out of 592 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 592/592 places, 555/555 transitions.
Graph (complete) has 1114 edges and 592 vertex of which 590 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 30 places and 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 232 transitions
Trivial Post-agglo rules discarded 232 transitions
Performed 232 trivial Post agglomeration. Transition count delta: 232
Iterating post reduction 0 with 232 rules applied. Total rules applied 233 place count 560 transition count 293
Reduce places removed 232 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 233 rules applied. Total rules applied 466 place count 328 transition count 292
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 467 place count 327 transition count 292
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 473 place count 321 transition count 286
Iterating global reduction 3 with 6 rules applied. Total rules applied 479 place count 321 transition count 286
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 482 place count 321 transition count 283
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 485 place count 318 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 487 place count 317 transition count 282
Applied a total of 487 rules in 48 ms. Remains 317 /592 variables (removed 275) and now considering 282/555 (removed 273) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15730407947205896538.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7993697607278061957.kers'
[2026-05-26 00:25:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15730407947205896538.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7993697607278061957.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 282 rows 317 cols 585 entries
Finished phase 1 with 277 SingleSign rule and 5 generalized
[2026-05-26 00:25:46] [INFO ] Computed 35 invariants in 1 ms
Computed 35 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7993697607278061957.kers
Total runtime 1 ms.
[2026-05-26 00:25:46] [INFO ] Implicit Places using invariants in 254 ms returned []
[2026-05-26 00:25:46] [INFO ] Invariant cache hit.
[2026-05-26 00:25:49] [INFO ] Implicit Places using invariants and state equation in 3361 ms returned []
Implicit Place search using SMT with State Equation took 3627 ms to find 0 implicit places.
[2026-05-26 00:25:49] [INFO ] Redundant transitions in 3 ms returned []
Running 223 sub problems to find dead transitions.
[2026-05-26 00:25:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 2/260 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 226/486 variables, 260/295 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 1/487 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 0/487 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/599 variables, and 296 constraints, problems are : Problem set: 0 solved, 223 unsolved in 26469 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 261/317 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 2/260 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (OVERLAPS) 226/486 variables, 260/295 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 223/518 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/599 variables, and 518 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 260/317 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56499ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 56500ms
Starting structural reductions in SI_LTL mode, iteration 1 : 317/592 places, 282/555 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60189 ms. Remains : 317/592 places, 282/555 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))&&F(G(p2))))'
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-10
Stuttering criterion allowed to conclude after 311 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-30-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-10 finished in 60328 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))'
Support contains 1 out of 592 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 592/592 places, 555/555 transitions.
Graph (complete) has 1114 edges and 592 vertex of which 590 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 30 places and 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 239 place count 560 transition count 287
Reduce places removed 238 places and 0 transitions.
Iterating post reduction 1 with 238 rules applied. Total rules applied 477 place count 322 transition count 287
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 484 place count 315 transition count 280
Iterating global reduction 2 with 7 rules applied. Total rules applied 491 place count 315 transition count 280
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 495 place count 315 transition count 276
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 499 place count 311 transition count 276
Applied a total of 499 rules in 25 ms. Remains 311 /592 variables (removed 281) and now considering 276/555 (removed 279) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18358842407739868802.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3354174834337389021.kers'
[2026-05-26 00:26:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18358842407739868802.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3354174834337389021.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 276 rows 311 cols 564 entries
Finished phase 1 with 271 SingleSign rule and 5 generalized
[2026-05-26 00:26:46] [INFO ] Computed 35 invariants in 2 ms
Computed 35 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3354174834337389021.kers
Total runtime 4 ms.
[2026-05-26 00:26:46] [INFO ] Implicit Places using invariants in 237 ms returned []
[2026-05-26 00:26:46] [INFO ] Invariant cache hit.
[2026-05-26 00:26:49] [INFO ] Implicit Places using invariants and state equation in 3120 ms returned []
Implicit Place search using SMT with State Equation took 3358 ms to find 0 implicit places.
[2026-05-26 00:26:49] [INFO ] Redundant transitions in 4 ms returned []
Running 217 sub problems to find dead transitions.
[2026-05-26 00:26:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 220/474 variables, 254/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 3/477 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/477 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/587 variables, and 291 constraints, problems are : Problem set: 0 solved, 217 unsolved in 25953 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 256/311 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 220/474 variables, 254/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 208/497 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 3/477 variables, 2/499 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 9/508 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/477 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 477/587 variables, and 508 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 256/311 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55981ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 55983ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/592 places, 276/555 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59374 ms. Remains : 311/592 places, 276/555 transitions.
Initial state reduction rules removed 1 formulas.
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' '!(false)'
Stuttering acceptance computed with spot in 8 ms :[true]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-30-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-11 finished in 59408 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)&&F((p1&&X(X(X(p2)))))))'
Spot run failed in 41 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 00:27:45] [INFO ] Flatten gal took : 27 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6345428784275344510
[2026-05-26 00:27:45] [INFO ] Computing symmetric may disable matrix : 555 transitions.
[2026-05-26 00:27:45] [INFO ] Applying decomposition
[2026-05-26 00:27:45] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 00:27:45] [INFO ] Flatten gal took : 18 ms
[2026-05-26 00:27:45] [INFO ] Computing symmetric may enable matrix : 555 transitions.
[2026-05-26 00:27:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph15253332592075314368.txt' '-o' '/tmp/graph15253332592075314368.bin' '-w' '/tmp/graph15253332592075314368.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15253332592075314368.bin' '-l' '-1' '-v' '-w' '/tmp/graph15253332592075314368.weights' '-q' '0' '-e' '0.001'
[2026-05-26 00:27:45] [INFO ] Decomposing Gal with order
[2026-05-26 00:27:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 00:27:46] [INFO ] Computing Do-Not-Accords matrix : 555 transitions.
[2026-05-26 00:27:46] [INFO ] Removed a total of 69 redundant transitions.
[2026-05-26 00:27:46] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 00:27:46] [INFO ] Built C files in 212ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6345428784275344510
Running compilation step : cd /tmp/ltsmin6345428784275344510;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-26 00:27:46] [INFO ] Flatten gal took : 87 ms
[2026-05-26 00:27:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2026-05-26 00:27:46] [INFO ] Time to serialize gal into /tmp/LTLCardinality10536972532341320971.gal : 4 ms
[2026-05-26 00:27:46] [INFO ] Time to serialize properties into /tmp/LTLCardinality16070180176266169575.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/LTLCardinality10536972532341320971.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16070180176266169575.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...299
Read 1 LTL properties
Checking formula 0 : !(((F("(gi0.gi1.gi2.gu2.newmsg4>=1)"))&&(F(("(gu63.election_30_5_12_to_right_11<=gu63.election_30_5_21_to_right_20)")&&(X(X(X("(gi0.gi...185
Formula 0 simplified : G!"(gi0.gi1.gi2.gu2.newmsg4>=1)" | G(!"(gu63.election_30_5_12_to_right_11<=gu63.election_30_5_21_to_right_20)" | XXX!"(gi0.gi1.gi0.g...171
Compilation finished in 1288 ms.
Running link step : cd /tmp/ltsmin6345428784275344510;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6345428784275344510;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '(<>((LTLAPp0==true))&&<>(((LTLAPp1==true)&&X(X(X((LTLAPp2==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gi0.gi0.gi0.gu3.t45, gi0.gi0.gi0.gu5.t53, gi0.gi0.gi0.gu28.t49, gi0.gi0.gi0.t59, gi0.gi0.gi0....1389
Computing Next relation with stutter on 2.66968e+22 deadlock states
206 unique states visited
0 strongly connected components in search stack
205 transitions explored
205 items max in DFS search stack
42143 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,421.585,4967284,1,0,1317,2.51815e+07,26,956,7835,2.75029e+07,3387
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HirschbergSinclair-PT-30-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1066542 ms.

BK_STOP 1779755720014

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-30"
export BK_EXAMINATION="LTLCardinality"
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-30, examination is LTLCardinality"
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-177961074400771"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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