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.r018-smll-177946788000244.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 BART-PT-010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946788000244
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 710K Mar 5 09:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.6M Mar 5 09:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 463K Mar 5 09:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Mar 5 09:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 281K Mar 15 07:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 752K Mar 15 07:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 352K Mar 15 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 950K Mar 15 07:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5M Mar 5 09:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.4M Mar 5 09:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 821K Mar 5 09:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.7M Mar 5 09:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 47K Mar 15 07:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 93K Mar 15 07:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 2.4M 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 BART-PT-010-LTLFireability-00
FORMULA_NAME BART-PT-010-LTLFireability-01
FORMULA_NAME BART-PT-010-LTLFireability-02
FORMULA_NAME BART-PT-010-LTLFireability-03
FORMULA_NAME BART-PT-010-LTLFireability-04
FORMULA_NAME BART-PT-010-LTLFireability-05
FORMULA_NAME BART-PT-010-LTLFireability-06
FORMULA_NAME BART-PT-010-LTLFireability-07
FORMULA_NAME BART-PT-010-LTLFireability-08
FORMULA_NAME BART-PT-010-LTLFireability-09
FORMULA_NAME BART-PT-010-LTLFireability-10
FORMULA_NAME BART-PT-010-LTLFireability-11
FORMULA_NAME BART-PT-010-LTLFireability-12
FORMULA_NAME BART-PT-010-LTLFireability-13
FORMULA_NAME BART-PT-010-LTLFireability-14
FORMULA_NAME BART-PT-010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779551033447

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 15:43:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 15:43:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 15:43:56] [INFO ] Load time of PNML (sax parser for PT used): 667 ms
[2026-05-23 15:43:56] [INFO ] Transformed 1530 places.
[2026-05-23 15:43:57] [INFO ] Transformed 2020 transitions.
[2026-05-23 15:43:57] [INFO ] Found NUPN structural information;
[2026-05-23 15:43:57] [INFO ] Parsed PT model containing 1530 places and 2020 transitions and 16200 arcs in 923 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 155 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-010-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-010-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1320 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 98 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (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-7961669438565809605.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7991723953494869402.kers'
[2026-05-23 15:43:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7961669438565809605.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7991723953494869402.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2020 rows 1320 cols 4040 entries
Finished phase 1 with 1310 SingleSign rule and 0 generalized
[2026-05-23 15:43:58] [INFO ] Computed 10 invariants in 15 ms
Computed 10 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-7991723953494869402.kers
Total runtime 32 ms.
[2026-05-23 15:44:00] [INFO ] Implicit Places using invariants in 1890 ms returned []
[2026-05-23 15:44:00] [INFO ] Invariant cache hit.
[2026-05-23 15:44:02] [INFO ] Implicit Places using invariants and state equation in 2282 ms returned []
Implicit Place search using SMT with State Equation took 4354 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2026-05-23 15:44:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1310 variables, 1310/1310 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1310/3340 variables, and 1310 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30149 ms.
Refiners :[Domain max(s): 1310/1320 constraints, Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1320 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1310 variables, 1310/1310 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1310/3340 variables, and 1310 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30089 ms.
Refiners :[Domain max(s): 1310/1320 constraints, Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1320 constraints, PredecessorRefiner: 0/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61229ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 61279ms
Finished structural reductions in LTL mode , in 1 iterations and 65881 ms. Remains : 1320/1320 places, 2020/2020 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 17 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
[2026-05-23 15:45:04] [INFO ] Invariant cache hit.
[2026-05-23 15:45:04] [INFO ] Implicit Places using invariants in 636 ms returned []
[2026-05-23 15:45:04] [INFO ] Invariant cache hit.
[2026-05-23 15:45:06] [INFO ] Implicit Places using invariants and state equation in 1756 ms returned []
Implicit Place search using SMT with State Equation took 2400 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2420 ms. Remains : 1320/1320 places, 2020/2020 transitions.
Support contains 1320 out of 1320 places after structural reductions.
[2026-05-23 15:45:07] [INFO ] Flatten gal took : 382 ms
[2026-05-23 15:45:08] [INFO ] Flatten gal took : 191 ms
[2026-05-23 15:45:08] [INFO ] Input system was already deterministic with 2020 transitions.
Reduction of identical properties reduced properties to check from 27 to 23
RANDOM walk for 17955 steps (4 resets) in 948 ms. (18 steps per ms) remains 0/23 properties
FORMULA BART-PT-010-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(((G(p2) U p3)||p1) U X(X(!p4)))))'
Support contains 1310 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 34 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
[2026-05-23 15:45:09] [INFO ] Invariant cache hit.
[2026-05-23 15:45:10] [INFO ] Implicit Places using invariants in 629 ms returned []
[2026-05-23 15:45:10] [INFO ] Invariant cache hit.
[2026-05-23 15:45:12] [INFO ] Implicit Places using invariants and state equation in 1650 ms returned []
Implicit Place search using SMT with State Equation took 2283 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2320 ms. Remains : 1320/1320 places, 2020/2020 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) U p3)||p1) U X(X(!p4)))))'
Stuttering acceptance computed with spot in 1113 ms :[(OR (NOT p0) p4), (NOT p0), p4, (OR (AND (NOT p2) p4) (AND (NOT p3) p4)), p4, true, p4, (AND (NOT p2) p4), (AND (NOT p3) p2 p4), p4, (OR (AND (NOT p2) p4) (AND (NOT p3) p4)), p4, (NOT p2), (NOT p3)]
Running random walk in product with property : BART-PT-010-LTLFireability-01
Entered a terminal (fully accepting) state of product in 4 steps with 1 reset in 8 ms.
FORMULA BART-PT-010-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-01 finished in 3650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 680 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 1320 transition count 1990
Reduce places removed 30 places and 0 transitions.
Performed 270 Post agglomeration using F-continuation condition.Transition count delta: 270
Iterating post reduction 1 with 300 rules applied. Total rules applied 330 place count 1290 transition count 1720
Reduce places removed 270 places and 0 transitions.
Iterating post reduction 2 with 270 rules applied. Total rules applied 600 place count 1020 transition count 1720
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 610 place count 1010 transition count 1710
Iterating global reduction 3 with 10 rules applied. Total rules applied 620 place count 1010 transition count 1710
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 4 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 700 place count 970 transition count 1670
Applied a total of 700 rules in 483 ms. Remains 970 /1320 variables (removed 350) and now considering 1670/2020 (removed 350) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16109134547975926405.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4854611694681357718.kers'
[2026-05-23 15:45:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16109134547975926405.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4854611694681357718.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1670 rows 970 cols 3340 entries
Finished phase 1 with 960 SingleSign rule and 0 generalized
[2026-05-23 15:45:13] [INFO ] Computed 10 invariants in 12 ms
Computed 10 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-4854611694681357718.kers
Total runtime 15 ms.
[2026-05-23 15:45:14] [INFO ] Implicit Places using invariants in 314 ms returned []
[2026-05-23 15:45:14] [INFO ] Invariant cache hit.
[2026-05-23 15:45:15] [INFO ] Implicit Places using invariants and state equation in 1129 ms returned []
Implicit Place search using SMT with State Equation took 1448 ms to find 0 implicit places.
[2026-05-23 15:45:15] [INFO ] Redundant transitions in 177 ms returned []
Running 1310 sub problems to find dead transitions.
[2026-05-23 15:45:15] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 960/2640 variables, and 0 constraints, problems are : Problem set: 0 solved, 1310 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/970 constraints, PredecessorRefiner: 1310/1310 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1310 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 960/2640 variables, and 0 constraints, problems are : Problem set: 0 solved, 1310 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/970 constraints, PredecessorRefiner: 0/1310 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60554ms problems are : Problem set: 0 solved, 1310 unsolved
Search for dead transitions found 0 dead transitions in 60561ms
Starting structural reductions in SI_LTL mode, iteration 1 : 970/1320 places, 1670/2020 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62687 ms. Remains : 970/1320 places, 1670/2020 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-010-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 1348 ms.
Stack based approach found an accepted trace after 35977 steps with 0 reset with depth 35978 and stack size 35978 in 463 ms.
FORMULA BART-PT-010-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-010-LTLFireability-02 finished in 64593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((!p0||F((G(F(!p1))||(X(!p2)&&F(!p1))))) U (G((!p0||F((G(F(!p1))||(X(!p2)&&F(!p1))))))||(!p2&&(!p0||F((G(F(!p1))||(X(!p2)&&F(!p1)))))))) U (G((!p0||F((G(F(!p1))||(X(!p2)&&F(!p1))))))||(!p1&&((!p0||F((G(F(!p1))||(X(!p2)&&F(!p1))))) U (G((!p0||F((G(F(!p1))||(X(!p2)&&F(!p1))))))||(!p2&&(!p0||F((G(F(!p1))||(X(!p2)&&F(!p1)))))))))))))'
Support contains 980 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 32 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (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-1816852707709114864.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17268346227673813516.kers'
[2026-05-23 15:46:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1816852707709114864.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17268346227673813516.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2020 rows 1320 cols 4040 entries
Finished phase 1 with 1310 SingleSign rule and 0 generalized
[2026-05-23 15:46:18] [INFO ] Computed 10 invariants in 16 ms
Computed 10 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-17268346227673813516.kers
Total runtime 20 ms.
[2026-05-23 15:46:18] [INFO ] Implicit Places using invariants in 522 ms returned []
[2026-05-23 15:46:18] [INFO ] Invariant cache hit.
[2026-05-23 15:46:20] [INFO ] Implicit Places using invariants and state equation in 1485 ms returned []
Implicit Place search using SMT with State Equation took 2013 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2026-05-23 15:46:20] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1310 variables, 1310/1310 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1310/3340 variables, and 1310 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30035 ms.
Refiners :[Domain max(s): 1310/1320 constraints, Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1320 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1310 variables, 1310/1310 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1310/3340 variables, and 1310 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30037 ms.
Refiners :[Domain max(s): 1310/1320 constraints, Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1320 constraints, PredecessorRefiner: 0/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60451ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 60458ms
Finished structural reductions in LTL mode , in 1 iterations and 62512 ms. Remains : 1320/1320 places, 2020/2020 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((!p0||F((G(F(!p1))||(X(!p2)&&F(!p1))))) U (G((!p0||F((G(F(!p1))||(X(!p2)&&F(!p1))))))||(!p2&&(!p0||F((G(F(!p1))||(X(!p2)&&F(!p1)))))))) U (G((!p0||F((G(F(!p1))||(X(!p2)&&F(!p1))))))||(!p1&&((!p0||F((G(F(!p1))||(X(!p2)&&F(!p1))))) U (G((!p0||F((G(F(!p1))||(X(!p2)&&F(!p1))))))||(!p2&&(!p0||F((G(F(!p1))||(X(!p2)&&F(!p1)))))))))))))'
Stuttering acceptance computed with spot in 204 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p2 p1), p1]
Running random walk in product with property : BART-PT-010-LTLFireability-03
Product exploration explored 100000 steps with 12866 reset in 2282 ms.
Product exploration explored 100000 steps with 12849 reset in 2201 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 6 factoid took 258 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
RANDOM walk for 213 steps (0 resets) in 12 ms. (16 steps per ms) remains 0/6 properties
Knowledge based reduction with 6 factoid took 274 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p2 p1), p1]
Knowledge-based reduction took 939 ms.
Stuttering acceptance computed with spot in 289 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p2 p1), p1]
Support contains 980 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 23 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
[2026-05-23 15:47:26] [INFO ] Invariant cache hit.
[2026-05-23 15:47:27] [INFO ] Implicit Places using invariants in 385 ms returned []
[2026-05-23 15:47:27] [INFO ] Invariant cache hit.
[2026-05-23 15:47:28] [INFO ] Implicit Places using invariants and state equation in 1235 ms returned []
Implicit Place search using SMT with State Equation took 1622 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1649 ms. Remains : 1320/1320 places, 2020/2020 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 6 factoid took 192 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
RANDOM walk for 289 steps (0 resets) in 15 ms. (18 steps per ms) remains 0/6 properties
Knowledge based reduction with 6 factoid took 260 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p2 p1), p1]
Knowledge-based reduction took 780 ms.
Stuttering acceptance computed with spot in 185 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p2 p1), p1]
Stuttering acceptance computed with spot in 183 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p2 p1), p1]
Product exploration explored 100000 steps with 12798 reset in 2153 ms.
Product exploration explored 100000 steps with 12854 reset in 2167 ms.
Spot run failed in 118 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/ltsmin12111557044621922115
[2026-05-23 15:47:34] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12111557044621922115
Running compilation step : cd /tmp/ltsmin12111557044621922115;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12111557044621922115;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12111557044621922115;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 980 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 10 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
[2026-05-23 15:47:37] [INFO ] Invariant cache hit.
[2026-05-23 15:47:37] [INFO ] Implicit Places using invariants in 379 ms returned []
[2026-05-23 15:47:37] [INFO ] Invariant cache hit.
[2026-05-23 15:47:38] [INFO ] Implicit Places using invariants and state equation in 1236 ms returned []
Implicit Place search using SMT with State Equation took 1620 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1631 ms. Remains : 1320/1320 places, 2020/2020 transitions.
Built C files in :
/tmp/ltsmin12849193463978871719
[2026-05-23 15:47:38] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12849193463978871719
Running compilation step : cd /tmp/ltsmin12849193463978871719;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12849193463978871719;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12849193463978871719;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 15:47:42] [INFO ] Flatten gal took : 76 ms
[2026-05-23 15:47:42] [INFO ] Flatten gal took : 65 ms
[2026-05-23 15:47:42] [INFO ] Time to serialize gal into /tmp/LTL9688012346670725757.gal : 22 ms
[2026-05-23 15:47:42] [INFO ] Time to serialize properties into /tmp/LTL12329715150555371784.prop : 7 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/LTL9688012346670725757.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16922437083192363282.hoa' '-atoms' '/tmp/LTL12329715150555371784.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/LTL12329715150555371784.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16922437083192363282.hoa
Detected timeout of ITS tools.
[2026-05-23 15:47:57] [INFO ] Flatten gal took : 89 ms
[2026-05-23 15:47:57] [INFO ] Flatten gal took : 84 ms
[2026-05-23 15:47:57] [INFO ] Time to serialize gal into /tmp/LTL17742037870295390219.gal : 16 ms
[2026-05-23 15:47:57] [INFO ] Time to serialize properties into /tmp/LTL13760417188717925868.ltl : 45 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/LTL17742037870295390219.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13760417188717925868.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((((!("(((((((((((TrainState_1_2_13==1)||(TrainState_3_2_12==1))||((TrainState_5_2_11==1)||(TrainState_3_1_40==1)))||(((TrainState...315953
Formula 0 simplified : X(("((((((((TrainState_1_2_5==1)||(TrainState_8_4_12==1))||((TrainState_4_4_13==1)||(TrainState_6_3_7==1)))||(((TrainState_5_4_11==1...143086
Detected timeout of ITS tools.
[2026-05-23 15:48:12] [INFO ] Flatten gal took : 74 ms
[2026-05-23 15:48:12] [INFO ] Applying decomposition
[2026-05-23 15:48:12] [INFO ] Flatten gal took : 103 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/graph392161686636396190.txt' '-o' '/tmp/graph392161686636396190.bin' '-w' '/tmp/graph392161686636396190.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph392161686636396190.bin' '-l' '-1' '-v' '-w' '/tmp/graph392161686636396190.weights' '-q' '0' '-e' '0.001'
[2026-05-23 15:48:13] [INFO ] Decomposing Gal with order
[2026-05-23 15:48:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 15:48:14] [INFO ] Removed a total of 236 redundant transitions.
[2026-05-23 15:48:14] [INFO ] Flatten gal took : 442 ms
[2026-05-23 15:48:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2026-05-23 15:48:16] [INFO ] Time to serialize gal into /tmp/LTL3052671778817524504.gal : 29 ms
[2026-05-23 15:48:16] [INFO ] Time to serialize properties into /tmp/LTL16439889180171698203.ltl : 51 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/LTL3052671778817524504.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16439889180171698203.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((((!("(((((((((((i9.i0.u77.TrainState_1_2_13==1)||(i8.i2.u87.TrainState_3_2_12==1))||((i5.i0.u60.TrainState_5_2_11==1)||(i8.i4.u1...444366
Formula 0 simplified : X(("((((((((i9.i0.u22.TrainState_1_2_5==1)||(i1.i3.u130.TrainState_8_4_12==1))||((i3.i2.u140.TrainState_4_4_13==1)||(i6.i3.u43.Train...201231
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
337 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.65681,126308,1,0,178669,5386,12059,694780,1253,10051,281261
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-010-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-010-LTLFireability-03 finished in 122992 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)&&F(p1)))&&G(F(p2))))'
Support contains 690 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 1320 transition count 1990
Reduce places removed 30 places and 0 transitions.
Performed 260 Post agglomeration using F-continuation condition.Transition count delta: 260
Iterating post reduction 1 with 290 rules applied. Total rules applied 320 place count 1290 transition count 1730
Reduce places removed 260 places and 0 transitions.
Iterating post reduction 2 with 260 rules applied. Total rules applied 580 place count 1030 transition count 1730
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 590 place count 1020 transition count 1720
Iterating global reduction 3 with 10 rules applied. Total rules applied 600 place count 1020 transition count 1720
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 680 place count 980 transition count 1680
Applied a total of 680 rules in 152 ms. Remains 980 /1320 variables (removed 340) and now considering 1680/2020 (removed 340) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18333919041032047324.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8450239560721084093.kers'
[2026-05-23 15:48:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18333919041032047324.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8450239560721084093.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1680 rows 980 cols 3360 entries
Finished phase 1 with 970 SingleSign rule and 0 generalized
[2026-05-23 15:48:21] [INFO ] Computed 10 invariants in 9 ms
Computed 10 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-8450239560721084093.kers
Total runtime 11 ms.
[2026-05-23 15:48:21] [INFO ] Implicit Places using invariants in 256 ms returned []
[2026-05-23 15:48:21] [INFO ] Invariant cache hit.
[2026-05-23 15:48:22] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1183 ms to find 0 implicit places.
[2026-05-23 15:48:22] [INFO ] Redundant transitions in 184 ms returned []
Running 1320 sub problems to find dead transitions.
[2026-05-23 15:48:22] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 970/2660 variables, and 0 constraints, problems are : Problem set: 0 solved, 1320 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 1320/1320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1320 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 970/2660 variables, and 0 constraints, problems are : Problem set: 0 solved, 1320 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 0/1320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60409ms problems are : Problem set: 0 solved, 1320 unsolved
Search for dead transitions found 0 dead transitions in 60415ms
Starting structural reductions in SI_LTL mode, iteration 1 : 980/1320 places, 1680/2020 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61947 ms. Remains : 980/1320 places, 1680/2020 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)&&F(p1)))&&G(F(p2))))'
Stuttering acceptance computed with spot in 358 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : BART-PT-010-LTLFireability-04
Product exploration explored 100000 steps with 3 reset in 2330 ms.
Product exploration explored 100000 steps with 3 reset in 1983 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 8 factoid took 85 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter insensitive) to 6 states, 13 edges and 3 AP (stutter insensitive).
RANDOM walk for 29548 steps (6 resets) in 433 ms. (68 steps per ms) remains 0/4 properties
Knowledge based reduction with 8 factoid took 134 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter insensitive) to 6 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p2), (NOT p0), (NOT p1)]
[2026-05-23 15:49:29] [INFO ] Invariant cache hit.
[2026-05-23 15:49:30] [INFO ] [Real]Absence check using 10 positive place invariants in 17 ms returned sat
[2026-05-23 15:49:31] [INFO ] [Real]Absence check using state equation in 630 ms returned sat
[2026-05-23 15:49:31] [INFO ] Computed and/alt/rep : 1320/2360/1320 causal constraints (skipped 0 transitions) in 121 ms.
[2026-05-23 15:49:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 15:49:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 19 ms returned sat
[2026-05-23 15:49:33] [INFO ] [Nat]Absence check using state equation in 783 ms returned sat
[2026-05-23 15:49:34] [INFO ] Computed and/alt/rep : 1320/2360/1320 causal constraints (skipped 0 transitions) in 167 ms.
Could not prove EG (NOT p2)
Knowledge-based reduction took 19275 ms.
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p2), (NOT p0), (NOT p1)]
Support contains 690 out of 980 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 980/980 places, 1680/1680 transitions.
Applied a total of 0 rules in 52 ms. Remains 980 /980 variables (removed 0) and now considering 1680/1680 (removed 0) transitions.
[2026-05-23 15:49:47] [INFO ] Invariant cache hit.
[2026-05-23 15:49:47] [INFO ] Implicit Places using invariants in 312 ms returned []
[2026-05-23 15:49:47] [INFO ] Invariant cache hit.
[2026-05-23 15:49:48] [INFO ] Implicit Places using invariants and state equation in 1119 ms returned []
Implicit Place search using SMT with State Equation took 1444 ms to find 0 implicit places.
[2026-05-23 15:49:48] [INFO ] Redundant transitions in 49 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1555 ms. Remains : 980/980 places, 1680/1680 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 8 factoid took 124 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter insensitive) to 6 states, 13 edges and 3 AP (stutter insensitive).
RANDOM walk for 24450 steps (4 resets) in 393 ms. (62 steps per ms) remains 0/4 properties
Knowledge based reduction with 8 factoid took 189 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter insensitive) to 6 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p2), (NOT p0), (NOT p1)]
[2026-05-23 15:49:51] [INFO ] Invariant cache hit.
[2026-05-23 15:49:52] [INFO ] [Real]Absence check using 10 positive place invariants in 28 ms returned sat
[2026-05-23 15:49:53] [INFO ] [Real]Absence check using state equation in 873 ms returned sat
[2026-05-23 15:49:53] [INFO ] Computed and/alt/rep : 1320/2360/1320 causal constraints (skipped 0 transitions) in 117 ms.
[2026-05-23 15:49:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 15:49:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 20 ms returned sat
[2026-05-23 15:49:56] [INFO ] [Nat]Absence check using state equation in 894 ms returned sat
[2026-05-23 15:49:56] [INFO ] Computed and/alt/rep : 1320/2360/1320 causal constraints (skipped 0 transitions) in 148 ms.
[2026-05-23 15:50:09] [INFO ] Added : 385 causal constraints over 77 iterations in 12580 ms. Result :unknown
Could not prove EG (NOT p2)
Knowledge-based reduction took 20553 ms.
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p2), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p2), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 5 reset in 2147 ms.
Stack based approach found an accepted trace after 66190 steps with 7 reset with depth 20166 and stack size 1878 in 1163 ms.
FORMULA BART-PT-010-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-010-LTLFireability-04 finished in 112345 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)&&((!p1||X(F((!p1&&F(p2))))) U (p1&&X(X(p0))))))'
Support contains 1220 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 5 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (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-13554149518913023097.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6723178656333511221.kers'
[2026-05-23 15:50:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13554149518913023097.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6723178656333511221.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2020 rows 1320 cols 4040 entries
Finished phase 1 with 1310 SingleSign rule and 0 generalized
[2026-05-23 15:50:13] [INFO ] Computed 10 invariants in 9 ms
Computed 10 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-6723178656333511221.kers
Total runtime 12 ms.
[2026-05-23 15:50:13] [INFO ] Implicit Places using invariants in 510 ms returned []
[2026-05-23 15:50:13] [INFO ] Invariant cache hit.
[2026-05-23 15:50:15] [INFO ] Implicit Places using invariants and state equation in 1595 ms returned []
Implicit Place search using SMT with State Equation took 2109 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2026-05-23 15:50:15] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1310 variables, 1310/1310 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1310/3340 variables, and 1310 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30063 ms.
Refiners :[Domain max(s): 1310/1320 constraints, Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1320 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1310 variables, 1310/1310 constraints. Problems are: Problem set: 0 solved, 1660 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1310/3340 variables, and 1310 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30048 ms.
Refiners :[Domain max(s): 1310/1320 constraints, Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1320 constraints, PredecessorRefiner: 0/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60548ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 60553ms
Finished structural reductions in LTL mode , in 1 iterations and 62673 ms. Remains : 1320/1320 places, 2020/2020 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)&&((!p1||X(F((!p1&&F(p2))))) U (p1&&X(X(p0))))))'
Stuttering acceptance computed with spot in 374 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (NOT p2), (OR (NOT p2) p1)]
Running random walk in product with property : BART-PT-010-LTLFireability-06
Product exploration explored 100000 steps with 33165 reset in 6490 ms.
Product exploration explored 100000 steps with 33075 reset in 6063 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 9 factoid took 230 ms. Reduced automaton from 10 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
RANDOM walk for 31630 steps (6 resets) in 1132 ms. (27 steps per ms) remains 0/8 properties
Knowledge based reduction with 9 factoid took 358 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 423 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (NOT p2), (OR (NOT p2) p1)]
[2026-05-23 15:51:36] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:834)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:590)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeFacts.computeEGknowledge(KnowledgeFacts.java:231)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeOrchestrator.applyKnowledgeBasedReductions(KnowledgeOrchestrator.java:52)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:248)
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)
[2026-05-23 15:51:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Knowledge-based reduction took 22132 ms.
Stuttering acceptance computed with spot in 398 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (NOT p2), (OR (NOT p2) p1)]
Support contains 1220 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 8 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
[2026-05-23 15:51:51] [INFO ] Invariant cache hit.
[2026-05-23 15:51:52] [INFO ] Implicit Places using invariants in 572 ms returned []
[2026-05-23 15:51:52] [INFO ] Invariant cache hit.
[2026-05-23 15:51:53] [INFO ] Implicit Places using invariants and state equation in 1201 ms returned []
Implicit Place search using SMT with State Equation took 1776 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1786 ms. Remains : 1320/1320 places, 2020/2020 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 1 factoid took 154 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 1365 ms. (29 steps per ms) remains 1/8 properties
BEST_FIRST walk for 12309 steps (0 resets) in 1107 ms. (11 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 339 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 420 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (NOT p2), (OR (NOT p2) p1)]
[2026-05-23 15:51:56] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:834)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:590)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeFacts.computeEGknowledge(KnowledgeFacts.java:231)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeOrchestrator.applyKnowledgeBasedReductions(KnowledgeOrchestrator.java:52)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
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)
[2026-05-23 15:52:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Knowledge-based reduction took 17802 ms.
Stuttering acceptance computed with spot in 404 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (NOT p2), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (NOT p2), (OR (NOT p2) p1)]
Product exploration explored 100000 steps with 24823 reset in 3508 ms.
Product exploration explored 100000 steps with 24837 reset in 3698 ms.
Spot run failed in 83 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/ltsmin8950859804336775514
[2026-05-23 15:52:19] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8950859804336775514
Running compilation step : cd /tmp/ltsmin8950859804336775514;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8950859804336775514;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8950859804336775514;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 1220 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Applied a total of 0 rules in 5 ms. Remains 1320 /1320 variables (removed 0) and now considering 2020/2020 (removed 0) transitions.
[2026-05-23 15:52:22] [INFO ] Invariant cache hit.
[2026-05-23 15:52:22] [INFO ] Implicit Places using invariants in 407 ms returned []
[2026-05-23 15:52:22] [INFO ] Invariant cache hit.
[2026-05-23 15:52:24] [INFO ] Implicit Places using invariants and state equation in 1638 ms returned []
Implicit Place search using SMT with State Equation took 2047 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2053 ms. Remains : 1320/1320 places, 2020/2020 transitions.
Built C files in :
/tmp/ltsmin17923120903687390795
[2026-05-23 15:52:24] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17923120903687390795
Running compilation step : cd /tmp/ltsmin17923120903687390795;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17923120903687390795;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17923120903687390795;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 15:52:27] [INFO ] Flatten gal took : 39 ms
[2026-05-23 15:52:27] [INFO ] Flatten gal took : 41 ms
[2026-05-23 15:52:27] [INFO ] Time to serialize gal into /tmp/LTL8695661199644995370.gal : 8 ms
[2026-05-23 15:52:27] [INFO ] Time to serialize properties into /tmp/LTL3059290670067309701.prop : 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/LTL8695661199644995370.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12649387315382910866.hoa' '-atoms' '/tmp/LTL3059290670067309701.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/LTL3059290670067309701.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12649387315382910866.hoa
Detected timeout of ITS tools.
[2026-05-23 15:52:42] [INFO ] Flatten gal took : 45 ms
[2026-05-23 15:52:42] [INFO ] Flatten gal took : 48 ms
[2026-05-23 15:52:42] [INFO ] Time to serialize gal into /tmp/LTL7025362255626454918.gal : 9 ms
[2026-05-23 15:52:42] [INFO ] Time to serialize properties into /tmp/LTL13848645360006854085.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/LTL7025362255626454918.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13848645360006854085.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 : !(((X("((((((((((TrainState_10_0_0==1)||(TrainState_5_0_0==1))||((TrainState_6_0_0==1)||(TrainState_1_0_0==1)))||(((TrainState_2_0_0==...104401
Formula 0 simplified : X!"((((((((((TrainState_10_0_0==1)||(TrainState_5_0_0==1))||((TrainState_6_0_0==1)||(TrainState_1_0_0==1)))||(((TrainState_2_0_0==1)...104378
Detected timeout of ITS tools.
[2026-05-23 15:52:57] [INFO ] Flatten gal took : 35 ms
[2026-05-23 15:52:57] [INFO ] Applying decomposition
[2026-05-23 15:52:57] [INFO ] Flatten gal took : 46 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/graph6443757018503743053.txt' '-o' '/tmp/graph6443757018503743053.bin' '-w' '/tmp/graph6443757018503743053.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6443757018503743053.bin' '-l' '-1' '-v' '-w' '/tmp/graph6443757018503743053.weights' '-q' '0' '-e' '0.001'
[2026-05-23 15:52:58] [INFO ] Decomposing Gal with order
[2026-05-23 15:52:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 15:52:58] [INFO ] Removed a total of 112 redundant transitions.
[2026-05-23 15:52:58] [INFO ] Flatten gal took : 178 ms
[2026-05-23 15:52:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2026-05-23 15:52:59] [INFO ] Time to serialize gal into /tmp/LTL780051624999421929.gal : 23 ms
[2026-05-23 15:52:59] [INFO ] Time to serialize properties into /tmp/LTL2709684026547007236.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/LTL780051624999421929.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2709684026547007236.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 : !(((X("((((((((((i8.i2.u169.TrainState_10_0_0==1)||(i6.i0.u21.TrainState_5_0_0==1))||((i2.i0.u25.TrainState_6_0_0==1)||(i5.i1.u270.Tra...147042
Formula 0 simplified : X!"((((((((((i8.i2.u169.TrainState_10_0_0==1)||(i6.i0.u21.TrainState_5_0_0==1))||((i2.i0.u25.TrainState_6_0_0==1)||(i5.i1.u270.Train...147019
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
2 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
99 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.35538,34928,1,0,22007,5674,10928,37430,1270,10497,67903
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-010-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-010-LTLFireability-06 finished in 167890 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)||G((F(G(p1)) U p1)))))'
Support contains 690 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 1290 transition count 1990
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 1290 transition count 1990
Applied a total of 60 rules in 61 ms. Remains 1290 /1320 variables (removed 30) and now considering 1990/2020 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5972024273001331201.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10118860300146834582.kers'
[2026-05-23 15:53:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5972024273001331201.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10118860300146834582.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1990 rows 1290 cols 3980 entries
Finished phase 1 with 1280 SingleSign rule and 0 generalized
[2026-05-23 15:53:01] [INFO ] Computed 10 invariants in 16 ms
Computed 10 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-10118860300146834582.kers
Total runtime 20 ms.
[2026-05-23 15:53:01] [INFO ] Implicit Places using invariants in 363 ms returned []
[2026-05-23 15:53:01] [INFO ] Invariant cache hit.
[2026-05-23 15:53:03] [INFO ] Implicit Places using invariants and state equation in 1424 ms returned []
Implicit Place search using SMT with State Equation took 1794 ms to find 0 implicit places.
Running 1630 sub problems to find dead transitions.
[2026-05-23 15:53:03] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1280/3280 variables, and 0 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1290 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1280/3280 variables, and 0 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1290 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60746ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 60753ms
Starting structural reductions in LTL mode, iteration 1 : 1290/1320 places, 1990/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62614 ms. Remains : 1290/1320 places, 1990/2020 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)||G((F(G(p1)) U p1)))))'
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BART-PT-010-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 3108 ms.
Product exploration explored 100000 steps with 0 reset in 3172 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 45 steps (0 resets) in 8 ms. (5 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Knowledge-based reduction took 450 ms.
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Support contains 10 out of 1290 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 : 1290/1290 places, 1990/1990 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 1290 transition count 1960
Reduce places removed 30 places and 0 transitions.
Performed 240 Post agglomeration using F-continuation condition.Transition count delta: 240
Iterating post reduction 1 with 270 rules applied. Total rules applied 300 place count 1260 transition count 1720
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 2 with 240 rules applied. Total rules applied 540 place count 1020 transition count 1720
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 620 place count 980 transition count 1680
Applied a total of 620 rules in 437 ms. Remains 980 /1290 variables (removed 310) and now considering 1680/1990 (removed 310) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14378632901589481036.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2871036668874684136.kers'
[2026-05-23 15:54:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14378632901589481036.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2871036668874684136.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1680 rows 980 cols 3360 entries
Finished phase 1 with 970 SingleSign rule and 0 generalized
[2026-05-23 15:54:11] [INFO ] Computed 10 invariants in 8 ms
Computed 10 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-2871036668874684136.kers
Total runtime 12 ms.
[2026-05-23 15:54:11] [INFO ] Implicit Places using invariants in 312 ms returned []
[2026-05-23 15:54:11] [INFO ] Invariant cache hit.
[2026-05-23 15:54:12] [INFO ] Implicit Places using invariants and state equation in 1088 ms returned []
Implicit Place search using SMT with State Equation took 1403 ms to find 0 implicit places.
[2026-05-23 15:54:12] [INFO ] Redundant transitions in 320 ms returned []
Running 1320 sub problems to find dead transitions.
[2026-05-23 15:54:13] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 970/2660 variables, and 0 constraints, problems are : Problem set: 0 solved, 1320 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 1320/1320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 970/2660 variables, and 0 constraints, problems are : Problem set: 0 solved, 1320 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 0/1320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61010ms problems are : Problem set: 0 solved, 1320 unsolved
Search for dead transitions found 0 dead transitions in 61022ms
Starting structural reductions in SI_LTL mode, iteration 1 : 980/1290 places, 1680/1990 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63207 ms. Remains : 980/1290 places, 1680/1990 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 43 steps (0 resets) in 6 ms. (6 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p1)]
Knowledge-based reduction took 327 ms.
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 3001 ms.
Product exploration explored 100000 steps with 0 reset in 3079 ms.
Built C files in :
/tmp/ltsmin8350645043797768313
[2026-05-23 15:55:20] [INFO ] Too many transitions (1680) to apply POR reductions. Disabling POR matrices.
[2026-05-23 15:55:20] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8350645043797768313
Running compilation step : cd /tmp/ltsmin8350645043797768313;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8350645043797768313;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8350645043797768313;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 10 out of 980 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 980/980 places, 1680/1680 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 340 transitions
Trivial Post-agglo rules discarded 340 transitions
Performed 340 trivial Post agglomeration. Transition count delta: 340
Iterating post reduction 0 with 340 rules applied. Total rules applied 340 place count 980 transition count 1340
Reduce places removed 340 places and 0 transitions.
Iterating post reduction 1 with 340 rules applied. Total rules applied 680 place count 640 transition count 1340
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 680 place count 640 transition count 1300
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 760 place count 600 transition count 1300
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 820 place count 540 transition count 1240
Iterating global reduction 2 with 60 rules applied. Total rules applied 880 place count 540 transition count 1240
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 890 place count 540 transition count 1230
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 930 place count 500 transition count 1190
Iterating global reduction 3 with 40 rules applied. Total rules applied 970 place count 500 transition count 1190
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 1000 place count 470 transition count 1160
Iterating global reduction 3 with 30 rules applied. Total rules applied 1030 place count 470 transition count 1160
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 1060 place count 440 transition count 1130
Iterating global reduction 3 with 30 rules applied. Total rules applied 1090 place count 440 transition count 1130
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1110 place count 420 transition count 1110
Iterating global reduction 3 with 20 rules applied. Total rules applied 1130 place count 420 transition count 1110
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1140 place count 410 transition count 1100
Iterating global reduction 3 with 10 rules applied. Total rules applied 1150 place count 410 transition count 1100
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 1270 place count 350 transition count 1040
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 1310 place count 350 transition count 1000
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 1350 place count 330 transition count 980
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 1390 place count 330 transition count 940
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 1430 place count 310 transition count 920
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 5 with 40 rules applied. Total rules applied 1470 place count 310 transition count 880
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 1510 place count 290 transition count 860
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 6 with 40 rules applied. Total rules applied 1550 place count 290 transition count 820
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 1590 place count 270 transition count 800
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 7 with 40 rules applied. Total rules applied 1630 place count 270 transition count 760
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 8 with 40 rules applied. Total rules applied 1670 place count 250 transition count 740
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 8 with 40 rules applied. Total rules applied 1710 place count 250 transition count 700
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 9 with 40 rules applied. Total rules applied 1750 place count 230 transition count 680
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 9 with 40 rules applied. Total rules applied 1790 place count 230 transition count 640
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 10 with 40 rules applied. Total rules applied 1830 place count 210 transition count 620
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 10 with 40 rules applied. Total rules applied 1870 place count 210 transition count 580
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 11 with 40 rules applied. Total rules applied 1910 place count 190 transition count 560
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 11 with 40 rules applied. Total rules applied 1950 place count 190 transition count 520
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 12 with 40 rules applied. Total rules applied 1990 place count 170 transition count 500
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 12 with 40 rules applied. Total rules applied 2030 place count 170 transition count 460
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 13 with 40 rules applied. Total rules applied 2070 place count 150 transition count 440
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 13 with 40 rules applied. Total rules applied 2110 place count 150 transition count 400
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 14 with 40 rules applied. Total rules applied 2150 place count 130 transition count 380
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 14 with 40 rules applied. Total rules applied 2190 place count 130 transition count 340
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 15 with 40 rules applied. Total rules applied 2230 place count 110 transition count 320
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 15 with 40 rules applied. Total rules applied 2270 place count 110 transition count 280
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 16 with 40 rules applied. Total rules applied 2310 place count 90 transition count 260
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 16 with 40 rules applied. Total rules applied 2350 place count 90 transition count 220
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 17 with 40 rules applied. Total rules applied 2390 place count 70 transition count 200
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 17 with 40 rules applied. Total rules applied 2430 place count 70 transition count 160
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 18 with 40 rules applied. Total rules applied 2470 place count 50 transition count 140
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 18 with 40 rules applied. Total rules applied 2510 place count 50 transition count 100
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 19 with 40 rules applied. Total rules applied 2550 place count 30 transition count 80
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 19 with 50 rules applied. Total rules applied 2600 place count 30 transition count 30
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 20 with 20 rules applied. Total rules applied 2620 place count 20 transition count 20
Applied a total of 2620 rules in 775 ms. Remains 20 /980 variables (removed 960) and now considering 20/1680 (removed 1660) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11756327247081741781.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15921213616561057380.kers'
[2026-05-23 15:55:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11756327247081741781.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15921213616561057380.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 20 rows 10 cols 20 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-23 15:55:24] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15921213616561057380.kers
Total runtime 4 ms.
[2026-05-23 15:55:24] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-23 15:55:24] [INFO ] Invariant cache hit.
[2026-05-23 15:55:24] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2026-05-23 15:55:24] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2026-05-23 15:55:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 20/40 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/40 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 30 constraints, problems are : Problem set: 0 solved, 10 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10/20 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 20/40 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/40 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 40 constraints, problems are : Problem set: 0 solved, 10 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 396ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 397ms
Starting structural reductions in SI_LTL mode, iteration 1 : 20/980 places, 20/1680 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1267 ms. Remains : 20/980 places, 20/1680 transitions.
Built C files in :
/tmp/ltsmin16846319704808121072
[2026-05-23 15:55:24] [INFO ] Computing symmetric may disable matrix : 20 transitions.
[2026-05-23 15:55:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 15:55:24] [INFO ] Computing symmetric may enable matrix : 20 transitions.
[2026-05-23 15:55:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 15:55:24] [INFO ] Computing Do-Not-Accords matrix : 20 transitions.
[2026-05-23 15:55:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 15:55:24] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16846319704808121072
Running compilation step : cd /tmp/ltsmin16846319704808121072;'/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 353 ms.
Running link step : cd /tmp/ltsmin16846319704808121072;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin16846319704808121072;'/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/stateBased12052581797908381015.hoa' '--buchi-type=spotba'
LTSmin run took 83 ms.
FORMULA BART-PT-010-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-PT-010-LTLFireability-07 finished in 144348 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(p1)||p0)))'
Support contains 3 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Graph (trivial) has 1943 edges and 1320 vertex of which 1038 / 1320 are part of one of the 8 SCC in 6 ms
Free SCC test removed 1030 places
Ensure Unique test removed 1584 transitions
Reduce isomorphic transitions removed 1584 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 146 rules applied. Total rules applied 147 place count 283 transition count 290
Reduce places removed 140 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 142 rules applied. Total rules applied 289 place count 143 transition count 288
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 292 place count 142 transition count 286
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 295 place count 141 transition count 284
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 297 place count 140 transition count 283
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 297 place count 140 transition count 273
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 317 place count 130 transition count 273
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 330 place count 117 transition count 260
Iterating global reduction 5 with 13 rules applied. Total rules applied 343 place count 117 transition count 260
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 346 place count 117 transition count 257
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 354 place count 109 transition count 249
Iterating global reduction 6 with 8 rules applied. Total rules applied 362 place count 109 transition count 249
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 368 place count 103 transition count 243
Iterating global reduction 6 with 6 rules applied. Total rules applied 374 place count 103 transition count 243
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 380 place count 97 transition count 237
Iterating global reduction 6 with 6 rules applied. Total rules applied 386 place count 97 transition count 237
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 390 place count 93 transition count 233
Iterating global reduction 6 with 4 rules applied. Total rules applied 394 place count 93 transition count 233
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 398 place count 89 transition count 229
Iterating global reduction 6 with 4 rules applied. Total rules applied 402 place count 89 transition count 229
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 404 place count 87 transition count 227
Iterating global reduction 6 with 2 rules applied. Total rules applied 406 place count 87 transition count 227
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 434 place count 73 transition count 213
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 442 place count 73 transition count 205
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 450 place count 69 transition count 201
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 458 place count 69 transition count 193
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 466 place count 65 transition count 189
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 474 place count 65 transition count 181
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 482 place count 61 transition count 177
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 490 place count 61 transition count 169
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 498 place count 57 transition count 165
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 506 place count 57 transition count 157
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 514 place count 53 transition count 153
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 522 place count 53 transition count 145
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 530 place count 49 transition count 141
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 538 place count 49 transition count 133
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 546 place count 45 transition count 129
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 13 with 8 rules applied. Total rules applied 554 place count 45 transition count 121
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 562 place count 41 transition count 117
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 570 place count 41 transition count 109
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 578 place count 37 transition count 105
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 15 with 8 rules applied. Total rules applied 586 place count 37 transition count 97
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 594 place count 33 transition count 93
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 16 with 8 rules applied. Total rules applied 602 place count 33 transition count 85
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 610 place count 29 transition count 81
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 17 with 8 rules applied. Total rules applied 618 place count 29 transition count 73
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 626 place count 25 transition count 69
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 18 with 8 rules applied. Total rules applied 634 place count 25 transition count 61
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 642 place count 21 transition count 57
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 19 with 8 rules applied. Total rules applied 650 place count 21 transition count 49
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 20 with 8 rules applied. Total rules applied 658 place count 17 transition count 45
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 20 with 8 rules applied. Total rules applied 666 place count 17 transition count 37
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 8 rules applied. Total rules applied 674 place count 13 transition count 33
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 21 with 8 rules applied. Total rules applied 682 place count 13 transition count 25
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 22 with 8 rules applied. Total rules applied 690 place count 9 transition count 21
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 22 with 10 rules applied. Total rules applied 700 place count 9 transition count 11
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 704 place count 7 transition count 9
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 24 with 1 rules applied. Total rules applied 705 place count 7 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 24 with 1 Pre rules applied. Total rules applied 705 place count 7 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 707 place count 6 transition count 7
Applied a total of 707 rules in 127 ms. Remains 6 /1320 variables (removed 1314) and now considering 7/2020 (removed 2013) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3635909761085095655.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16722767163956989888.kers'
[2026-05-23 15:55:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3635909761085095655.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16722767163956989888.kers]
Normalized transition count is 6 out of 7 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 6 rows 3 cols 6 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-23 15:55:25] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16722767163956989888.kers
Total runtime 0 ms.
[2026-05-23 15:55:25] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-23 15:55:25] [INFO ] Invariant cache hit.
[2026-05-23 15:55:25] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2026-05-23 15:55:25] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2026-05-23 15:55:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 144ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 146ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/1320 places, 7/2020 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 354 ms. Remains : 6/1320 places, 7/2020 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(p1)||p0)))'
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BART-PT-010-LTLFireability-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA BART-PT-010-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-08 finished in 508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U p1)||F((p2&&F(p3))))))'
Support contains 4 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 319 places :
Symmetric choice reduction at 0 with 319 rule applications. Total rules 319 place count 1001 transition count 1701
Iterating global reduction 0 with 319 rules applied. Total rules applied 638 place count 1001 transition count 1701
Discarding 269 places :
Symmetric choice reduction at 0 with 269 rule applications. Total rules 907 place count 732 transition count 1432
Iterating global reduction 0 with 269 rules applied. Total rules applied 1176 place count 732 transition count 1432
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 1216 place count 692 transition count 1392
Iterating global reduction 0 with 40 rules applied. Total rules applied 1256 place count 692 transition count 1392
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1285 place count 663 transition count 1363
Iterating global reduction 0 with 29 rules applied. Total rules applied 1314 place count 663 transition count 1363
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1343 place count 634 transition count 1334
Iterating global reduction 0 with 29 rules applied. Total rules applied 1372 place count 634 transition count 1334
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1401 place count 605 transition count 1305
Iterating global reduction 0 with 29 rules applied. Total rules applied 1430 place count 605 transition count 1305
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1459 place count 576 transition count 1276
Iterating global reduction 0 with 29 rules applied. Total rules applied 1488 place count 576 transition count 1276
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1517 place count 547 transition count 1247
Iterating global reduction 0 with 29 rules applied. Total rules applied 1546 place count 547 transition count 1247
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1566 place count 527 transition count 1227
Iterating global reduction 0 with 20 rules applied. Total rules applied 1586 place count 527 transition count 1227
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 1605 place count 508 transition count 1208
Iterating global reduction 0 with 19 rules applied. Total rules applied 1624 place count 508 transition count 1208
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 1634 place count 498 transition count 1198
Iterating global reduction 0 with 10 rules applied. Total rules applied 1644 place count 498 transition count 1198
Applied a total of 1644 rules in 386 ms. Remains 498 /1320 variables (removed 822) and now considering 1198/2020 (removed 822) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9261504426545910026.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2252802886760759550.kers'
[2026-05-23 15:55:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9261504426545910026.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2252802886760759550.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1198 rows 498 cols 2396 entries
Finished phase 1 with 488 SingleSign rule and 0 generalized
[2026-05-23 15:55:26] [INFO ] Computed 10 invariants in 10 ms
Computed 10 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-2252802886760759550.kers
Total runtime 12 ms.
[2026-05-23 15:55:26] [INFO ] Implicit Places using invariants in 115 ms returned []
[2026-05-23 15:55:26] [INFO ] Invariant cache hit.
[2026-05-23 15:55:26] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
Running 838 sub problems to find dead transitions.
[2026-05-23 15:55:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 838 unsolved
SMT process timed out in 30318ms, After SMT, problems are : Problem set: 0 solved, 838 unsolved
Search for dead transitions found 0 dead transitions in 30326ms
Starting structural reductions in LTL mode, iteration 1 : 498/1320 places, 1198/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31281 ms. Remains : 498/1320 places, 1198/2020 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U p1)||F((p2&&F(p3))))))'
Stuttering acceptance computed with spot in 408 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : BART-PT-010-LTLFireability-09
Product exploration explored 100000 steps with 1247 reset in 637 ms.
Product exploration explored 100000 steps with 1302 reset in 564 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 13 factoid took 359 ms. Reduced automaton from 7 states, 19 edges and 4 AP (stutter sensitive) to 7 states, 19 edges and 4 AP (stutter sensitive).
RANDOM walk for 7692 steps (0 resets) in 121 ms. (63 steps per ms) remains 0/17 properties
Knowledge based reduction with 13 factoid took 748 ms. Reduced automaton from 7 states, 19 edges and 4 AP (stutter sensitive) to 7 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 388 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p0))]
Knowledge-based reduction took 1699 ms.
Stuttering acceptance computed with spot in 383 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p0))]
Support contains 4 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 1198/1198 transitions.
Applied a total of 0 rules in 17 ms. Remains 498 /498 variables (removed 0) and now considering 1198/1198 (removed 0) transitions.
[2026-05-23 15:56:01] [INFO ] Invariant cache hit.
[2026-05-23 15:56:01] [INFO ] Implicit Places using invariants in 163 ms returned []
[2026-05-23 15:56:01] [INFO ] Invariant cache hit.
[2026-05-23 15:56:01] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 885 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 903 ms. Remains : 498/498 places, 1198/1198 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 13 factoid took 521 ms. Reduced automaton from 7 states, 19 edges and 4 AP (stutter sensitive) to 7 states, 19 edges and 4 AP (stutter sensitive).
RANDOM walk for 1989 steps (0 resets) in 21 ms. (90 steps per ms) remains 0/17 properties
Knowledge based reduction with 13 factoid took 797 ms. Reduced automaton from 7 states, 19 edges and 4 AP (stutter sensitive) to 7 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 383 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p0))]
Knowledge-based reduction took 1945 ms.
Stuttering acceptance computed with spot in 386 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p0))]
Stuttering acceptance computed with spot in 382 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p0))]
Product exploration explored 100000 steps with 1249 reset in 431 ms.
Product exploration explored 100000 steps with 1105 reset in 495 ms.
Spot run failed in 84 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/ltsmin9521295929455772955
[2026-05-23 15:56:05] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9521295929455772955
Running compilation step : cd /tmp/ltsmin9521295929455772955;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9521295929455772955;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9521295929455772955;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 498/498 places, 1198/1198 transitions.
Applied a total of 0 rules in 13 ms. Remains 498 /498 variables (removed 0) and now considering 1198/1198 (removed 0) transitions.
[2026-05-23 15:56:08] [INFO ] Invariant cache hit.
[2026-05-23 15:56:08] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-23 15:56:08] [INFO ] Invariant cache hit.
[2026-05-23 15:56:09] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 702 ms. Remains : 498/498 places, 1198/1198 transitions.
Built C files in :
/tmp/ltsmin9086206035633465889
[2026-05-23 15:56:09] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9086206035633465889
Running compilation step : cd /tmp/ltsmin9086206035633465889;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9086206035633465889;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9086206035633465889;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-23 15:56:13] [INFO ] Flatten gal took : 137 ms
[2026-05-23 15:56:13] [INFO ] Flatten gal took : 91 ms
[2026-05-23 15:56:13] [INFO ] Time to serialize gal into /tmp/LTL8357694559431840579.gal : 19 ms
[2026-05-23 15:56:13] [INFO ] Time to serialize properties into /tmp/LTL4315338727650303192.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/LTL8357694559431840579.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17324375336310234654.hoa' '-atoms' '/tmp/LTL4315338727650303192.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/LTL4315338727650303192.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17324375336310234654.hoa
Detected timeout of ITS tools.
[2026-05-23 15:56:28] [INFO ] Flatten gal took : 28 ms
[2026-05-23 15:56:28] [INFO ] Flatten gal took : 24 ms
[2026-05-23 15:56:28] [INFO ] Time to serialize gal into /tmp/LTL14990813615331861550.gal : 5 ms
[2026-05-23 15:56:28] [INFO ] Time to serialize properties into /tmp/LTL4703759503433622059.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14990813615331861550.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4703759503433622059.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 : !((X(((G("(TrainState_5_0_0==1)"))U("(TrainState_6_0_0==1)"))||(F(("(TrainState_3_1_1==1)")&&(F("(TrainState_3_4_14==1)")))))))
Formula 0 simplified : X((F!"(TrainState_5_0_0==1)" R !"(TrainState_6_0_0==1)") & G(!"(TrainState_3_1_1==1)" | G!"(TrainState_3_4_14==1)"))
Detected timeout of ITS tools.
[2026-05-23 15:56:43] [INFO ] Flatten gal took : 26 ms
[2026-05-23 15:56:43] [INFO ] Applying decomposition
[2026-05-23 15:56:43] [INFO ] Flatten gal took : 23 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/graph17984726091891878602.txt' '-o' '/tmp/graph17984726091891878602.bin' '-w' '/tmp/graph17984726091891878602.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17984726091891878602.bin' '-l' '-1' '-v' '-w' '/tmp/graph17984726091891878602.weights' '-q' '0' '-e' '0.001'
[2026-05-23 15:56:43] [INFO ] Decomposing Gal with order
[2026-05-23 15:56:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 15:56:44] [INFO ] Removed a total of 404 redundant transitions.
[2026-05-23 15:56:44] [INFO ] Flatten gal took : 109 ms
[2026-05-23 15:56:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 206 labels/synchronizations in 38 ms.
[2026-05-23 15:56:44] [INFO ] Time to serialize gal into /tmp/LTL18069855859640541245.gal : 15 ms
[2026-05-23 15:56:44] [INFO ] Time to serialize properties into /tmp/LTL12459775123756570052.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18069855859640541245.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12459775123756570052.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...256
Read 1 LTL properties
Checking formula 0 : !((X(((G("(i7.u48.TrainState_5_0_0==1)"))U("(i0.u18.TrainState_6_0_0==1)"))||(F(("(i3.i0.u7.TrainState_3_1_1==1)")&&(F("(i3.i0.u52.Tra...181
Formula 0 simplified : X((F!"(i7.u48.TrainState_5_0_0==1)" R !"(i0.u18.TrainState_6_0_0==1)") & G(!"(i3.i0.u7.TrainState_3_1_1==1)" | G!"(i3.i0.u52.TrainSt...172
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
18 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.343328,23184,1,0,4081,919,2026,6406,403,1905,9108
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-010-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property BART-PT-010-LTLFireability-09 finished in 78625 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U X(p1))||X(X(X(X(F(p2))))))))'
Support contains 2 out of 1320 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 319 places :
Symmetric choice reduction at 0 with 319 rule applications. Total rules 319 place count 1001 transition count 1701
Iterating global reduction 0 with 319 rules applied. Total rules applied 638 place count 1001 transition count 1701
Discarding 269 places :
Symmetric choice reduction at 0 with 269 rule applications. Total rules 907 place count 732 transition count 1432
Iterating global reduction 0 with 269 rules applied. Total rules applied 1176 place count 732 transition count 1432
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 1216 place count 692 transition count 1392
Iterating global reduction 0 with 40 rules applied. Total rules applied 1256 place count 692 transition count 1392
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1285 place count 663 transition count 1363
Iterating global reduction 0 with 29 rules applied. Total rules applied 1314 place count 663 transition count 1363
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1343 place count 634 transition count 1334
Iterating global reduction 0 with 29 rules applied. Total rules applied 1372 place count 634 transition count 1334
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1401 place count 605 transition count 1305
Iterating global reduction 0 with 29 rules applied. Total rules applied 1430 place count 605 transition count 1305
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1459 place count 576 transition count 1276
Iterating global reduction 0 with 29 rules applied. Total rules applied 1488 place count 576 transition count 1276
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1517 place count 547 transition count 1247
Iterating global reduction 0 with 29 rules applied. Total rules applied 1546 place count 547 transition count 1247
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1566 place count 527 transition count 1227
Iterating global reduction 0 with 20 rules applied. Total rules applied 1586 place count 527 transition count 1227
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 1605 place count 508 transition count 1208
Iterating global reduction 0 with 19 rules applied. Total rules applied 1624 place count 508 transition count 1208
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 1634 place count 498 transition count 1198
Iterating global reduction 0 with 10 rules applied. Total rules applied 1644 place count 498 transition count 1198
Applied a total of 1644 rules in 216 ms. Remains 498 /1320 variables (removed 822) and now considering 1198/2020 (removed 822) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6163243651971779035.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11156901300764564854.kers'
[2026-05-23 15:56:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6163243651971779035.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11156901300764564854.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1198 rows 498 cols 2396 entries
Finished phase 1 with 488 SingleSign rule and 0 generalized
[2026-05-23 15:56:44] [INFO ] Computed 10 invariants in 4 ms
Computed 10 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-11156901300764564854.kers
Total runtime 6 ms.
[2026-05-23 15:56:44] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-05-23 15:56:44] [INFO ] Invariant cache hit.
[2026-05-23 15:56:45] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 498/1320 places, 1198/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 791 ms. Remains : 498/1320 places, 1198/2020 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U X(p1))||X(X(X(X(F(p2))))))))'
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BART-PT-010-LTLFireability-12
Product exploration explored 100000 steps with 13756 reset in 1733 ms.
Product exploration explored 100000 steps with 13731 reset in 1395 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 1 factoid took 118 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 9844 steps (2 resets) in 45 ms. (214 steps per ms) remains 0/3 properties
Knowledge based reduction with 1 factoid took 161 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2026-05-23 15:56:49] [INFO ] Invariant cache hit.
[2026-05-23 15:56:50] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned unsat
Proved EG (AND (NOT p1) (NOT p2)) asserting that LTL formula F !(AND (NOT p1) (NOT p2)) is false.
Negative knowledge disproves property using: (F (NOT (AND (NOT p1) (NOT p2))))
Knowledge-based reduction took 1422 ms.
FORMULA BART-PT-010-LTLFireability-12 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property BART-PT-010-LTLFireability-12 finished in 5579 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((p0||(p1 U (G(p1)||(p1&&G(!p2)))))))))'
Support contains 3 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 317 places :
Symmetric choice reduction at 0 with 317 rule applications. Total rules 317 place count 1003 transition count 1703
Iterating global reduction 0 with 317 rules applied. Total rules applied 634 place count 1003 transition count 1703
Discarding 267 places :
Symmetric choice reduction at 0 with 267 rule applications. Total rules 901 place count 736 transition count 1436
Iterating global reduction 0 with 267 rules applied. Total rules applied 1168 place count 736 transition count 1436
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 1208 place count 696 transition count 1396
Iterating global reduction 0 with 40 rules applied. Total rules applied 1248 place count 696 transition count 1396
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1277 place count 667 transition count 1367
Iterating global reduction 0 with 29 rules applied. Total rules applied 1306 place count 667 transition count 1367
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 1333 place count 640 transition count 1340
Iterating global reduction 0 with 27 rules applied. Total rules applied 1360 place count 640 transition count 1340
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 1387 place count 613 transition count 1313
Iterating global reduction 0 with 27 rules applied. Total rules applied 1414 place count 613 transition count 1313
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 1441 place count 586 transition count 1286
Iterating global reduction 0 with 27 rules applied. Total rules applied 1468 place count 586 transition count 1286
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 1495 place count 559 transition count 1259
Iterating global reduction 0 with 27 rules applied. Total rules applied 1522 place count 559 transition count 1259
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 1539 place count 542 transition count 1242
Iterating global reduction 0 with 17 rules applied. Total rules applied 1556 place count 542 transition count 1242
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 1573 place count 525 transition count 1225
Iterating global reduction 0 with 17 rules applied. Total rules applied 1590 place count 525 transition count 1225
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 1598 place count 517 transition count 1217
Iterating global reduction 0 with 8 rules applied. Total rules applied 1606 place count 517 transition count 1217
Applied a total of 1606 rules in 338 ms. Remains 517 /1320 variables (removed 803) and now considering 1217/2020 (removed 803) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-910444682855119027.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10391179598135997061.kers'
[2026-05-23 15:56:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-910444682855119027.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10391179598135997061.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1217 rows 517 cols 2434 entries
Finished phase 1 with 507 SingleSign rule and 0 generalized
[2026-05-23 15:56:50] [INFO ] Computed 10 invariants in 7 ms
Computed 10 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-10391179598135997061.kers
Total runtime 10 ms.
[2026-05-23 15:56:50] [INFO ] Implicit Places using invariants in 186 ms returned []
[2026-05-23 15:56:50] [INFO ] Invariant cache hit.
[2026-05-23 15:56:51] [INFO ] Implicit Places using invariants and state equation in 750 ms returned []
Implicit Place search using SMT with State Equation took 938 ms to find 0 implicit places.
Running 857 sub problems to find dead transitions.
[2026-05-23 15:56:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/507 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 857 unsolved
SMT process timed out in 30145ms, After SMT, problems are : Problem set: 0 solved, 857 unsolved
Search for dead transitions found 0 dead transitions in 30147ms
Starting structural reductions in LTL mode, iteration 1 : 517/1320 places, 1217/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31427 ms. Remains : 517/1320 places, 1217/2020 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((p0||(p1 U (G(p1)||(p1&&G(!p2)))))))))'
Stuttering acceptance computed with spot in 379 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) p2), p2, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-010-LTLFireability-13
Product exploration explored 100000 steps with 25000 reset in 1762 ms.
Entered a terminal (fully accepting) state of product in 52059 steps with 13014 reset in 713 ms.
FORMULA BART-PT-010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-13 finished in 34328 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(G(p0)) U p1)||G(p2))))'
Support contains 3 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Graph (trivial) has 2012 edges and 1320 vertex of which 1158 / 1320 are part of one of the 9 SCC in 2 ms
Free SCC test removed 1149 places
Ensure Unique test removed 1769 transitions
Reduce isomorphic transitions removed 1769 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 90 rules applied. Total rules applied 91 place count 164 transition count 161
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 88 rules applied. Total rules applied 179 place count 80 transition count 157
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 184 place count 78 transition count 154
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 187 place count 77 transition count 152
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 189 place count 76 transition count 151
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 189 place count 76 transition count 147
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 197 place count 72 transition count 147
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 205 place count 64 transition count 139
Iterating global reduction 5 with 8 rules applied. Total rules applied 213 place count 64 transition count 139
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 216 place count 64 transition count 136
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 220 place count 60 transition count 132
Iterating global reduction 6 with 4 rules applied. Total rules applied 224 place count 60 transition count 132
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 227 place count 57 transition count 129
Iterating global reduction 6 with 3 rules applied. Total rules applied 230 place count 57 transition count 129
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 233 place count 54 transition count 126
Iterating global reduction 6 with 3 rules applied. Total rules applied 236 place count 54 transition count 126
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 238 place count 52 transition count 124
Iterating global reduction 6 with 2 rules applied. Total rules applied 240 place count 52 transition count 124
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 242 place count 50 transition count 122
Iterating global reduction 6 with 2 rules applied. Total rules applied 244 place count 50 transition count 122
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 245 place count 49 transition count 121
Iterating global reduction 6 with 1 rules applied. Total rules applied 246 place count 49 transition count 121
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 260 place count 42 transition count 114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 264 place count 42 transition count 110
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 268 place count 40 transition count 108
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 272 place count 40 transition count 104
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 276 place count 38 transition count 102
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 280 place count 38 transition count 98
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 284 place count 36 transition count 96
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 288 place count 36 transition count 92
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 292 place count 34 transition count 90
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 296 place count 34 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 300 place count 32 transition count 84
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 304 place count 32 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 308 place count 30 transition count 78
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 312 place count 30 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 316 place count 28 transition count 72
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 320 place count 28 transition count 68
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 324 place count 26 transition count 66
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 328 place count 26 transition count 62
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 332 place count 24 transition count 60
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 336 place count 24 transition count 56
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 340 place count 22 transition count 54
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 344 place count 22 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 348 place count 20 transition count 48
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 352 place count 20 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 356 place count 18 transition count 42
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 360 place count 18 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 364 place count 16 transition count 36
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 368 place count 16 transition count 32
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 20 with 4 rules applied. Total rules applied 372 place count 14 transition count 30
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 376 place count 14 transition count 26
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 21 with 4 rules applied. Total rules applied 380 place count 12 transition count 24
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 384 place count 12 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 22 with 4 rules applied. Total rules applied 388 place count 10 transition count 18
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 22 with 5 rules applied. Total rules applied 393 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 395 place count 9 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 24 with 1 Pre rules applied. Total rules applied 395 place count 9 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 397 place count 8 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 24 with 2 rules applied. Total rules applied 399 place count 8 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 24 with 2 Pre rules applied. Total rules applied 399 place count 8 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 24 with 4 rules applied. Total rules applied 403 place count 6 transition count 7
Applied a total of 403 rules in 33 ms. Remains 6 /1320 variables (removed 1314) and now considering 7/2020 (removed 2013) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3101661655541543137.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16606011390772348373.kers'
[2026-05-23 15:57:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3101661655541543137.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16606011390772348373.kers]
Normalized transition count is 6 out of 7 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 6 rows 3 cols 6 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-23 15:57:24] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16606011390772348373.kers
Total runtime 1 ms.
[2026-05-23 15:57:24] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-23 15:57:24] [INFO ] Invariant cache hit.
[2026-05-23 15:57:24] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2026-05-23 15:57:24] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2026-05-23 15:57:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 153ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 153ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/1320 places, 7/2020 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 247 ms. Remains : 6/1320 places, 7/2020 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(G(p0)) U p1)||G(p2))))'
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : BART-PT-010-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-14 finished in 475 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(p1))&&F(p2)) U X(G(p3)))))'
Support contains 4 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 2020/2020 transitions.
Discarding 318 places :
Symmetric choice reduction at 0 with 318 rule applications. Total rules 318 place count 1002 transition count 1702
Iterating global reduction 0 with 318 rules applied. Total rules applied 636 place count 1002 transition count 1702
Discarding 269 places :
Symmetric choice reduction at 0 with 269 rule applications. Total rules 905 place count 733 transition count 1433
Iterating global reduction 0 with 269 rules applied. Total rules applied 1174 place count 733 transition count 1433
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 1214 place count 693 transition count 1393
Iterating global reduction 0 with 40 rules applied. Total rules applied 1254 place count 693 transition count 1393
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1283 place count 664 transition count 1364
Iterating global reduction 0 with 29 rules applied. Total rules applied 1312 place count 664 transition count 1364
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1341 place count 635 transition count 1335
Iterating global reduction 0 with 29 rules applied. Total rules applied 1370 place count 635 transition count 1335
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1399 place count 606 transition count 1306
Iterating global reduction 0 with 29 rules applied. Total rules applied 1428 place count 606 transition count 1306
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1457 place count 577 transition count 1277
Iterating global reduction 0 with 29 rules applied. Total rules applied 1486 place count 577 transition count 1277
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 1515 place count 548 transition count 1248
Iterating global reduction 0 with 29 rules applied. Total rules applied 1544 place count 548 transition count 1248
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1564 place count 528 transition count 1228
Iterating global reduction 0 with 20 rules applied. Total rules applied 1584 place count 528 transition count 1228
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 1603 place count 509 transition count 1209
Iterating global reduction 0 with 19 rules applied. Total rules applied 1622 place count 509 transition count 1209
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 1632 place count 499 transition count 1199
Iterating global reduction 0 with 10 rules applied. Total rules applied 1642 place count 499 transition count 1199
Applied a total of 1642 rules in 327 ms. Remains 499 /1320 variables (removed 821) and now considering 1199/2020 (removed 821) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8026250316104357215.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12462691257264439608.kers'
[2026-05-23 15:57:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8026250316104357215.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12462691257264439608.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1199 rows 499 cols 2398 entries
Finished phase 1 with 489 SingleSign rule and 0 generalized
[2026-05-23 15:57:25] [INFO ] Computed 10 invariants in 7 ms
Computed 10 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-12462691257264439608.kers
Total runtime 9 ms.
[2026-05-23 15:57:25] [INFO ] Implicit Places using invariants in 170 ms returned []
[2026-05-23 15:57:25] [INFO ] Invariant cache hit.
[2026-05-23 15:57:26] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 913 ms to find 0 implicit places.
Running 839 sub problems to find dead transitions.
[2026-05-23 15:57:26] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 839 unsolved
SMT process timed out in 30189ms, After SMT, problems are : Problem set: 0 solved, 839 unsolved
Search for dead transitions found 0 dead transitions in 30191ms
Starting structural reductions in LTL mode, iteration 1 : 499/1320 places, 1199/2020 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31435 ms. Remains : 499/1320 places, 1199/2020 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&((X(X(p1))&&F(p2)) U X(G(p3)))))'
Stuttering acceptance computed with spot in 450 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p2) (NOT p3)), (NOT p3), true, (NOT p1), (AND (NOT p3) (NOT p1)), (NOT p2), (AND (NOT p3) p1)]
Running random walk in product with property : BART-PT-010-LTLFireability-15
Entered a terminal (fully accepting) state of product in 4 steps with 1 reset in 1 ms.
FORMULA BART-PT-010-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-010-LTLFireability-15 finished in 31958 ms.
All properties solved by simple procedures.
Total runtime 840949 ms.

BK_STOP 1779551877110

--------------------
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="BART-PT-010"
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 BART-PT-010, 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 r018-smll-177946788000244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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