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

About the Execution of ITS-Tools for PermAdmissibility-PT-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16199.907 3600000.00 5161559.00 750199.40 FFFTFFTFF?FFFFTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r194-tall-177969914200612.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 PermAdmissibility-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914200612
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 13K Mar 8 07:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K Mar 8 07:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 46K Mar 8 07:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 241K Mar 8 07:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.4K Mar 16 08:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Mar 16 08:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Mar 16 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 89K Mar 16 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Mar 8 07:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Mar 8 07:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 50K Mar 8 07:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 246K Mar 8 07:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 16 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Mar 16 08:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 336K 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 PermAdmissibility-PT-02-LTLFireability-00
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-01
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-02
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-03
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-04
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-05
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-06
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-07
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-08
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-09
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-10
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-11
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-12
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-13
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-14
FORMULA_NAME PermAdmissibility-PT-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779796133104

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 11:48:54] [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 11:48:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 11:48:54] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2026-05-26 11:48:54] [INFO ] Transformed 168 places.
[2026-05-26 11:48:54] [INFO ] Transformed 592 transitions.
[2026-05-26 11:48:54] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA PermAdmissibility-PT-02-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 100 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 104 transition count 592
Applied a total of 64 rules in 23 ms. Remains 104 /168 variables (removed 64) and now considering 592/592 (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-4311369640034896305.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10819825169277769936.kers'
[2026-05-26 11:48:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4311369640034896305.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10819825169277769936.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 592 rows 104 cols 2944 entries
Finished phase 1 with 40 SingleSign rule and 48 generalized
[2026-05-26 11:48:54] [INFO ] Computed 16 invariants in 2 ms
Computed 16 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10819825169277769936.kers
Total runtime 3 ms.
[2026-05-26 11:48:54] [INFO ] Implicit Places using invariants in 181 ms returned []
[2026-05-26 11:48:54] [INFO ] Invariant cache hit.
[2026-05-26 11:48:55] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Running 588 sub problems to find dead transitions.
[2026-05-26 11:48:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 588 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 4 (OVERLAPS) 592/696 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/696 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 696/696 variables, and 120 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 588 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 4 (OVERLAPS) 592/696 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/696 variables, 588/708 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 696/696 variables, and 708 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60778ms problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 60798ms
Starting structural reductions in LTL mode, iteration 1 : 104/168 places, 592/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61325 ms. Remains : 104/168 places, 592/592 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 592/592 (removed 0) transitions.
[2026-05-26 11:49:55] [INFO ] Invariant cache hit.
[2026-05-26 11:49:56] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-26 11:49:56] [INFO ] Invariant cache hit.
[2026-05-26 11:49:56] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 217 ms. Remains : 104/104 places, 592/592 transitions.
Support contains 100 out of 104 places after structural reductions.
[2026-05-26 11:49:56] [INFO ] Flatten gal took : 100 ms
[2026-05-26 11:49:56] [INFO ] Flatten gal took : 64 ms
[2026-05-26 11:49:56] [INFO ] Input system was already deterministic with 592 transitions.
Reduction of identical properties reduced properties to check from 33 to 28
RANDOM walk for 35226 steps (753 resets) in 1453 ms. (24 steps per ms) remains 0/28 properties
FORMULA PermAdmissibility-PT-02-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 104 stabilizing places and 592 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 592
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(((G(p0)&&p1) U (G((p1&&G(p0)))||(G(p0)&&F(!p2)&&p1)))) U (G(F(((p1&&G(p0)) U ((p1&&G(p0)&&F(!p2))||G((p1&&G(p0)))))))||(F(!p3)&&F(((p1&&G(p0)) U ((p1&&G(p0)&&F(!p2))||G((p1&&G(p0))))))))))'
Support contains 44 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Graph (complete) has 975 edges and 104 vertex of which 68 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.4 ms
Discarding 36 places :
Also discarding 256 output transitions
Drop transitions (Output transitions of discarded places.) removed 256 transitions
Applied a total of 1 rules in 24 ms. Remains 68 /104 variables (removed 36) and now considering 336/592 (removed 256) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16031818188682864438.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15250782822394438938.kers'
[2026-05-26 11:49:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16031818188682864438.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15250782822394438938.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 336 rows 68 cols 1440 entries
Finished phase 1 with 37 SingleSign rule and 19 generalized
[2026-05-26 11:49:57] [INFO ] Computed 12 invariants in 1 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15250782822394438938.kers
Total runtime 1 ms.
[2026-05-26 11:49:57] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-26 11:49:57] [INFO ] Invariant cache hit.
[2026-05-26 11:49:57] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2026-05-26 11:49:58] [INFO ] Redundant transitions in 19 ms returned []
Running 332 sub problems to find dead transitions.
[2026-05-26 11:49:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 332 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (OVERLAPS) 336/404 variables, 68/80 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (OVERLAPS) 0/404 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 332 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 80 constraints, problems are : Problem set: 0 solved, 332 unsolved in 12209 ms.
Refiners :[Generalized P Invariants (flows): 12/12 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (OVERLAPS) 336/404 variables, 68/80 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 332/412 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/404 variables, and 412 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 12/12 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42409ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 42411ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/104 places, 336/592 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42648 ms. Remains : 68/104 places, 336/592 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)&&p1) U (G((p1&&G(p0)))||(G(p0)&&F(!p2)&&p1)))) U (G(F(((p1&&G(p0)) U ((p1&&G(p0)&&F(!p2))||G((p1&&G(p0)))))))||(F(!p3)&&F(((p1&&G(p0)) U ((p1&&G(p0)&&F(!p2))||G((p1&&G(p0))))))))))'
Stuttering acceptance computed with spot in 525 ms :[(OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) p3) (AND (NOT p1) p3)), (OR (AND (NOT p0) p2 p3) (AND (NOT p1) p2 p3)), (OR (AND (NOT p0) p3) (AND (NOT p1) p3)), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) p3), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-01
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 3 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-01 finished in 43270 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 22 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Graph (complete) has 975 edges and 104 vertex of which 86 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 128 output transitions
Drop transitions (Output transitions of discarded places.) removed 128 transitions
Applied a total of 1 rules in 35 ms. Remains 86 /104 variables (removed 18) and now considering 464/592 (removed 128) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-943984736332412685.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9161667100747076845.kers'
[2026-05-26 11:50:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-943984736332412685.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9161667100747076845.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 464 rows 86 cols 2192 entries
Finished phase 1 with 51 SingleSign rule and 21 generalized
[2026-05-26 11:50:41] [INFO ] Computed 14 invariants in 2 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9161667100747076845.kers
Total runtime 2 ms.
[2026-05-26 11:50:41] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-26 11:50:41] [INFO ] Invariant cache hit.
[2026-05-26 11:50:41] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
[2026-05-26 11:50:41] [INFO ] Redundant transitions in 13 ms returned []
Running 460 sub problems to find dead transitions.
[2026-05-26 11:50:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 464/550 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 0/550 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 100 constraints, problems are : Problem set: 0 solved, 460 unsolved in 21500 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (OVERLAPS) 464/550 variables, 86/100 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 460/560 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 560 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51772ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 51773ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/104 places, 464/592 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52506 ms. Remains : 86/104 places, 464/592 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-02
Stuttering criterion allowed to conclude after 42 steps with 3 reset in 3 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-02 finished in 52638 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(X(X(F(!p1)))))))'
Support contains 22 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 91 transition count 468
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 91 transition count 468
Applied a total of 26 rules in 24 ms. Remains 91 /104 variables (removed 13) and now considering 468/592 (removed 124) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13212575825371091621.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17330323070190322666.kers'
[2026-05-26 11:51:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13212575825371091621.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17330323070190322666.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 468 rows 91 cols 2368 entries
Finished phase 1 with 27 SingleSign rule and 48 generalized
[2026-05-26 11:51:33] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17330323070190322666.kers
Total runtime 2 ms.
[2026-05-26 11:51:33] [INFO ] Implicit Places using invariants in 79 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/104 places, 468/592 transitions.
Applied a total of 0 rules in 14 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 118 ms. Remains : 90/104 places, 468/592 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(X(X(F(p1)))))))'
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-03
Product exploration explored 100000 steps with 3535 reset in 688 ms.
Product exploration explored 100000 steps with 3531 reset in 655 ms.
Computed a total of 90 stabilizing places and 468 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 90 transition count 468
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 5 factoid took 11 ms. Proved property starting from automaton with 4 states, 5 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 88 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-02-LTLFireability-03 finished in 1718 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 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Graph (complete) has 975 edges and 104 vertex of which 12 are kept as prefixes of interest. Removing 92 places using SCC suffix rule.1 ms
Discarding 92 places :
Also discarding 576 output transitions
Drop transitions (Output transitions of discarded places.) removed 576 transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 10 transition count 10
Ensure Unique test removed 1 places
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 9 transition count 10
Applied a total of 6 rules in 6 ms. Remains 9 /104 variables (removed 95) and now considering 10/592 (removed 582) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7305847542584947253.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10031843769337821718.kers'
[2026-05-26 11:51:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7305847542584947253.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10031843769337821718.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 9 cols 34 entries
Finished phase 1 with 5 SingleSign rule and 1 generalized
[2026-05-26 11:51:35] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10031843769337821718.kers
Total runtime 0 ms.
[2026-05-26 11:51:35] [INFO ] Implicit Places using invariants in 18 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 19 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/104 places, 10/592 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 7 transition count 8
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 6 transition count 8
Applied a total of 2 rules in 3 ms. Remains 6 /8 variables (removed 2) and now considering 8/10 (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-13389347405135170169.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9451835447675350825.kers'
[2026-05-26 11:51:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13389347405135170169.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9451835447675350825.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 6 cols 28 entries
Finished phase 1 with 3 SingleSign rule and 1 generalized
[2026-05-26 11:51:35] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9451835447675350825.kers
Total runtime 0 ms.
[2026-05-26 11:51:35] [INFO ] Implicit Places using invariants in 15 ms returned []
[2026-05-26 11:51:35] [INFO ] Invariant cache hit.
[2026-05-26 11:51:35] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/104 places, 8/592 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60 ms. Remains : 6/104 places, 8/592 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 32 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-04
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-04 finished in 113 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)||X((X(F(p2))||p1))))'
Support contains 23 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 91 transition count 468
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 91 transition count 468
Applied a total of 26 rules in 12 ms. Remains 91 /104 variables (removed 13) and now considering 468/592 (removed 124) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6055132846730158666.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8203832257182671362.kers'
[2026-05-26 11:51:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6055132846730158666.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8203832257182671362.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 468 rows 91 cols 2412 entries
Finished phase 1 with 27 SingleSign rule and 48 generalized
[2026-05-26 11:51:35] [INFO ] Computed 16 invariants in 2 ms
Computed 16 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8203832257182671362.kers
Total runtime 3 ms.
[2026-05-26 11:51:35] [INFO ] Implicit Places using invariants in 72 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/104 places, 468/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 90/104 places, 468/592 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)||X((X(F(p2))||p1))))'
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-06
Product exploration explored 100000 steps with 23007 reset in 451 ms.
Product exploration explored 100000 steps with 23049 reset in 482 ms.
Computed a total of 90 stabilizing places and 468 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 90 transition count 468
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 10 factoid took 109 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 10 factoid took 106 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p2), (NOT p2), (NOT p2)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11055806559857416194.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-539438734439356990.kers'
[2026-05-26 11:51:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11055806559857416194.kers, --Pflows, --basisKERS=/tmp/petrispot-output-539438734439356990.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 468 rows 90 cols 2344 entries
Finished phase 1 with 53 SingleSign rule and 22 generalized
[2026-05-26 11:51:37] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-539438734439356990.kers
Total runtime 3 ms.
[2026-05-26 11:51:37] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 14 ms returned sat
[2026-05-26 11:51:37] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2026-05-26 11:51:37] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 436 transitions) in 70 ms.
[2026-05-26 11:51:37] [INFO ] Added : 0 causal constraints over 0 iterations in 101 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 867 ms.
Stuttering acceptance computed with spot in 113 ms :[(NOT p2), (NOT p2), (NOT p2)]
Support contains 5 out of 90 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2026-05-26 11:51:37] [INFO ] Invariant cache hit.
[2026-05-26 11:51:37] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-26 11:51:37] [INFO ] Invariant cache hit.
[2026-05-26 11:51:38] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2026-05-26 11:51:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 468/558 variables, 90/105 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 6 (OVERLAPS) 0/558 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 464 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 105 constraints, problems are : Problem set: 0 solved, 464 unsolved in 21048 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 468/558 variables, 90/105 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 464/569 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/558 variables, and 569 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51361ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 51363ms
Finished structural reductions in LTL mode , in 1 iterations and 51910 ms. Remains : 90/90 places, 468/468 transitions.
Computed a total of 90 stabilizing places and 468 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 90 transition count 468
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 2 factoid took 57 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
RANDOM walk for 4 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p2), (NOT p2), (NOT p2)]
[2026-05-26 11:52:29] [INFO ] Invariant cache hit.
[2026-05-26 11:52:30] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 14 ms returned sat
[2026-05-26 11:52:30] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2026-05-26 11:52:30] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 436 transitions) in 54 ms.
[2026-05-26 11:52:30] [INFO ] Added : 0 causal constraints over 0 iterations in 88 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 748 ms.
Stuttering acceptance computed with spot in 85 ms :[(NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 22941 reset in 218 ms.
Product exploration explored 100000 steps with 23071 reset in 226 ms.
Spot run failed in 68 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/ltsmin2373942663152087600
[2026-05-26 11:52:31] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2373942663152087600
Running compilation step : cd /tmp/ltsmin2373942663152087600;'/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 848 ms.
Running link step : cd /tmp/ltsmin2373942663152087600;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin2373942663152087600;'/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/stateBased12759936631386430575.hoa' '--buchi-type=spotba'
LTSmin run took 7043 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-02-LTLFireability-06 finished in 63589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)&&p0))))'
Support contains 22 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 62 place count 68 transition count 234
Iterating global reduction 0 with 10 rules applied. Total rules applied 72 place count 68 transition count 234
Applied a total of 72 rules in 11 ms. Remains 68 /104 variables (removed 36) and now considering 234/592 (removed 358) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7710327993298988141.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5186846958192785871.kers'
[2026-05-26 11:52:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7710327993298988141.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5186846958192785871.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 234 rows 68 cols 1236 entries
Finished phase 1 with 30 SingleSign rule and 22 generalized
[2026-05-26 11:52:39] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5186846958192785871.kers
Total runtime 1 ms.
[2026-05-26 11:52:39] [INFO ] Implicit Places using invariants in 50 ms returned [0, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/104 places, 234/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63 ms. Remains : 66/104 places, 234/592 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)&&p0))))'
Stuttering acceptance computed with spot in 107 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-07
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-07 finished in 194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F((p1&&X(F((X(p3)||p2)))))&&p0))))'
Support contains 9 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 80 transition count 352
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 80 transition count 352
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 66 place count 62 transition count 154
Iterating global reduction 0 with 18 rules applied. Total rules applied 84 place count 62 transition count 154
Applied a total of 84 rules in 5 ms. Remains 62 /104 variables (removed 42) and now considering 154/592 (removed 438) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3627667037473368031.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-592254679762706586.kers'
[2026-05-26 11:52:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3627667037473368031.kers, --Pflows, --basisKERS=/tmp/petrispot-output-592254679762706586.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 154 rows 62 cols 827 entries
Finished phase 1 with 19 SingleSign rule and 27 generalized
[2026-05-26 11:52:39] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-592254679762706586.kers
Total runtime 1 ms.
[2026-05-26 11:52:39] [INFO ] Implicit Places using invariants in 49 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/104 places, 154/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 61/104 places, 154/592 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((p1&&X(F((X(p3)||p2)))))&&p0))))'
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), true, (OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-08 finished in 345 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((X(((!p2 U (G(!p2)||(!p2&&(!p3||G(!p4)))))||p1))||p0)))))'
Support contains 12 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 82 transition count 360
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 82 transition count 360
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 60 place count 66 transition count 172
Iterating global reduction 0 with 16 rules applied. Total rules applied 76 place count 66 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 65 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 65 transition count 164
Applied a total of 78 rules in 11 ms. Remains 65 /104 variables (removed 39) and now considering 164/592 (removed 428) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2813620672290961787.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7765944537430422293.kers'
[2026-05-26 11:52:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2813620672290961787.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7765944537430422293.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 164 rows 65 cols 881 entries
Finished phase 1 with 22 SingleSign rule and 27 generalized
[2026-05-26 11:52:39] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7765944537430422293.kers
Total runtime 1 ms.
[2026-05-26 11:52:39] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-26 11:52:39] [INFO ] Invariant cache hit.
[2026-05-26 11:52:39] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2026-05-26 11:52:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 164/229 variables, 65/81 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/229 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 81 constraints, problems are : Problem set: 0 solved, 160 unsolved in 4644 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 164/229 variables, 65/81 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 160/241 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 229/229 variables, and 241 constraints, problems are : Problem set: 0 solved, 160 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34693ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 34694ms
Starting structural reductions in LTL mode, iteration 1 : 65/104 places, 164/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34931 ms. Remains : 65/104 places, 164/592 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((X(((!p2 U (G(!p2)||(!p2&&(!p3||G(!p4)))))||p1))||p0)))))'
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), true, p2, (AND p2 p4), p4]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-09
Product exploration explored 100000 steps with 3087 reset in 239 ms.
Product exploration explored 100000 steps with 3096 reset in 242 ms.
Computed a total of 65 stabilizing places and 164 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 65 transition count 164
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 7 factoid took 81 ms. Reduced automaton from 8 states, 17 edges and 5 AP (stutter sensitive) to 8 states, 17 edges and 5 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40002 steps (847 resets) in 581 ms. (68 steps per ms) remains 5/11 properties
BEST_FIRST walk for 40003 steps (230 resets) in 232 ms. (171 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (249 resets) in 110 ms. (360 steps per ms) remains 1/3 properties
[2026-05-26 11:53:15] [INFO ] Invariant cache hit.
Problem apf4 is UNSAT
After SMT solving in domain Real declared 9/229 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 40 ms.
Refiners :[Generalized P Invariants (flows): 0/16 constraints, State Equation: 0/65 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 8 factoid took 189 ms. Reduced automaton from 8 states, 17 edges and 5 AP (stutter sensitive) to 8 states, 16 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), true, p2, (AND p2 p4), p4]
Knowledge-based reduction took 1027 ms.
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), true, p2, (AND p2 p4), p4]
Support contains 12 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 164/164 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2026-05-26 11:53:16] [INFO ] Invariant cache hit.
[2026-05-26 11:53:16] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-26 11:53:16] [INFO ] Invariant cache hit.
[2026-05-26 11:53:16] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 248 ms. Remains : 65/65 places, 164/164 transitions.
Computed a total of 65 stabilizing places and 164 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 65 transition count 164
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 7 factoid took 76 ms. Reduced automaton from 8 states, 16 edges and 5 AP (stutter sensitive) to 8 states, 16 edges and 5 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (848 resets) in 166 ms. (239 steps per ms) remains 4/10 properties
BEST_FIRST walk for 30074 steps (186 resets) in 80 ms. (371 steps per ms) remains 0/4 properties
Knowledge based reduction with 7 factoid took 236 ms. Reduced automaton from 8 states, 16 edges and 5 AP (stutter sensitive) to 8 states, 16 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), true, p2, (AND p2 p4), p4]
Knowledge-based reduction took 742 ms.
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), true, p2, (AND p2 p4), p4]
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), true, p2, (AND p2 p4), p4]
Product exploration explored 100000 steps with 3095 reset in 230 ms.
Product exploration explored 100000 steps with 3094 reset in 238 ms.
Spot run failed in 44 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/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/ltsmin26879951358999310
[2026-05-26 11:53:18] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin26879951358999310
Running compilation step : cd /tmp/ltsmin26879951358999310;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 287 ms.
Running link step : cd /tmp/ltsmin26879951358999310;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin26879951358999310;'/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/stateBased10789933850231801029.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 12 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 164/164 transitions.
Applied a total of 0 rules in 1 ms. Remains 65 /65 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2026-05-26 11:53:33] [INFO ] Invariant cache hit.
[2026-05-26 11:53:33] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-26 11:53:33] [INFO ] Invariant cache hit.
[2026-05-26 11:53:34] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 248 ms. Remains : 65/65 places, 164/164 transitions.
Built C files in :
/tmp/ltsmin16296541978592641476
[2026-05-26 11:53:34] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16296541978592641476
Running compilation step : cd /tmp/ltsmin16296541978592641476;'/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 284 ms.
Running link step : cd /tmp/ltsmin16296541978592641476;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16296541978592641476;'/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/stateBased16691850687899563573.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 11:53:49] [INFO ] Flatten gal took : 10 ms
[2026-05-26 11:53:49] [INFO ] Flatten gal took : 10 ms
[2026-05-26 11:53:49] [INFO ] Time to serialize gal into /tmp/LTL3235126425717208585.gal : 3 ms
[2026-05-26 11:53:49] [INFO ] Time to serialize properties into /tmp/LTL3407202928102489431.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3235126425717208585.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1970691324847399482.hoa' '-atoms' '/tmp/LTL3407202928102489431.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...317
Loading property file /tmp/LTL3407202928102489431.prop.
Loaded 5 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1970691324847399482.hoa
Detected timeout of ITS tools.
[2026-05-26 11:54:04] [INFO ] Flatten gal took : 10 ms
[2026-05-26 11:54:04] [INFO ] Flatten gal took : 10 ms
[2026-05-26 11:54:04] [INFO ] Time to serialize gal into /tmp/LTL13275114635771683784.gal : 2 ms
[2026-05-26 11:54:04] [INFO ] Time to serialize properties into /tmp/LTL16461211236341923324.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13275114635771683784.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16461211236341923324.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((aux15_5<1)||(aux13_2<1))")||(("(c17<1)")||(X(("((c13<1)||(aux11_7<1))")||(("(aux9_6<1)")||((!("(((in4_6>=1)&&(in2_3>=1))&...373
Formula 0 simplified : XXF(!"((aux15_5<1)||(aux13_2<1))" & !"(c17<1)" & X(!"((c13<1)||(aux11_7<1))" & !"(aux9_6<1)" & (("(((aux16_3>=1)&&(aux14_6>=1))&&(c1...251
Detected timeout of ITS tools.
[2026-05-26 11:54:19] [INFO ] Flatten gal took : 13 ms
[2026-05-26 11:54:19] [INFO ] Applying decomposition
[2026-05-26 11:54:19] [INFO ] Flatten gal took : 9 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/graph16166398540474914178.txt' '-o' '/tmp/graph16166398540474914178.bin' '-w' '/tmp/graph16166398540474914178.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16166398540474914178.bin' '-l' '-1' '-v' '-w' '/tmp/graph16166398540474914178.weights' '-q' '0' '-e' '0.001'
[2026-05-26 11:54:19] [INFO ] Decomposing Gal with order
[2026-05-26 11:54:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 11:54:19] [INFO ] Removed a total of 145 redundant transitions.
[2026-05-26 11:54:19] [INFO ] Flatten gal took : 173 ms
[2026-05-26 11:54:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 111 labels/synchronizations in 7 ms.
[2026-05-26 11:54:19] [INFO ] Time to serialize gal into /tmp/LTL7310773469317038238.gal : 3 ms
[2026-05-26 11:54:19] [INFO ] Time to serialize properties into /tmp/LTL11113546849295578675.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7310773469317038238.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11113546849295578675.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(("((i0.u0.aux15_5<1)||(i0.u0.aux13_2<1))")||(("(i0.u1.c17<1)")||(X(("((u2.c13<1)||(u4.aux11_7<1))")||(("(u4.aux9_6<1)")||((!(...478
Formula 0 simplified : XXF(!"((i0.u0.aux15_5<1)||(i0.u0.aux13_2<1))" & !"(i0.u1.c17<1)" & X(!"((u2.c13<1)||(u4.aux11_7<1))" & !"(u4.aux9_6<1)" & (("(((i0.u...320
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-PT-02-LTLFireability-09 finished in 115209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 76 place count 54 transition count 108
Iterating global reduction 0 with 24 rules applied. Total rules applied 100 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 103 place count 51 transition count 84
Iterating global reduction 0 with 3 rules applied. Total rules applied 106 place count 51 transition count 84
Applied a total of 106 rules in 9 ms. Remains 51 /104 variables (removed 53) and now considering 84/592 (removed 508) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3128699307515759616.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9535077170523358474.kers'
[2026-05-26 11:54:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3128699307515759616.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9535077170523358474.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 84 rows 51 cols 446 entries
Finished phase 1 with 14 SingleSign rule and 21 generalized
[2026-05-26 11:54:34] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9535077170523358474.kers
Total runtime 2 ms.
[2026-05-26 11:54:34] [INFO ] Implicit Places using invariants in 67 ms returned [0, 5, 18, 25]
[2026-05-26 11:54:34] [INFO ] Actually due to overlaps returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 70 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/104 places, 84/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82 ms. Remains : 48/104 places, 84/592 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-10 finished in 206 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||(G(p1) U X(((p1||X(p3))&&p2))))))'
Support contains 11 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 72 place count 58 transition count 128
Iterating global reduction 0 with 20 rules applied. Total rules applied 92 place count 58 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 57 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 57 transition count 120
Applied a total of 94 rules in 7 ms. Remains 57 /104 variables (removed 47) and now considering 120/592 (removed 472) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8659771783585654197.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7366045993517882322.kers'
[2026-05-26 11:54:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8659771783585654197.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7366045993517882322.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 120 rows 57 cols 646 entries
Finished phase 1 with 18 SingleSign rule and 23 generalized
[2026-05-26 11:54:35] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7366045993517882322.kers
Total runtime 1 ms.
[2026-05-26 11:54:35] [INFO ] Implicit Places using invariants in 54 ms returned [0, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 71 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/104 places, 120/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 55 /55 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 55/104 places, 120/592 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U X(((p0||X(p2))&&p1)))||p3)))'
Stuttering acceptance computed with spot in 233 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-11 finished in 338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F((p1&&F(p2))))&&p0)))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 75 place count 55 transition count 114
Iterating global reduction 0 with 23 rules applied. Total rules applied 98 place count 55 transition count 114
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 101 place count 52 transition count 90
Iterating global reduction 0 with 3 rules applied. Total rules applied 104 place count 52 transition count 90
Applied a total of 104 rules in 7 ms. Remains 52 /104 variables (removed 52) and now considering 90/592 (removed 502) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10281451954529176915.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16554651395905021104.kers'
[2026-05-26 11:54:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10281451954529176915.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16554651395905021104.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 90 rows 52 cols 480 entries
Finished phase 1 with 14 SingleSign rule and 22 generalized
[2026-05-26 11:54:35] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16554651395905021104.kers
Total runtime 2 ms.
[2026-05-26 11:54:35] [INFO ] Implicit Places using invariants in 69 ms returned [0, 5, 18, 25]
[2026-05-26 11:54:35] [INFO ] Actually due to overlaps returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 71 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/104 places, 90/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 49/104 places, 90/592 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((p1&&F(p2))))&&p0)))'
Stuttering acceptance computed with spot in 160 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLFireability-12 finished in 269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((p0&&G(p1)))&&(!p2 U (G(!p2)||(!p2&&G(!p3))))))))'
Support contains 12 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 80 transition count 352
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 80 transition count 352
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 66 place count 62 transition count 154
Iterating global reduction 0 with 18 rules applied. Total rules applied 84 place count 62 transition count 154
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 61 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 61 transition count 146
Applied a total of 86 rules in 8 ms. Remains 61 /104 variables (removed 43) and now considering 146/592 (removed 446) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4184050021759522092.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-34415796814856014.kers'
[2026-05-26 11:54:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4184050021759522092.kers, --Pflows, --basisKERS=/tmp/petrispot-output-34415796814856014.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 146 rows 61 cols 781 entries
Finished phase 1 with 21 SingleSign rule and 24 generalized
[2026-05-26 11:54:35] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-34415796814856014.kers
Total runtime 2 ms.
[2026-05-26 11:54:35] [INFO ] Implicit Places using invariants in 53 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/104 places, 146/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63 ms. Remains : 60/104 places, 146/592 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((X((p0&&G(p1)))&&(!p2 U (G(!p2)||(!p2&&G(!p3))))))))'
Stuttering acceptance computed with spot in 332 ms :[(OR (NOT p1) (NOT p0) p2), (OR (NOT p1) (NOT p0) p2), (OR (NOT p0) (NOT p1)), (AND p2 p3), p2, (NOT p1), (OR (AND (NOT p1) p3) (AND (NOT p0) p3) (AND p2 p3)), (AND (NOT p1) p3), (OR (AND (NOT p0) p3) (AND (NOT p1) p3))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLFireability-15
Product exploration explored 100000 steps with 3030 reset in 262 ms.
Product exploration explored 100000 steps with 3030 reset in 274 ms.
Computed a total of 60 stabilizing places and 146 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 60 transition count 146
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 18 factoid took 12 ms. Proved property starting from automaton with 9 states, 44 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 58 ms.
FORMULA PermAdmissibility-PT-02-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-02-LTLFireability-15 finished in 1033 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((X(((!p2 U (G(!p2)||(!p2&&(!p3||G(!p4)))))||p1))||p0)))))'
Spot run failed in 45 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-26 11:54:36] [INFO ] Flatten gal took : 31 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12591171632178443078
[2026-05-26 11:54:36] [INFO ] Computing symmetric may disable matrix : 592 transitions.
[2026-05-26 11:54:36] [INFO ] Applying decomposition
[2026-05-26 11:54:36] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 11:54:36] [INFO ] Flatten gal took : 29 ms
[2026-05-26 11:54:36] [INFO ] Computing symmetric may enable matrix : 592 transitions.
[2026-05-26 11:54:36] [INFO ] Computation of Complete enable matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5959488487771672662.txt' '-o' '/tmp/graph5959488487771672662.bin' '-w' '/tmp/graph5959488487771672662.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5959488487771672662.bin' '-l' '-1' '-v' '-w' '/tmp/graph5959488487771672662.weights' '-q' '0' '-e' '0.001'
[2026-05-26 11:54:36] [INFO ] Decomposing Gal with order
[2026-05-26 11:54:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 11:54:36] [INFO ] Computing Do-Not-Accords matrix : 592 transitions.
[2026-05-26 11:54:36] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 11:54:36] [INFO ] Built C files in 202ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12591171632178443078
Running compilation step : cd /tmp/ltsmin12591171632178443078;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-26 11:54:37] [INFO ] Removed a total of 565 redundant transitions.
[2026-05-26 11:54:37] [INFO ] Flatten gal took : 140 ms
[2026-05-26 11:54:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 208 labels/synchronizations in 10 ms.
[2026-05-26 11:54:37] [INFO ] Time to serialize gal into /tmp/LTLFireability11966012428788650516.gal : 21 ms
[2026-05-26 11:54:37] [INFO ] Time to serialize properties into /tmp/LTLFireability17288724590556443127.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/LTLFireability11966012428788650516.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17288724590556443127.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...278
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((u0.aux15_5<1)||(u0.aux13_2<1))")||(("(u4.c17<1)")||(X(("((u0.c13<1)||(u1.aux11_7<1))")||(("(u1.aux9_6<1)")||((!("(((i1.u2...463
Formula 0 simplified : XXF(!"((u0.aux15_5<1)||(u0.aux13_2<1))" & !"(u4.c17<1)" & X(!"((u0.c13<1)||(u1.aux11_7<1))" & !"(u1.aux9_6<1)" & (("(((u4.aux16_3>=1...305
Compilation finished in 1664 ms.
Running link step : cd /tmp/ltsmin12591171632178443078;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin12591171632178443078;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X([]((X(((!(LTLAPp2==true) U ([](!(LTLAPp2==true))||(!(LTLAPp2==true)&&(!(LTLAPp3==true)||[](!(LTLAPp4==true))))))||(LTLAPp1==true)))||(LTLAPp0==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-26 12:16:43] [INFO ] Flatten gal took : 413 ms
[2026-05-26 12:16:43] [INFO ] Time to serialize gal into /tmp/LTLFireability18428434345122958134.gal : 36 ms
[2026-05-26 12:16:43] [INFO ] Time to serialize properties into /tmp/LTLFireability8363695475791013058.ltl : 11 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/LTLFireability18428434345122958134.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8363695475791013058.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("((aux15_5<1)||(aux13_2<1))")||(("(c17<1)")||(X(("((c13<1)||(aux11_7<1))")||(("(aux9_6<1)")||((!("(((in4_6>=1)&&(in2_3>=1))&...373
Formula 0 simplified : XXF(!"((aux15_5<1)||(aux13_2<1))" & !"(c17<1)" & X(!"((c13<1)||(aux11_7<1))" & !"(aux9_6<1)" & (("(((aux16_3>=1)&&(aux14_6>=1))&&(c1...251
Detected timeout of ITS tools.
[2026-05-26 12:38:42] [INFO ] Flatten gal took : 378 ms
[2026-05-26 12:38:43] [INFO ] Input system was already deterministic with 592 transitions.
[2026-05-26 12:38:43] [INFO ] Transformed 104 places.
[2026-05-26 12:38:43] [INFO ] Transformed 592 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-26 12:38:44] [INFO ] Time to serialize gal into /tmp/LTLFireability2616975314357102331.gal : 10 ms
[2026-05-26 12:38:44] [INFO ] Time to serialize properties into /tmp/LTLFireability5282539556112976993.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2616975314357102331.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5282539556112976993.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(G(("((aux15_5<1)||(aux13_2<1))")||(("(c17<1)")||(X(("((c13<1)||(aux11_7<1))")||(("(aux9_6<1)")||((!("(((in4_6>=1)&&(in2_3>=1))&...373
Formula 0 simplified : XXF(!"((aux15_5<1)||(aux13_2<1))" & !"(c17<1)" & X(!"((c13<1)||(aux11_7<1))" & !"(aux9_6<1)" & (("(((aux16_3>=1)&&(aux14_6>=1))&&(c1...251

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

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