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.r050-smll-177946901100124.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 Champagne-PT-H09T0R, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050-smll-177946901100124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 6.4K Mar 6 10:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Mar 6 10:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 6 10:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 6 10:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 6 10:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 181K Mar 6 10:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 10:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Mar 6 10:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 366K 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 Champagne-PT-H09T0R-LTLFireability-00
FORMULA_NAME Champagne-PT-H09T0R-LTLFireability-01
FORMULA_NAME Champagne-PT-H09T0R-LTLFireability-02
FORMULA_NAME Champagne-PT-H09T0R-LTLFireability-03
FORMULA_NAME Champagne-PT-H09T0R-LTLFireability-04
FORMULA_NAME Champagne-PT-H09T0R-LTLFireability-05
FORMULA_NAME Champagne-PT-H09T0R-LTLFireability-06
FORMULA_NAME Champagne-PT-H09T0R-LTLFireability-07
FORMULA_NAME Champagne-PT-H09T0R-LTLFireability-08
FORMULA_NAME Champagne-PT-H09T0R-LTLFireability-09
FORMULA_NAME Champagne-PT-H09T0R-LTLFireability-10
FORMULA_NAME Champagne-PT-H09T0R-LTLFireability-11
FORMULA_NAME Champagne-PT-H09T0R-LTLFireability-12
FORMULA_NAME Champagne-PT-H09T0R-LTLFireability-13
FORMULA_NAME Champagne-PT-H09T0R-LTLFireability-14
FORMULA_NAME Champagne-PT-H09T0R-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779526350141

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H09T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 08:52:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 08:52:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 08:52:33] [INFO ] Load time of PNML (sax parser for PT used): 336 ms
[2026-05-23 08:52:33] [INFO ] Transformed 979 places.
[2026-05-23 08:52:33] [INFO ] Transformed 1572 transitions.
[2026-05-23 08:52:33] [INFO ] Found NUPN structural information;
[2026-05-23 08:52:33] [INFO ] Parsed PT model containing 979 places and 1572 transitions and 4420 arcs in 606 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Champagne-PT-H09T0R-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 979 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 979/979 places, 1572/1572 transitions.
Discarding 237 places :
Symmetric choice reduction at 0 with 237 rule applications. Total rules 237 place count 742 transition count 1335
Iterating global reduction 0 with 237 rules applied. Total rules applied 474 place count 742 transition count 1335
Discarding 141 places :
Symmetric choice reduction at 0 with 141 rule applications. Total rules 615 place count 601 transition count 1194
Iterating global reduction 0 with 141 rules applied. Total rules applied 756 place count 601 transition count 1194
Discarding 95 places :
Symmetric choice reduction at 0 with 95 rule applications. Total rules 851 place count 506 transition count 947
Iterating global reduction 0 with 95 rules applied. Total rules applied 946 place count 506 transition count 947
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 983 place count 506 transition count 910
Applied a total of 983 rules in 357 ms. Remains 506 /979 variables (removed 473) and now considering 910/1572 (removed 662) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15322759845920400832.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8923281581608847686.kers'
[2026-05-23 08:52:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15322759845920400832.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8923281581608847686.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 910 rows 506 cols 2742 entries
Finished phase 1 with 457 SingleSign rule and 0 generalized
[2026-05-23 08:52:34] [INFO ] Computed 49 invariants in 7 ms
Computed 49 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-8923281581608847686.kers
Total runtime 11 ms.
[2026-05-23 08:52:35] [INFO ] Implicit Places using invariants in 907 ms returned []
[2026-05-23 08:52:35] [INFO ] Invariant cache hit.
[2026-05-23 08:52:36] [INFO ] Implicit Places using invariants and state equation in 1182 ms returned []
Implicit Place search using SMT with State Equation took 2160 ms to find 0 implicit places.
Running 909 sub problems to find dead transitions.
[2026-05-23 08:52:36] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/505 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 909 unsolved
SMT process timed out in 30779ms, After SMT, problems are : Problem set: 0 solved, 909 unsolved
Search for dead transitions found 0 dead transitions in 30825ms
Starting structural reductions in LTL mode, iteration 1 : 506/979 places, 910/1572 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33470 ms. Remains : 506/979 places, 910/1572 transitions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 910/910 transitions.
Applied a total of 0 rules in 38 ms. Remains 506 /506 variables (removed 0) and now considering 910/910 (removed 0) transitions.
[2026-05-23 08:53:07] [INFO ] Invariant cache hit.
[2026-05-23 08:53:07] [INFO ] Implicit Places using invariants in 446 ms returned []
[2026-05-23 08:53:07] [INFO ] Invariant cache hit.
[2026-05-23 08:53:08] [INFO ] Implicit Places using invariants and state equation in 982 ms returned []
Implicit Place search using SMT with State Equation took 1433 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1473 ms. Remains : 506/506 places, 910/910 transitions.
Support contains 41 out of 506 places after structural reductions.
[2026-05-23 08:53:09] [INFO ] Flatten gal took : 198 ms
[2026-05-23 08:53:09] [INFO ] Flatten gal took : 116 ms
[2026-05-23 08:53:09] [INFO ] Input system was already deterministic with 910 transitions.
RANDOM walk for 40000 steps (70 resets) in 2035 ms. (19 steps per ms) remains 2/34 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
[2026-05-23 08:53:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 473/506 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 910/1416 variables, 506/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1416 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1416 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1416/1416 variables, and 555 constraints, problems are : Problem set: 0 solved, 2 unsolved in 710 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 506/506 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 473/506 variables, 47/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 910/1416 variables, 506/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1416 variables, 2/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1416 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1416 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1416/1416 variables, and 557 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1230 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 506/506 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1959ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 245 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=30 )
Parikh walk visited 2 properties in 21 ms.
FORMULA Champagne-PT-H09T0R-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 54 stabilizing places and 54 stable 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 U p1)||X(p2)))) U (!p0&&X((!p0 U (!p1||G(!p0)))))))'
Support contains 6 out of 506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 910/910 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 490 transition count 845
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 490 transition count 845
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 38 place count 490 transition count 839
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 484 transition count 827
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 484 transition count 827
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 484 transition count 826
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 480 transition count 809
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 480 transition count 809
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 480 transition count 807
Applied a total of 61 rules in 129 ms. Remains 480 /506 variables (removed 26) and now considering 807/910 (removed 103) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1235429593170137895.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-239605652052706862.kers'
[2026-05-23 08:53:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1235429593170137895.kers, --Pflows, --basisKERS=/tmp/petrispot-output-239605652052706862.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 807 rows 480 cols 2382 entries
Finished phase 1 with 431 SingleSign rule and 0 generalized
[2026-05-23 08:53:13] [INFO ] Computed 49 invariants in 5 ms
Computed 49 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-239605652052706862.kers
Total runtime 7 ms.
[2026-05-23 08:53:13] [INFO ] Implicit Places using invariants in 412 ms returned []
[2026-05-23 08:53:13] [INFO ] Invariant cache hit.
[2026-05-23 08:53:14] [INFO ] Implicit Places using invariants and state equation in 828 ms returned []
Implicit Place search using SMT with State Equation took 1243 ms to find 0 implicit places.
Running 806 sub problems to find dead transitions.
[2026-05-23 08:53:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 806 unsolved
SMT process timed out in 30363ms, After SMT, problems are : Problem set: 0 solved, 806 unsolved
Search for dead transitions found 0 dead transitions in 30371ms
Starting structural reductions in LTL mode, iteration 1 : 480/506 places, 807/910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31751 ms. Remains : 480/506 places, 807/910 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 U p1)||X(p2)))) U (!p0&&X((!p0 U (!p1||G(!p0)))))))'
Stuttering acceptance computed with spot in 661 ms :[p0, (AND (NOT p1) (NOT p2)), (AND p0 p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false]
Running random walk in product with property : Champagne-PT-H09T0R-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 737 ms.
Product exploration explored 100000 steps with 50000 reset in 357 ms.
Computed a total of 48 stabilizing places and 48 stable transitions
Computed a total of 48 stabilizing places and 48 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 21 factoid took 23 ms. Proved property starting from automaton with 6 states, 21 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 46 ms.
FORMULA Champagne-PT-H09T0R-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H09T0R-LTLFireability-01 finished in 33753 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((G(!p0) U X(X(p1))))) U (p1&&X(!p0))))'
Support contains 3 out of 506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 910/910 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 488 transition count 820
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 488 transition count 820
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 44 place count 488 transition count 812
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 482 transition count 800
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 482 transition count 800
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 482 transition count 799
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 478 transition count 782
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 478 transition count 782
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 478 transition count 780
Applied a total of 67 rules in 49 ms. Remains 478 /506 variables (removed 28) and now considering 780/910 (removed 130) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-450788977869612241.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4653996321742271910.kers'
[2026-05-23 08:53:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-450788977869612241.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4653996321742271910.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 780 rows 478 cols 2278 entries
Finished phase 1 with 429 SingleSign rule and 0 generalized
[2026-05-23 08:53:46] [INFO ] Computed 49 invariants in 6 ms
Computed 49 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-4653996321742271910.kers
Total runtime 8 ms.
[2026-05-23 08:53:47] [INFO ] Implicit Places using invariants in 327 ms returned []
[2026-05-23 08:53:47] [INFO ] Invariant cache hit.
[2026-05-23 08:53:48] [INFO ] Implicit Places using invariants and state equation in 792 ms returned []
Implicit Place search using SMT with State Equation took 1124 ms to find 0 implicit places.
Running 779 sub problems to find dead transitions.
[2026-05-23 08:53:48] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 779 unsolved
SMT process timed out in 30144ms, After SMT, problems are : Problem set: 0 solved, 779 unsolved
Search for dead transitions found 0 dead transitions in 30148ms
Starting structural reductions in LTL mode, iteration 1 : 478/506 places, 780/910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31327 ms. Remains : 478/506 places, 780/910 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((G(!p0) U X(X(p1))))) U (p1&&X(!p0))))'
Stuttering acceptance computed with spot in 482 ms :[(OR (NOT p1) p0), (NOT p1), p0, (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), p0]
Running random walk in product with property : Champagne-PT-H09T0R-LTLFireability-02
Entered a terminal (fully accepting) state of product in 847 steps with 1 reset in 6 ms.
FORMULA Champagne-PT-H09T0R-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T0R-LTLFireability-02 finished in 31899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p1)||p0))&&(!p2 U (p3||G(!p2))))))'
Support contains 4 out of 506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 910/910 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 489 transition count 838
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 489 transition count 838
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 41 place count 489 transition count 831
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 483 transition count 819
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 483 transition count 819
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 483 transition count 818
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 479 transition count 801
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 479 transition count 801
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 479 transition count 799
Applied a total of 64 rules in 68 ms. Remains 479 /506 variables (removed 27) and now considering 799/910 (removed 111) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15961585885216879302.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18148239914632194239.kers'
[2026-05-23 08:54:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15961585885216879302.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18148239914632194239.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 799 rows 479 cols 2352 entries
Finished phase 1 with 430 SingleSign rule and 0 generalized
[2026-05-23 08:54:18] [INFO ] Computed 49 invariants in 6 ms
Computed 49 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-18148239914632194239.kers
Total runtime 8 ms.
[2026-05-23 08:54:19] [INFO ] Implicit Places using invariants in 404 ms returned []
[2026-05-23 08:54:19] [INFO ] Invariant cache hit.
[2026-05-23 08:54:20] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1257 ms to find 0 implicit places.
Running 798 sub problems to find dead transitions.
[2026-05-23 08:54:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 798 unsolved
SMT process timed out in 30208ms, After SMT, problems are : Problem set: 0 solved, 798 unsolved
Search for dead transitions found 0 dead transitions in 30212ms
Starting structural reductions in LTL mode, iteration 1 : 479/506 places, 799/910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31542 ms. Remains : 479/506 places, 799/910 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p1)||p0))&&(!p2 U (p3||G(!p2))))))'
Stuttering acceptance computed with spot in 265 ms :[(OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND p2 (NOT p3))), true, (AND (NOT p0) (NOT p1)), (AND (NOT p3) p2)]
Running random walk in product with property : Champagne-PT-H09T0R-LTLFireability-03
Entered a terminal (fully accepting) state of product in 3186 steps with 5 reset in 35 ms.
FORMULA Champagne-PT-H09T0R-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T0R-LTLFireability-03 finished in 31901 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 506/506 places, 910/910 transitions.
Graph (trivial) has 466 edges and 506 vertex of which 62 / 506 are part of one of the 14 SCC in 8 ms
Free SCC test removed 48 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 457 transition count 798
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 1 with 152 rules applied. Total rules applied 214 place count 396 transition count 707
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 2 with 45 rules applied. Total rules applied 259 place count 351 transition count 707
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 259 place count 351 transition count 679
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 315 place count 323 transition count 679
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 332 place count 306 transition count 587
Iterating global reduction 3 with 17 rules applied. Total rules applied 349 place count 306 transition count 587
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 358 place count 306 transition count 578
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 358 place count 306 transition count 572
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 370 place count 300 transition count 572
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 371 place count 299 transition count 565
Iterating global reduction 4 with 1 rules applied. Total rules applied 372 place count 299 transition count 565
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 373 place count 299 transition count 564
Performed 156 Post agglomeration using F-continuation condition.Transition count delta: 156
Deduced a syphon composed of 156 places in 0 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 5 with 312 rules applied. Total rules applied 685 place count 143 transition count 408
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 687 place count 141 transition count 393
Iterating global reduction 5 with 2 rules applied. Total rules applied 689 place count 141 transition count 393
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 691 place count 141 transition count 391
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 693 place count 140 transition count 399
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 695 place count 138 transition count 397
Applied a total of 695 rules in 293 ms. Remains 138 /506 variables (removed 368) and now considering 397/910 (removed 513) transitions.
[2026-05-23 08:54:50] [INFO ] Flow matrix only has 145 transitions (discarded 252 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6331169427287816844.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10818337489612222792.kers'
[2026-05-23 08:54:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6331169427287816844.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10818337489612222792.kers]
Normalized transition count is 144 out of 145 initially.
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 144 rows 127 cols 396 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-23 08:54:50] [INFO ] Computed 49 invariants in 1 ms
Computed 49 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10818337489612222792.kers
Total runtime 2 ms.
[2026-05-23 08:54:51] [INFO ] Implicit Places using invariants in 260 ms returned []
[2026-05-23 08:54:51] [INFO ] Flow matrix only has 145 transitions (discarded 252 similar events)
[2026-05-23 08:54:51] [INFO ] Invariant cache hit.
[2026-05-23 08:54:51] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
[2026-05-23 08:54:51] [INFO ] Redundant transitions in 47 ms returned []
Running 298 sub problems to find dead transitions.
[2026-05-23 08:54:51] [INFO ] Flow matrix only has 145 transitions (discarded 252 similar events)
[2026-05-23 08:54:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 3/138 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 144/282 variables, 138/187 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (OVERLAPS) 0/282 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/283 variables, and 187 constraints, problems are : Problem set: 0 solved, 298 unsolved in 22835 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 3/138 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 144/282 variables, 138/187 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 298/485 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (OVERLAPS) 0/282 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/283 variables, and 485 constraints, problems are : Problem set: 0 solved, 298 unsolved in 21991 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44899ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 44901ms
Starting structural reductions in SI_LTL mode, iteration 1 : 138/506 places, 397/910 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45921 ms. Remains : 138/506 places, 397/910 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H09T0R-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H09T0R-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T0R-LTLFireability-04 finished in 46004 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 506/506 places, 910/910 transitions.
Graph (trivial) has 468 edges and 506 vertex of which 58 / 506 are part of one of the 13 SCC in 2 ms
Free SCC test removed 45 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 460 transition count 798
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 1 with 156 rules applied. Total rules applied 221 place count 396 transition count 706
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 2 with 45 rules applied. Total rules applied 266 place count 351 transition count 706
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 266 place count 351 transition count 677
Deduced a syphon composed of 29 places in 3 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 324 place count 322 transition count 677
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 340 place count 306 transition count 597
Iterating global reduction 3 with 16 rules applied. Total rules applied 356 place count 306 transition count 597
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 364 place count 306 transition count 589
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 364 place count 306 transition count 583
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 376 place count 300 transition count 583
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 377 place count 299 transition count 576
Iterating global reduction 4 with 1 rules applied. Total rules applied 378 place count 299 transition count 576
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 379 place count 299 transition count 575
Performed 158 Post agglomeration using F-continuation condition.Transition count delta: 158
Deduced a syphon composed of 158 places in 0 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 5 with 316 rules applied. Total rules applied 695 place count 141 transition count 417
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 697 place count 139 transition count 402
Iterating global reduction 5 with 2 rules applied. Total rules applied 699 place count 139 transition count 402
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 701 place count 139 transition count 400
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 703 place count 137 transition count 398
Applied a total of 703 rules in 165 ms. Remains 137 /506 variables (removed 369) and now considering 398/910 (removed 512) transitions.
[2026-05-23 08:55:36] [INFO ] Flow matrix only has 140 transitions (discarded 258 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7572007778589627824.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2828644745913172341.kers'
[2026-05-23 08:55:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7572007778589627824.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2828644745913172341.kers]
Normalized transition count is 139 out of 140 initially.
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 139 rows 126 cols 374 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-23 08:55:36] [INFO ] Computed 49 invariants in 1 ms
Computed 49 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2828644745913172341.kers
Total runtime 2 ms.
[2026-05-23 08:55:37] [INFO ] Implicit Places using invariants in 228 ms returned []
[2026-05-23 08:55:37] [INFO ] Flow matrix only has 140 transitions (discarded 258 similar events)
[2026-05-23 08:55:37] [INFO ] Invariant cache hit.
[2026-05-23 08:55:37] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
[2026-05-23 08:55:37] [INFO ] Redundant transitions in 12 ms returned []
Running 298 sub problems to find dead transitions.
[2026-05-23 08:55:37] [INFO ] Flow matrix only has 140 transitions (discarded 258 similar events)
[2026-05-23 08:55:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 3/137 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 139/276 variables, 137/186 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (OVERLAPS) 0/276 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/277 variables, and 186 constraints, problems are : Problem set: 0 solved, 298 unsolved in 22647 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 3/137 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 139/276 variables, 137/186 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 298/484 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (OVERLAPS) 0/276 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/277 variables, and 484 constraints, problems are : Problem set: 0 solved, 298 unsolved in 21629 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44341ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 44343ms
Starting structural reductions in SI_LTL mode, iteration 1 : 137/506 places, 398/910 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45119 ms. Remains : 137/506 places, 398/910 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 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H09T0R-LTLFireability-05
Stuttering criterion allowed to conclude after 577 steps with 6 reset in 8 ms.
FORMULA Champagne-PT-H09T0R-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T0R-LTLFireability-05 finished in 45239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 506/506 places, 910/910 transitions.
Graph (trivial) has 464 edges and 506 vertex of which 62 / 506 are part of one of the 14 SCC in 1 ms
Free SCC test removed 48 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 457 transition count 796
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 1 with 155 rules applied. Total rules applied 219 place count 394 transition count 704
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 2 with 45 rules applied. Total rules applied 264 place count 349 transition count 704
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 264 place count 349 transition count 677
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 318 place count 322 transition count 677
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 335 place count 305 transition count 585
Iterating global reduction 3 with 17 rules applied. Total rules applied 352 place count 305 transition count 585
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 361 place count 305 transition count 576
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 361 place count 305 transition count 570
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 373 place count 299 transition count 570
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 374 place count 298 transition count 563
Iterating global reduction 4 with 1 rules applied. Total rules applied 375 place count 298 transition count 563
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 376 place count 298 transition count 562
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 157
Deduced a syphon composed of 157 places in 0 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 5 with 314 rules applied. Total rules applied 690 place count 141 transition count 405
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 691 place count 140 transition count 400
Iterating global reduction 5 with 1 rules applied. Total rules applied 692 place count 140 transition count 400
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 693 place count 140 transition count 399
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 695 place count 138 transition count 397
Applied a total of 695 rules in 90 ms. Remains 138 /506 variables (removed 368) and now considering 397/910 (removed 513) transitions.
[2026-05-23 08:56:21] [INFO ] Flow matrix only has 141 transitions (discarded 256 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13371515773423240166.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16494578648684360360.kers'
[2026-05-23 08:56:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13371515773423240166.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16494578648684360360.kers]
Normalized transition count is 140 out of 141 initially.
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 140 rows 126 cols 376 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-23 08:56:21] [INFO ] Computed 49 invariants in 0 ms
Computed 49 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16494578648684360360.kers
Total runtime 1 ms.
[2026-05-23 08:56:22] [INFO ] Implicit Places using invariants in 236 ms returned []
[2026-05-23 08:56:22] [INFO ] Flow matrix only has 141 transitions (discarded 256 similar events)
[2026-05-23 08:56:22] [INFO ] Invariant cache hit.
[2026-05-23 08:56:22] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
[2026-05-23 08:56:22] [INFO ] Redundant transitions in 6 ms returned []
Running 298 sub problems to find dead transitions.
[2026-05-23 08:56:22] [INFO ] Flow matrix only has 141 transitions (discarded 256 similar events)
[2026-05-23 08:56:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 4/138 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 140/278 variables, 138/187 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (OVERLAPS) 0/278 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/279 variables, and 187 constraints, problems are : Problem set: 0 solved, 298 unsolved in 21055 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 4/138 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 140/278 variables, 138/187 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 298/485 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (OVERLAPS) 0/278 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Int declared 278/279 variables, and 485 constraints, problems are : Problem set: 0 solved, 298 unsolved in 20260 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41372ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 41374ms
Starting structural reductions in SI_LTL mode, iteration 1 : 138/506 places, 397/910 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42055 ms. Remains : 138/506 places, 397/910 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H09T0R-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H09T0R-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T0R-LTLFireability-06 finished in 42216 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((p0&&X(X(F(p1))))))'
Support contains 2 out of 506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 910/910 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 489 transition count 818
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 489 transition count 818
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 43 place count 489 transition count 809
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 484 transition count 804
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 484 transition count 804
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 57 place count 480 transition count 787
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 480 transition count 787
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 480 transition count 785
Applied a total of 63 rules in 60 ms. Remains 480 /506 variables (removed 26) and now considering 785/910 (removed 125) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6288106650486796416.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7457696170281227747.kers'
[2026-05-23 08:57:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6288106650486796416.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7457696170281227747.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 785 rows 480 cols 2294 entries
Finished phase 1 with 431 SingleSign rule and 0 generalized
[2026-05-23 08:57:04] [INFO ] Computed 49 invariants in 3 ms
Computed 49 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7457696170281227747.kers
Total runtime 4 ms.
[2026-05-23 08:57:04] [INFO ] Implicit Places using invariants in 359 ms returned []
[2026-05-23 08:57:04] [INFO ] Invariant cache hit.
[2026-05-23 08:57:05] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 931 ms to find 0 implicit places.
Running 784 sub problems to find dead transitions.
[2026-05-23 08:57:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (OVERLAPS) 1/480 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 480/1265 variables, and 49 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 0/480 constraints, PredecessorRefiner: 784/784 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 784 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 1 (OVERLAPS) 1/480 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 784 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 784 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/1265 variables, and 53 constraints, problems are : Problem set: 0 solved, 784 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 0/480 constraints, PredecessorRefiner: 0/784 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60186ms problems are : Problem set: 0 solved, 784 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Starting structural reductions in LTL mode, iteration 1 : 480/506 places, 785/910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61184 ms. Remains : 480/506 places, 785/910 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&&X(X(F(p1))))))'
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Champagne-PT-H09T0R-LTLFireability-07
Product exploration explored 100000 steps with 25000 reset in 234 ms.
Product exploration explored 100000 steps with 25000 reset in 268 ms.
Computed a total of 48 stabilizing places and 48 stable transitions
Computed a total of 48 stabilizing places and 48 stable transitions
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 6166 steps (10 resets) in 65 ms. (93 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 408 ms.
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 480 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 785/785 transitions.
Applied a total of 0 rules in 13 ms. Remains 480 /480 variables (removed 0) and now considering 785/785 (removed 0) transitions.
[2026-05-23 08:58:06] [INFO ] Invariant cache hit.
[2026-05-23 08:58:06] [INFO ] Implicit Places using invariants in 316 ms returned []
[2026-05-23 08:58:06] [INFO ] Invariant cache hit.
[2026-05-23 08:58:07] [INFO ] Implicit Places using invariants and state equation in 870 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1202 ms. Remains : 480/480 places, 785/785 transitions.
Computed a total of 48 stabilizing places and 48 stable transitions
Computed a total of 48 stabilizing places and 48 stable transitions
Knowledge based reduction with 1 factoid took 60 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 4438 steps (7 resets) in 32 ms. (134 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Knowledge-based reduction took 357 ms.
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 229 ms.
Product exploration explored 100000 steps with 25000 reset in 245 ms.
Spot run failed in 108 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin2037417553653542920
[2026-05-23 08:58:09] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2037417553653542920
Running compilation step : cd /tmp/ltsmin2037417553653542920;'/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 2346 ms.
Running link step : cd /tmp/ltsmin2037417553653542920;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 85 ms.
Running LTSmin : cd /tmp/ltsmin2037417553653542920;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased3695471912377605073.hoa' '--buchi-type=spotba'
LTSmin run took 164 ms.
FORMULA Champagne-PT-H09T0R-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Champagne-PT-H09T0R-LTLFireability-07 finished in 67702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 506 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 506/506 places, 910/910 transitions.
Graph (trivial) has 469 edges and 506 vertex of which 58 / 506 are part of one of the 13 SCC in 1 ms
Free SCC test removed 45 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 460 transition count 798
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 1 with 156 rules applied. Total rules applied 221 place count 396 transition count 706
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 2 with 45 rules applied. Total rules applied 266 place count 351 transition count 706
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 266 place count 351 transition count 677
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 324 place count 322 transition count 677
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 341 place count 305 transition count 585
Iterating global reduction 3 with 17 rules applied. Total rules applied 358 place count 305 transition count 585
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 367 place count 305 transition count 576
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 367 place count 305 transition count 570
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 379 place count 299 transition count 570
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 380 place count 298 transition count 563
Iterating global reduction 4 with 1 rules applied. Total rules applied 381 place count 298 transition count 563
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 382 place count 298 transition count 562
Performed 158 Post agglomeration using F-continuation condition.Transition count delta: 158
Deduced a syphon composed of 158 places in 0 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 5 with 316 rules applied. Total rules applied 698 place count 140 transition count 404
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 700 place count 138 transition count 389
Iterating global reduction 5 with 2 rules applied. Total rules applied 702 place count 138 transition count 389
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 704 place count 138 transition count 387
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 706 place count 136 transition count 385
Applied a total of 706 rules in 116 ms. Remains 136 /506 variables (removed 370) and now considering 385/910 (removed 525) transitions.
[2026-05-23 08:58:11] [INFO ] Flow matrix only has 137 transitions (discarded 248 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9021911827841734055.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7759185096832071047.kers'
[2026-05-23 08:58:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9021911827841734055.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7759185096832071047.kers]
Normalized transition count is 136 out of 137 initially.
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 136 rows 125 cols 366 entries
Finished phase 1 with 87 SingleSign rule and 0 generalized
[2026-05-23 08:58:11] [INFO ] Computed 49 invariants in 1 ms
Computed 49 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7759185096832071047.kers
Total runtime 1 ms.
[2026-05-23 08:58:12] [INFO ] Implicit Places using invariants in 190 ms returned []
[2026-05-23 08:58:12] [INFO ] Flow matrix only has 137 transitions (discarded 248 similar events)
[2026-05-23 08:58:12] [INFO ] Invariant cache hit.
[2026-05-23 08:58:12] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2026-05-23 08:58:12] [INFO ] Redundant transitions in 3 ms returned []
Running 286 sub problems to find dead transitions.
[2026-05-23 08:58:12] [INFO ] Flow matrix only has 137 transitions (discarded 248 similar events)
[2026-05-23 08:58:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 3/136 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 136/272 variables, 136/185 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (OVERLAPS) 0/272 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/273 variables, and 185 constraints, problems are : Problem set: 0 solved, 286 unsolved in 15006 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (OVERLAPS) 3/136 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 136/272 variables, 136/185 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 286/471 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 0/272 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/273 variables, and 471 constraints, problems are : Problem set: 0 solved, 286 unsolved in 18838 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33876ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 33877ms
Starting structural reductions in SI_LTL mode, iteration 1 : 136/506 places, 385/910 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34444 ms. Remains : 136/506 places, 385/910 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 42 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H09T0R-LTLFireability-08
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA Champagne-PT-H09T0R-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T0R-LTLFireability-08 finished in 34528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1&&G(p2)))))'
Support contains 3 out of 506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 910/910 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 489 transition count 818
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 489 transition count 818
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 43 place count 489 transition count 809
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 485 transition count 799
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 485 transition count 799
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 485 transition count 798
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 483 transition count 787
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 483 transition count 787
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 483 transition count 786
Applied a total of 57 rules in 37 ms. Remains 483 /506 variables (removed 23) and now considering 786/910 (removed 124) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13390443213721586264.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5857586708347641174.kers'
[2026-05-23 08:58:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13390443213721586264.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5857586708347641174.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 786 rows 483 cols 2292 entries
Finished phase 1 with 434 SingleSign rule and 0 generalized
[2026-05-23 08:58:46] [INFO ] Computed 49 invariants in 6 ms
Computed 49 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-5857586708347641174.kers
Total runtime 9 ms.
[2026-05-23 08:58:46] [INFO ] Implicit Places using invariants in 370 ms returned []
[2026-05-23 08:58:46] [INFO ] Invariant cache hit.
[2026-05-23 08:58:47] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 943 ms to find 0 implicit places.
Running 785 sub problems to find dead transitions.
[2026-05-23 08:58:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 785 unsolved
SMT process timed out in 30122ms, After SMT, problems are : Problem set: 0 solved, 785 unsolved
Search for dead transitions found 0 dead transitions in 30124ms
Starting structural reductions in LTL mode, iteration 1 : 483/506 places, 786/910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31108 ms. Remains : 483/506 places, 786/910 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((G(p1)&&p2))))'
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Champagne-PT-H09T0R-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H09T0R-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T0R-LTLFireability-09 finished in 31419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 910/910 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 488 transition count 817
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 488 transition count 817
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 45 place count 488 transition count 808
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 51 place count 482 transition count 796
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 482 transition count 796
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 482 transition count 795
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 62 place count 478 transition count 778
Iterating global reduction 2 with 4 rules applied. Total rules applied 66 place count 478 transition count 778
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 478 transition count 776
Applied a total of 68 rules in 65 ms. Remains 478 /506 variables (removed 28) and now considering 776/910 (removed 134) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6147214367893066545.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3542568778781846560.kers'
[2026-05-23 08:59:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6147214367893066545.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3542568778781846560.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 776 rows 478 cols 2262 entries
Finished phase 1 with 429 SingleSign rule and 0 generalized
[2026-05-23 08:59:17] [INFO ] Computed 49 invariants in 6 ms
Computed 49 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-3542568778781846560.kers
Total runtime 7 ms.
[2026-05-23 08:59:18] [INFO ] Implicit Places using invariants in 412 ms returned []
[2026-05-23 08:59:18] [INFO ] Invariant cache hit.
[2026-05-23 08:59:18] [INFO ] Implicit Places using invariants and state equation in 658 ms returned []
Implicit Place search using SMT with State Equation took 1073 ms to find 0 implicit places.
Running 775 sub problems to find dead transitions.
[2026-05-23 08:59:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 775 unsolved
At refinement iteration 1 (OVERLAPS) 1/478 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 775 unsolved
SMT process timed out in 30262ms, After SMT, problems are : Problem set: 0 solved, 775 unsolved
Search for dead transitions found 0 dead transitions in 30266ms
Starting structural reductions in LTL mode, iteration 1 : 478/506 places, 776/910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31409 ms. Remains : 478/506 places, 776/910 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H09T0R-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H09T0R-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T0R-LTLFireability-10 finished in 31596 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) U p1)&&X(X((p1||X(F(p2))))))))'
Support contains 2 out of 506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 910/910 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 488 transition count 817
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 488 transition count 817
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 45 place count 488 transition count 808
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 50 place count 483 transition count 797
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 483 transition count 797
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 483 transition count 796
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 480 transition count 780
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 480 transition count 780
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 480 transition count 778
Applied a total of 64 rules in 46 ms. Remains 480 /506 variables (removed 26) and now considering 778/910 (removed 132) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10085868175009832651.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3485584723573876482.kers'
[2026-05-23 08:59:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10085868175009832651.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3485584723573876482.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 778 rows 480 cols 2266 entries
Finished phase 1 with 431 SingleSign rule and 0 generalized
[2026-05-23 08:59:49] [INFO ] Computed 49 invariants in 6 ms
Computed 49 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-3485584723573876482.kers
Total runtime 8 ms.
[2026-05-23 08:59:49] [INFO ] Implicit Places using invariants in 365 ms returned []
[2026-05-23 08:59:49] [INFO ] Invariant cache hit.
[2026-05-23 08:59:50] [INFO ] Implicit Places using invariants and state equation in 724 ms returned []
Implicit Place search using SMT with State Equation took 1091 ms to find 0 implicit places.
Running 777 sub problems to find dead transitions.
[2026-05-23 08:59:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 777 unsolved
SMT process timed out in 30131ms, After SMT, problems are : Problem set: 0 solved, 777 unsolved
Search for dead transitions found 0 dead transitions in 30132ms
Starting structural reductions in LTL mode, iteration 1 : 480/506 places, 778/910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31272 ms. Remains : 480/506 places, 778/910 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) U p1)&&X(X((p1||X(F(p2))))))))'
Stuttering acceptance computed with spot in 378 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Champagne-PT-H09T0R-LTLFireability-11
Product exploration explored 100000 steps with 1331 reset in 499 ms.
Stack based approach found an accepted trace after 320 steps with 5 reset with depth 7 and stack size 7 in 4 ms.
FORMULA Champagne-PT-H09T0R-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Champagne-PT-H09T0R-LTLFireability-11 finished in 32213 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(((F(G(p0)) U ((p1 U p2) U !p0))&&X(p3)))))'
Support contains 6 out of 506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 910/910 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 489 transition count 831
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 489 transition count 831
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 41 place count 489 transition count 824
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 483 transition count 812
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 483 transition count 812
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 483 transition count 811
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 479 transition count 794
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 479 transition count 794
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 479 transition count 792
Applied a total of 64 rules in 72 ms. Remains 479 /506 variables (removed 27) and now considering 792/910 (removed 118) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4784510590186192435.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-407871985544687918.kers'
[2026-05-23 09:00:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4784510590186192435.kers, --Pflows, --basisKERS=/tmp/petrispot-output-407871985544687918.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 792 rows 479 cols 2324 entries
Finished phase 1 with 430 SingleSign rule and 0 generalized
[2026-05-23 09:00:21] [INFO ] Computed 49 invariants in 6 ms
Computed 49 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-407871985544687918.kers
Total runtime 9 ms.
[2026-05-23 09:00:22] [INFO ] Implicit Places using invariants in 385 ms returned []
[2026-05-23 09:00:22] [INFO ] Invariant cache hit.
[2026-05-23 09:00:22] [INFO ] Implicit Places using invariants and state equation in 697 ms returned []
Implicit Place search using SMT with State Equation took 1090 ms to find 0 implicit places.
Running 791 sub problems to find dead transitions.
[2026-05-23 09:00:22] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 791 unsolved
SMT process timed out in 30129ms, After SMT, problems are : Problem set: 0 solved, 791 unsolved
Search for dead transitions found 0 dead transitions in 30130ms
Starting structural reductions in LTL mode, iteration 1 : 479/506 places, 792/910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31295 ms. Remains : 479/506 places, 792/910 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((F(G(p0)) U ((p1 U p2) U !p0))&&X(p3)))))'
Stuttering acceptance computed with spot in 343 ms :[(OR (NOT p3) p0), (OR (NOT p3) p0), (OR (NOT p3) p0), (NOT p0), p0, (NOT p3), (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : Champagne-PT-H09T0R-LTLFireability-12
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H09T0R-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T0R-LTLFireability-12 finished in 31747 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!((F(p0)||!p1) U X(p1))||G(p2)||X(p1)))'
Support contains 4 out of 506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 910/910 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 488 transition count 828
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 488 transition count 828
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 44 place count 488 transition count 820
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 482 transition count 808
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 482 transition count 808
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 482 transition count 807
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 478 transition count 790
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 478 transition count 790
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 478 transition count 788
Applied a total of 67 rules in 57 ms. Remains 478 /506 variables (removed 28) and now considering 788/910 (removed 122) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10444768054298931794.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14501153976894013617.kers'
[2026-05-23 09:00:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10444768054298931794.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14501153976894013617.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 788 rows 478 cols 2310 entries
Finished phase 1 with 429 SingleSign rule and 0 generalized
[2026-05-23 09:00:53] [INFO ] Computed 49 invariants in 3 ms
Computed 49 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14501153976894013617.kers
Total runtime 4 ms.
[2026-05-23 09:00:53] [INFO ] Implicit Places using invariants in 302 ms returned []
[2026-05-23 09:00:53] [INFO ] Invariant cache hit.
[2026-05-23 09:00:54] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 947 ms to find 0 implicit places.
Running 787 sub problems to find dead transitions.
[2026-05-23 09:00:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 787 unsolved
At refinement iteration 1 (OVERLAPS) 1/478 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 787 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/1266 variables, and 49 constraints, problems are : Problem set: 0 solved, 787 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 0/478 constraints, PredecessorRefiner: 787/787 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 787 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 787 unsolved
At refinement iteration 1 (OVERLAPS) 1/478 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 787 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/1266 variables, and 49 constraints, problems are : Problem set: 0 solved, 787 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, State Equation: 0/478 constraints, PredecessorRefiner: 0/787 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60244ms problems are : Problem set: 0 solved, 787 unsolved
Search for dead transitions found 0 dead transitions in 60246ms
Starting structural reductions in LTL mode, iteration 1 : 478/506 places, 788/910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61254 ms. Remains : 478/506 places, 788/910 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!((F(p0)||!p1) U X(p1))||G(p2)||X(p1)))'
Stuttering acceptance computed with spot in 514 ms :[true, false, p1, (AND p1 (NOT p2)), p0, (AND p1 p0), (AND p0 (NOT p2)), (AND p1 (NOT p2) p0), false, false, false, false, (NOT p2)]
Running random walk in product with property : Champagne-PT-H09T0R-LTLFireability-13
Entered a terminal (fully accepting) state of product in 15514 steps with 29 reset in 55 ms.
FORMULA Champagne-PT-H09T0R-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T0R-LTLFireability-13 finished in 61873 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U p1)&&X(X(F(p2))))))'
Support contains 4 out of 506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 910/910 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 489 transition count 818
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 489 transition count 818
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 43 place count 489 transition count 809
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 484 transition count 798
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 484 transition count 798
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 484 transition count 797
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 482 transition count 795
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 482 transition count 795
Applied a total of 58 rules in 31 ms. Remains 482 /506 variables (removed 24) and now considering 795/910 (removed 115) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-841144265526130852.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11096247777832949443.kers'
[2026-05-23 09:01:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-841144265526130852.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11096247777832949443.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 795 rows 482 cols 2330 entries
Finished phase 1 with 433 SingleSign rule and 0 generalized
[2026-05-23 09:01:55] [INFO ] Computed 49 invariants in 6 ms
Computed 49 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-11096247777832949443.kers
Total runtime 7 ms.
[2026-05-23 09:01:55] [INFO ] Implicit Places using invariants in 364 ms returned []
[2026-05-23 09:01:55] [INFO ] Invariant cache hit.
[2026-05-23 09:01:56] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 936 ms to find 0 implicit places.
Running 794 sub problems to find dead transitions.
[2026-05-23 09:01:56] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 794 unsolved
SMT process timed out in 30168ms, After SMT, problems are : Problem set: 0 solved, 794 unsolved
Search for dead transitions found 0 dead transitions in 30169ms
Starting structural reductions in LTL mode, iteration 1 : 482/506 places, 795/910 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31140 ms. Remains : 482/506 places, 795/910 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U p1)&&X(X(F(p2))))))'
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : Champagne-PT-H09T0R-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H09T0R-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H09T0R-LTLFireability-14 finished in 31491 ms.
All properties solved by simple procedures.
Total runtime 593969 ms.

BK_STOP 1779526946711

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Champagne-PT-H09T0R"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is Champagne-PT-H09T0R, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r050-smll-177946901100124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Champagne-PT-H09T0R.tgz
mv Champagne-PT-H09T0R execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;