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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.9K Mar 8 07:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 8 07:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 58K Mar 8 07:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 304K Mar 8 07:03 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.7K Mar 16 08:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Mar 16 08:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Mar 16 08:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 70K Mar 16 08:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Mar 8 07:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 8 07:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 69K Mar 8 07:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 350K Mar 8 07:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 16 08:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K Mar 16 08:28 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 340K 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-50-LTLFireability-00
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-01
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-02
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-03
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-04
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-05
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-06
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-07
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-08
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-09
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-10
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-11
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-12
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-13
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-14
FORMULA_NAME PermAdmissibility-PT-50-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779806570863

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-50
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 14:42:51] [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 14:42:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 14:42:52] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2026-05-26 14:42:52] [INFO ] Transformed 168 places.
[2026-05-26 14:42:52] [INFO ] Transformed 592 transitions.
[2026-05-26 14:42:52] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Support contains 103 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-6677170521397623952.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17741524533656072071.kers'
[2026-05-26 14:42:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6677170521397623952.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17741524533656072071.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 14:42:52] [INFO ] Computed 16 invariants in 3 ms
Computed 16 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17741524533656072071.kers
Total runtime 4 ms.
[2026-05-26 14:42:52] [INFO ] Implicit Places using invariants in 171 ms returned []
[2026-05-26 14:42:52] [INFO ] Invariant cache hit.
[2026-05-26 14:42:52] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 588 sub problems to find dead transitions.
[2026-05-26 14:42:52] [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
At refinement iteration 6 (OVERLAPS) 0/696 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 588 unsolved
No progress, stopping.
After SMT solving in domain Real declared 696/696 variables, and 120 constraints, problems are : Problem set: 0 solved, 588 unsolved in 14958 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 30027 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 45739ms problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 45756ms
Starting structural reductions in LTL mode, iteration 1 : 104/168 places, 592/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46230 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 14:43:38] [INFO ] Invariant cache hit.
[2026-05-26 14:43:38] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-26 14:43:38] [INFO ] Invariant cache hit.
[2026-05-26 14:43:38] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 194 ms. Remains : 104/104 places, 592/592 transitions.
Support contains 103 out of 104 places after structural reductions.
[2026-05-26 14:43:39] [INFO ] Flatten gal took : 99 ms
[2026-05-26 14:43:39] [INFO ] Flatten gal took : 69 ms
[2026-05-26 14:43:39] [INFO ] Input system was already deterministic with 592 transitions.
Reduction of identical properties reduced properties to check from 37 to 33
RANDOM walk for 40074 steps (48 resets) in 281 ms. (142 steps per ms) remains 2/33 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 1/2 properties
BEST_FIRST walk for 2693 steps (0 resets) in 8 ms. (299 steps per ms) remains 0/1 properties
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' '!((X(F(p0)) U (p1&&X(X(X(X(F(!p2))))))))'
Support contains 39 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-2758481596702846386.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6224917139325018397.kers'
[2026-05-26 14:43:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2758481596702846386.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6224917139325018397.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 14:43:40] [INFO ] Computed 16 invariants in 2 ms
Computed 16 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6224917139325018397.kers
Total runtime 2 ms.
[2026-05-26 14:43:40] [INFO ] Implicit Places using invariants in 69 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 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 5 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' '!((X(F(p0)) U (X(X(X(X(F(!p1)))))&&p2)))'
Stuttering acceptance computed with spot in 344 ms :[(OR (NOT p2) p1), (NOT p0), p1, p1, p1, p1]
Running random walk in product with property : PermAdmissibility-PT-50-LTLFireability-00
Product exploration explored 100000 steps with 21381 reset in 568 ms.
Product exploration explored 100000 steps with 21310 reset in 501 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 7 factoid took 114 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 1840 steps (0 resets) in 14 ms. (122 steps per ms) remains 0/2 properties
Knowledge based reduction with 7 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p2), (NOT p0)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10080314466931266909.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16643535366514673860.kers'
[2026-05-26 14:43:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10080314466931266909.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16643535366514673860.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 468 rows 90 cols 2300 entries
Finished phase 1 with 53 SingleSign rule and 22 generalized
[2026-05-26 14:43:42] [INFO ] Computed 15 invariants in 1 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16643535366514673860.kers
Total runtime 3 ms.
[2026-05-26 14:43:42] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 11 ms returned sat
[2026-05-26 14:43:42] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2026-05-26 14:43:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 14:43:43] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 14:43:43] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2026-05-26 14:43:43] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 436 transitions) in 57 ms.
[2026-05-26 14:43:43] [INFO ] Added : 23 causal constraints over 6 iterations in 271 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 1898 ms.
Stuttering acceptance computed with spot in 80 ms :[(NOT p2), (NOT p0)]
Support contains 22 out of 90 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Applied a total of 0 rules in 30 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2026-05-26 14:43:43] [INFO ] Invariant cache hit.
[2026-05-26 14:43:43] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-26 14:43:43] [INFO ] Invariant cache hit.
[2026-05-26 14:43:44] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2026-05-26 14:43:44] [INFO ] Redundant transitions in 26 ms returned []
Running 464 sub problems to find dead transitions.
[2026-05-26 14:43:44] [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 9795 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 30027 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 40128ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 40131ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40477 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 6 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 1840 steps (0 resets) in 9 ms. (184 steps per ms) remains 0/2 properties
Knowledge based reduction with 6 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p2), (NOT p0)]
[2026-05-26 14:44:24] [INFO ] Invariant cache hit.
[2026-05-26 14:44:25] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 12 ms returned sat
[2026-05-26 14:44:25] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2026-05-26 14:44:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 14:44:25] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 9 ms returned sat
[2026-05-26 14:44:25] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2026-05-26 14:44:25] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 436 transitions) in 48 ms.
[2026-05-26 14:44:26] [INFO ] Added : 23 causal constraints over 6 iterations in 257 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 1893 ms.
Stuttering acceptance computed with spot in 81 ms :[(NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p2), (NOT p0)]
Product exploration explored 100000 steps with 21505 reset in 356 ms.
Product exploration explored 100000 steps with 21496 reset in 365 ms.
Built C files in :
/tmp/ltsmin18001196589161624042
[2026-05-26 14:44:27] [INFO ] Computing symmetric may disable matrix : 468 transitions.
[2026-05-26 14:44:27] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 14:44:27] [INFO ] Computing symmetric may enable matrix : 468 transitions.
[2026-05-26 14:44:27] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 14:44:27] [INFO ] Computing Do-Not-Accords matrix : 468 transitions.
[2026-05-26 14:44:27] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 14:44:27] [INFO ] Built C files in 133ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18001196589161624042
Running compilation step : cd /tmp/ltsmin18001196589161624042;'/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 1296 ms.
Running link step : cd /tmp/ltsmin18001196589161624042;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin18001196589161624042;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7078387240021642177.hoa' '--buchi-type=spotba'
LTSmin run took 972 ms.
FORMULA PermAdmissibility-PT-50-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-50-LTLFireability-00 finished in 49345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U !p1)))'
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 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 17 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-17420780064139937678.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15639599786348010039.kers'
[2026-05-26 14:44:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17420780064139937678.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15639599786348010039.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 14:44:29] [INFO ] Computed 16 invariants in 5 ms
Computed 16 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-15639599786348010039.kers
Total runtime 7 ms.
[2026-05-26 14:44:29] [INFO ] Implicit Places using invariants in 90 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 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 5 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 113 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' '!(X((F(G(p0)) U !p1)))'
Stuttering acceptance computed with spot in 139 ms :[p1, p1, (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-50-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 295 ms.
Product exploration explored 100000 steps with 50000 reset in 307 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 18 ms. Proved property starting from automaton with 3 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 92 ms.
FORMULA PermAdmissibility-PT-50-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-50-LTLFireability-01 finished in 981 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0&&F(G(!p0))) U X(p1)))'
Support contains 14 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 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 53 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 53 transition count 100
Applied a total of 102 rules in 16 ms. Remains 53 /104 variables (removed 51) and now considering 100/592 (removed 492) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1894967078114649506.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14488453360274667521.kers'
[2026-05-26 14:44:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1894967078114649506.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14488453360274667521.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 100 rows 53 cols 531 entries
Finished phase 1 with 13 SingleSign rule and 24 generalized
[2026-05-26 14:44:30] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14488453360274667521.kers
Total runtime 1 ms.
[2026-05-26 14:44:30] [INFO ] Implicit Places using invariants in 46 ms returned [0, 5, 18, 25]
[2026-05-26 14:44:30] [INFO ] Actually due to overlaps returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 47 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/104 places, 100/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 50/104 places, 100/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' '!(((!p0&&F(G(!p0))) U X(p1)))'
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : PermAdmissibility-PT-50-LTLFireability-02
Product exploration explored 100000 steps with 191 reset in 661 ms.
Product exploration explored 100000 steps with 177 reset in 603 ms.
Computed a total of 50 stabilizing places and 100 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 50 transition count 100
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 9 factoid took 99 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 616 steps (0 resets) in 6 ms. (88 steps per ms) remains 0/4 properties
Knowledge based reduction with 9 factoid took 162 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-617112942514964642.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6445013809604287205.kers'
[2026-05-26 14:44:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-617112942514964642.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6445013809604287205.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 100 rows 50 cols 507 entries
Finished phase 1 with 24 SingleSign rule and 13 generalized
[2026-05-26 14:44:32] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6445013809604287205.kers
Total runtime 1 ms.
[2026-05-26 14:44:32] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 4 ms returned sat
[2026-05-26 14:44:32] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2026-05-26 14:44:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 14:44:32] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 5 ms returned sat
[2026-05-26 14:44:32] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2026-05-26 14:44:32] [INFO ] Computed and/alt/rep : 33/212/33 causal constraints (skipped 63 transitions) in 8 ms.
[2026-05-26 14:44:32] [INFO ] Added : 27 causal constraints over 9 iterations in 99 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 725 ms.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Support contains 14 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2026-05-26 14:44:32] [INFO ] Invariant cache hit.
[2026-05-26 14:44:33] [INFO ] Implicit Places using invariants in 35 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/50 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40 ms. Remains : 49/50 places, 100/100 transitions.
Computed a total of 49 stabilizing places and 100 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49 transition count 100
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 9 factoid took 101 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 616 steps (0 resets) in 6 ms. (88 steps per ms) remains 0/4 properties
Knowledge based reduction with 9 factoid took 154 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14203361716860723422.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1273199102858816215.kers'
[2026-05-26 14:44:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14203361716860723422.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1273199102858816215.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 100 rows 49 cols 489 entries
Finished phase 1 with 26 SingleSign rule and 11 generalized
[2026-05-26 14:44:33] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1273199102858816215.kers
Total runtime 0 ms.
[2026-05-26 14:44:33] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 4 ms returned sat
[2026-05-26 14:44:33] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2026-05-26 14:44:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 14:44:33] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 4 ms returned sat
[2026-05-26 14:44:33] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2026-05-26 14:44:33] [INFO ] Computed and/alt/rep : 35/222/35 causal constraints (skipped 61 transitions) in 6 ms.
[2026-05-26 14:44:33] [INFO ] Added : 25 causal constraints over 7 iterations in 90 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge-based reduction took 700 ms.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 24978 reset in 254 ms.
Product exploration explored 100000 steps with 25029 reset in 260 ms.
Spot run failed in 79 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/ltsmin6051744612034511854
[2026-05-26 14:44:34] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6051744612034511854
Running compilation step : cd /tmp/ltsmin6051744612034511854;'/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 213 ms.
Running link step : cd /tmp/ltsmin6051744612034511854;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6051744612034511854;'/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/stateBased6042755499707218503.hoa' '--buchi-type=spotba'
LTSmin run took 1216 ms.
FORMULA PermAdmissibility-PT-50-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-50-LTLFireability-02 finished in 5477 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 U (p1&&(!p2 U p0))))))'
Support contains 31 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 50 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.5 ms
Discarding 54 places :
Also discarding 384 output transitions
Drop transitions (Output transitions of discarded places.) removed 384 transitions
Applied a total of 1 rules in 23 ms. Remains 50 /104 variables (removed 54) and now considering 208/592 (removed 384) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5278196207108562393.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8254664781980703846.kers'
[2026-05-26 14:44:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5278196207108562393.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8254664781980703846.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 208 rows 50 cols 864 entries
Finished phase 1 with 31 SingleSign rule and 9 generalized
[2026-05-26 14:44:36] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8254664781980703846.kers
Total runtime 1 ms.
[2026-05-26 14:44:36] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-26 14:44:36] [INFO ] Invariant cache hit.
[2026-05-26 14:44:36] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2026-05-26 14:44:36] [INFO ] Redundant transitions in 3 ms returned []
Running 204 sub problems to find dead transitions.
[2026-05-26 14:44:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 208/258 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 0/258 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 60 constraints, problems are : Problem set: 0 solved, 204 unsolved in 2868 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 208/258 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 204/264 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 258/258 variables, and 264 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32950ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 32951ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/104 places, 208/592 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33094 ms. Remains : 50/104 places, 208/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 U ((!p1 U p0)&&p2)))))'
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-50-LTLFireability-03
Product exploration explored 100000 steps with 4044 reset in 1202 ms.
Product exploration explored 100000 steps with 4004 reset in 1189 ms.
Computed a total of 50 stabilizing places and 208 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 50 transition count 208
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 false by K+ with min(phi)
Knowledge based reduction with 17 factoid took 38 ms. Proved property starting from automaton with 3 states, 9 edges and 3 AP (stutter insensitive
Knowledge-based reduction took 90 ms.
FORMULA PermAdmissibility-PT-50-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-50-LTLFireability-03 finished in 35746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U p1)&&X(G(p2))))'
Support contains 31 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 8 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-9446129095518690369.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3226778567369403867.kers'
[2026-05-26 14:45:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9446129095518690369.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3226778567369403867.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 14:45:11] [INFO ] Computed 16 invariants in 5 ms
Computed 16 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-3226778567369403867.kers
Total runtime 6 ms.
[2026-05-26 14:45:11] [INFO ] Implicit Places using invariants in 90 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 92 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 102 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' '!(((!p0 U p1)&&X(G(p2))))'
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), true, (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-PT-50-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-50-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-50-LTLFireability-04 finished in 270 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!((!p0 U !(F(p2)||p1)) U (X(p0)||G(p2))))'
Support contains 39 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 7 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-1974576619348770504.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2851595674346779554.kers'
[2026-05-26 14:45:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1974576619348770504.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2851595674346779554.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 14:45:12] [INFO ] Computed 16 invariants in 4 ms
Computed 16 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2851595674346779554.kers
Total runtime 5 ms.
[2026-05-26 14:45:12] [INFO ] Implicit Places using invariants in 71 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 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 1 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 80 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' '!(!((!p0 U !(F(p2)||p1)) U (X(p0)||G(p2))))'
Stuttering acceptance computed with spot in 391 ms :[(OR p2 p0), p0, p2, (AND p0 (NOT p2)), (AND (NOT p2) (NOT p1) p0), true, (AND (NOT p2) p0), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0), (NOT p2)]
Running random walk in product with property : PermAdmissibility-PT-50-LTLFireability-05
Product exploration explored 100000 steps with 28786 reset in 782 ms.
Product exploration explored 100000 steps with 28635 reset in 794 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 14 factoid took 192 ms. Reduced automaton from 10 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
RANDOM walk for 2860 steps (0 resets) in 9 ms. (286 steps per ms) remains 0/8 properties
Knowledge based reduction with 14 factoid took 272 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 318 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0), (NOT p2)]
Knowledge-based reduction took 875 ms.
Stuttering acceptance computed with spot in 277 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0), (NOT p2)]
Support contains 39 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (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-3530076814143754820.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2445369741346327459.kers'
[2026-05-26 14:45:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3530076814143754820.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2445369741346327459.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 468 rows 90 cols 2300 entries
Finished phase 1 with 53 SingleSign rule and 22 generalized
[2026-05-26 14:45:15] [INFO ] Computed 15 invariants in 5 ms
Computed 15 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-2445369741346327459.kers
Total runtime 6 ms.
[2026-05-26 14:45:15] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-26 14:45:15] [INFO ] Invariant cache hit.
[2026-05-26 14:45:15] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2026-05-26 14:45:15] [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 10000 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 30014 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 40274ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 40276ms
Finished structural reductions in LTL mode , in 1 iterations and 40544 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 14 factoid took 178 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
RANDOM walk for 2860 steps (0 resets) in 16 ms. (168 steps per ms) remains 0/8 properties
Knowledge based reduction with 14 factoid took 275 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0), (NOT p2)]
Knowledge-based reduction took 864 ms.
Stuttering acceptance computed with spot in 292 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0), (NOT p2)]
Stuttering acceptance computed with spot in 296 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND (NOT p2) p0), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2) p0), (NOT p2)]
Product exploration explored 100000 steps with 23696 reset in 690 ms.
Product exploration explored 100000 steps with 23828 reset in 693 ms.
Spot run failed in 48 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/ltsmin11553201373616008016
[2026-05-26 14:45:58] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11553201373616008016
Running compilation step : cd /tmp/ltsmin11553201373616008016;'/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 830 ms.
Running link step : cd /tmp/ltsmin11553201373616008016;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11553201373616008016;'/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/stateBased16119252589400142635.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 39 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2026-05-26 14:46:13] [INFO ] Invariant cache hit.
[2026-05-26 14:46:13] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-26 14:46:13] [INFO ] Invariant cache hit.
[2026-05-26 14:46:14] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 266 ms. Remains : 90/90 places, 468/468 transitions.
Built C files in :
/tmp/ltsmin12997067486572461231
[2026-05-26 14:46:14] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12997067486572461231
Running compilation step : cd /tmp/ltsmin12997067486572461231;'/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 811 ms.
Running link step : cd /tmp/ltsmin12997067486572461231;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12997067486572461231;'/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/stateBased18282755559607438683.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 14:46:29] [INFO ] Flatten gal took : 26 ms
[2026-05-26 14:46:29] [INFO ] Flatten gal took : 25 ms
[2026-05-26 14:46:29] [INFO ] Time to serialize gal into /tmp/LTL15075302481933494778.gal : 7 ms
[2026-05-26 14:46:29] [INFO ] Time to serialize properties into /tmp/LTL6131697748639644860.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/LTL15075302481933494778.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13425886634942081455.hoa' '-atoms' '/tmp/LTL6131697748639644860.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL6131697748639644860.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13425886634942081455.hoa
Detected timeout of ITS tools.
[2026-05-26 14:46:44] [INFO ] Flatten gal took : 22 ms
[2026-05-26 14:46:44] [INFO ] Flatten gal took : 22 ms
[2026-05-26 14:46:44] [INFO ] Time to serialize gal into /tmp/LTL3672492086622939842.gal : 5 ms
[2026-05-26 14:46:44] [INFO ] Time to serialize properties into /tmp/LTL893354273957673218.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3672492086622939842.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL893354273957673218.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...274
Read 1 LTL properties
Checking formula 0 : !((!(((!("(((((((((c13>=1)&&(aux11_3>=1))&&(aux9_4>=1))||(((c13>=1)&&(aux11_6>=1))&&(aux9_7>=1)))||((((c13>=1)&&(aux11_2>=1))&&(aux9_2...11356
Formula 0 simplified : (!"(((((((((c13>=1)&&(aux11_3>=1))&&(aux9_4>=1))||(((c13>=1)&&(aux11_6>=1))&&(aux9_7>=1)))||((((c13>=1)&&(aux11_2>=1))&&(aux9_2>=1))...11333
Detected timeout of ITS tools.
[2026-05-26 14:46:59] [INFO ] Flatten gal took : 19 ms
[2026-05-26 14:46:59] [INFO ] Applying decomposition
[2026-05-26 14:46:59] [INFO ] Flatten gal took : 20 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/graph10554760805414825006.txt' '-o' '/tmp/graph10554760805414825006.bin' '-w' '/tmp/graph10554760805414825006.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10554760805414825006.bin' '-l' '-1' '-v' '-w' '/tmp/graph10554760805414825006.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:46:59] [INFO ] Decomposing Gal with order
[2026-05-26 14:46:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:46:59] [INFO ] Removed a total of 504 redundant transitions.
[2026-05-26 14:46:59] [INFO ] Flatten gal took : 118 ms
[2026-05-26 14:46:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 8 ms.
[2026-05-26 14:46:59] [INFO ] Time to serialize gal into /tmp/LTL16941110939241991952.gal : 6 ms
[2026-05-26 14:46:59] [INFO ] Time to serialize properties into /tmp/LTL6914112197836909847.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16941110939241991952.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6914112197836909847.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 : !((!(((!("(((((((((u3.c13>=1)&&(u3.aux11_3>=1))&&(u3.aux9_4>=1))||(((u3.c13>=1)&&(u3.aux11_6>=1))&&(u3.aux9_7>=1)))||((((u3.c13>=1)&&(...13732
Formula 0 simplified : (!"(((((((((u3.c13>=1)&&(u3.aux11_3>=1))&&(u3.aux9_4>=1))||(((u3.c13>=1)&&(u3.aux11_6>=1))&&(u3.aux9_7>=1)))||((((u3.c13>=1)&&(u3.au...13709
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-PT-50-LTLFireability-05 finished in 122692 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(X(p0)) U p1) U (G((G(p0)||G(p3)))||p2)))'
Support contains 32 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 12 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-10893200403296259795.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13463029464368925461.kers'
[2026-05-26 14:47:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10893200403296259795.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13463029464368925461.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 14:47:14] [INFO ] Computed 16 invariants in 2 ms
Computed 16 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13463029464368925461.kers
Total runtime 3 ms.
[2026-05-26 14:47:14] [INFO ] Implicit Places using invariants in 58 ms returned [0, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 58 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 0 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 71 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' '!(!((G(X(p0)) U p1) U (G((G(p0)||G(p3)))||p2)))'
Stuttering acceptance computed with spot in 186 ms :[(OR p0 p2 p3), true, p0, p3, (AND p0 p1)]
Running random walk in product with property : PermAdmissibility-PT-50-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 444 ms.
Product exploration explored 100000 steps with 50000 reset in 449 ms.
Computed a total of 66 stabilizing places and 234 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 234
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 25 factoid took 68 ms. Proved property starting from automaton with 5 states, 10 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 130 ms.
FORMULA PermAdmissibility-PT-50-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-50-LTLFireability-06 finished in 1314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(G(p0))))||(p1&&F(p2)))))'
Support contains 35 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 7 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-14942169641992766198.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16651593910392871073.kers'
[2026-05-26 14:47:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14942169641992766198.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16651593910392871073.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 14:47:16] [INFO ] Computed 16 invariants in 6 ms
Computed 16 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-16651593910392871073.kers
Total runtime 7 ms.
[2026-05-26 14:47:16] [INFO ] Implicit Places using invariants in 75 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 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 1 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 86 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' '!(X((X(X(X(G(p0))))||(F(p1)&&p2))))'
Stuttering acceptance computed with spot in 372 ms :[true, (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-50-LTLFireability-07
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-50-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-50-LTLFireability-07 finished in 487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 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 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 68 place count 60 transition count 136
Iterating global reduction 0 with 20 rules applied. Total rules applied 88 place count 60 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 90 place count 58 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 92 place count 58 transition count 120
Applied a total of 92 rules in 7 ms. Remains 58 /104 variables (removed 46) 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-13203839165396965606.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1536856935003504391.kers'
[2026-05-26 14:47:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13203839165396965606.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1536856935003504391.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 120 rows 58 cols 638 entries
Finished phase 1 with 18 SingleSign rule and 24 generalized
[2026-05-26 14:47:16] [INFO ] Computed 16 invariants in 2 ms
Computed 16 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1536856935003504391.kers
Total runtime 3 ms.
[2026-05-26 14:47:16] [INFO ] Implicit Places using invariants in 61 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/104 places, 120/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 57 /57 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70 ms. Remains : 57/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)))'
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-50-LTLFireability-08
Entered a terminal (fully accepting) state of product in 110 steps with 0 reset in 2 ms.
FORMULA PermAdmissibility-PT-50-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-50-LTLFireability-08 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(p2)&&p1)||(G(p4)&&p3))))'
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 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 65 place count 63 transition count 154
Iterating global reduction 0 with 17 rules applied. Total rules applied 82 place count 63 transition count 154
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 62 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 62 transition count 146
Applied a total of 84 rules in 6 ms. Remains 62 /104 variables (removed 42) 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-13793108572886188831.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-428864013684534511.kers'
[2026-05-26 14:47:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13793108572886188831.kers, --Pflows, --basisKERS=/tmp/petrispot-output-428864013684534511.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 146 rows 62 cols 784 entries
Finished phase 1 with 20 SingleSign rule and 26 generalized
[2026-05-26 14:47:16] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-428864013684534511.kers
Total runtime 2 ms.
[2026-05-26 14:47:16] [INFO ] Implicit Places using invariants in 55 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/104 places, 146/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 61/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((p0||(G(p2)&&p1)||(G(p4)&&p3))))'
Stuttering acceptance computed with spot in 203 ms :[true, (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p4), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p2), (AND (NOT p4) (NOT p2))]
Running random walk in product with property : PermAdmissibility-PT-50-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-50-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-50-LTLFireability-09 finished in 292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(G((p1||G(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 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 82 transition count 364
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 82 transition count 364
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 61 place count 65 transition count 164
Iterating global reduction 0 with 17 rules applied. Total rules applied 78 place count 65 transition count 164
Applied a total of 78 rules in 6 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-16686939203615104865.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17411633002240699980.kers'
[2026-05-26 14:47:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16686939203615104865.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17411633002240699980.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 164 rows 65 cols 876 entries
Finished phase 1 with 24 SingleSign rule and 25 generalized
[2026-05-26 14:47:17] [INFO ] Computed 16 invariants in 2 ms
Computed 16 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17411633002240699980.kers
Total runtime 3 ms.
[2026-05-26 14:47:17] [INFO ] Implicit Places using invariants in 55 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/104 places, 164/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 164/164 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63 ms. Remains : 64/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(X(G((p0||G(p1)))))||p2)))'
Stuttering acceptance computed with spot in 189 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-50-LTLFireability-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-50-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-50-LTLFireability-10 finished in 276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 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 7 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-666072141352417667.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2887435032714697994.kers'
[2026-05-26 14:47:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-666072141352417667.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2887435032714697994.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 14:47:17] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2887435032714697994.kers
Total runtime 0 ms.
[2026-05-26 14:47:17] [INFO ] Implicit Places using invariants in 47 ms returned [0, 5, 18, 25]
[2026-05-26 14:47:17] [INFO ] Actually due to overlaps returned [0, 5, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 49 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 0 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 56 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' '!(X(F(p0)))'
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-50-LTLFireability-11
Product exploration explored 100000 steps with 15137 reset in 139 ms.
Product exploration explored 100000 steps with 15204 reset in 150 ms.
Computed a total of 48 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 84
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 53 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 411 steps (0 resets) in 14 ms. (27 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 66 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1869344447745651146.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13587136035451805697.kers'
[2026-05-26 14:47:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1869344447745651146.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13587136035451805697.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 84 rows 48 cols 422 entries
Finished phase 1 with 21 SingleSign rule and 14 generalized
[2026-05-26 14:47:18] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13587136035451805697.kers
Total runtime 2 ms.
[2026-05-26 14:47:18] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 5 ms returned sat
[2026-05-26 14:47:18] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2026-05-26 14:47:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 14:47:18] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 4 ms returned sat
[2026-05-26 14:47:18] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2026-05-26 14:47:18] [INFO ] Computed and/alt/rep : 18/93/18 causal constraints (skipped 62 transitions) in 5 ms.
[2026-05-26 14:47:18] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 423 ms.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 84/84 transitions.
Graph (complete) has 207 edges and 48 vertex of which 12 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Discarding 36 places :
Also discarding 68 output transitions
Drop transitions (Output transitions of discarded places.) removed 68 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 10 ms. Remains 9 /48 variables (removed 39) and now considering 10/84 (removed 74) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16015402178577459546.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9557683382115689535.kers'
[2026-05-26 14:47:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16015402178577459546.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9557683382115689535.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 14:47:18] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9557683382115689535.kers
Total runtime 0 ms.
[2026-05-26 14:47:18] [INFO ] Implicit Places using invariants in 25 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/48 places, 10/84 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 5 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-8814253430353710674.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15846094394987436686.kers'
[2026-05-26 14:47:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8814253430353710674.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15846094394987436686.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 14:47:18] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15846094394987436686.kers
Total runtime 1 ms.
[2026-05-26 14:47:18] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-26 14:47:18] [INFO ] Invariant cache hit.
[2026-05-26 14:47:18] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/48 places, 8/84 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 87 ms. Remains : 6/48 places, 8/84 transitions.
Computed a total of 6 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 3 factoid took 66 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 84 ms.
FORMULA PermAdmissibility-PT-50-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-50-LTLFireability-11 finished in 1131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(X(p1)) U 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 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 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 64 place count 62 transition count 144
Iterating global reduction 0 with 20 rules applied. Total rules applied 84 place count 62 transition count 144
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 60 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 60 transition count 128
Applied a total of 88 rules in 11 ms. Remains 60 /104 variables (removed 44) and now considering 128/592 (removed 464) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9741320721635150116.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12002987810140770566.kers'
[2026-05-26 14:47:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9741320721635150116.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12002987810140770566.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 128 rows 60 cols 674 entries
Finished phase 1 with 20 SingleSign rule and 24 generalized
[2026-05-26 14:47:18] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12002987810140770566.kers
Total runtime 1 ms.
[2026-05-26 14:47:18] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-26 14:47:18] [INFO ] Invariant cache hit.
[2026-05-26 14:47:18] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2026-05-26 14:47:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 128/188 variables, 60/76 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 76 constraints, problems are : Problem set: 0 solved, 124 unsolved in 2948 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (OVERLAPS) 128/188 variables, 60/76 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 124/200 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 0/188 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 200 constraints, problems are : Problem set: 0 solved, 124 unsolved in 30009 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32984ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 32985ms
Starting structural reductions in LTL mode, iteration 1 : 60/104 places, 128/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33120 ms. Remains : 60/104 places, 128/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((X(X(p1)) U p2))||p0)))'
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p1), true]
Running random walk in product with property : PermAdmissibility-PT-50-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 89 ms.
Product exploration explored 100000 steps with 50000 reset in 105 ms.
Computed a total of 60 stabilizing places and 128 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 60 transition count 128
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 6 factoid took 46 ms. Proved property starting from automaton with 6 states, 7 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 92 ms.
FORMULA PermAdmissibility-PT-50-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-50-LTLFireability-12 finished in 33657 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((X((G(F(G((X(X(p1)) U p2))))&&p0))||F(p3))))'
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 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 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 74 place count 56 transition count 114
Iterating global reduction 0 with 22 rules applied. Total rules applied 96 place count 56 transition count 114
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 98 place count 54 transition count 98
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 54 transition count 98
Applied a total of 100 rules in 9 ms. Remains 54 /104 variables (removed 50) and now considering 98/592 (removed 494) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14121375247606445332.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10103917586580922667.kers'
[2026-05-26 14:47:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14121375247606445332.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10103917586580922667.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 54 cols 527 entries
Finished phase 1 with 16 SingleSign rule and 22 generalized
[2026-05-26 14:47:52] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10103917586580922667.kers
Total runtime 0 ms.
[2026-05-26 14:47:52] [INFO ] Implicit Places using invariants in 47 ms returned [0, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/104 places, 98/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 52 /52 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 52/104 places, 98/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((X((G(F(G((X(X(p1)) U p2))))&&p0))||F(p3))))'
Stuttering acceptance computed with spot in 200 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-50-LTLFireability-13
Product exploration explored 100000 steps with 15055 reset in 188 ms.
Product exploration explored 100000 steps with 15097 reset in 207 ms.
Computed a total of 52 stabilizing places and 98 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 52 transition count 98
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 18 factoid took 72 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 11 states, 33 edges and 4 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 16 to 14
RANDOM walk for 40053 steps (48 resets) in 82 ms. (482 steps per ms) remains 5/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3450284865523984629.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7943810734303301175.kers'
[2026-05-26 14:47:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3450284865523984629.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7943810734303301175.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 52 cols 511 entries
Finished phase 1 with 18 SingleSign rule and 20 generalized
[2026-05-26 14:47:53] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7943810734303301175.kers
Total runtime 1 ms.
Problem apf4 is UNSAT
Problem apf6 is UNSAT
Problem apf7 is UNSAT
After SMT solving in domain Real declared 9/150 variables, and 0 constraints, problems are : Problem set: 3 solved, 0 unsolved in 16 ms.
Refiners :[Generalized P Invariants (flows): 0/14 constraints, State Equation: 0/52 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge based reduction with 21 factoid took 270 ms. Reduced automaton from 11 states, 33 edges and 4 AP (stutter insensitive) to 17 states, 52 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 803 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), false, false, false, false, (AND p0 (NOT p3) (NOT p1) (NOT p2)), false, false, false, (AND p0 (NOT p3) p1 (NOT p2)), false, false, false]
[2026-05-26 14:47:54] [INFO ] Invariant cache hit.
[2026-05-26 14:47:54] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 5 ms returned sat
[2026-05-26 14:47:54] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2026-05-26 14:47:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 14:47:54] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 4 ms returned sat
[2026-05-26 14:47:54] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2026-05-26 14:47:54] [INFO ] Computed and/alt/rep : 24/142/24 causal constraints (skipped 70 transitions) in 7 ms.
[2026-05-26 14:47:54] [INFO ] Added : 15 causal constraints over 4 iterations in 61 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p3))
[2026-05-26 14:47:54] [INFO ] Invariant cache hit.
[2026-05-26 14:47:54] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 5 ms returned sat
[2026-05-26 14:47:54] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2026-05-26 14:47:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 14:47:54] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 4 ms returned sat
[2026-05-26 14:47:54] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2026-05-26 14:47:54] [INFO ] Computed and/alt/rep : 24/142/24 causal constraints (skipped 70 transitions) in 5 ms.
[2026-05-26 14:47:54] [INFO ] Added : 15 causal constraints over 4 iterations in 61 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Knowledge-based reduction took 1866 ms.
Stuttering acceptance computed with spot in 816 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), false, false, false, false, (AND p0 (NOT p3) (NOT p1) (NOT p2)), false, false, false, (AND p0 (NOT p3) p1 (NOT p2)), false, false, false]
Support contains 9 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 98/98 transitions.
Graph (complete) has 242 edges and 52 vertex of which 44 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 40 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 40 transition count 74
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 36 transition count 52
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 36 transition count 52
Applied a total of 17 rules in 6 ms. Remains 36 /52 variables (removed 16) and now considering 52/98 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3003917783237775210.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11091084379689664519.kers'
[2026-05-26 14:47:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3003917783237775210.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11091084379689664519.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 52 rows 36 cols 263 entries
Finished phase 1 with 10 SingleSign rule and 14 generalized
[2026-05-26 14:47:55] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11091084379689664519.kers
Total runtime 1 ms.
[2026-05-26 14:47:55] [INFO ] Implicit Places using invariants in 37 ms returned [10, 19]
[2026-05-26 14:47:55] [INFO ] Actually due to overlaps returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/52 places, 52/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 47 ms. Remains : 35/52 places, 52/98 transitions.
Computed a total of 35 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 35 transition count 52
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 49 factoid took 80 ms. Reduced automaton from 17 states, 52 edges and 4 AP (stutter insensitive) to 17 states, 52 edges and 4 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 22 to 21
RANDOM walk for 40062 steps (64 resets) in 64 ms. (616 steps per ms) remains 10/21 properties
BEST_FIRST walk for 40003 steps (8 resets) in 68 ms. (579 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 6/6 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17528456353211086910.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10308886469789501076.kers'
[2026-05-26 14:47:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17528456353211086910.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10308886469789501076.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 52 rows 35 cols 252 entries
Finished phase 1 with 12 SingleSign rule and 12 generalized
[2026-05-26 14:47:55] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10308886469789501076.kers
Total runtime 1 ms.
Problem apf4 is UNSAT
Problem apf5 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
Problem apf11 is UNSAT
Problem apf13 is UNSAT
After SMT solving in domain Real declared 9/87 variables, and 0 constraints, problems are : Problem set: 6 solved, 0 unsolved in 16 ms.
Refiners :[Generalized P Invariants (flows): 0/11 constraints, State Equation: 0/35 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 6 invariant AP formulas.
Knowledge based reduction with 55 factoid took 269 ms. Reduced automaton from 17 states, 52 edges and 4 AP (stutter insensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
[2026-05-26 14:47:56] [INFO ] Invariant cache hit.
[2026-05-26 14:47:56] [INFO ] [Real]Absence check using 0 positive and 11 generalized place invariants in 3 ms returned sat
[2026-05-26 14:47:56] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-26 14:47:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 14:47:56] [INFO ] [Nat]Absence check using 0 positive and 11 generalized place invariants in 4 ms returned sat
[2026-05-26 14:47:56] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2026-05-26 14:47:56] [INFO ] Computed and/alt/rep : 24/144/24 causal constraints (skipped 24 transitions) in 3 ms.
[2026-05-26 14:47:56] [INFO ] Added : 15 causal constraints over 3 iterations in 28 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Knowledge-based reduction took 977 ms.
Stuttering acceptance computed with spot in 227 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 236 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 15139 reset in 156 ms.
Product exploration explored 100000 steps with 15203 reset in 169 ms.
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/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/ltsmin7909832517348888897
[2026-05-26 14:47:57] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7909832517348888897
Running compilation step : cd /tmp/ltsmin7909832517348888897;'/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 142 ms.
Running link step : cd /tmp/ltsmin7909832517348888897;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7909832517348888897;'/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/stateBased7434837232111113961.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 52/52 transitions.
Applied a total of 0 rules in 0 ms. Remains 35 /35 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2026-05-26 14:48:12] [INFO ] Invariant cache hit.
[2026-05-26 14:48:12] [INFO ] Implicit Places using invariants in 39 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 34/35 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41 ms. Remains : 34/35 places, 52/52 transitions.
Built C files in :
/tmp/ltsmin589809569571553421
[2026-05-26 14:48:12] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin589809569571553421
Running compilation step : cd /tmp/ltsmin589809569571553421;'/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 141 ms.
Running link step : cd /tmp/ltsmin589809569571553421;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin589809569571553421;'/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/stateBased11307916135431652615.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-26 14:48:27] [INFO ] Flatten gal took : 2 ms
[2026-05-26 14:48:27] [INFO ] Flatten gal took : 2 ms
[2026-05-26 14:48:27] [INFO ] Time to serialize gal into /tmp/LTL11231720970044037621.gal : 1 ms
[2026-05-26 14:48:27] [INFO ] Time to serialize properties into /tmp/LTL9965197168534523223.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11231720970044037621.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3728349387625919849.hoa' '-atoms' '/tmp/LTL9965197168534523223.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9965197168534523223.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3728349387625919849.hoa
Detected timeout of ITS tools.
[2026-05-26 14:48:42] [INFO ] Flatten gal took : 2 ms
[2026-05-26 14:48:42] [INFO ] Flatten gal took : 2 ms
[2026-05-26 14:48:42] [INFO ] Time to serialize gal into /tmp/LTL13468913298961259052.gal : 1 ms
[2026-05-26 14:48:42] [INFO ] Time to serialize properties into /tmp/LTL9242047525853508843.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/LTL13468913298961259052.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9242047525853508843.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...276
Read 1 LTL properties
Checking formula 0 : !((F((X(((G(F(G((X(X("(((aux8_7>=1)&&(aux6_5>=1))&&(c11>=1))")))U("(((aux12_2>=1)&&(aux10_1>=1))&&(c16>=1))")))))&&("(aux12_2>=1)"))&&...232
Formula 0 simplified : G(!"(((in4_7>=1)&&(in2_2>=1))&&(c8>=1))" & X(!"((aux10_1>=1)&&(c16>=1))" | !"(aux12_2>=1)" | GF(!"(((aux12_2>=1)&&(aux10_1>=1))&&(c1...259
Detected timeout of ITS tools.
[2026-05-26 14:48:57] [INFO ] Flatten gal took : 2 ms
[2026-05-26 14:48:57] [INFO ] Applying decomposition
[2026-05-26 14:48:57] [INFO ] Flatten gal took : 2 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/graph9776443986579650589.txt' '-o' '/tmp/graph9776443986579650589.bin' '-w' '/tmp/graph9776443986579650589.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9776443986579650589.bin' '-l' '-1' '-v' '-w' '/tmp/graph9776443986579650589.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:48:57] [INFO ] Decomposing Gal with order
[2026-05-26 14:48:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:48:57] [INFO ] Removed a total of 31 redundant transitions.
[2026-05-26 14:48:57] [INFO ] Flatten gal took : 5 ms
[2026-05-26 14:48:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 1 ms.
[2026-05-26 14:48:57] [INFO ] Time to serialize gal into /tmp/LTL794022126782533581.gal : 1 ms
[2026-05-26 14:48:57] [INFO ] Time to serialize properties into /tmp/LTL3087808260962616149.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/LTL794022126782533581.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3087808260962616149.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...253
Read 1 LTL properties
Checking formula 0 : !((F((X(((G(F(G((X(X("(((u0.aux8_7>=1)&&(u0.aux6_5>=1))&&(u0.c11>=1))")))U("(((u2.aux12_2>=1)&&(u2.aux10_1>=1))&&(u2.c16>=1))")))))&&(...268
Formula 0 simplified : G(!"(((u1.in4_7>=1)&&(u1.in2_2>=1))&&(u1.c8>=1))" & X(!"((u2.aux10_1>=1)&&(u2.c16>=1))" | !"(u2.aux12_2>=1)" | GF(!"(((u2.aux12_2>=1...304
Detected timeout of ITS tools.
Treatment of property PermAdmissibility-PT-50-LTLFireability-13 finished in 80543 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(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 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 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 67 place count 61 transition count 140
Iterating global reduction 0 with 19 rules applied. Total rules applied 86 place count 61 transition count 140
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 59 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 59 transition count 124
Applied a total of 90 rules in 11 ms. Remains 59 /104 variables (removed 45) and now considering 124/592 (removed 468) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3279575475798681681.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7241057156353099684.kers'
[2026-05-26 14:49:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3279575475798681681.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7241057156353099684.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 124 rows 59 cols 664 entries
Finished phase 1 with 21 SingleSign rule and 22 generalized
[2026-05-26 14:49:12] [INFO ] Computed 16 invariants in 2 ms
Computed 16 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7241057156353099684.kers
Total runtime 4 ms.
[2026-05-26 14:49:12] [INFO ] Implicit Places using invariants in 57 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/104 places, 124/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 58 /58 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 58/104 places, 124/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((X(p0)&&p1))))'
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-50-LTLFireability-14
Product exploration explored 100000 steps with 33378 reset in 132 ms.
Product exploration explored 100000 steps with 33426 reset in 148 ms.
Computed a total of 58 stabilizing places and 124 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 58 transition count 124
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 11 factoid took 19 ms. Proved property starting from automaton with 3 states, 7 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 62 ms.
FORMULA PermAdmissibility-PT-50-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-50-LTLFireability-14 finished in 554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0 U p1)&&G(p2)))))'
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 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 68 place count 60 transition count 136
Iterating global reduction 0 with 20 rules applied. Total rules applied 88 place count 60 transition count 136
Applied a total of 88 rules in 9 ms. Remains 60 /104 variables (removed 44) and now considering 136/592 (removed 456) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9716048924982927369.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6217479535331454231.kers'
[2026-05-26 14:49:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9716048924982927369.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6217479535331454231.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 136 rows 60 cols 728 entries
Finished phase 1 with 18 SingleSign rule and 26 generalized
[2026-05-26 14:49:13] [INFO ] Computed 16 invariants in 1 ms
Computed 16 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6217479535331454231.kers
Total runtime 2 ms.
[2026-05-26 14:49:13] [INFO ] Implicit Places using invariants in 52 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 59/104 places, 136/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63 ms. Remains : 59/104 places, 136/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(((p0 U p1)&&G(p2)))))'
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : PermAdmissibility-PT-50-LTLFireability-15
Stuttering criterion allowed to conclude after 1498 steps with 4 reset in 16 ms.
FORMULA PermAdmissibility-PT-50-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-50-LTLFireability-15 finished in 275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!((!p0 U !(F(p2)||p1)) U (X(p0)||G(p2))))'
Spot run failed in 42 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.
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((X((G(F(G((X(X(p1)) U p2))))&&p0))||F(p3))))'
Spot run failed in 36 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 14:49:13] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin261005865548991461
[2026-05-26 14:49:13] [INFO ] Applying decomposition
[2026-05-26 14:49:13] [INFO ] Computing symmetric may disable matrix : 592 transitions.
[2026-05-26 14:49:13] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 14:49:13] [INFO ] Computing symmetric may enable matrix : 592 transitions.
[2026-05-26 14:49:13] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 14:49:13] [INFO ] Flatten gal took : 19 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/graph3122534764670766327.txt' '-o' '/tmp/graph3122534764670766327.bin' '-w' '/tmp/graph3122534764670766327.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3122534764670766327.bin' '-l' '-1' '-v' '-w' '/tmp/graph3122534764670766327.weights' '-q' '0' '-e' '0.001'
[2026-05-26 14:49:13] [INFO ] Decomposing Gal with order
[2026-05-26 14:49:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 14:49:13] [INFO ] Computing Do-Not-Accords matrix : 592 transitions.
[2026-05-26 14:49:13] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 14:49:13] [INFO ] Built C files in 115ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin261005865548991461
Running compilation step : cd /tmp/ltsmin261005865548991461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' '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 14:49:13] [INFO ] Removed a total of 598 redundant transitions.
[2026-05-26 14:49:13] [INFO ] Flatten gal took : 97 ms
[2026-05-26 14:49:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 204 labels/synchronizations in 12 ms.
[2026-05-26 14:49:13] [INFO ] Time to serialize gal into /tmp/LTLFireability6498778395515370704.gal : 6 ms
[2026-05-26 14:49:13] [INFO ] Time to serialize properties into /tmp/LTLFireability5967604124840615707.ltl : 2 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/LTLFireability6498778395515370704.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5967604124840615707.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...276
Read 2 LTL properties
Checking formula 0 : !((!(((!("(((((((((u2.c13>=1)&&(u2.aux11_3>=1))&&(u2.aux9_4>=1))||(((u2.c13>=1)&&(u2.aux11_6>=1))&&(u2.aux9_7>=1)))||((((u2.c13>=1)&&(...13732
Formula 0 simplified : (!"(((((((((u2.c13>=1)&&(u2.aux11_3>=1))&&(u2.aux9_4>=1))||(((u2.c13>=1)&&(u2.aux11_6>=1))&&(u2.aux9_7>=1)))||((((u2.c13>=1)&&(u2.au...13709
Compilation finished in 1621 ms.
Running link step : cd /tmp/ltsmin261005865548991461;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin261005865548991461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '!((!(LTLAPp0==true) U !(<>((LTLAPp2==true))||(LTLAPp1==true))) U (X((LTLAPp0==true))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin261005865548991461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '!((!(LTLAPp0==true) U !(<>((LTLAPp2==true))||(LTLAPp1==true))) U (X((LTLAPp0==true))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin261005865548991461;'/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((LTLAPp4==true))) U (LTLAPp5==true)))))&&(LTLAPp3==true)))||<>((LTLAPp6==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-26 15:11:52] [INFO ] Flatten gal took : 176 ms
[2026-05-26 15:11:52] [INFO ] Time to serialize gal into /tmp/LTLFireability4217766385488205054.gal : 33 ms
[2026-05-26 15:11:52] [INFO ] Time to serialize properties into /tmp/LTLFireability6695881889029595194.ltl : 12 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/LTLFireability4217766385488205054.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6695881889029595194.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !((!(((!("(((((((((c13>=1)&&(aux11_3>=1))&&(aux9_4>=1))||(((c13>=1)&&(aux11_6>=1))&&(aux9_7>=1)))||((((c13>=1)&&(aux11_2>=1))&&(aux9_2...11356
Formula 0 simplified : (!"(((((((((c13>=1)&&(aux11_3>=1))&&(aux9_4>=1))||(((c13>=1)&&(aux11_6>=1))&&(aux9_7>=1)))||((((c13>=1)&&(aux11_2>=1))&&(aux9_2>=1))...11333
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin261005865548991461;'/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((LTLAPp4==true))) U (LTLAPp5==true)))))&&(LTLAPp3==true)))||<>((LTLAPp6==true))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin261005865548991461;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '!((!(LTLAPp0==true) U !(<>((LTLAPp2==true))||(LTLAPp1==true))) U (X((LTLAPp0==true))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-26 15:34:13] [INFO ] Flatten gal took : 281 ms
[2026-05-26 15:34:14] [INFO ] Input system was already deterministic with 592 transitions.
[2026-05-26 15:34:14] [INFO ] Transformed 104 places.
[2026-05-26 15:34:14] [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 15:34:14] [INFO ] Time to serialize gal into /tmp/LTLFireability18139514469250888659.gal : 11 ms
[2026-05-26 15:34:14] [INFO ] Time to serialize properties into /tmp/LTLFireability1455327038635164235.ltl : 9 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/LTLFireability18139514469250888659.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1455327038635164235.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((!(((!("(((((((((c13>=1)&&(aux11_3>=1))&&(aux9_4>=1))||(((c13>=1)&&(aux11_6>=1))&&(aux9_7>=1)))||((((c13>=1)&&(aux11_2>=1))&&(aux9_2...11356
Formula 0 simplified : (!"(((((((((c13>=1)&&(aux11_3>=1))&&(aux9_4>=1))||(((c13>=1)&&(aux11_6>=1))&&(aux9_7>=1)))||((((c13>=1)&&(aux11_2>=1))&&(aux9_2>=1))...11333

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-50"
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-50, 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-177969914200644"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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