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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.3K Mar 7 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 7 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 7 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 7 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 15 10:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 10:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Mar 7 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 7 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Mar 7 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 10:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 15 10:49 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 173K 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-15-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-15-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779750860835

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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 23:14:21] [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-25 23:14:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 23:14:22] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2026-05-25 23:14:22] [INFO ] Transformed 330 places.
[2026-05-25 23:14:22] [INFO ] Transformed 296 transitions.
[2026-05-25 23:14:22] [INFO ] Parsed PT model containing 330 places and 296 transitions and 906 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HirschbergSinclair-PT-15-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-15-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-15-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 296/296 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 316 transition count 296
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 23 place count 307 transition count 287
Iterating global reduction 1 with 9 rules applied. Total rules applied 32 place count 307 transition count 287
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 300 transition count 280
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 300 transition count 280
Applied a total of 46 rules in 80 ms. Remains 300 /330 variables (removed 30) and now considering 280/296 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17955178977734709425.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4659293776526079723.kers'
[2026-05-25 23:14:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17955178977734709425.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4659293776526079723.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 280 rows 300 cols 840 entries
Finished phase 1 with 276 SingleSign rule and 4 generalized
[2026-05-25 23:14:22] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4659293776526079723.kers
Total runtime 2 ms.
[2026-05-25 23:14:22] [INFO ] Implicit Places using invariants in 303 ms returned []
[2026-05-25 23:14:22] [INFO ] Invariant cache hit.
[2026-05-25 23:14:23] [INFO ] Implicit Places using invariants and state equation in 1176 ms returned []
Implicit Place search using SMT with State Equation took 1514 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2026-05-25 23:14:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/284 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (OVERLAPS) 2/286 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 14/300 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 280/580 variables, 300/320 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/580 variables, and 320 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/284 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (OVERLAPS) 2/286 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 14/300 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 280/580 variables, 300/320 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 265/585 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/580 variables, and 585 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60126ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Starting structural reductions in LTL mode, iteration 1 : 300/330 places, 280/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61764 ms. Remains : 300/330 places, 280/296 transitions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 280/280 transitions.
Applied a total of 0 rules in 6 ms. Remains 300 /300 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2026-05-25 23:15:24] [INFO ] Invariant cache hit.
[2026-05-25 23:15:24] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-25 23:15:24] [INFO ] Invariant cache hit.
[2026-05-25 23:15:25] [INFO ] Implicit Places using invariants and state equation in 1050 ms returned []
Implicit Place search using SMT with State Equation took 1154 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1161 ms. Remains : 300/300 places, 280/280 transitions.
Support contains 42 out of 300 places after structural reductions.
[2026-05-25 23:15:25] [INFO ] Flatten gal took : 49 ms
[2026-05-25 23:15:25] [INFO ] Flatten gal took : 23 ms
[2026-05-25 23:15:25] [INFO ] Input system was already deterministic with 280 transitions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40000 steps (132 resets) in 1722 ms. (23 steps per ms) remains 11/31 properties
BEST_FIRST walk for 40003 steps (20 resets) in 117 ms. (339 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 99 ms. (400 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 102 ms. (388 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (20 resets) in 163 ms. (243 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (20 resets) in 91 ms. (434 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 98 ms. (404 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 102 ms. (388 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 74 ms. (533 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (16 resets) in 136 ms. (291 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (16 resets) in 137 ms. (289 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 56 ms. (701 steps per ms) remains 11/11 properties
[2026-05-25 23:15:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (OVERLAPS) 5/18 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 222/240 variables, 12/13 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 30/270 variables, 7/20 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 7 (OVERLAPS) 280/550 variables, 270/290 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 0/290 constraints. Problems are: Problem set: 10 solved, 1 unsolved
Problem AtomicPropp24 is UNSAT
After SMT solving in domain Real declared 580/580 variables, and 320 constraints, problems are : Problem set: 11 solved, 0 unsolved in 635 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 300/300 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 640ms problems are : Problem set: 11 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA HirschbergSinclair-PT-15-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 11 atomic propositions for a total of 12 simplifications.
FORMULA HirschbergSinclair-PT-15-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 300 stabilizing places and 280 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 300 transition count 280
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-15-LTLCardinality-02 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((p0&&F(G(p1))))||((p2 U p1)&&X(p2))))'
Support contains 6 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 280/280 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 299 transition count 280
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 293 transition count 274
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 293 transition count 274
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 289 transition count 270
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 289 transition count 270
Applied a total of 21 rules in 17 ms. Remains 289 /300 variables (removed 11) and now considering 270/280 (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-12079281355570155035.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16975039933011312533.kers'
[2026-05-25 23:15:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12079281355570155035.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16975039933011312533.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 270 rows 289 cols 812 entries
Finished phase 1 with 266 SingleSign rule and 4 generalized
[2026-05-25 23:15:27] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16975039933011312533.kers
Total runtime 2 ms.
[2026-05-25 23:15:27] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-25 23:15:27] [INFO ] Invariant cache hit.
[2026-05-25 23:15:29] [INFO ] Implicit Places using invariants and state equation in 1513 ms returned []
Implicit Place search using SMT with State Equation took 1621 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2026-05-25 23:15:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 15/289 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 270/559 variables, 289/308 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 6 (OVERLAPS) 0/559 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 255 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 308 constraints, problems are : Problem set: 0 solved, 255 unsolved in 27614 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 15/289 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 4 (OVERLAPS) 270/559 variables, 289/308 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 255/563 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 559/559 variables, and 563 constraints, problems are : Problem set: 0 solved, 255 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57669ms problems are : Problem set: 0 solved, 255 unsolved
Search for dead transitions found 0 dead transitions in 57671ms
Starting structural reductions in LTL mode, iteration 1 : 289/300 places, 270/280 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59311 ms. Remains : 289/300 places, 270/280 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&F(G(p1))))||((p2 U p1)&&X(p2))))'
Stuttering acceptance computed with spot in 537 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 364 ms.
Product exploration explored 100000 steps with 50000 reset in 229 ms.
Computed a total of 289 stabilizing places and 270 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 289 transition count 270
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 10 factoid took 14 ms. Proved property starting from automaton with 8 states, 16 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 117 ms.
FORMULA HirschbergSinclair-PT-15-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-03 finished in 60679 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Support contains 2 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 280/280 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 299 transition count 280
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 291 transition count 272
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 291 transition count 272
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 285 transition count 266
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 285 transition count 266
Applied a total of 29 rules in 22 ms. Remains 285 /300 variables (removed 15) and now considering 266/280 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3459403225394005130.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1125847923855201290.kers'
[2026-05-25 23:16:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3459403225394005130.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1125847923855201290.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 266 rows 285 cols 802 entries
Finished phase 1 with 262 SingleSign rule and 4 generalized
[2026-05-25 23:16:28] [INFO ] Computed 19 invariants in 3 ms
Computed 19 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1125847923855201290.kers
Total runtime 3 ms.
[2026-05-25 23:16:28] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-25 23:16:28] [INFO ] Invariant cache hit.
[2026-05-25 23:16:29] [INFO ] Implicit Places using invariants and state equation in 1520 ms returned []
Implicit Place search using SMT with State Equation took 1621 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2026-05-25 23:16:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 27166 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57225ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 57227ms
Starting structural reductions in LTL mode, iteration 1 : 285/300 places, 266/280 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58873 ms. Remains : 285/300 places, 266/280 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(G(p0)))))))'
Stuttering acceptance computed with spot in 276 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 275 steps with 0 reset in 4 ms.
FORMULA HirschbergSinclair-PT-15-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-04 finished in 59191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0||X(p1)))'
Support contains 3 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 280/280 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 299 transition count 280
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 293 transition count 274
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 293 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 19 place count 287 transition count 268
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 287 transition count 268
Applied a total of 25 rules in 18 ms. Remains 287 /300 variables (removed 13) and now considering 268/280 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-22608795238945183.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18318485618973432177.kers'
[2026-05-25 23:17:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-22608795238945183.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18318485618973432177.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 268 rows 287 cols 808 entries
Finished phase 1 with 264 SingleSign rule and 4 generalized
[2026-05-25 23:17:27] [INFO ] Computed 19 invariants in 4 ms
Computed 19 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-18318485618973432177.kers
Total runtime 5 ms.
[2026-05-25 23:17:27] [INFO ] Implicit Places using invariants in 123 ms returned []
[2026-05-25 23:17:27] [INFO ] Invariant cache hit.
[2026-05-25 23:17:29] [INFO ] Implicit Places using invariants and state equation in 1544 ms returned []
Implicit Place search using SMT with State Equation took 1670 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2026-05-25 23:17:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 306 constraints, problems are : Problem set: 0 solved, 253 unsolved in 27281 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 253/559 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 559 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30011 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57322ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 57324ms
Starting structural reductions in LTL mode, iteration 1 : 287/300 places, 268/280 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59015 ms. Remains : 287/300 places, 268/280 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0||X(p1)))'
Stuttering acceptance computed with spot in 104 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 25 steps with 12 reset in 1 ms.
FORMULA HirschbergSinclair-PT-15-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-05 finished in 59159 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||G(p1))))'
Support contains 5 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 280/280 transitions.
Graph (complete) has 561 edges and 300 vertex of which 299 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 14 places and 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 285 transition count 151
Reduce places removed 115 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 116 rules applied. Total rules applied 232 place count 170 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 233 place count 169 transition count 150
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 240 place count 162 transition count 143
Iterating global reduction 3 with 7 rules applied. Total rules applied 247 place count 162 transition count 143
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 249 place count 162 transition count 141
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 251 place count 160 transition count 141
Applied a total of 251 rules in 33 ms. Remains 160 /300 variables (removed 140) and now considering 141/280 (removed 139) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8787058542833918223.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15330942371404674183.kers'
[2026-05-25 23:18:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8787058542833918223.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15330942371404674183.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 141 rows 160 cols 299 entries
Finished phase 1 with 137 SingleSign rule and 4 generalized
[2026-05-25 23:18:26] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15330942371404674183.kers
Total runtime 1 ms.
[2026-05-25 23:18:26] [INFO ] Implicit Places using invariants in 115 ms returned []
[2026-05-25 23:18:26] [INFO ] Invariant cache hit.
[2026-05-25 23:18:26] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 23:18:27] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2026-05-25 23:18:27] [INFO ] Redundant transitions in 6 ms returned []
Running 114 sub problems to find dead transitions.
[2026-05-25 23:18:27] [INFO ] Invariant cache hit.
[2026-05-25 23:18:27] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 2/135 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 118/253 variables, 135/154 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 10/164 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 4/257 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 0/257 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/301 variables, and 167 constraints, problems are : Problem set: 0 solved, 114 unsolved in 8632 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 138/160 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 2/135 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 118/253 variables, 135/154 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 10/164 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 102/266 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 4/257 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 12/281 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (OVERLAPS) 0/257 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/301 variables, and 281 constraints, problems are : Problem set: 0 solved, 114 unsolved in 25379 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 138/160 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34019ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 34020ms
Starting structural reductions in SI_LTL mode, iteration 1 : 160/300 places, 141/280 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34739 ms. Remains : 160/300 places, 141/280 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||G(p1))))'
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-07
Product exploration explored 100000 steps with 647 reset in 248 ms.
Product exploration explored 100000 steps with 647 reset in 280 ms.
Computed a total of 160 stabilizing places and 141 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 160 transition count 141
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 9 factoid took 123 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (247 resets) in 168 ms. (236 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (43 resets) in 117 ms. (339 steps per ms) remains 1/1 properties
[2026-05-25 23:19:02] [INFO ] Invariant cache hit.
[2026-05-25 23:19:02] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 120/124 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/132 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 114/246 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 9/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/252 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/253 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/253 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/253 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/301 variables, and 165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 108 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 136/160 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 120/124 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/132 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 114/246 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 246/301 variables, and 160 constraints, problems are : Problem set: 1 solved, 0 unsolved in 77 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 132/160 constraints, ReadFeed: 9/10 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 188ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 10 factoid took 183 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 738 ms.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 141/141 transitions.
Applied a total of 0 rules in 11 ms. Remains 160 /160 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2026-05-25 23:19:02] [INFO ] Invariant cache hit.
[2026-05-25 23:19:02] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-25 23:19:02] [INFO ] Invariant cache hit.
[2026-05-25 23:19:02] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 23:19:03] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
[2026-05-25 23:19:03] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 682 ms. Remains : 160/160 places, 141/141 transitions.
Computed a total of 160 stabilizing places and 141 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 160 transition count 141
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 9 factoid took 106 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 40002 steps (248 resets) in 105 ms. (377 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (44 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
[2026-05-25 23:19:03] [INFO ] Invariant cache hit.
[2026-05-25 23:19:03] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 120/124 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/132 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 114/246 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 9/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/252 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/253 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/253 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/253 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/301 variables, and 165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 112 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 136/160 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 120/124 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/132 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 114/246 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 246/301 variables, and 160 constraints, problems are : Problem set: 1 solved, 0 unsolved in 83 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 132/160 constraints, ReadFeed: 9/10 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 198ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 10 factoid took 161 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 651 ms.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 647 reset in 160 ms.
Product exploration explored 100000 steps with 647 reset in 162 ms.
Built C files in :
/tmp/ltsmin8150965558221099511
[2026-05-25 23:19:04] [INFO ] Computing symmetric may disable matrix : 141 transitions.
[2026-05-25 23:19:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:19:04] [INFO ] Computing symmetric may enable matrix : 141 transitions.
[2026-05-25 23:19:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:19:04] [INFO ] Computing Do-Not-Accords matrix : 141 transitions.
[2026-05-25 23:19:04] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:19:04] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8150965558221099511
Running compilation step : cd /tmp/ltsmin8150965558221099511;'/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 388 ms.
Running link step : cd /tmp/ltsmin8150965558221099511;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin8150965558221099511;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15537325004253585461.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 141/141 transitions.
Applied a total of 0 rules in 13 ms. Remains 160 /160 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2026-05-25 23:19:19] [INFO ] Invariant cache hit.
[2026-05-25 23:19:19] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-25 23:19:19] [INFO ] Invariant cache hit.
[2026-05-25 23:19:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 23:19:20] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
[2026-05-25 23:19:20] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 691 ms. Remains : 160/160 places, 141/141 transitions.
Built C files in :
/tmp/ltsmin1956830455146433513
[2026-05-25 23:19:20] [INFO ] Computing symmetric may disable matrix : 141 transitions.
[2026-05-25 23:19:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:19:20] [INFO ] Computing symmetric may enable matrix : 141 transitions.
[2026-05-25 23:19:20] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:19:20] [INFO ] Computing Do-Not-Accords matrix : 141 transitions.
[2026-05-25 23:19:20] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:19:20] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1956830455146433513
Running compilation step : cd /tmp/ltsmin1956830455146433513;'/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 282 ms.
Running link step : cd /tmp/ltsmin1956830455146433513;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1956830455146433513;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14744074833028990404.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 23:19:35] [INFO ] Flatten gal took : 7 ms
[2026-05-25 23:19:35] [INFO ] Flatten gal took : 9 ms
[2026-05-25 23:19:35] [INFO ] Time to serialize gal into /tmp/LTL3628532105715357357.gal : 2 ms
[2026-05-25 23:19:35] [INFO ] Time to serialize properties into /tmp/LTL16443593263366926382.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/LTL3628532105715357357.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10962462566606776577.hoa' '-atoms' '/tmp/LTL16443593263366926382.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16443593263366926382.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10962462566606776577.hoa
Reverse transition relation is NOT exact ! Due to transitions t0, t15.t16, t17.t18, t21.t22, t27.t28, t33.t34, t37.t38, t42.t43, t48.t49, t52.t53, t58.t59,...319
Computing Next relation with stutter on 1.31836e+11 deadlock states
Detected timeout of ITS tools.
[2026-05-25 23:19:50] [INFO ] Flatten gal took : 7 ms
[2026-05-25 23:19:50] [INFO ] Flatten gal took : 6 ms
[2026-05-25 23:19:50] [INFO ] Time to serialize gal into /tmp/LTL3981248815458099037.gal : 2 ms
[2026-05-25 23:19:50] [INFO ] Time to serialize properties into /tmp/LTL1593584016783523525.ltl : 4 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/LTL3981248815458099037.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1593584016783523525.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 : !((G(("(election_15_2_4_to_left_12<=rcv_left_election_15_4_11_11)")||(G("(((rcv_left_reply_15_2_12>=3)&&(init1<=rcv_left_election_10_0...207
Formula 0 simplified : F(!"(election_15_2_4_to_left_12<=rcv_left_election_15_4_11_11)" & F!"(((rcv_left_reply_15_2_12>=3)&&(init1<=rcv_left_election_10_0_1...201
Reverse transition relation is NOT exact ! Due to transitions t0, t15.t16, t17.t18, t21.t22, t27.t28, t33.t34, t37.t38, t42.t43, t48.t49, t52.t53, t58.t59,...319
Computing Next relation with stutter on 1.31836e+11 deadlock states
Detected timeout of ITS tools.
[2026-05-25 23:20:05] [INFO ] Flatten gal took : 11 ms
[2026-05-25 23:20:05] [INFO ] Applying decomposition
[2026-05-25 23:20:05] [INFO ] Flatten gal took : 6 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/graph6391337159090745464.txt' '-o' '/tmp/graph6391337159090745464.bin' '-w' '/tmp/graph6391337159090745464.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6391337159090745464.bin' '-l' '-1' '-v' '-w' '/tmp/graph6391337159090745464.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:20:05] [INFO ] Decomposing Gal with order
[2026-05-25 23:20:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:20:05] [INFO ] Removed a total of 88 redundant transitions.
[2026-05-25 23:20:05] [INFO ] Flatten gal took : 60 ms
[2026-05-25 23:20:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 7 ms.
[2026-05-25 23:20:05] [INFO ] Time to serialize gal into /tmp/LTL11421214224032434862.gal : 5 ms
[2026-05-25 23:20:05] [INFO ] Time to serialize properties into /tmp/LTL12257543441907239087.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/LTL11421214224032434862.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12257543441907239087.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 : !((G(("(gu23.election_15_2_4_to_left_12<=gu23.rcv_left_election_15_4_11_11)")||(G("(((gi2.gi3.gi1.gu2.rcv_left_reply_15_2_12>=3)&&(gu0...249
Formula 0 simplified : F(!"(gu23.election_15_2_4_to_left_12<=gu23.rcv_left_election_15_4_11_11)" & F!"(((gi2.gi3.gi1.gu2.rcv_left_reply_15_2_12>=3)&&(gu0.i...243
Reverse transition relation is NOT exact ! Due to transitions gi2.gi0.gi0.t261_t262, gi2.gi0.gi0.t77_t78, gi2.gi0.gi1.t17_t18, gi2.gi1.gi3.t48_t49, gi2.gi1...439
Computing Next relation with stutter on 1.31836e+11 deadlock states
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-07 finished in 114351 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))||G(p0)))'
Support contains 2 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 280/280 transitions.
Graph (complete) has 561 edges and 300 vertex of which 299 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 15 places and 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 284 transition count 148
Reduce places removed 117 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 118 rules applied. Total rules applied 236 place count 167 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 237 place count 166 transition count 147
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 244 place count 159 transition count 140
Iterating global reduction 3 with 7 rules applied. Total rules applied 251 place count 159 transition count 140
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 253 place count 159 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 255 place count 157 transition count 138
Applied a total of 255 rules in 28 ms. Remains 157 /300 variables (removed 143) and now considering 138/280 (removed 142) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9568286045970628939.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-329955072306555507.kers'
[2026-05-25 23:20:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9568286045970628939.kers, --Pflows, --basisKERS=/tmp/petrispot-output-329955072306555507.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 138 rows 157 cols 288 entries
Finished phase 1 with 134 SingleSign rule and 4 generalized
[2026-05-25 23:20:20] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-329955072306555507.kers
Total runtime 1 ms.
[2026-05-25 23:20:21] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-25 23:20:21] [INFO ] Invariant cache hit.
[2026-05-25 23:20:21] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2026-05-25 23:20:21] [INFO ] Redundant transitions in 3 ms returned []
Running 109 sub problems to find dead transitions.
[2026-05-25 23:20:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 2/130 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 111/241 variables, 130/149 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 0/241 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/295 variables, and 149 constraints, problems are : Problem set: 0 solved, 109 unsolved in 5214 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 130/157 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 2/130 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 111/241 variables, 130/149 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 109/258 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/241 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/295 variables, and 258 constraints, problems are : Problem set: 0 solved, 109 unsolved in 13518 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 130/157 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18741ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 18741ms
Starting structural reductions in SI_LTL mode, iteration 1 : 157/300 places, 138/280 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19253 ms. Remains : 157/300 places, 138/280 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))||G(!p0)))'
Stuttering acceptance computed with spot in 80 ms :[false, (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-08
Stuttering criterion allowed to conclude after 152 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-15-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-08 finished in 19365 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 2 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 280/280 transitions.
Graph (complete) has 561 edges and 300 vertex of which 299 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 15 places and 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 284 transition count 147
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 166 transition count 147
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 244 place count 159 transition count 140
Iterating global reduction 2 with 7 rules applied. Total rules applied 251 place count 159 transition count 140
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 253 place count 159 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 255 place count 157 transition count 138
Applied a total of 255 rules in 22 ms. Remains 157 /300 variables (removed 143) and now considering 138/280 (removed 142) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7822036428191982656.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11659014098967313124.kers'
[2026-05-25 23:20:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7822036428191982656.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11659014098967313124.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 138 rows 157 cols 287 entries
Finished phase 1 with 134 SingleSign rule and 4 generalized
[2026-05-25 23:20:40] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11659014098967313124.kers
Total runtime 1 ms.
[2026-05-25 23:20:40] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-25 23:20:40] [INFO ] Invariant cache hit.
[2026-05-25 23:20:40] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2026-05-25 23:20:40] [INFO ] Redundant transitions in 4 ms returned []
Running 109 sub problems to find dead transitions.
[2026-05-25 23:20:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 2/130 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 113/243 variables, 130/149 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 2/245 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/245 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/295 variables, and 151 constraints, problems are : Problem set: 0 solved, 109 unsolved in 6211 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 132/157 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 2/130 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 113/243 variables, 130/149 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 109/258 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 2/245 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/295 variables, and 260 constraints, problems are : Problem set: 0 solved, 109 unsolved in 23791 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 132/157 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30011ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 30011ms
Starting structural reductions in SI_LTL mode, iteration 1 : 157/300 places, 138/280 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30564 ms. Remains : 157/300 places, 138/280 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 39 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-09
Stuttering criterion allowed to conclude after 152 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-15-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-09 finished in 30641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(F(p1)))))'
Support contains 4 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 280/280 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 299 transition count 280
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 292 transition count 273
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 292 transition count 273
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 20 place count 287 transition count 268
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 287 transition count 268
Applied a total of 25 rules in 20 ms. Remains 287 /300 variables (removed 13) and now considering 268/280 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15909338811276395976.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10786337407508213531.kers'
[2026-05-25 23:21:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15909338811276395976.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10786337407508213531.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 268 rows 287 cols 807 entries
Finished phase 1 with 264 SingleSign rule and 4 generalized
[2026-05-25 23:21:10] [INFO ] Computed 19 invariants in 3 ms
Computed 19 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10786337407508213531.kers
Total runtime 4 ms.
[2026-05-25 23:21:11] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-25 23:21:11] [INFO ] Invariant cache hit.
[2026-05-25 23:21:12] [INFO ] Implicit Places using invariants and state equation in 1584 ms returned []
Implicit Place search using SMT with State Equation took 1703 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2026-05-25 23:21:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 306 constraints, problems are : Problem set: 0 solved, 253 unsolved in 27416 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 253/559 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 559 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57461ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 57462ms
Starting structural reductions in LTL mode, iteration 1 : 287/300 places, 268/280 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59191 ms. Remains : 287/300 places, 268/280 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(F(p1)))))'
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 181 ms.
Product exploration explored 100000 steps with 50000 reset in 198 ms.
Computed a total of 287 stabilizing places and 268 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 287 transition count 268
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 7 factoid took 51 ms. Proved property starting from automaton with 3 states, 3 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 137 ms.
FORMULA HirschbergSinclair-PT-15-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-10 finished in 59874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 280/280 transitions.
Graph (complete) has 561 edges and 300 vertex of which 299 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 15 places and 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 284 transition count 145
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 241 place count 164 transition count 145
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 249 place count 156 transition count 137
Iterating global reduction 2 with 8 rules applied. Total rules applied 257 place count 156 transition count 137
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 259 place count 156 transition count 135
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 261 place count 154 transition count 135
Applied a total of 261 rules in 21 ms. Remains 154 /300 variables (removed 146) and now considering 135/280 (removed 145) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11321521865896594672.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15949944062642151554.kers'
[2026-05-25 23:22:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11321521865896594672.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15949944062642151554.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 135 rows 154 cols 278 entries
Finished phase 1 with 131 SingleSign rule and 4 generalized
[2026-05-25 23:22:10] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15949944062642151554.kers
Total runtime 2 ms.
[2026-05-25 23:22:10] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-25 23:22:10] [INFO ] Invariant cache hit.
[2026-05-25 23:22:11] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2026-05-25 23:22:11] [INFO ] Redundant transitions in 1 ms returned []
Running 106 sub problems to find dead transitions.
[2026-05-25 23:22:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/127 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 108/235 variables, 127/146 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 0/235 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/289 variables, and 146 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4602 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 127/154 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 2/127 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 108/235 variables, 127/146 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 106/252 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/235 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/289 variables, and 252 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4588 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 127/154 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9194ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 9195ms
Starting structural reductions in SI_LTL mode, iteration 1 : 154/300 places, 135/280 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9742 ms. Remains : 154/300 places, 135/280 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-11
Product exploration explored 100000 steps with 695 reset in 131 ms.
Product exploration explored 100000 steps with 696 reset in 273 ms.
Computed a total of 154 stabilizing places and 135 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 154 transition count 135
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 61 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 590 steps (0 resets) in 6 ms. (84 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
[2026-05-25 23:22:21] [INFO ] Invariant cache hit.
[2026-05-25 23:22:21] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 13 ms returned sat
[2026-05-25 23:22:22] [INFO ] [Real]Absence check using state equation in 812 ms returned sat
[2026-05-25 23:22:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 23:22:22] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 7 ms returned sat
[2026-05-25 23:22:23] [INFO ] [Nat]Absence check using state equation in 915 ms returned sat
[2026-05-25 23:22:23] [INFO ] Computed and/alt/rep : 106/111/106 causal constraints (skipped 0 transitions) in 7 ms.
[2026-05-25 23:22:23] [INFO ] Added : 99 causal constraints over 20 iterations in 635 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 2829 ms.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 135/135 transitions.
Applied a total of 0 rules in 10 ms. Remains 154 /154 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2026-05-25 23:22:23] [INFO ] Invariant cache hit.
[2026-05-25 23:22:24] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-25 23:22:24] [INFO ] Invariant cache hit.
[2026-05-25 23:22:24] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
[2026-05-25 23:22:24] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 536 ms. Remains : 154/154 places, 135/135 transitions.
Computed a total of 154 stabilizing places and 135 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 154 transition count 135
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 47 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 604 steps (0 resets) in 13 ms. (43 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 49 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
[2026-05-25 23:22:24] [INFO ] Invariant cache hit.
[2026-05-25 23:22:24] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 12 ms returned sat
[2026-05-25 23:22:25] [INFO ] [Real]Absence check using state equation in 814 ms returned sat
[2026-05-25 23:22:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 23:22:25] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 6 ms returned sat
[2026-05-25 23:22:26] [INFO ] [Nat]Absence check using state equation in 918 ms returned sat
[2026-05-25 23:22:26] [INFO ] Computed and/alt/rep : 106/111/106 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-25 23:22:27] [INFO ] Added : 99 causal constraints over 20 iterations in 639 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 2774 ms.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 696 reset in 130 ms.
Product exploration explored 100000 steps with 696 reset in 189 ms.
Built C files in :
/tmp/ltsmin10937847553551148042
[2026-05-25 23:22:27] [INFO ] Computing symmetric may disable matrix : 135 transitions.
[2026-05-25 23:22:27] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:22:27] [INFO ] Computing symmetric may enable matrix : 135 transitions.
[2026-05-25 23:22:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:22:27] [INFO ] Computing Do-Not-Accords matrix : 135 transitions.
[2026-05-25 23:22:27] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:22:27] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10937847553551148042
Running compilation step : cd /tmp/ltsmin10937847553551148042;'/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 283 ms.
Running link step : cd /tmp/ltsmin10937847553551148042;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin10937847553551148042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9275807217067103495.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 135/135 transitions.
Applied a total of 0 rules in 6 ms. Remains 154 /154 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2026-05-25 23:22:42] [INFO ] Invariant cache hit.
[2026-05-25 23:22:42] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-25 23:22:42] [INFO ] Invariant cache hit.
[2026-05-25 23:22:43] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2026-05-25 23:22:43] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 542 ms. Remains : 154/154 places, 135/135 transitions.
Built C files in :
/tmp/ltsmin5481796795494150870
[2026-05-25 23:22:43] [INFO ] Computing symmetric may disable matrix : 135 transitions.
[2026-05-25 23:22:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:22:43] [INFO ] Computing symmetric may enable matrix : 135 transitions.
[2026-05-25 23:22:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:22:43] [INFO ] Computing Do-Not-Accords matrix : 135 transitions.
[2026-05-25 23:22:43] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:22:43] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5481796795494150870
Running compilation step : cd /tmp/ltsmin5481796795494150870;'/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 279 ms.
Running link step : cd /tmp/ltsmin5481796795494150870;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin5481796795494150870;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18283500797403288501.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 23:22:58] [INFO ] Flatten gal took : 6 ms
[2026-05-25 23:22:58] [INFO ] Flatten gal took : 5 ms
[2026-05-25 23:22:58] [INFO ] Time to serialize gal into /tmp/LTL8952039671993916920.gal : 1 ms
[2026-05-25 23:22:58] [INFO ] Time to serialize properties into /tmp/LTL5191797952535317998.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8952039671993916920.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15114940214946568881.hoa' '-atoms' '/tmp/LTL5191797952535317998.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/LTL5191797952535317998.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15114940214946568881.hoa
Reverse transition relation is NOT exact ! Due to transitions t17.t18, t21.t22, t27.t28, t33.t34, t37.t38, t42.t43, t48.t49, t52.t53, t58.t59, t62.t63, t68...301
Computing Next relation with stutter on 1.09863e+11 deadlock states
153 unique states visited
153 strongly connected components in search stack
154 transitions explored
153 items max in DFS search stack
382 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,3.84581,144724,1,0,750,577636,300,772,4484,661152,1924
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HirschbergSinclair-PT-15-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-11 finished in 52158 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 280/280 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 299 transition count 280
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 291 transition count 272
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 291 transition count 272
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 285 transition count 266
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 285 transition count 266
Applied a total of 29 rules in 29 ms. Remains 285 /300 variables (removed 15) and now considering 266/280 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2364241169549862702.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5997506679274126223.kers'
[2026-05-25 23:23:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2364241169549862702.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5997506679274126223.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 266 rows 285 cols 802 entries
Finished phase 1 with 262 SingleSign rule and 4 generalized
[2026-05-25 23:23:02] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5997506679274126223.kers
Total runtime 2 ms.
[2026-05-25 23:23:03] [INFO ] Implicit Places using invariants in 114 ms returned []
[2026-05-25 23:23:03] [INFO ] Invariant cache hit.
[2026-05-25 23:23:04] [INFO ] Implicit Places using invariants and state equation in 1565 ms returned []
Implicit Place search using SMT with State Equation took 1681 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2026-05-25 23:23:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 27425 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57465ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 57467ms
Starting structural reductions in LTL mode, iteration 1 : 285/300 places, 266/280 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59180 ms. Remains : 285/300 places, 266/280 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 239 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-15-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-12 finished in 59399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 300 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 300/300 places, 280/280 transitions.
Reduce places removed 15 places and 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 285 transition count 148
Reduce places removed 117 places and 0 transitions.
Iterating post reduction 1 with 117 rules applied. Total rules applied 234 place count 168 transition count 148
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 241 place count 161 transition count 141
Iterating global reduction 2 with 7 rules applied. Total rules applied 248 place count 161 transition count 141
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 250 place count 161 transition count 139
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 252 place count 159 transition count 139
Applied a total of 252 rules in 15 ms. Remains 159 /300 variables (removed 141) and now considering 139/280 (removed 141) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17611474593385818332.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6911443098345913661.kers'
[2026-05-25 23:24:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17611474593385818332.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6911443098345913661.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 139 rows 159 cols 292 entries
Finished phase 1 with 135 SingleSign rule and 4 generalized
[2026-05-25 23:24:02] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6911443098345913661.kers
Total runtime 2 ms.
[2026-05-25 23:24:02] [INFO ] Implicit Places using invariants in 190 ms returned []
[2026-05-25 23:24:02] [INFO ] Invariant cache hit.
[2026-05-25 23:24:03] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2026-05-25 23:24:03] [INFO ] Redundant transitions in 1 ms returned []
Running 110 sub problems to find dead transitions.
[2026-05-25 23:24:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 2/131 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 2/133 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 113/246 variables, 133/153 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/246 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/298 variables, and 153 constraints, problems are : Problem set: 0 solved, 110 unsolved in 5337 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 133/159 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 2/131 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 2/133 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 113/246 variables, 133/153 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 110/263 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/298 variables, and 263 constraints, problems are : Problem set: 0 solved, 110 unsolved in 14100 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 133/159 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19444ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 19444ms
Starting structural reductions in SI_LTL mode, iteration 1 : 159/300 places, 139/280 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20133 ms. Remains : 159/300 places, 139/280 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-15-LTLCardinality-14
Product exploration explored 100000 steps with 682 reset in 148 ms.
Product exploration explored 100000 steps with 682 reset in 186 ms.
Computed a total of 159 stabilizing places and 139 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 159 transition count 139
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 11 factoid took 56 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 618 steps (1 resets) in 16 ms. (36 steps per ms) remains 0/4 properties
Knowledge based reduction with 11 factoid took 126 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 358 ms.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 139/139 transitions.
Applied a total of 0 rules in 11 ms. Remains 159 /159 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2026-05-25 23:24:23] [INFO ] Invariant cache hit.
[2026-05-25 23:24:23] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-25 23:24:23] [INFO ] Invariant cache hit.
[2026-05-25 23:24:23] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2026-05-25 23:24:23] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 578 ms. Remains : 159/159 places, 139/139 transitions.
Computed a total of 159 stabilizing places and 139 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 159 transition count 139
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 11 factoid took 59 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 456 steps (0 resets) in 10 ms. (41 steps per ms) remains 0/4 properties
Knowledge based reduction with 11 factoid took 117 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 335 ms.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 682 reset in 155 ms.
Product exploration explored 100000 steps with 682 reset in 162 ms.
Built C files in :
/tmp/ltsmin16792503704671349191
[2026-05-25 23:24:24] [INFO ] Computing symmetric may disable matrix : 139 transitions.
[2026-05-25 23:24:24] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:24:24] [INFO ] Computing symmetric may enable matrix : 139 transitions.
[2026-05-25 23:24:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:24:24] [INFO ] Computing Do-Not-Accords matrix : 139 transitions.
[2026-05-25 23:24:24] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:24:24] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16792503704671349191
Running compilation step : cd /tmp/ltsmin16792503704671349191;'/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 287 ms.
Running link step : cd /tmp/ltsmin16792503704671349191;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16792503704671349191;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2534838285263624558.hoa' '--buchi-type=spotba'
LTSmin run took 94 ms.
FORMULA HirschbergSinclair-PT-15-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-15-LTLCardinality-14 finished in 22923 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||G(p1))))'
Spot run failed in 72 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-25 23:24:25] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9192827371385185810
[2026-05-25 23:24:25] [INFO ] Computing symmetric may disable matrix : 280 transitions.
[2026-05-25 23:24:25] [INFO ] Applying decomposition
[2026-05-25 23:24:25] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:24:25] [INFO ] Computing symmetric may enable matrix : 280 transitions.
[2026-05-25 23:24:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 23:24:25] [INFO ] Flatten gal took : 11 ms
[2026-05-25 23:24:25] [INFO ] Computing Do-Not-Accords matrix : 280 transitions.
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/graph18392214446387561270.txt' '-o' '/tmp/graph18392214446387561270.bin' '-w' '/tmp/graph18392214446387561270.weights'
[2026-05-25 23:24:25] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18392214446387561270.bin' '-l' '-1' '-v' '-w' '/tmp/graph18392214446387561270.weights' '-q' '0' '-e' '0.001'
[2026-05-25 23:24:25] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9192827371385185810
Running compilation step : cd /tmp/ltsmin9192827371385185810;'/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-25 23:24:25] [INFO ] Decomposing Gal with order
[2026-05-25 23:24:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 23:24:25] [INFO ] Removed a total of 31 redundant transitions.
[2026-05-25 23:24:25] [INFO ] Flatten gal took : 29 ms
[2026-05-25 23:24:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-25 23:24:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality2053098436168631688.gal : 6 ms
[2026-05-25 23:24:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality1465525431199627195.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2053098436168631688.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1465525431199627195.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...297
Read 1 LTL properties
Checking formula 0 : !((G(("(gu22.election_15_2_4_to_left_12<=gu22.rcv_left_election_15_4_11_11)")||(G("(((gi1.gi1.gi1.gu20.rcv_left_reply_15_2_12>=3)&&(gu...250
Formula 0 simplified : F(!"(gu22.election_15_2_4_to_left_12<=gu22.rcv_left_election_15_4_11_11)" & F!"(((gi1.gi1.gi1.gu20.rcv_left_reply_15_2_12>=3)&&(gu0....244
Compilation finished in 564 ms.
Running link step : cd /tmp/ltsmin9192827371385185810;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9192827371385185810;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](((LTLAPp0==true)||[]((LTLAPp1==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gi1.gi0.gi0.gu6.t49, gi1.gi0.gi0.gu7.t53, gi1.gi0.gi0.gu7.t61, gi1.gi0.gi0.gu18.t43, gi1.gi0....940
Computing Next relation with stutter on 4.06782e+11 deadlock states
Detected timeout of ITS tools.
[2026-05-25 23:47:46] [INFO ] Flatten gal took : 11 ms
[2026-05-25 23:47:46] [INFO ] Time to serialize gal into /tmp/LTLCardinality6009329919701812366.gal : 17 ms
[2026-05-25 23:47:46] [INFO ] Time to serialize properties into /tmp/LTLCardinality18003467664598823177.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/LTLCardinality6009329919701812366.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18003467664598823177.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...298
Read 1 LTL properties
Checking formula 0 : !((G(("(election_15_2_4_to_left_12<=rcv_left_election_15_4_11_11)")||(G("(((rcv_left_reply_15_2_12>=3)&&(init1<=rcv_left_election_10_0...207
Formula 0 simplified : F(!"(election_15_2_4_to_left_12<=rcv_left_election_15_4_11_11)" & F!"(((rcv_left_reply_15_2_12>=3)&&(init1<=rcv_left_election_10_0_1...201
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t20, t22, t26, t28...375
Computing Next relation with stutter on 4.06782e+11 deadlock states
Detected timeout of ITS tools.
[2026-05-26 00:11:08] [INFO ] Flatten gal took : 14 ms
[2026-05-26 00:11:08] [INFO ] Input system was already deterministic with 280 transitions.
[2026-05-26 00:11:08] [INFO ] Transformed 300 places.
[2026-05-26 00:11:08] [INFO ] Transformed 280 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-26 00:11:08] [INFO ] Time to serialize gal into /tmp/LTLCardinality5375727589029722063.gal : 3 ms
[2026-05-26 00:11:08] [INFO ] Time to serialize properties into /tmp/LTLCardinality13289311137737324588.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/LTLCardinality5375727589029722063.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13289311137737324588.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(("(election_15_2_4_to_left_12<=rcv_left_election_15_4_11_11)")||(G("(((rcv_left_reply_15_2_12>=3)&&(init1<=rcv_left_election_10_0...207
Formula 0 simplified : F(!"(election_15_2_4_to_left_12<=rcv_left_election_15_4_11_11)" & F!"(((rcv_left_reply_15_2_12>=3)&&(init1<=rcv_left_election_10_0_1...201
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t20, t22, t26, t28...375
Computing Next relation with stutter on 4.06782e+11 deadlock states

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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-15"
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-15, 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-177961074400747"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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