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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 6.5K Mar 8 08:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Mar 8 08:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 8 08:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 8 08:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Mar 17 09:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 17 09:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 17 09:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 17 09:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Mar 8 08:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K Mar 8 08:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Mar 8 08:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 8 08:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 17 09:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 17 09:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 174K 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 ParamProductionCell-PT-4-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779784508074

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 08:35:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 08:35:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 08:35:09] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2026-05-26 08:35:09] [INFO ] Transformed 231 places.
[2026-05-26 08:35:09] [INFO ] Transformed 202 transitions.
[2026-05-26 08:35:09] [INFO ] Found NUPN structural information;
[2026-05-26 08:35:09] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ParamProductionCell-PT-4-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 227 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 227 transition count 198
Applied a total of 8 rules in 47 ms. Remains 227 /231 variables (removed 4) and now considering 198/202 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1644902341202520560.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16354470142118610366.kers'
[2026-05-26 08:35:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1644902341202520560.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16354470142118610366.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 198 rows 215 cols 552 entries
Finished phase 1 with 119 SingleSign rule and 49 generalized
[2026-05-26 08:35:09] [INFO ] Computed 59 invariants in 1 ms
Computed 59 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16354470142118610366.kers
Total runtime 2 ms.
[2026-05-26 08:35:10] [INFO ] Implicit Places using invariants in 380 ms returned [16, 19, 24, 31, 35, 36, 41, 42, 47, 59, 64, 65, 73, 79, 98, 113, 116, 119, 161, 162, 164, 166, 167, 193, 197, 202, 203, 207, 218]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 411 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 198/231 places, 198/202 transitions.
Applied a total of 0 rules in 10 ms. Remains 198 /198 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 482 ms. Remains : 198/231 places, 198/202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 198/198 transitions.
Applied a total of 0 rules in 5 ms. Remains 198 /198 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1523729060547339122.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14635746280904450449.kers'
[2026-05-26 08:35:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1523729060547339122.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14635746280904450449.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 198 rows 193 cols 476 entries
Finished phase 1 with 152 SingleSign rule and 16 generalized
[2026-05-26 08:35:10] [INFO ] Computed 30 invariants in 1 ms
Computed 30 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14635746280904450449.kers
Total runtime 1 ms.
[2026-05-26 08:35:10] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-26 08:35:10] [INFO ] Invariant cache hit.
[2026-05-26 08:35:10] [INFO ] State equation strengthened by 68 read => feed constraints.
[2026-05-26 08:35:10] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Running 194 sub problems to find dead transitions.
[2026-05-26 08:35:10] [INFO ] Invariant cache hit.
[2026-05-26 08:35:10] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (OVERLAPS) 3/195 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 12 (OVERLAPS) 3/198 variables, 7/78 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/198 variables, 12/90 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/198 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/198 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 16 (OVERLAPS) 198/396 variables, 198/289 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/396 variables, 68/357 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/396 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/396 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 20 (OVERLAPS) 0/396 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 358 constraints, problems are : Problem set: 0 solved, 194 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 198/198 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 194 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 51/68 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 4 (OVERLAPS) 3/195 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 8 (OVERLAPS) 3/198 variables, 7/89 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 11 (OVERLAPS) 198/396 variables, 198/290 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 68/358 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 194/552 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/396 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 194 unsolved
At refinement iteration 15 (OVERLAPS) 0/396 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 194 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 552 constraints, problems are : Problem set: 0 solved, 194 unsolved in 27362 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 198/198 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 194/194 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57437ms problems are : Problem set: 0 solved, 194 unsolved
Search for dead transitions found 0 dead transitions in 57452ms
Finished structural reductions in LTL mode , in 1 iterations and 57932 ms. Remains : 198/198 places, 198/198 transitions.
Support contains 47 out of 198 places after structural reductions.
[2026-05-26 08:36:08] [INFO ] Flatten gal took : 38 ms
[2026-05-26 08:36:08] [INFO ] Flatten gal took : 21 ms
[2026-05-26 08:36:08] [INFO ] Input system was already deterministic with 198 transitions.
Reduction of identical properties reduced properties to check from 32 to 31
RANDOM walk for 40000 steps (8 resets) in 943 ms. (42 steps per ms) remains 0/31 properties
FORMULA ParamProductionCell-PT-4-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ParamProductionCell-PT-4-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 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' '!(X((X(F(p0))&&(X(X(!p1)) U ((!p2&&X(X(!p1)))||X(X(G(!p1))))))))'
Support contains 6 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 196 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 196 transition count 196
Applied a total of 4 rules in 8 ms. Remains 196 /198 variables (removed 2) and now considering 196/198 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17138836173177597579.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17899139104367574739.kers'
[2026-05-26 08:36:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17138836173177597579.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17899139104367574739.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 196 rows 191 cols 468 entries
Finished phase 1 with 151 SingleSign rule and 15 generalized
[2026-05-26 08:36:09] [INFO ] Computed 30 invariants in 0 ms
Computed 30 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17899139104367574739.kers
Total runtime 1 ms.
[2026-05-26 08:36:09] [INFO ] Implicit Places using invariants in 146 ms returned [38, 65, 84, 86, 98, 101, 167, 170]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 147 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/198 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 6 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18357385903251545253.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4051407941485238216.kers'
[2026-05-26 08:36:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18357385903251545253.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4051407941485238216.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 194 rows 181 cols 410 entries
Finished phase 1 with 157 SingleSign rule and 7 generalized
[2026-05-26 08:36:09] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4051407941485238216.kers
Total runtime 1 ms.
[2026-05-26 08:36:09] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-26 08:36:09] [INFO ] Invariant cache hit.
[2026-05-26 08:36:09] [INFO ] State equation strengthened by 68 read => feed constraints.
[2026-05-26 08:36:10] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/198 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 852 ms. Remains : 186/198 places, 194/198 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&(X(X(!p1)) U ((!p2&&X(X(!p1)))||X(X(G(!p1))))))))'
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1, p1, p1, true]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-00
Entered a terminal (fully accepting) state of product in 393 steps with 5 reset in 13 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-00 finished in 1313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0)))&&G(p1))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 196 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 196 transition count 196
Applied a total of 4 rules in 6 ms. Remains 196 /198 variables (removed 2) and now considering 196/198 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5460659215350222023.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5341295873458970374.kers'
[2026-05-26 08:36:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5460659215350222023.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5341295873458970374.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 196 rows 191 cols 468 entries
Finished phase 1 with 151 SingleSign rule and 15 generalized
[2026-05-26 08:36:10] [INFO ] Computed 30 invariants in 0 ms
Computed 30 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5341295873458970374.kers
Total runtime 1 ms.
[2026-05-26 08:36:10] [INFO ] Implicit Places using invariants in 143 ms returned [15, 17, 38, 65, 84, 86, 98, 101, 167, 170]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 145 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/198 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 5 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13685274912228865013.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6622575291762505974.kers'
[2026-05-26 08:36:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13685274912228865013.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6622575291762505974.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 194 rows 179 cols 402 entries
Finished phase 1 with 157 SingleSign rule and 7 generalized
[2026-05-26 08:36:10] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6622575291762505974.kers
Total runtime 1 ms.
[2026-05-26 08:36:10] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-26 08:36:10] [INFO ] Invariant cache hit.
[2026-05-26 08:36:10] [INFO ] State equation strengthened by 68 read => feed constraints.
[2026-05-26 08:36:11] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 877 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/198 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1034 ms. Remains : 184/198 places, 194/198 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0)))&&G(p1))))'
Stuttering acceptance computed with spot in 151 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-03
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-03 finished in 1225 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||((p2||F(p3))&&p1))))'
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 198 transition count 174
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 174 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 173 transition count 173
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 50 place count 173 transition count 161
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 74 place count 161 transition count 161
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 159 transition count 159
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 159 transition count 159
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 142 place count 127 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 144 place count 126 transition count 126
Applied a total of 144 rules in 52 ms. Remains 126 /198 variables (removed 72) and now considering 126/198 (removed 72) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8906164391560856054.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15054703274834729187.kers'
[2026-05-26 08:36:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8906164391560856054.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15054703274834729187.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 126 rows 121 cols 328 entries
Finished phase 1 with 81 SingleSign rule and 15 generalized
[2026-05-26 08:36:11] [INFO ] Computed 30 invariants in 0 ms
Computed 30 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15054703274834729187.kers
Total runtime 1 ms.
[2026-05-26 08:36:11] [INFO ] Implicit Places using invariants in 96 ms returned [12, 14, 26, 40, 51, 64, 66, 109, 112]
[2026-05-26 08:36:11] [INFO ] Actually due to overlaps returned [51, 26, 40, 64, 112, 14, 109]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 97 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/198 places, 126/198 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 119 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 118 transition count 125
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 118 transition count 123
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 116 transition count 123
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 32 place count 103 transition count 110
Applied a total of 32 rules in 12 ms. Remains 103 /119 variables (removed 16) and now considering 110/126 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6747594169526739381.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11147437855122195260.kers'
[2026-05-26 08:36:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6747594169526739381.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11147437855122195260.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 110 rows 98 cols 250 entries
Finished phase 1 with 69 SingleSign rule and 11 generalized
[2026-05-26 08:36:11] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11147437855122195260.kers
Total runtime 0 ms.
[2026-05-26 08:36:11] [INFO ] Implicit Places using invariants in 87 ms returned [9, 51]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 88 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/198 places, 110/198 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 100 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 99 transition count 108
Applied a total of 4 rules in 7 ms. Remains 99 /101 variables (removed 2) and now considering 108/110 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4012484556493984140.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6162094694146925229.kers'
[2026-05-26 08:36:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4012484556493984140.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6162094694146925229.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 108 rows 94 cols 242 entries
Finished phase 1 with 67 SingleSign rule and 11 generalized
[2026-05-26 08:36:11] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6162094694146925229.kers
Total runtime 0 ms.
[2026-05-26 08:36:11] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-26 08:36:11] [INFO ] Invariant cache hit.
[2026-05-26 08:36:12] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-26 08:36:12] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 99/198 places, 108/198 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 556 ms. Remains : 99/198 places, 108/198 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||((F(p2)||p3)&&p1))))'
Stuttering acceptance computed with spot in 77 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-04
Product exploration explored 100000 steps with 1972 reset in 225 ms.
Product exploration explored 100000 steps with 1977 reset in 172 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 15 factoid took 52 ms. Reduced automaton from 2 states, 3 edges and 4 AP (stutter insensitive) to 2 states, 3 edges and 4 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 274 ms. (145 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 181 ms. (219 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 416 ms. (95 steps per ms) remains 2/2 properties
[2026-05-26 08:36:13] [INFO ] Invariant cache hit.
[2026-05-26 08:36:13] [INFO ] State equation strengthened by 66 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 44/51 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/57 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/63 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/77 variables, 6/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 83/160 variables, 77/89 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 30/119 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 25/185 variables, 36/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/185 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 22/207 variables, 22/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/207 variables, 9/186 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/207 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/207 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 186 constraints, problems are : Problem set: 1 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 99/99 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/51 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/57 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/63 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Int declared 77/207 variables, and 12 constraints, problems are : Problem set: 2 solved, 0 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 6/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/99 constraints, ReadFeed: 0/66 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 230ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge based reduction with 17 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
[2026-05-26 08:36:13] [INFO ] Invariant cache hit.
[2026-05-26 08:36:13] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2026-05-26 08:36:13] [INFO ] [Real]Absence check using 15 positive and 6 generalized place invariants in 7 ms returned sat
[2026-05-26 08:36:13] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2026-05-26 08:36:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 08:36:13] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2026-05-26 08:36:13] [INFO ] [Nat]Absence check using 15 positive and 6 generalized place invariants in 4 ms returned sat
[2026-05-26 08:36:13] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2026-05-26 08:36:13] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-26 08:36:13] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2026-05-26 08:36:14] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1100 ms
[2026-05-26 08:36:14] [INFO ] Computed and/alt/rep : 98/239/98 causal constraints (skipped 7 transitions) in 9 ms.
[2026-05-26 08:36:15] [INFO ] Added : 64 causal constraints over 13 iterations in 279 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Knowledge-based reduction took 2460 ms.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Support contains 5 out of 99 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2026-05-26 08:36:15] [INFO ] Invariant cache hit.
[2026-05-26 08:36:15] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-26 08:36:15] [INFO ] Invariant cache hit.
[2026-05-26 08:36:15] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-26 08:36:15] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2026-05-26 08:36:15] [INFO ] Redundant transitions in 3 ms returned []
Running 105 sub problems to find dead transitions.
[2026-05-26 08:36:15] [INFO ] Invariant cache hit.
[2026-05-26 08:36:15] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 1/98 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 1/99 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/99 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/99 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/99 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 15 (OVERLAPS) 108/207 variables, 99/164 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/207 variables, 66/230 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/207 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 18 (OVERLAPS) 0/207 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 230 constraints, problems are : Problem set: 0 solved, 105 unsolved in 8933 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 99/99 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 43/61 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 1/98 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 1/99 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 108/207 variables, 99/164 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 66/230 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 105/335 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 14 (OVERLAPS) 0/207 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 335 constraints, problems are : Problem set: 0 solved, 105 unsolved in 6138 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 99/99 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15082ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 15087ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15343 ms. Remains : 99/99 places, 108/108 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 7 factoid took 50 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
RANDOM walk for 7551 steps (1 resets) in 34 ms. (215 steps per ms) remains 0/3 properties
Knowledge based reduction with 7 factoid took 76 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
[2026-05-26 08:36:30] [INFO ] Invariant cache hit.
[2026-05-26 08:36:30] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2026-05-26 08:36:30] [INFO ] [Real]Absence check using 15 positive and 6 generalized place invariants in 6 ms returned sat
[2026-05-26 08:36:30] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2026-05-26 08:36:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 08:36:31] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2026-05-26 08:36:31] [INFO ] [Nat]Absence check using 15 positive and 6 generalized place invariants in 7 ms returned sat
[2026-05-26 08:36:31] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2026-05-26 08:36:31] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-26 08:36:31] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2026-05-26 08:36:32] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1079 ms
[2026-05-26 08:36:32] [INFO ] Computed and/alt/rep : 98/239/98 causal constraints (skipped 7 transitions) in 5 ms.
[2026-05-26 08:36:32] [INFO ] Added : 64 causal constraints over 13 iterations in 272 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Knowledge-based reduction took 1899 ms.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1986 reset in 117 ms.
Product exploration explored 100000 steps with 1972 reset in 156 ms.
Built C files in :
/tmp/ltsmin7887764944907273052
[2026-05-26 08:36:32] [INFO ] Computing symmetric may disable matrix : 108 transitions.
[2026-05-26 08:36:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 08:36:32] [INFO ] Computing symmetric may enable matrix : 108 transitions.
[2026-05-26 08:36:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 08:36:32] [INFO ] Computing Do-Not-Accords matrix : 108 transitions.
[2026-05-26 08:36:32] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 08:36:32] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7887764944907273052
Running compilation step : cd /tmp/ltsmin7887764944907273052;'/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 314 ms.
Running link step : cd /tmp/ltsmin7887764944907273052;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin7887764944907273052;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12561625943617095816.hoa' '--buchi-type=spotba'
LTSmin run took 793 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-4-LTLFireability-04 finished in 22394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(!p0))) U G((p1 U X(p2))))))'
Support contains 5 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 196 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 196 transition count 196
Applied a total of 4 rules in 10 ms. Remains 196 /198 variables (removed 2) and now considering 196/198 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4981885929440684498.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4289600996817469507.kers'
[2026-05-26 08:36:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4981885929440684498.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4289600996817469507.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 196 rows 191 cols 468 entries
Finished phase 1 with 151 SingleSign rule and 15 generalized
[2026-05-26 08:36:34] [INFO ] Computed 30 invariants in 0 ms
Computed 30 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4289600996817469507.kers
Total runtime 1 ms.
[2026-05-26 08:36:34] [INFO ] Implicit Places using invariants in 111 ms returned [15, 17, 38, 65, 84, 86, 98, 101, 167, 170]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 141 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/198 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 6 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14392901935587182117.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16735915900752979334.kers'
[2026-05-26 08:36:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14392901935587182117.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16735915900752979334.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 194 rows 179 cols 402 entries
Finished phase 1 with 157 SingleSign rule and 7 generalized
[2026-05-26 08:36:34] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16735915900752979334.kers
Total runtime 5 ms.
[2026-05-26 08:36:34] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-26 08:36:34] [INFO ] Invariant cache hit.
[2026-05-26 08:36:34] [INFO ] State equation strengthened by 68 read => feed constraints.
[2026-05-26 08:36:34] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/198 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 544 ms. Remains : 184/198 places, 194/198 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(!p0))) U G((p1 U X(p2))))))'
Stuttering acceptance computed with spot in 677 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), p0, p0, true, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-05
Product exploration explored 100000 steps with 15651 reset in 131 ms.
Product exploration explored 100000 steps with 15573 reset in 186 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 6 factoid took 95 ms. Reduced automaton from 18 states, 37 edges and 3 AP (stutter sensitive) to 18 states, 37 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 148 ms. (268 steps per ms) remains 2/12 properties
BEST_FIRST walk for 4913 steps (0 resets) in 15 ms. (307 steps per ms) remains 0/2 properties
Knowledge based reduction with 6 factoid took 243 ms. Reduced automaton from 18 states, 37 edges and 3 AP (stutter sensitive) to 18 states, 37 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 791 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), p0, p0, true, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
[2026-05-26 08:36:36] [INFO ] Invariant cache hit.
[2026-05-26 08:36:36] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2026-05-26 08:36:36] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-26 08:36:37] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2026-05-26 08:36:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 08:36:37] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2026-05-26 08:36:37] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-26 08:36:37] [INFO ] [Nat]Absence check using state equation in 418 ms returned sat
[2026-05-26 08:36:37] [INFO ] State equation strengthened by 68 read => feed constraints.
[2026-05-26 08:36:37] [INFO ] [Nat]Added 68 Read/Feed constraints in 62 ms returned sat
[2026-05-26 08:36:38] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 966 ms
[2026-05-26 08:36:38] [INFO ] Computed and/alt/rep : 190/309/190 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-26 08:36:40] [INFO ] Added : 90 causal constraints over 18 iterations in 1134 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 4384 ms.
Stuttering acceptance computed with spot in 791 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), p0, p0, true, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 5 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Applied a total of 0 rules in 5 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2026-05-26 08:36:40] [INFO ] Invariant cache hit.
[2026-05-26 08:36:40] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-26 08:36:40] [INFO ] Invariant cache hit.
[2026-05-26 08:36:41] [INFO ] State equation strengthened by 68 read => feed constraints.
[2026-05-26 08:36:41] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2026-05-26 08:36:41] [INFO ] Invariant cache hit.
[2026-05-26 08:36:41] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 4/183 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 1/184 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (OVERLAPS) 194/378 variables, 184/248 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 68/316 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 15 (OVERLAPS) 0/378 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 316 constraints, problems are : Problem set: 0 solved, 190 unsolved in 21663 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 184/184 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 34/48 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 4/183 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 1/184 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (OVERLAPS) 194/378 variables, 184/248 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 68/316 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 190/506 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (OVERLAPS) 0/378 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 506 constraints, problems are : Problem set: 0 solved, 190 unsolved in 21243 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 184/184 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42925ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 42926ms
Finished structural reductions in LTL mode , in 1 iterations and 43279 ms. Remains : 184/184 places, 194/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 6 factoid took 97 ms. Reduced automaton from 18 states, 37 edges and 3 AP (stutter sensitive) to 18 states, 37 edges and 3 AP (stutter sensitive).
RANDOM walk for 22902 steps (4 resets) in 104 ms. (218 steps per ms) remains 0/12 properties
Knowledge based reduction with 6 factoid took 228 ms. Reduced automaton from 18 states, 37 edges and 3 AP (stutter sensitive) to 18 states, 37 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 765 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), p0, p0, true, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
[2026-05-26 08:37:25] [INFO ] Invariant cache hit.
[2026-05-26 08:37:25] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2026-05-26 08:37:25] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-26 08:37:25] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2026-05-26 08:37:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 08:37:25] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2026-05-26 08:37:25] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-26 08:37:26] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2026-05-26 08:37:26] [INFO ] State equation strengthened by 68 read => feed constraints.
[2026-05-26 08:37:26] [INFO ] [Nat]Added 68 Read/Feed constraints in 61 ms returned sat
[2026-05-26 08:37:27] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 940 ms
[2026-05-26 08:37:27] [INFO ] Computed and/alt/rep : 190/309/190 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-26 08:37:28] [INFO ] Added : 90 causal constraints over 18 iterations in 1101 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 4245 ms.
Stuttering acceptance computed with spot in 778 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), p0, p0, true, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 765 ms :[(NOT p2), (NOT p2), (NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), p0, p0, true, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 15635 reset in 111 ms.
Product exploration explored 100000 steps with 15654 reset in 120 ms.
Spot run failed in 71 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/ltsmin11408424491890801673
[2026-05-26 08:37:30] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11408424491890801673
Running compilation step : cd /tmp/ltsmin11408424491890801673;'/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 308 ms.
Running link step : cd /tmp/ltsmin11408424491890801673;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin11408424491890801673;'/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/stateBased13172739023236140180.hoa' '--buchi-type=spotba'
LTSmin run took 89 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-4-LTLFireability-05 finished in 56651 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 198 transition count 176
Reduce places removed 22 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 24 rules applied. Total rules applied 46 place count 176 transition count 174
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 174 transition count 174
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 48 place count 174 transition count 160
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 76 place count 160 transition count 160
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 158 transition count 158
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 158 transition count 158
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 142 place count 127 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 144 place count 126 transition count 126
Applied a total of 144 rules in 23 ms. Remains 126 /198 variables (removed 72) and now considering 126/198 (removed 72) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14549473217173572671.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15182234910994683057.kers'
[2026-05-26 08:37:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14549473217173572671.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15182234910994683057.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 126 rows 121 cols 328 entries
Finished phase 1 with 81 SingleSign rule and 15 generalized
[2026-05-26 08:37:30] [INFO ] Computed 30 invariants in 1 ms
Computed 30 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15182234910994683057.kers
Total runtime 2 ms.
[2026-05-26 08:37:30] [INFO ] Implicit Places using invariants in 91 ms returned [11, 13, 41, 52, 54, 65, 67, 110, 113]
[2026-05-26 08:37:30] [INFO ] Actually due to overlaps returned [52, 54, 41, 65, 113, 13, 110]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 92 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/198 places, 126/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 119 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 118 transition count 125
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 52 place count 93 transition count 100
Applied a total of 52 rules in 6 ms. Remains 93 /119 variables (removed 26) and now considering 100/126 (removed 26) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13219051297100211271.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2699030121529884180.kers'
[2026-05-26 08:37:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13219051297100211271.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2699030121529884180.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 100 rows 88 cols 222 entries
Finished phase 1 with 63 SingleSign rule and 7 generalized
[2026-05-26 08:37:30] [INFO ] Computed 23 invariants in 0 ms
Computed 23 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2699030121529884180.kers
Total runtime 0 ms.
[2026-05-26 08:37:30] [INFO ] Implicit Places using invariants in 64 ms returned [10, 52]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 65 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 91/198 places, 100/198 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 90 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 89 transition count 98
Applied a total of 4 rules in 5 ms. Remains 89 /91 variables (removed 2) and now considering 98/100 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6727229189435788805.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6265154237540413561.kers'
[2026-05-26 08:37:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6727229189435788805.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6265154237540413561.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 98 rows 84 cols 214 entries
Finished phase 1 with 61 SingleSign rule and 7 generalized
[2026-05-26 08:37:30] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6265154237540413561.kers
Total runtime 1 ms.
[2026-05-26 08:37:30] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-26 08:37:30] [INFO ] Invariant cache hit.
[2026-05-26 08:37:31] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-26 08:37:31] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 89/198 places, 98/198 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 422 ms. Remains : 89/198 places, 98/198 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 36 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 119 ms.
Stack based approach found an accepted trace after 118 steps with 0 reset with depth 119 and stack size 119 in 1 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-06 finished in 600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X(X((p1||G(p2)))))))'
Support contains 6 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 196 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 196 transition count 196
Applied a total of 4 rules in 3 ms. Remains 196 /198 variables (removed 2) and now considering 196/198 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6771336273078630417.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8256720729093216999.kers'
[2026-05-26 08:37:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6771336273078630417.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8256720729093216999.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 196 rows 191 cols 468 entries
Finished phase 1 with 151 SingleSign rule and 15 generalized
[2026-05-26 08:37:31] [INFO ] Computed 30 invariants in 3 ms
Computed 30 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8256720729093216999.kers
Total runtime 4 ms.
[2026-05-26 08:37:31] [INFO ] Implicit Places using invariants in 107 ms returned [15, 17, 38, 86, 101, 167, 170]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 108 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 189/198 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 187 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 187 transition count 194
Applied a total of 4 rules in 2 ms. Remains 187 /189 variables (removed 2) and now considering 194/196 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10600091483760894924.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9746529056987210044.kers'
[2026-05-26 08:37:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10600091483760894924.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9746529056987210044.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 194 rows 182 cols 430 entries
Finished phase 1 with 156 SingleSign rule and 8 generalized
[2026-05-26 08:37:31] [INFO ] Computed 23 invariants in 3 ms
Computed 23 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9746529056987210044.kers
Total runtime 3 ms.
[2026-05-26 08:37:31] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-26 08:37:31] [INFO ] Invariant cache hit.
[2026-05-26 08:37:31] [INFO ] State equation strengthened by 68 read => feed constraints.
[2026-05-26 08:37:32] [INFO ] Implicit Places using invariants and state equation in 1219 ms returned []
Implicit Place search using SMT with State Equation took 1307 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 187/198 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1421 ms. Remains : 187/198 places, 194/198 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X(X((G(p1)||p2))))))'
Stuttering acceptance computed with spot in 411 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-07
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-07 finished in 1883 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((X(X(!p0)) U ((!p1&&X(X(!p0)))||X(X(G(!p0))))))) U (X(X(G((X(X(!p0)) U ((!p1&&X(X(!p0)))||X(X(G(!p0))))))))||(!p2&&F(!p1)&&X(X((X(X(!p0)) U ((!p1&&X(X(!p0)))||X(X(G(!p0))))))))))))'
Support contains 6 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 196 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 196 transition count 196
Applied a total of 4 rules in 2 ms. Remains 196 /198 variables (removed 2) and now considering 196/198 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17814808240082277810.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15561950422288703058.kers'
[2026-05-26 08:37:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17814808240082277810.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15561950422288703058.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 196 rows 191 cols 468 entries
Finished phase 1 with 151 SingleSign rule and 15 generalized
[2026-05-26 08:37:33] [INFO ] Computed 30 invariants in 2 ms
Computed 30 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15561950422288703058.kers
Total runtime 4 ms.
[2026-05-26 08:37:33] [INFO ] Implicit Places using invariants in 115 ms returned [15, 17, 38, 65, 84, 86, 98, 101, 167, 170]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 116 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/198 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 3 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2936544197289983950.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4646386551510165422.kers'
[2026-05-26 08:37:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2936544197289983950.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4646386551510165422.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 194 rows 179 cols 402 entries
Finished phase 1 with 157 SingleSign rule and 7 generalized
[2026-05-26 08:37:33] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4646386551510165422.kers
Total runtime 1 ms.
[2026-05-26 08:37:33] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-26 08:37:33] [INFO ] Invariant cache hit.
[2026-05-26 08:37:33] [INFO ] State equation strengthened by 68 read => feed constraints.
[2026-05-26 08:37:33] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/198 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 526 ms. Remains : 184/198 places, 194/198 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((X(X(!p0)) U (X(X(G(!p0)))||(!p1&&X(X(!p0))))))) U (X(X(G((X(X(!p0)) U ((!p1&&X(X(!p0)))||X(X(G(!p0))))))))||(!p2&&F(!p1)&&X(X((X(X(!p0)) U ((!p1&&X(X(!p0)))||X(X(G(!p0))))))))))))'
Stuttering acceptance computed with spot in 719 ms :[p0, p0, true, p0, p0, p0, p0, p0, p0, p0, p0, p0, p0, p0, p0, p0, p0]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-09
Product exploration explored 100000 steps with 16666 reset in 102 ms.
Product exploration explored 100000 steps with 16666 reset in 109 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 17 states, 29 edges and 3 AP (stutter sensitive) to 10 states, 15 edges and 2 AP (stutter sensitive).
RANDOM walk for 16242 steps (3 resets) in 36 ms. (438 steps per ms) remains 0/4 properties
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 10 states, 15 edges and 2 AP (stutter sensitive) to 10 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 363 ms :[p0, p0, p0, true, p0, p0, p0, p0, p0, p0]
Knowledge-based reduction took 572 ms.
Stuttering acceptance computed with spot in 394 ms :[p0, p0, p0, true, p0, p0, p0, p0, p0, p0]
Support contains 4 out of 184 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2026-05-26 08:37:35] [INFO ] Invariant cache hit.
[2026-05-26 08:37:35] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-26 08:37:35] [INFO ] Invariant cache hit.
[2026-05-26 08:37:35] [INFO ] State equation strengthened by 68 read => feed constraints.
[2026-05-26 08:37:36] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 410 ms. Remains : 184/184 places, 194/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 1 factoid took 51 ms. Reduced automaton from 10 states, 15 edges and 2 AP (stutter sensitive) to 10 states, 15 edges and 2 AP (stutter sensitive).
RANDOM walk for 18956 steps (4 resets) in 36 ms. (512 steps per ms) remains 0/4 properties
Knowledge based reduction with 1 factoid took 113 ms. Reduced automaton from 10 states, 15 edges and 2 AP (stutter sensitive) to 10 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 418 ms :[p0, p0, p0, true, p0, p0, p0, p0, p0, p0]
Knowledge-based reduction took 598 ms.
Stuttering acceptance computed with spot in 407 ms :[p0, p0, p0, true, p0, p0, p0, p0, p0, p0]
Stuttering acceptance computed with spot in 361 ms :[p0, p0, p0, true, p0, p0, p0, p0, p0, p0]
Product exploration explored 100000 steps with 16666 reset in 96 ms.
Product exploration explored 100000 steps with 16666 reset in 106 ms.
Spot run failed in 46 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin15298616390768134546
[2026-05-26 08:37:37] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15298616390768134546
Running compilation step : cd /tmp/ltsmin15298616390768134546;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 279 ms.
Running link step : cd /tmp/ltsmin15298616390768134546;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin15298616390768134546;'/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/stateBased10785567766794521809.hoa' '--buchi-type=spotba'
LTSmin run took 25 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-4-LTLFireability-09 finished in 5027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X((p0&&X(p1)))&&F(p2))))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 197 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 197 transition count 197
Applied a total of 2 rules in 4 ms. Remains 197 /198 variables (removed 1) and now considering 197/198 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5082279606324614741.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15376905900657627158.kers'
[2026-05-26 08:37:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5082279606324614741.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15376905900657627158.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 197 rows 192 cols 472 entries
Finished phase 1 with 152 SingleSign rule and 15 generalized
[2026-05-26 08:37:38] [INFO ] Computed 30 invariants in 1 ms
Computed 30 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15376905900657627158.kers
Total runtime 2 ms.
[2026-05-26 08:37:38] [INFO ] Implicit Places using invariants in 129 ms returned [15, 17, 38, 65, 84, 98, 168, 171]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 130 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 189/198 places, 197/198 transitions.
Applied a total of 0 rules in 1 ms. Remains 189 /189 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137 ms. Remains : 189/198 places, 197/198 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X((p0&&X(p1)))&&F(p2))))))'
Stuttering acceptance computed with spot in 399 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-10
Product exploration explored 100000 steps with 1135 reset in 119 ms.
Stack based approach found an accepted trace after 1068 steps with 7 reset with depth 398 and stack size 398 in 1 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-10 finished in 688 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&&F(p1))))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 196 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 196 transition count 196
Applied a total of 4 rules in 4 ms. Remains 196 /198 variables (removed 2) and now considering 196/198 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1182264993709470969.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2048185523628541774.kers'
[2026-05-26 08:37:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1182264993709470969.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2048185523628541774.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 196 rows 191 cols 468 entries
Finished phase 1 with 151 SingleSign rule and 15 generalized
[2026-05-26 08:37:38] [INFO ] Computed 30 invariants in 1 ms
Computed 30 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2048185523628541774.kers
Total runtime 1 ms.
[2026-05-26 08:37:39] [INFO ] Implicit Places using invariants in 116 ms returned [15, 38, 65, 84, 86, 98, 101, 167, 170]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 118 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/198 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 2 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-765081991062869011.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7018269719692420831.kers'
[2026-05-26 08:37:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-765081991062869011.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7018269719692420831.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 194 rows 180 cols 408 entries
Finished phase 1 with 157 SingleSign rule and 7 generalized
[2026-05-26 08:37:39] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7018269719692420831.kers
Total runtime 1 ms.
[2026-05-26 08:37:39] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-26 08:37:39] [INFO ] Invariant cache hit.
[2026-05-26 08:37:39] [INFO ] State equation strengthened by 68 read => feed constraints.
[2026-05-26 08:37:39] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/198 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 711 ms. Remains : 185/198 places, 194/198 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)&&p1)))'
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 126 ms.
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 5 factoid took 14 ms. Proved property starting from automaton with 4 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 19 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-4-LTLFireability-12 finished in 1146 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||(F(p1) U G(p2)))))'
Support contains 6 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 197 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 197 transition count 197
Applied a total of 2 rules in 5 ms. Remains 197 /198 variables (removed 1) and now considering 197/198 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6184316487283442131.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7959364290517865335.kers'
[2026-05-26 08:37:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6184316487283442131.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7959364290517865335.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 197 rows 192 cols 472 entries
Finished phase 1 with 151 SingleSign rule and 16 generalized
[2026-05-26 08:37:40] [INFO ] Computed 30 invariants in 2 ms
Computed 30 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7959364290517865335.kers
Total runtime 3 ms.
[2026-05-26 08:37:40] [INFO ] Implicit Places using invariants in 114 ms returned [15, 17, 38, 65, 84, 98, 101, 171]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 115 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 189/198 places, 197/198 transitions.
Applied a total of 0 rules in 1 ms. Remains 189 /189 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 121 ms. Remains : 189/198 places, 197/198 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 G(p1))||p2)))'
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-14
Product exploration explored 100000 steps with 39 reset in 99 ms.
Stack based approach found an accepted trace after 395 steps with 0 reset with depth 396 and stack size 396 in 1 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-14 finished in 408 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(F(!p0))||(F(!p0)&&X(X(F((p1||X(p2))))))))))'
Support contains 5 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 196 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 196 transition count 196
Applied a total of 4 rules in 6 ms. Remains 196 /198 variables (removed 2) and now considering 196/198 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1837608317666823615.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9038873205680077885.kers'
[2026-05-26 08:37:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1837608317666823615.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9038873205680077885.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 196 rows 191 cols 468 entries
Finished phase 1 with 151 SingleSign rule and 15 generalized
[2026-05-26 08:37:40] [INFO ] Computed 30 invariants in 3 ms
Computed 30 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9038873205680077885.kers
Total runtime 3 ms.
[2026-05-26 08:37:40] [INFO ] Implicit Places using invariants in 122 ms returned [15, 17, 38, 65, 84, 86, 98, 101, 167]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 123 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/198 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 3 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1728565320685932368.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12667827843272494507.kers'
[2026-05-26 08:37:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1728565320685932368.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12667827843272494507.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 194 rows 180 cols 406 entries
Finished phase 1 with 155 SingleSign rule and 9 generalized
[2026-05-26 08:37:40] [INFO ] Computed 21 invariants in 2 ms
Computed 21 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12667827843272494507.kers
Total runtime 3 ms.
[2026-05-26 08:37:40] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-26 08:37:40] [INFO ] Invariant cache hit.
[2026-05-26 08:37:40] [INFO ] State equation strengthened by 68 read => feed constraints.
[2026-05-26 08:37:41] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/198 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 674 ms. Remains : 185/198 places, 194/198 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(F(p0))||(F(p0)&&X(X(F((p1||X(p2))))))))))'
Stuttering acceptance computed with spot in 349 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-15
Product exploration explored 100000 steps with 809 reset in 122 ms.
Product exploration explored 100000 steps with 817 reset in 127 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 8 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
RANDOM walk for 5928 steps (0 resets) in 14 ms. (395 steps per ms) remains 0/6 properties
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Knowledge-based reduction took 472 ms.
Stuttering acceptance computed with spot in 311 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 5 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2026-05-26 08:37:42] [INFO ] Invariant cache hit.
[2026-05-26 08:37:42] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-26 08:37:42] [INFO ] Invariant cache hit.
[2026-05-26 08:37:42] [INFO ] State equation strengthened by 68 read => feed constraints.
[2026-05-26 08:37:43] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2026-05-26 08:37:43] [INFO ] Invariant cache hit.
[2026-05-26 08:37:43] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 4/184 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 18/61 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (OVERLAPS) 1/185 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (OVERLAPS) 194/379 variables, 185/251 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/379 variables, 68/319 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/379 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 16 (OVERLAPS) 0/379 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 319 constraints, problems are : Problem set: 0 solved, 190 unsolved in 22346 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 4/184 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 1/185 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (OVERLAPS) 194/379 variables, 185/251 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/379 variables, 68/319 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 190/509 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/379 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 14 (OVERLAPS) 0/379 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 509 constraints, problems are : Problem set: 0 solved, 190 unsolved in 17396 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39761ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 39766ms
Finished structural reductions in LTL mode , in 1 iterations and 40310 ms. Remains : 185/185 places, 194/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 1 factoid took 60 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
RANDOM walk for 24383 steps (4 resets) in 42 ms. (567 steps per ms) remains 0/6 properties
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 7 states, 9 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Knowledge-based reduction took 477 ms.
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 799 reset in 126 ms.
Product exploration explored 100000 steps with 803 reset in 136 ms.
Spot run failed in 41 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/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/ltsmin1291220385826931583
[2026-05-26 08:38:24] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1291220385826931583
Running compilation step : cd /tmp/ltsmin1291220385826931583;'/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 290 ms.
Running link step : cd /tmp/ltsmin1291220385826931583;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1291220385826931583;'/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/stateBased7655892074119983467.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Applied a total of 0 rules in 4 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2026-05-26 08:38:39] [INFO ] Invariant cache hit.
[2026-05-26 08:38:39] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-26 08:38:39] [INFO ] Invariant cache hit.
[2026-05-26 08:38:39] [INFO ] State equation strengthened by 68 read => feed constraints.
[2026-05-26 08:38:39] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 543 ms. Remains : 185/185 places, 194/194 transitions.
Built C files in :
/tmp/ltsmin66404822436368342
[2026-05-26 08:38:39] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin66404822436368342
Running compilation step : cd /tmp/ltsmin66404822436368342;'/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 285 ms.
Running link step : cd /tmp/ltsmin66404822436368342;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin66404822436368342;'/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/stateBased3156698011142274627.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 08:38:54] [INFO ] Flatten gal took : 9 ms
[2026-05-26 08:38:54] [INFO ] Flatten gal took : 8 ms
[2026-05-26 08:38:54] [INFO ] Time to serialize gal into /tmp/LTL8817619652599365980.gal : 3 ms
[2026-05-26 08:38:54] [INFO ] Time to serialize properties into /tmp/LTL1466544040311390536.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8817619652599365980.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17582929752933833582.hoa' '-atoms' '/tmp/LTL1466544040311390536.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1466544040311390536.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17582929752933833582.hoa
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t14, t22, t26, t30, t34, t42, t46, t54, t58, t62, t65, t72, t73, t76, t77, t79, t80,...443
Detected timeout of ITS tools.
[2026-05-26 08:39:09] [INFO ] Flatten gal took : 7 ms
[2026-05-26 08:39:09] [INFO ] Flatten gal took : 7 ms
[2026-05-26 08:39:09] [INFO ] Time to serialize gal into /tmp/LTL180935605316098016.gal : 2 ms
[2026-05-26 08:39:09] [INFO ] Time to serialize properties into /tmp/LTL10256757935785647333.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL180935605316098016.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10256757935785647333.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("((crane_lift!=1)||(CU_lift_rs!=1))")))||((F("((crane_lift!=1)||(CU_lift_rs!=1))"))&&(X(X(F(("(A1U_out==1)")||(X("((A2U_in...197
Formula 0 simplified : XX(FG!"((crane_lift!=1)||(CU_lift_rs!=1))" & (G!"((crane_lift!=1)||(CU_lift_rs!=1))" | XXG(!"(A1U_out==1)" & X!"((A2U_in==1)&&(arm1_...177
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t14, t22, t26, t30, t34, t42, t46, t54, t58, t62, t65, t72, t73, t76, t77, t79, t80,...443
Detected timeout of ITS tools.
[2026-05-26 08:39:25] [INFO ] Flatten gal took : 10 ms
[2026-05-26 08:39:25] [INFO ] Applying decomposition
[2026-05-26 08:39:25] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12185488376243395737.txt' '-o' '/tmp/graph12185488376243395737.bin' '-w' '/tmp/graph12185488376243395737.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12185488376243395737.bin' '-l' '-1' '-v' '-w' '/tmp/graph12185488376243395737.weights' '-q' '0' '-e' '0.001'
[2026-05-26 08:39:25] [INFO ] Decomposing Gal with order
[2026-05-26 08:39:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 08:39:25] [INFO ] Removed a total of 49 redundant transitions.
[2026-05-26 08:39:25] [INFO ] Flatten gal took : 63 ms
[2026-05-26 08:39:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2026-05-26 08:39:25] [INFO ] Time to serialize gal into /tmp/LTL5237108936656927593.gal : 4 ms
[2026-05-26 08:39:25] [INFO ] Time to serialize properties into /tmp/LTL15048137437015811056.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5237108936656927593.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15048137437015811056.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("((i8.u67.crane_lift!=1)||(i8.u72.CU_lift_rs!=1))")))||((F("((i8.u67.crane_lift!=1)||(i8.u72.CU_lift_rs!=1))"))&&(X(X(F(("...255
Formula 0 simplified : XX(FG!"((i8.u67.crane_lift!=1)||(i8.u72.CU_lift_rs!=1))" & (G!"((i8.u67.crane_lift!=1)||(i8.u72.CU_lift_rs!=1))" | XXG(!"(i7.i0.u60....235
Reverse transition relation is NOT exact ! Due to transitions t119, i0.i0.u13.t30, i0.i1.u2.t22, i0.i1.u10.t26, i0.i1.u12.t34, i1.i0.u0.t10, i1.i0.u6.t6, i...846
278 unique states visited
0 strongly connected components in search stack
345 transitions explored
187 items max in DFS search stack
330 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.32794,124948,1,0,238280,158,3066,287436,138,385,516433
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ParamProductionCell-PT-4-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ParamProductionCell-PT-4-LTLFireability-15 finished in 108734 ms.
All properties solved by simple procedures.
Total runtime 259962 ms.

BK_STOP 1779784769240

--------------------
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="ParamProductionCell-PT-4"
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 ParamProductionCell-PT-4, 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 r194-tall-177969914100492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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