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.r082-smll-177946993700308.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 DES-PT-00b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993700308
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.1K Mar 6 18:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 6 18:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 6 18:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 6 18:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 08:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 08:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 08:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 6 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Mar 6 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 6 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 6 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 66K 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 DES-PT-00b-LTLFireability-00
FORMULA_NAME DES-PT-00b-LTLFireability-01
FORMULA_NAME DES-PT-00b-LTLFireability-02
FORMULA_NAME DES-PT-00b-LTLFireability-03
FORMULA_NAME DES-PT-00b-LTLFireability-04
FORMULA_NAME DES-PT-00b-LTLFireability-05
FORMULA_NAME DES-PT-00b-LTLFireability-06
FORMULA_NAME DES-PT-00b-LTLFireability-07
FORMULA_NAME DES-PT-00b-LTLFireability-08
FORMULA_NAME DES-PT-00b-LTLFireability-09
FORMULA_NAME DES-PT-00b-LTLFireability-10
FORMULA_NAME DES-PT-00b-LTLFireability-11
FORMULA_NAME DES-PT-00b-LTLFireability-12
FORMULA_NAME DES-PT-00b-LTLFireability-13
FORMULA_NAME DES-PT-00b-LTLFireability-14
FORMULA_NAME DES-PT-00b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779647931177

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-00b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 18:38:53] [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-24 18:38:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 18:38:54] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2026-05-24 18:38:54] [INFO ] Transformed 271 places.
[2026-05-24 18:38:54] [INFO ] Transformed 230 transitions.
[2026-05-24 18:38:54] [INFO ] Found NUPN structural information;
[2026-05-24 18:38:54] [INFO ] Parsed PT model containing 271 places and 230 transitions and 658 arcs in 404 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DES-PT-00b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 230/230 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 269 transition count 230
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 24 place count 247 transition count 208
Iterating global reduction 1 with 22 rules applied. Total rules applied 46 place count 247 transition count 208
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 57 place count 236 transition count 197
Iterating global reduction 1 with 11 rules applied. Total rules applied 68 place count 236 transition count 197
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 77 place count 236 transition count 188
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 235 transition count 187
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 235 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 235 transition count 186
Applied a total of 80 rules in 181 ms. Remains 235 /271 variables (removed 36) and now considering 186/230 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13860277977070645504.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13412021786432966606.kers'
[2026-05-24 18:38:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13860277977070645504.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13412021786432966606.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 186 rows 235 cols 548 entries
Finished phase 1 with 138 SingleSign rule and 40 generalized
[2026-05-24 18:38:54] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13412021786432966606.kers
Total runtime 4 ms.
[2026-05-24 18:38:55] [INFO ] Implicit Places using invariants in 677 ms returned []
[2026-05-24 18:38:55] [INFO ] Invariant cache hit.
[2026-05-24 18:38:56] [INFO ] Implicit Places using invariants and state equation in 657 ms returned []
Implicit Place search using SMT with State Equation took 1410 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2026-05-24 18:38:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/235 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 10/87 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 15/102 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 186/421 variables, 235/337 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/421 variables, and 342 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/235 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 50/107 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 186/421 variables, 235/342 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 185/527 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 3/530 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/421 variables, and 531 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60166ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 60195ms
Starting structural reductions in LTL mode, iteration 1 : 235/271 places, 186/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61857 ms. Remains : 235/271 places, 186/230 transitions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 186/186 transitions.
Applied a total of 0 rules in 6 ms. Remains 235 /235 variables (removed 0) and now considering 186/186 (removed 0) transitions.
[2026-05-24 18:39:56] [INFO ] Invariant cache hit.
[2026-05-24 18:39:56] [INFO ] Implicit Places using invariants in 166 ms returned []
[2026-05-24 18:39:56] [INFO ] Invariant cache hit.
[2026-05-24 18:39:56] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 637 ms. Remains : 235/235 places, 186/186 transitions.
Support contains 44 out of 235 places after structural reductions.
[2026-05-24 18:39:57] [INFO ] Flatten gal took : 57 ms
[2026-05-24 18:39:57] [INFO ] Flatten gal took : 23 ms
[2026-05-24 18:39:57] [INFO ] Input system was already deterministic with 186 transitions.
Reduction of identical properties reduced properties to check from 34 to 33
RANDOM walk for 33251 steps (287 resets) in 1045 ms. (31 steps per ms) remains 0/33 properties
FORMULA DES-PT-00b-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 420 edges and 235 vertex of which 231 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.11 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X((G(p0)||X(p1))))||(p0&&X(p2))))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 186/186 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 229 transition count 180
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 229 transition count 180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 229 transition count 177
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 226 transition count 174
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 226 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 226 transition count 173
Applied a total of 22 rules in 23 ms. Remains 226 /235 variables (removed 9) and now considering 173/186 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1206825849188677425.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-121049101870028144.kers'
[2026-05-24 18:39:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1206825849188677425.kers, --Pflows, --basisKERS=/tmp/petrispot-output-121049101870028144.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 173 rows 226 cols 513 entries
Finished phase 1 with 130 SingleSign rule and 39 generalized
[2026-05-24 18:39:58] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-121049101870028144.kers
Total runtime 1 ms.
[2026-05-24 18:39:58] [INFO ] Implicit Places using invariants in 227 ms returned []
[2026-05-24 18:39:58] [INFO ] Invariant cache hit.
[2026-05-24 18:39:59] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2026-05-24 18:39:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 173/399 variables, 226/323 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/399 variables, and 330 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 45/102 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 6/108 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 173/399 variables, 226/334 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 172/506 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 8/514 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/516 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/399 variables, and 516 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Starting structural reductions in LTL mode, iteration 1 : 226/235 places, 173/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60751 ms. Remains : 226/235 places, 173/186 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X((G(p0)||X(p1))))||(p0&&X(p2))))))'
Stuttering acceptance computed with spot in 731 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : DES-PT-00b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 3 ms.
FORMULA DES-PT-00b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00b-LTLFireability-01 finished in 61611 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F((X(p0)&&G(p1)))))&&F(((!p2&&X(p3))||G(p3)))))'
Support contains 6 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 186/186 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 230 transition count 181
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 230 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 230 transition count 178
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 228 transition count 176
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 228 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 228 transition count 175
Applied a total of 18 rules in 43 ms. Remains 228 /235 variables (removed 7) and now considering 175/186 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-61262268878519014.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3229507900930119791.kers'
[2026-05-24 18:41:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-61262268878519014.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3229507900930119791.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 175 rows 228 cols 519 entries
Finished phase 1 with 131 SingleSign rule and 40 generalized
[2026-05-24 18:41:00] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3229507900930119791.kers
Total runtime 3 ms.
[2026-05-24 18:41:00] [INFO ] Implicit Places using invariants in 255 ms returned []
[2026-05-24 18:41:00] [INFO ] Invariant cache hit.
[2026-05-24 18:41:00] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2026-05-24 18:41:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/228 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 11/88 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (OVERLAPS) 175/403 variables, 228/337 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/403 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/403 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 403/403 variables, and 342 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/228 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 55/112 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 175/403 variables, 228/340 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 174/514 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 3/517 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 7/524 constraints. Problems are: Problem set: 0 solved, 174 unsolved
SMT process timed out in 60045ms, After SMT, problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 60048ms
Starting structural reductions in LTL mode, iteration 1 : 228/235 places, 175/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60706 ms. Remains : 228/235 places, 175/186 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F((X(p0)&&G(p1)))))&&F(((p2&&X(p3))||G(p3)))))'
Stuttering acceptance computed with spot in 401 ms :[(OR (NOT p1) (NOT p3) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p3), (NOT p3), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-00b-LTLFireability-02
Stuttering criterion allowed to conclude after 132 steps with 4 reset in 4 ms.
FORMULA DES-PT-00b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00b-LTLFireability-02 finished in 61189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))&&X(X((X(p2)&&(!p2 U (p3||G(!p2))))))))'
Support contains 6 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 186/186 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 230 transition count 181
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 230 transition count 181
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 230 transition count 179
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 227 transition count 176
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 227 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 227 transition count 175
Applied a total of 19 rules in 35 ms. Remains 227 /235 variables (removed 8) and now considering 175/186 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13042220274767593481.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17971120654419207445.kers'
[2026-05-24 18:42:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13042220274767593481.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17971120654419207445.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 175 rows 227 cols 519 entries
Finished phase 1 with 131 SingleSign rule and 39 generalized
[2026-05-24 18:42:01] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17971120654419207445.kers
Total runtime 3 ms.
[2026-05-24 18:42:01] [INFO ] Implicit Places using invariants in 236 ms returned []
[2026-05-24 18:42:01] [INFO ] Invariant cache hit.
[2026-05-24 18:42:01] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2026-05-24 18:42:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/227 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 10/87 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 5/92 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 175/402 variables, 227/319 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 402/402 variables, and 327 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/227 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 39/96 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 175/402 variables, 227/323 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 174/497 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 7/504 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 8/515 constraints. Problems are: Problem set: 0 solved, 174 unsolved
SMT process timed out in 60060ms, After SMT, problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Starting structural reductions in LTL mode, iteration 1 : 227/235 places, 175/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60853 ms. Remains : 227/235 places, 175/186 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))&&X(X((X(p2)&&(!p2 U (p3||G(!p2))))))))'
Stuttering acceptance computed with spot in 392 ms :[(OR (NOT p2) (NOT p1) (NOT p3)), (NOT p1), (OR (NOT p3) (NOT p2)), (NOT p1), true, (OR (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p3) p2)]
Running random walk in product with property : DES-PT-00b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DES-PT-00b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00b-LTLFireability-03 finished in 61302 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(p0)) U p1))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 186/186 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 230 transition count 181
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 230 transition count 181
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 230 transition count 179
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 227 transition count 176
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 227 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 227 transition count 175
Applied a total of 19 rules in 26 ms. Remains 227 /235 variables (removed 8) and now considering 175/186 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4763662954258649182.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15017811093855246143.kers'
[2026-05-24 18:43:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4763662954258649182.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15017811093855246143.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 175 rows 227 cols 519 entries
Finished phase 1 with 131 SingleSign rule and 39 generalized
[2026-05-24 18:43:02] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15017811093855246143.kers
Total runtime 2 ms.
[2026-05-24 18:43:02] [INFO ] Implicit Places using invariants in 240 ms returned []
[2026-05-24 18:43:02] [INFO ] Invariant cache hit.
[2026-05-24 18:43:03] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 227/235 places, 175/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 648 ms. Remains : 227/235 places, 175/186 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(p0)) U p1))'
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : DES-PT-00b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 1 ms.
FORMULA DES-PT-00b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00b-LTLFireability-04 finished in 801 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||(X(G(p1))&&F(p2)))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 186/186 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 229 transition count 180
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 229 transition count 180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 229 transition count 177
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 226 transition count 174
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 226 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 226 transition count 173
Applied a total of 22 rules in 10 ms. Remains 226 /235 variables (removed 9) and now considering 173/186 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18208662173261645709.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9606806876503395225.kers'
[2026-05-24 18:43:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18208662173261645709.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9606806876503395225.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 173 rows 226 cols 513 entries
Finished phase 1 with 130 SingleSign rule and 39 generalized
[2026-05-24 18:43:03] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9606806876503395225.kers
Total runtime 2 ms.
[2026-05-24 18:43:03] [INFO ] Implicit Places using invariants in 181 ms returned []
[2026-05-24 18:43:03] [INFO ] Invariant cache hit.
[2026-05-24 18:43:03] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2026-05-24 18:43:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 173/399 variables, 226/323 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 13 (OVERLAPS) 0/399 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/399 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 15 (OVERLAPS) 0/399 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 332 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 45/102 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 6/108 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 173/399 variables, 226/334 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 172/506 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 8/514 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 4/518 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/399 variables, and 519 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60046ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 60048ms
Starting structural reductions in LTL mode, iteration 1 : 226/235 places, 173/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60660 ms. Remains : 226/235 places, 173/186 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||(X(G(p1))&&F(p2)))))'
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : DES-PT-00b-LTLFireability-05
Product exploration explored 100000 steps with 33333 reset in 576 ms.
Product exploration explored 100000 steps with 33333 reset in 282 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 401 edges and 226 vertex of which 224 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 9 factoid took 16 ms. Proved property starting from automaton with 5 states, 9 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 31 ms.
FORMULA DES-PT-00b-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-00b-LTLFireability-05 finished in 61856 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p1&&G(p2)))))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 186/186 transitions.
Graph (complete) has 420 edges and 235 vertex of which 231 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 230 transition count 164
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 213 transition count 164
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 35 place count 213 transition count 153
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 57 place count 202 transition count 153
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 62 place count 197 transition count 148
Iterating global reduction 2 with 5 rules applied. Total rules applied 67 place count 197 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 197 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 70 place count 197 transition count 144
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 196 transition count 144
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 194 transition count 142
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 194 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 194 transition count 141
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 77 place count 194 transition count 140
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 79 place count 193 transition count 140
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 215 place count 125 transition count 72
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 4 with 4 rules applied. Total rules applied 219 place count 123 transition count 74
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 221 place count 123 transition count 74
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 223 place count 121 transition count 72
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 225 place count 119 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 227 place count 118 transition count 71
Applied a total of 227 rules in 77 ms. Remains 118 /235 variables (removed 117) and now considering 71/186 (removed 115) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7052088604859964124.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3319606105839755343.kers'
[2026-05-24 18:44:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7052088604859964124.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3319606105839755343.kers]
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 0 ms.
// Phase 1: matrix 71 rows 89 cols 237 entries
Finished phase 1 with 56 SingleSign rule and 7 generalized
[2026-05-24 18:44:05] [INFO ] Computed 55 invariants in 0 ms
Computed 55 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3319606105839755343.kers
Total runtime 1 ms.
[2026-05-24 18:44:05] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-24 18:44:05] [INFO ] Invariant cache hit.
[2026-05-24 18:44:05] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2026-05-24 18:44:05] [INFO ] Redundant transitions in 2 ms returned []
Running 62 sub problems to find dead transitions.
[2026-05-24 18:44:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 10/39 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 6/118 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 71/189 variables, 118/173 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 0/189 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 173 constraints, problems are : Problem set: 0 solved, 62 unsolved in 3889 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 10/39 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 6/118 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 71/189 variables, 118/175 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 62/237 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 14 (OVERLAPS) 0/189 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 242 constraints, problems are : Problem set: 0 solved, 62 unsolved in 14949 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 18855ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 18856ms
Starting structural reductions in SI_LTL mode, iteration 1 : 118/235 places, 71/186 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19263 ms. Remains : 118/235 places, 71/186 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||(G(p1)&&p2))))'
Stuttering acceptance computed with spot in 74 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-00b-LTLFireability-06
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA DES-PT-00b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00b-LTLFireability-06 finished in 19364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((p0||X(F(p1)))) U (p0&&F(G(p2))))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 186/186 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 230 transition count 181
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 230 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 230 transition count 178
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 228 transition count 176
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 228 transition count 176
Applied a total of 17 rules in 17 ms. Remains 228 /235 variables (removed 7) and now considering 176/186 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10761597274421610207.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4927952971337438497.kers'
[2026-05-24 18:44:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10761597274421610207.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4927952971337438497.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 176 rows 228 cols 521 entries
Finished phase 1 with 132 SingleSign rule and 39 generalized
[2026-05-24 18:44:24] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4927952971337438497.kers
Total runtime 3 ms.
[2026-05-24 18:44:24] [INFO ] Implicit Places using invariants in 292 ms returned []
[2026-05-24 18:44:24] [INFO ] Invariant cache hit.
[2026-05-24 18:44:25] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2026-05-24 18:44:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/228 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 7/80 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 5/85 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 176/404 variables, 228/313 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 15/328 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 404/404 variables, and 332 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/228 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 45/102 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 6/108 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 6/114 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 176/404 variables, 228/342 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 175/517 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/404 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/404 variables, and 523 constraints, problems are : Problem set: 0 solved, 175 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 0/2 constraints]
After SMT, in 60046ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 60047ms
Starting structural reductions in LTL mode, iteration 1 : 228/235 places, 176/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60865 ms. Remains : 228/235 places, 176/186 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((p0||X(F(p1)))) U (p0&&F(G(p2))))))'
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : DES-PT-00b-LTLFireability-07
Product exploration explored 100000 steps with 19909 reset in 153 ms.
Product exploration explored 100000 steps with 20033 reset in 337 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 406 edges and 228 vertex of which 226 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge based reduction with 6 factoid took 91 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
RANDOM walk for 3336 steps (25 resets) in 34 ms. (95 steps per ms) remains 0/4 properties
Knowledge based reduction with 6 factoid took 148 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p1)]
[2026-05-24 18:45:26] [INFO ] Invariant cache hit.
[2026-05-24 18:45:26] [INFO ] [Real]Absence check using 37 positive place invariants in 20 ms returned sat
[2026-05-24 18:45:26] [INFO ] [Real]Absence check using 37 positive and 20 generalized place invariants in 22 ms returned sat
[2026-05-24 18:45:27] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2026-05-24 18:45:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 18:45:27] [INFO ] [Nat]Absence check using 37 positive place invariants in 23 ms returned sat
[2026-05-24 18:45:27] [INFO ] [Nat]Absence check using 37 positive and 20 generalized place invariants in 25 ms returned sat
[2026-05-24 18:45:28] [INFO ] [Nat]Absence check using state equation in 693 ms returned sat
[2026-05-24 18:45:28] [INFO ] Computed and/alt/rep : 174/285/174 causal constraints (skipped 1 transitions) in 13 ms.
[2026-05-24 18:45:29] [INFO ] Added : 173 causal constraints over 35 iterations in 1458 ms. Result :sat
Could not prove EG (NOT p2)
[2026-05-24 18:45:29] [INFO ] Invariant cache hit.
[2026-05-24 18:45:29] [INFO ] [Real]Absence check using 37 positive place invariants in 33 ms returned sat
[2026-05-24 18:45:29] [INFO ] [Real]Absence check using 37 positive and 20 generalized place invariants in 67 ms returned sat
[2026-05-24 18:45:30] [INFO ] [Real]Absence check using state equation in 899 ms returned sat
[2026-05-24 18:45:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 18:45:31] [INFO ] [Nat]Absence check using 37 positive place invariants in 22 ms returned sat
[2026-05-24 18:45:31] [INFO ] [Nat]Absence check using 37 positive and 20 generalized place invariants in 41 ms returned sat
[2026-05-24 18:45:31] [INFO ] [Nat]Absence check using state equation in 506 ms returned sat
[2026-05-24 18:45:31] [INFO ] Computed and/alt/rep : 174/285/174 causal constraints (skipped 1 transitions) in 15 ms.
[2026-05-24 18:45:32] [INFO ] Added : 173 causal constraints over 35 iterations in 1379 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 6859 ms.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p1)]
Support contains 3 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 228 /228 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2026-05-24 18:45:33] [INFO ] Invariant cache hit.
[2026-05-24 18:45:33] [INFO ] Implicit Places using invariants in 276 ms returned []
[2026-05-24 18:45:33] [INFO ] Invariant cache hit.
[2026-05-24 18:45:33] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 778 ms. Remains : 228/228 places, 176/176 transitions.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 406 edges and 228 vertex of which 226 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge based reduction with 6 factoid took 81 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
RANDOM walk for 2096 steps (15 resets) in 12 ms. (161 steps per ms) remains 0/4 properties
Knowledge based reduction with 6 factoid took 144 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p1)]
[2026-05-24 18:45:34] [INFO ] Invariant cache hit.
[2026-05-24 18:45:34] [INFO ] [Real]Absence check using 37 positive place invariants in 30 ms returned sat
[2026-05-24 18:45:34] [INFO ] [Real]Absence check using 37 positive and 20 generalized place invariants in 37 ms returned sat
[2026-05-24 18:45:35] [INFO ] [Real]Absence check using state equation in 737 ms returned sat
[2026-05-24 18:45:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 18:45:35] [INFO ] [Nat]Absence check using 37 positive place invariants in 29 ms returned sat
[2026-05-24 18:45:35] [INFO ] [Nat]Absence check using 37 positive and 20 generalized place invariants in 32 ms returned sat
[2026-05-24 18:45:36] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2026-05-24 18:45:36] [INFO ] Computed and/alt/rep : 174/285/174 causal constraints (skipped 1 transitions) in 12 ms.
[2026-05-24 18:45:37] [INFO ] Added : 173 causal constraints over 35 iterations in 1116 ms. Result :sat
Could not prove EG (NOT p2)
[2026-05-24 18:45:37] [INFO ] Invariant cache hit.
[2026-05-24 18:45:37] [INFO ] [Real]Absence check using 37 positive place invariants in 20 ms returned sat
[2026-05-24 18:45:37] [INFO ] [Real]Absence check using 37 positive and 20 generalized place invariants in 41 ms returned sat
[2026-05-24 18:45:38] [INFO ] [Real]Absence check using state equation in 681 ms returned sat
[2026-05-24 18:45:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 18:45:38] [INFO ] [Nat]Absence check using 37 positive place invariants in 21 ms returned sat
[2026-05-24 18:45:38] [INFO ] [Nat]Absence check using 37 positive and 20 generalized place invariants in 33 ms returned sat
[2026-05-24 18:45:38] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2026-05-24 18:45:38] [INFO ] Computed and/alt/rep : 174/285/174 causal constraints (skipped 1 transitions) in 12 ms.
[2026-05-24 18:45:39] [INFO ] Added : 173 causal constraints over 35 iterations in 902 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 5856 ms.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 19969 reset in 101 ms.
Product exploration explored 100000 steps with 19941 reset in 124 ms.
Spot run failed in 112 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/ltsmin17954335729437132947
[2026-05-24 18:45:40] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17954335729437132947
Running compilation step : cd /tmp/ltsmin17954335729437132947;'/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 752 ms.
Running link step : cd /tmp/ltsmin17954335729437132947;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin17954335729437132947;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased6126076182899727975.hoa' '--buchi-type=spotba'
LTSmin run took 64 ms.
FORMULA DES-PT-00b-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-00b-LTLFireability-07 finished in 76910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 186/186 transitions.
Graph (complete) has 420 edges and 235 vertex of which 231 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 230 transition count 164
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 213 transition count 164
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 35 place count 213 transition count 153
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 57 place count 202 transition count 153
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 62 place count 197 transition count 148
Iterating global reduction 2 with 5 rules applied. Total rules applied 67 place count 197 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 197 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 70 place count 197 transition count 144
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 196 transition count 144
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 194 transition count 142
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 194 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 77 place count 194 transition count 141
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 77 place count 194 transition count 140
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 79 place count 193 transition count 140
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 223 place count 121 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 4 with 4 rules applied. Total rules applied 227 place count 119 transition count 70
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 117 transition count 68
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 231 place count 115 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 233 place count 114 transition count 67
Applied a total of 233 rules in 50 ms. Remains 114 /235 variables (removed 121) and now considering 67/186 (removed 119) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13128535621834039151.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-396866181015036288.kers'
[2026-05-24 18:45:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13128535621834039151.kers, --Pflows, --basisKERS=/tmp/petrispot-output-396866181015036288.kers]
Culling duplicate invariants (modulo rational): removing 30 columns.
Culled 30 columns in 0 ms.
// Phase 1: matrix 67 rows 84 cols 226 entries
Finished phase 1 with 52 SingleSign rule and 7 generalized
[2026-05-24 18:45:41] [INFO ] Computed 55 invariants in 0 ms
Computed 55 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-396866181015036288.kers
Total runtime 1 ms.
[2026-05-24 18:45:41] [INFO ] Implicit Places using invariants in 192 ms returned []
[2026-05-24 18:45:41] [INFO ] Invariant cache hit.
[2026-05-24 18:45:41] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
[2026-05-24 18:45:41] [INFO ] Redundant transitions in 2 ms returned []
Running 59 sub problems to find dead transitions.
[2026-05-24 18:45:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 5/114 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 67/181 variables, 114/169 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (OVERLAPS) 0/181 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 170 constraints, problems are : Problem set: 0 solved, 59 unsolved in 4184 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 5/114 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 67/181 variables, 114/170 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 59/229 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (OVERLAPS) 0/181 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 231 constraints, problems are : Problem set: 0 solved, 59 unsolved in 6956 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11154ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 11155ms
Starting structural reductions in SI_LTL mode, iteration 1 : 114/235 places, 67/186 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11717 ms. Remains : 114/235 places, 67/186 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-00b-LTLFireability-08
Stuttering criterion allowed to conclude after 45 steps with 1 reset in 0 ms.
FORMULA DES-PT-00b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00b-LTLFireability-08 finished in 11806 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(p1)&&p0)))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 186/186 transitions.
Graph (complete) has 420 edges and 235 vertex of which 231 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 230 transition count 164
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 213 transition count 164
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 35 place count 213 transition count 154
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 55 place count 203 transition count 154
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 60 place count 198 transition count 149
Iterating global reduction 2 with 5 rules applied. Total rules applied 65 place count 198 transition count 149
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 198 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 68 place count 198 transition count 145
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 197 transition count 145
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 195 transition count 143
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 195 transition count 143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 195 transition count 142
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 75 place count 195 transition count 141
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 77 place count 194 transition count 141
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 221 place count 122 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 225 place count 120 transition count 71
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 227 place count 120 transition count 71
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 118 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 231 place count 116 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 233 place count 115 transition count 68
Applied a total of 233 rules in 52 ms. Remains 115 /235 variables (removed 120) and now considering 68/186 (removed 118) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18240894718087032908.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1425912707137481680.kers'
[2026-05-24 18:45:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18240894718087032908.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1425912707137481680.kers]
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 0 ms.
// Phase 1: matrix 68 rows 86 cols 231 entries
Finished phase 1 with 53 SingleSign rule and 7 generalized
[2026-05-24 18:45:53] [INFO ] Computed 55 invariants in 1 ms
Computed 55 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1425912707137481680.kers
Total runtime 1 ms.
[2026-05-24 18:45:53] [INFO ] Implicit Places using invariants in 163 ms returned []
[2026-05-24 18:45:53] [INFO ] Invariant cache hit.
[2026-05-24 18:45:53] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2026-05-24 18:45:53] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2026-05-24 18:45:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 5/115 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 68/183 variables, 115/170 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/183 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/183 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 172 constraints, problems are : Problem set: 0 solved, 60 unsolved in 5119 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 5/115 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 68/183 variables, 115/172 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 60/232 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/183 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 232 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4228 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9359ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 9360ms
Starting structural reductions in SI_LTL mode, iteration 1 : 115/235 places, 68/186 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9859 ms. Remains : 115/235 places, 68/186 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(p1)&&p0)))'
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DES-PT-00b-LTLFireability-09
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA DES-PT-00b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00b-LTLFireability-09 finished in 9952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 186/186 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 229 transition count 180
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 229 transition count 180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 229 transition count 177
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 226 transition count 174
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 226 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 226 transition count 173
Applied a total of 22 rules in 8 ms. Remains 226 /235 variables (removed 9) and now considering 173/186 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-302589704738471311.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17990836946309879161.kers'
[2026-05-24 18:46:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-302589704738471311.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17990836946309879161.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 173 rows 226 cols 513 entries
Finished phase 1 with 130 SingleSign rule and 39 generalized
[2026-05-24 18:46:03] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17990836946309879161.kers
Total runtime 1 ms.
[2026-05-24 18:46:03] [INFO ] Implicit Places using invariants in 177 ms returned []
[2026-05-24 18:46:03] [INFO ] Invariant cache hit.
[2026-05-24 18:46:03] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2026-05-24 18:46:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 173/399 variables, 226/323 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/399 variables, and 330 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 45/102 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 6/108 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 173/399 variables, 226/334 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 172/506 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 8/514 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/516 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/399 variables, and 516 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60046ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 60048ms
Starting structural reductions in LTL mode, iteration 1 : 226/235 places, 173/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60608 ms. Remains : 226/235 places, 173/186 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-00b-LTLFireability-11
Product exploration explored 100000 steps with 900 reset in 508 ms.
Product exploration explored 100000 steps with 913 reset in 271 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 401 edges and 226 vertex of which 224 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge based reduction with 4 factoid took 49 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 463 steps (2 resets) in 5 ms. (77 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 58 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 33 ms :[(NOT p0)]
Knowledge-based reduction took 148 ms.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 1 out of 226 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 : 226/226 places, 173/173 transitions.
Graph (complete) has 401 edges and 226 vertex of which 224 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 223 transition count 153
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 206 transition count 153
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 35 place count 206 transition count 140
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 61 place count 193 transition count 140
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 201 place count 123 transition count 70
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 2 with 4 rules applied. Total rules applied 205 place count 121 transition count 72
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 207 place count 119 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 208 place count 118 transition count 70
Applied a total of 208 rules in 22 ms. Remains 118 /226 variables (removed 108) and now considering 70/173 (removed 103) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15755811894365301540.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7172133010720029692.kers'
[2026-05-24 18:47:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15755811894365301540.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7172133010720029692.kers]
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 0 ms.
// Phase 1: matrix 70 rows 102 cols 278 entries
Finished phase 1 with 38 SingleSign rule and 24 generalized
[2026-05-24 18:47:04] [INFO ] Computed 56 invariants in 0 ms
Computed 56 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7172133010720029692.kers
Total runtime 1 ms.
[2026-05-24 18:47:05] [INFO ] Implicit Places using invariants in 210 ms returned []
[2026-05-24 18:47:05] [INFO ] Invariant cache hit.
[2026-05-24 18:47:05] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
[2026-05-24 18:47:05] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2026-05-24 18:47:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 6/118 variables, 23/54 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 70/188 variables, 118/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 0/188 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 174 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3924 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 6/118 variables, 23/54 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 70/188 variables, 118/174 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 61/235 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/188 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 239 constraints, problems are : Problem set: 0 solved, 61 unsolved in 10912 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14846ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 14847ms
Starting structural reductions in SI_LTL mode, iteration 1 : 118/226 places, 70/173 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15420 ms. Remains : 118/226 places, 70/173 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 3 factoid took 47 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 187 steps (15 resets) in 4 ms. (37 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 56 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 36 ms :[(NOT p0)]
Knowledge-based reduction took 144 ms.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6126 reset in 341 ms.
Product exploration explored 100000 steps with 6200 reset in 405 ms.
Built C files in :
/tmp/ltsmin13932437896107685578
[2026-05-24 18:47:21] [INFO ] Computing symmetric may disable matrix : 70 transitions.
[2026-05-24 18:47:21] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 18:47:21] [INFO ] Computing symmetric may enable matrix : 70 transitions.
[2026-05-24 18:47:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 18:47:21] [INFO ] Computing Do-Not-Accords matrix : 70 transitions.
[2026-05-24 18:47:21] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 18:47:21] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13932437896107685578
Running compilation step : cd /tmp/ltsmin13932437896107685578;'/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 432 ms.
Running link step : cd /tmp/ltsmin13932437896107685578;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin13932437896107685578;'/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/stateBased8794697571264664972.hoa' '--buchi-type=spotba'
LTSmin run took 107 ms.
FORMULA DES-PT-00b-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-00b-LTLFireability-11 finished in 78834 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 X(X(X(!p0)))))))'
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 186/186 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 230 transition count 181
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 230 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 230 transition count 178
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 228 transition count 176
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 228 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 228 transition count 175
Applied a total of 18 rules in 16 ms. Remains 228 /235 variables (removed 7) and now considering 175/186 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2675780458748187198.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6629230120658877012.kers'
[2026-05-24 18:47:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2675780458748187198.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6629230120658877012.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 175 rows 228 cols 516 entries
Finished phase 1 with 132 SingleSign rule and 39 generalized
[2026-05-24 18:47:22] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6629230120658877012.kers
Total runtime 3 ms.
[2026-05-24 18:47:22] [INFO ] Implicit Places using invariants in 272 ms returned []
[2026-05-24 18:47:22] [INFO ] Invariant cache hit.
[2026-05-24 18:47:22] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2026-05-24 18:47:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/228 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 8/88 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 11 (OVERLAPS) 175/403 variables, 228/318 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/403 variables, 14/332 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 403/403 variables, and 332 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/228 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 47/104 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 175/403 variables, 228/332 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 174/506 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 8/514 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 3/517 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 403/403 variables, and 518 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60042ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 60044ms
Starting structural reductions in LTL mode, iteration 1 : 228/235 places, 175/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60797 ms. Remains : 228/235 places, 175/186 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U X(X(X(!p0)))))))'
Stuttering acceptance computed with spot in 261 ms :[p0, p0, p0, p0, p0, true, p0]
Running random walk in product with property : DES-PT-00b-LTLFireability-12
Product exploration explored 100000 steps with 16674 reset in 160 ms.
Product exploration explored 100000 steps with 16730 reset in 179 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 402 edges and 228 vertex of which 224 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 7 states, 9 edges and 1 AP (stutter sensitive) to 7 states, 9 edges and 1 AP (stutter sensitive).
RANDOM walk for 1618 steps (12 resets) in 12 ms. (124 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 7 states, 9 edges and 1 AP (stutter sensitive) to 7 states, 9 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[p0, p0, p0, p0, p0, true, p0]
Knowledge-based reduction took 505 ms.
Stuttering acceptance computed with spot in 241 ms :[p0, p0, p0, p0, p0, true, p0]
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 175/175 transitions.
Applied a total of 0 rules in 3 ms. Remains 228 /228 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2026-05-24 18:48:24] [INFO ] Invariant cache hit.
[2026-05-24 18:48:24] [INFO ] Implicit Places using invariants in 174 ms returned []
[2026-05-24 18:48:24] [INFO ] Invariant cache hit.
[2026-05-24 18:48:24] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 578 ms. Remains : 228/228 places, 175/175 transitions.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 402 edges and 228 vertex of which 224 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 7 states, 9 edges and 1 AP (stutter sensitive) to 7 states, 9 edges and 1 AP (stutter sensitive).
RANDOM walk for 1424 steps (10 resets) in 12 ms. (109 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 7 states, 9 edges and 1 AP (stutter sensitive) to 7 states, 9 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[p0, p0, p0, p0, p0, true, p0]
Knowledge-based reduction took 416 ms.
Stuttering acceptance computed with spot in 211 ms :[p0, p0, p0, p0, p0, true, p0]
Stuttering acceptance computed with spot in 267 ms :[p0, p0, p0, p0, p0, true, p0]
Product exploration explored 100000 steps with 16627 reset in 143 ms.
Product exploration explored 100000 steps with 16692 reset in 158 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/ltsmin8410712744328510769
[2026-05-24 18:48:26] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8410712744328510769
Running compilation step : cd /tmp/ltsmin8410712744328510769;'/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 674 ms.
Running link step : cd /tmp/ltsmin8410712744328510769;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin8410712744328510769;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased2474634333106619864.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 175/175 transitions.
Applied a total of 0 rules in 3 ms. Remains 228 /228 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2026-05-24 18:48:41] [INFO ] Invariant cache hit.
[2026-05-24 18:48:41] [INFO ] Implicit Places using invariants in 181 ms returned []
[2026-05-24 18:48:41] [INFO ] Invariant cache hit.
[2026-05-24 18:48:41] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 491 ms. Remains : 228/228 places, 175/175 transitions.
Built C files in :
/tmp/ltsmin7758204545459941454
[2026-05-24 18:48:41] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7758204545459941454
Running compilation step : cd /tmp/ltsmin7758204545459941454;'/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 675 ms.
Running link step : cd /tmp/ltsmin7758204545459941454;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin7758204545459941454;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased3397233600315686825.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-24 18:48:56] [INFO ] Flatten gal took : 14 ms
[2026-05-24 18:48:56] [INFO ] Flatten gal took : 14 ms
[2026-05-24 18:48:56] [INFO ] Time to serialize gal into /tmp/LTL13575240720330282696.gal : 5 ms
[2026-05-24 18:48:56] [INFO ] Time to serialize properties into /tmp/LTL12119174130971760624.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13575240720330282696.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14878515583701642550.hoa' '-atoms' '/tmp/LTL12119174130971760624.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...320
Loading property file /tmp/LTL12119174130971760624.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14878515583701642550.hoa
Detected timeout of ITS tools.
[2026-05-24 18:49:11] [INFO ] Flatten gal took : 13 ms
[2026-05-24 18:49:11] [INFO ] Flatten gal took : 13 ms
[2026-05-24 18:49:11] [INFO ] Time to serialize gal into /tmp/LTL1780829330741519652.gal : 3 ms
[2026-05-24 18:49:11] [INFO ] Time to serialize properties into /tmp/LTL4138576377413259644.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1780829330741519652.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4138576377413259644.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G(("(p70==1)")U(X(X(X("(p70!=1)"))))))))
Formula 0 simplified : XF(!"(p70==1)" R XXX!"(p70!=1)")
Detected timeout of ITS tools.
[2026-05-24 18:49:26] [INFO ] Flatten gal took : 12 ms
[2026-05-24 18:49:26] [INFO ] Applying decomposition
[2026-05-24 18:49:26] [INFO ] Flatten gal took : 12 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/graph8396589809139420747.txt' '-o' '/tmp/graph8396589809139420747.bin' '-w' '/tmp/graph8396589809139420747.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8396589809139420747.bin' '-l' '-1' '-v' '-w' '/tmp/graph8396589809139420747.weights' '-q' '0' '-e' '0.001'
[2026-05-24 18:49:26] [INFO ] Decomposing Gal with order
[2026-05-24 18:49:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 18:49:27] [INFO ] Removed a total of 11 redundant transitions.
[2026-05-24 18:49:27] [INFO ] Flatten gal took : 136 ms
[2026-05-24 18:49:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 17 ms.
[2026-05-24 18:49:27] [INFO ] Time to serialize gal into /tmp/LTL4116020523054202082.gal : 13 ms
[2026-05-24 18:49:27] [INFO ] Time to serialize properties into /tmp/LTL402090615704804873.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/LTL4116020523054202082.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL402090615704804873.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(G(("(i2.i1.u17.p70==1)")U(X(X(X("(i2.i1.u17.p70!=1)"))))))))
Formula 0 simplified : XF(!"(i2.i1.u17.p70==1)" R XXX!"(i2.i1.u17.p70!=1)")
Reverse transition relation is NOT exact ! Due to transitions t49, t57, t88, t144, t145, i0.u10.t111, i1.t132, i1.t122, i1.u3.t129, i1.u3.t130, i1.u4.t125,...715
Computing Next relation with stutter on 82586 deadlock states
Detected timeout of ITS tools.
Treatment of property DES-PT-00b-LTLFireability-12 finished in 140238 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(((p0&&F((G(F((G(F(!p1))||(F(!p1)&&X(X(!p2))))))||(!p2&&F((G(F(!p1))||(F(!p1)&&X(X(!p2))))))))) U (G((p0&&F((G(F((G(F(!p1))||(F(!p1)&&X(X(!p2))))))||(!p2&&F((G(F(!p1))||(F(!p1)&&X(X(!p2))))))))))||(F((G(F((G(F(!p1))||(F(!p1)&&X(X(!p2))))))||(!p2&&F((G(F(!p1))||(F(!p1)&&X(X(!p2))))))))&&p3))))))'
Support contains 6 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 186/186 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 229 transition count 180
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 229 transition count 180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 229 transition count 177
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 226 transition count 174
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 226 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 226 transition count 173
Applied a total of 22 rules in 9 ms. Remains 226 /235 variables (removed 9) and now considering 173/186 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7278918411264276165.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7567931123466252832.kers'
[2026-05-24 18:49:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7278918411264276165.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7567931123466252832.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 173 rows 226 cols 513 entries
Finished phase 1 with 130 SingleSign rule and 39 generalized
[2026-05-24 18:49:42] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7567931123466252832.kers
Total runtime 3 ms.
[2026-05-24 18:49:42] [INFO ] Implicit Places using invariants in 190 ms returned []
[2026-05-24 18:49:42] [INFO ] Invariant cache hit.
[2026-05-24 18:49:43] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2026-05-24 18:49:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 173/399 variables, 226/323 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 399/399 variables, and 330 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 45/102 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 6/108 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 173/399 variables, 226/334 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 172/506 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 8/514 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/516 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/399 variables, and 516 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60042ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 60043ms
Starting structural reductions in LTL mode, iteration 1 : 226/235 places, 173/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60757 ms. Remains : 226/235 places, 173/186 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(((p0&&F((G(F((G(F(!p1))||(F(!p1)&&X(X(!p2))))))||(!p2&&F((G(F(!p1))||(F(!p1)&&X(X(!p2))))))))) U (G((p0&&F((G(F((G(F(!p1))||(F(!p1)&&X(X(!p2))))))||(!p2&&F((G(F(!p1))||(F(!p1)&&X(X(!p2))))))))))||(F((G(F((G(F(!p1))||(F(!p1)&&X(X(!p2))))))||(!p2&&F((G(F(!p1))||(F(!p1)&&X(X(!p2))))))))&&p3))))))'
Stuttering acceptance computed with spot in 332 ms :[(OR p1 (AND (NOT p0) (NOT p3))), (OR p1 (AND (NOT p0) (NOT p3))), (OR p1 (AND (NOT p0) (NOT p3))), true, p1, (AND p1 p2), p1, (AND p1 p2), (AND p1 p2)]
Running random walk in product with property : DES-PT-00b-LTLFireability-13
Product exploration explored 100000 steps with 20000 reset in 140 ms.
Product exploration explored 100000 steps with 20000 reset in 188 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 401 edges and 226 vertex of which 224 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Detected a total of 26/226 stabilizing places and 26/173 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge based reduction with 11 factoid took 141 ms. Reduced automaton from 9 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (350 resets) in 177 ms. (224 steps per ms) remains 1/3 properties
BEST_FIRST walk for 33378 steps (44 resets) in 109 ms. (303 steps per ms) remains 0/1 properties
Knowledge based reduction with 11 factoid took 182 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 363 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), p1, (AND p1 p2), (AND p1 p2)]
Knowledge-based reduction took 790 ms.
Stuttering acceptance computed with spot in 360 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), p1, (AND p1 p2), (AND p1 p2)]
Support contains 3 out of 226 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 173/173 transitions.
Applied a total of 0 rules in 5 ms. Remains 226 /226 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2026-05-24 18:50:45] [INFO ] Invariant cache hit.
[2026-05-24 18:50:45] [INFO ] Implicit Places using invariants in 286 ms returned []
[2026-05-24 18:50:45] [INFO ] Invariant cache hit.
[2026-05-24 18:50:45] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 780 ms. Remains : 226/226 places, 173/173 transitions.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 401 edges and 226 vertex of which 224 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (367 resets) in 154 ms. (258 steps per ms) remains 1/3 properties
BEST_FIRST walk for 38267 steps (59 resets) in 98 ms. (386 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 135 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 363 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), p1, (AND p1 p2), (AND p1 p2)]
Knowledge-based reduction took 664 ms.
Stuttering acceptance computed with spot in 360 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), p1, (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 361 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), p1, (AND p1 p2), (AND p1 p2)]
Product exploration explored 100000 steps with 20000 reset in 134 ms.
Product exploration explored 100000 steps with 20000 reset in 153 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/ltsmin15420183942829639615
[2026-05-24 18:50:47] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15420183942829639615
Running compilation step : cd /tmp/ltsmin15420183942829639615;'/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 691 ms.
Running link step : cd /tmp/ltsmin15420183942829639615;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin15420183942829639615;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased7106080029534543161.hoa' '--buchi-type=spotba'
LTSmin run took 42 ms.
FORMULA DES-PT-00b-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-00b-LTLFireability-13 finished in 66228 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 186/186 transitions.
Graph (complete) has 420 edges and 235 vertex of which 231 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 230 transition count 164
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 213 transition count 164
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 35 place count 213 transition count 153
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 57 place count 202 transition count 153
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 198 transition count 149
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 198 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 198 transition count 147
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 69 place count 196 transition count 145
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 196 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 196 transition count 144
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 72 place count 196 transition count 143
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 74 place count 195 transition count 143
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 210 place count 127 transition count 75
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 216 place count 124 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 218 place count 122 transition count 76
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 220 place count 120 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 222 place count 119 transition count 75
Applied a total of 222 rules in 57 ms. Remains 119 /235 variables (removed 116) and now considering 75/186 (removed 111) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1150974220088193616.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16012059325085175412.kers'
[2026-05-24 18:50:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1150974220088193616.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16012059325085175412.kers]
Culling duplicate invariants (modulo rational): removing 11 columns.
Culled 11 columns in 0 ms.
// Phase 1: matrix 75 rows 108 cols 319 entries
Finished phase 1 with 41 SingleSign rule and 23 generalized
[2026-05-24 18:50:48] [INFO ] Computed 55 invariants in 1 ms
Computed 55 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16012059325085175412.kers
Total runtime 2 ms.
[2026-05-24 18:50:48] [INFO ] Implicit Places using invariants in 192 ms returned []
[2026-05-24 18:50:48] [INFO ] Invariant cache hit.
[2026-05-24 18:50:49] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2026-05-24 18:50:49] [INFO ] Redundant transitions in 2 ms returned []
Running 66 sub problems to find dead transitions.
[2026-05-24 18:50:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 6/119 variables, 26/44 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 75/194 variables, 119/174 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/194 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 177 constraints, problems are : Problem set: 0 solved, 66 unsolved in 5991 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 6/119 variables, 26/45 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 75/194 variables, 119/176 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 66/242 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 13 (OVERLAPS) 0/194 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 244 constraints, problems are : Problem set: 0 solved, 66 unsolved in 15074 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 21076ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 21077ms
Starting structural reductions in SI_LTL mode, iteration 1 : 119/235 places, 75/186 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21677 ms. Remains : 119/235 places, 75/186 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-00b-LTLFireability-14
Stuttering criterion allowed to conclude after 649 steps with 70 reset in 5 ms.
FORMULA DES-PT-00b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00b-LTLFireability-14 finished in 21783 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 X(X(X(!p0)))))))'
Spot run failed in 50 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-24 18:51:10] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13303984079068982849
[2026-05-24 18:51:10] [INFO ] Computing symmetric may disable matrix : 186 transitions.
[2026-05-24 18:51:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 18:51:10] [INFO ] Computing symmetric may enable matrix : 186 transitions.
[2026-05-24 18:51:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 18:51:10] [INFO ] Applying decomposition
[2026-05-24 18:51:10] [INFO ] Computing Do-Not-Accords matrix : 186 transitions.
[2026-05-24 18:51:10] [INFO ] Flatten gal took : 9 ms
[2026-05-24 18:51:10] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 18:51:10] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13303984079068982849
Running compilation step : cd /tmp/ltsmin13303984079068982849;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/graph14985832328017308689.txt' '-o' '/tmp/graph14985832328017308689.bin' '-w' '/tmp/graph14985832328017308689.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14985832328017308689.bin' '-l' '-1' '-v' '-w' '/tmp/graph14985832328017308689.weights' '-q' '0' '-e' '0.001'
[2026-05-24 18:51:10] [INFO ] Decomposing Gal with order
[2026-05-24 18:51:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 18:51:10] [INFO ] Removed a total of 18 redundant transitions.
[2026-05-24 18:51:10] [INFO ] Flatten gal took : 28 ms
[2026-05-24 18:51:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 8 ms.
[2026-05-24 18:51:10] [INFO ] Time to serialize gal into /tmp/LTLFireability15291025485361485274.gal : 11 ms
[2026-05-24 18:51:10] [INFO ] Time to serialize properties into /tmp/LTLFireability13757353258451597471.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15291025485361485274.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13757353258451597471.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(G(("(i4.u17.p70==1)")U(X(X(X("(i4.u17.p70!=1)"))))))))
Formula 0 simplified : XF(!"(i4.u17.p70==1)" R XXX!"(i4.u17.p70!=1)")
Compilation finished in 731 ms.
Running link step : cd /tmp/ltsmin13303984079068982849;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13303984079068982849;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X([](((LTLAPp0==true) U X(X(X(!(LTLAPp0==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t49, t57, t88, t122, t144, t145, t156, t178, i0.u33.t75, i0.u72.t21, i0.u72.t24, i1.i0.u10.t1...710
Computing Next relation with stutter on 350859 deadlock states
268 unique states visited
268 strongly connected components in search stack
269 transitions explored
268 items max in DFS search stack
15584 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,155.889,2197436,1,0,6.67704e+06,1260,1946,2.85879e+06,237,5311,1129238
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DES-PT-00b-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 896846 ms.

BK_STOP 1779648830557

--------------------
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="DES-PT-00b"
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 DES-PT-00b, 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 r082-smll-177946993700308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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