About the Execution of ITS-Tools for FileSystem-PT-N03I10B08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3040.239 | 1061453.00 | 1424452.00 | 3383.30 | FFTTFFFFFFTFFTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r338-smll-178021499300436.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 FileSystem-PT-N03I10B08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499300436
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 8.2K May 27 10:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 27 10:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 27 10:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 27 10:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Jun 16 12:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 16 12:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 16 12:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 16 12:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 16K May 27 10:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K May 27 10:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 27 10:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K May 27 10:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 16 12:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 16 12:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 10 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 191K Jun 10 11:57 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 FileSystem-PT-N03I10B08-LTLFireability-00
FORMULA_NAME FileSystem-PT-N03I10B08-LTLFireability-01
FORMULA_NAME FileSystem-PT-N03I10B08-LTLFireability-02
FORMULA_NAME FileSystem-PT-N03I10B08-LTLFireability-03
FORMULA_NAME FileSystem-PT-N03I10B08-LTLFireability-04
FORMULA_NAME FileSystem-PT-N03I10B08-LTLFireability-05
FORMULA_NAME FileSystem-PT-N03I10B08-LTLFireability-06
FORMULA_NAME FileSystem-PT-N03I10B08-LTLFireability-07
FORMULA_NAME FileSystem-PT-N03I10B08-LTLFireability-08
FORMULA_NAME FileSystem-PT-N03I10B08-LTLFireability-09
FORMULA_NAME FileSystem-PT-N03I10B08-LTLFireability-10
FORMULA_NAME FileSystem-PT-N03I10B08-LTLFireability-11
FORMULA_NAME FileSystem-PT-N03I10B08-LTLFireability-12
FORMULA_NAME FileSystem-PT-N03I10B08-LTLFireability-13
FORMULA_NAME FileSystem-PT-N03I10B08-LTLFireability-14
FORMULA_NAME FileSystem-PT-N03I10B08-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1781618228023
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FileSystem-PT-N03I10B08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-06-16 13:57:10] [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-06-16 13:57:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-16 13:57:10] [INFO ] Load time of PNML (sax parser for PT used): 214 ms
[2026-06-16 13:57:10] [INFO ] Transformed 455 places.
[2026-06-16 13:57:10] [INFO ] Transformed 420 transitions.
[2026-06-16 13:57:10] [INFO ] Parsed PT model containing 455 places and 420 transitions and 1490 arcs in 427 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 10 places and 0 transitions.
FORMULA FileSystem-PT-N03I10B08-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N03I10B08-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 445 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 445/445 places, 420/420 transitions.
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 365 transition count 420
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 147 place count 298 transition count 353
Iterating global reduction 1 with 67 rules applied. Total rules applied 214 place count 298 transition count 353
Applied a total of 214 rules in 78 ms. Remains 298 /445 variables (removed 147) and now considering 353/420 (removed 67) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15675108103002102510.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12882922887967600092.kers'
[2026-06-16 13:57:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15675108103002102510.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12882922887967600092.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 353 rows 290 cols 969 entries
Finished phase 1 with 280 SingleSign rule and 0 generalized
[2026-06-16 13:57:11] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12882922887967600092.kers
Total runtime 5 ms.
[2026-06-16 13:57:12] [INFO ] Implicit Places using invariants in 915 ms returned []
[2026-06-16 13:57:12] [INFO ] Invariant cache hit.
[2026-06-16 13:57:12] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:57:13] [INFO ] Implicit Places using invariants and state equation in 1517 ms returned []
Implicit Place search using SMT with State Equation took 2494 ms to find 0 implicit places.
Running 343 sub problems to find dead transitions.
[2026-06-16 13:57:13] [INFO ] Invariant cache hit.
[2026-06-16 13:57:13] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/287 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 2 (OVERLAPS) 11/298 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 298/651 variables, and 49 constraints, problems are : Problem set: 0 solved, 343 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/298 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 343/343 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 343 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/287 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 3 (OVERLAPS) 11/298 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 24/49 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 9 (OVERLAPS) 353/651 variables, 298/359 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 651/651 variables, and 439 constraints, problems are : Problem set: 0 solved, 343 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 298/298 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 0/343 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60295ms problems are : Problem set: 0 solved, 343 unsolved
Search for dead transitions found 0 dead transitions in 60328ms
Starting structural reductions in LTL mode, iteration 1 : 298/445 places, 353/420 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62958 ms. Remains : 298/445 places, 353/420 transitions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 353/353 transitions.
Applied a total of 0 rules in 13 ms. Remains 298 /298 variables (removed 0) and now considering 353/353 (removed 0) transitions.
[2026-06-16 13:58:14] [INFO ] Invariant cache hit.
[2026-06-16 13:58:14] [INFO ] Implicit Places using invariants in 584 ms returned []
[2026-06-16 13:58:14] [INFO ] Invariant cache hit.
[2026-06-16 13:58:15] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:58:16] [INFO ] Implicit Places using invariants and state equation in 1361 ms returned []
Implicit Place search using SMT with State Equation took 1948 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1963 ms. Remains : 298/298 places, 353/353 transitions.
Support contains 46 out of 298 places after structural reductions.
[2026-06-16 13:58:16] [INFO ] Flatten gal took : 114 ms
[2026-06-16 13:58:16] [INFO ] Flatten gal took : 60 ms
[2026-06-16 13:58:16] [INFO ] Input system was already deterministic with 353 transitions.
Reduction of identical properties reduced properties to check from 31 to 30
RANDOM walk for 40000 steps (8 resets) in 2588 ms. (15 steps per ms) remains 9/30 properties
BEST_FIRST walk for 40002 steps (8 resets) in 550 ms. (72 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 404 ms. (98 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
[2026-06-16 13:58:18] [INFO ] Invariant cache hit.
[2026-06-16 13:58:18] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 280/286 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 12/298 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 353/651 variables, 298/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/651 variables, 80/410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/651 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/651 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 651/651 variables, and 410 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4472 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 298/298 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 280/286 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 12/298 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 353/651 variables, 298/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/651 variables, 80/410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/651 variables, 3/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/651 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/651 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 651/651 variables, and 413 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2191 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 298/298 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6674ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 506 ms.
Support contains 6 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 353/353 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 298 transition count 343
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 288 transition count 343
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 23 place count 285 transition count 340
Iterating global reduction 2 with 3 rules applied. Total rules applied 26 place count 285 transition count 340
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 186 place count 205 transition count 260
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 2 with 79 rules applied. Total rules applied 265 place count 205 transition count 181
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 2 with 79 rules applied. Total rules applied 344 place count 126 transition count 181
Applied a total of 344 rules in 98 ms. Remains 126 /298 variables (removed 172) and now considering 181/353 (removed 172) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 126/298 places, 181/353 transitions.
RANDOM walk for 40000 steps (8 resets) in 541 ms. (73 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 386 ms. (103 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 998333 steps, run timeout after 3001 ms. (steps per millisecond=332 ) properties seen :2 out of 3
Probabilistic random walk after 998333 steps, saw 224974 distinct states, run finished after 3007 ms. (steps per millisecond=332 ) properties seen :2
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6706238192419564112.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2125211438754109731.kers'
[2026-06-16 13:58:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6706238192419564112.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2125211438754109731.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 181 rows 113 cols 488 entries
Finished phase 1 with 108 SingleSign rule and 0 generalized
[2026-06-16 13:58:28] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2125211438754109731.kers
Total runtime 2 ms.
[2026-06-16 13:58:28] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/118 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/126 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 181/307 variables, 126/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 80/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/307 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 232 constraints, problems are : Problem set: 0 solved, 1 unsolved in 793 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 126/126 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/118 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/126 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 181/307 variables, 126/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 80/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/307 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/307 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/307 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 235 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 126/126 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1098ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 181/181 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 125 transition count 180
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 180
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 24 place count 111 transition count 172
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 111 transition count 171
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 27 place count 109 transition count 171
Applied a total of 27 rules in 30 ms. Remains 109 /126 variables (removed 17) and now considering 171/181 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 109/126 places, 171/181 transitions.
RANDOM walk for 40000 steps (8 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Probably explored full state space saw : 148670 states, properties seen :0
Probabilistic random walk after 716680 steps, saw 148670 distinct states, run finished after 1087 ms. (steps per millisecond=659 ) properties seen :0
Explored full state space saw : 148670 states, properties seen :0
Exhaustive walk after 716680 steps, saw 148670 distinct states, run finished after 1150 ms. (steps per millisecond=623 ) properties seen :0
FORMULA FileSystem-PT-N03I10B08-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 50 stabilizing places and 113 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 298 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 298/298 places, 353/353 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 298 transition count 343
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 288 transition count 343
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 283 transition count 338
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 283 transition count 338
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 206 place count 195 transition count 250
Applied a total of 206 rules in 73 ms. Remains 195 /298 variables (removed 103) and now considering 250/353 (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-18372398007552722404.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-216086832488208266.kers'
[2026-06-16 13:58:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18372398007552722404.kers, --Pflows, --basisKERS=/tmp/petrispot-output-216086832488208266.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 250 rows 187 cols 830 entries
Finished phase 1 with 177 SingleSign rule and 0 generalized
[2026-06-16 13:58:32] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-216086832488208266.kers
Total runtime 4 ms.
[2026-06-16 13:58:33] [INFO ] Implicit Places using invariants in 513 ms returned []
[2026-06-16 13:58:33] [INFO ] Invariant cache hit.
[2026-06-16 13:58:33] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:58:34] [INFO ] Implicit Places using invariants and state equation in 1429 ms returned []
Implicit Place search using SMT with State Equation took 1944 ms to find 0 implicit places.
[2026-06-16 13:58:34] [INFO ] Redundant transitions in 19 ms returned []
Running 240 sub problems to find dead transitions.
[2026-06-16 13:58:34] [INFO ] Invariant cache hit.
[2026-06-16 13:58:34] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 11/195 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 250/445 variables, 195/234 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 80/314 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/445 variables, and 314 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 11/195 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (OVERLAPS) 250/445 variables, 195/241 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD148 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 80/321 constraints. Problems are: Problem set: 12 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 228/549 constraints. Problems are: Problem set: 12 solved, 228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/445 variables, and 549 constraints, problems are : Problem set: 12 solved, 228 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 228/240 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60146ms problems are : Problem set: 12 solved, 228 unsolved
Search for dead transitions found 12 dead transitions in 60151ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 195/298 places, 238/353 transitions.
Applied a total of 0 rules in 15 ms. Remains 195 /195 variables (removed 0) and now considering 238/238 (removed 0) transitions.
[2026-06-16 13:59:34] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 62238 ms. Remains : 195/298 places, 238/353 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 323 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FileSystem-PT-N03I10B08-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 522 ms.
Stack based approach found an accepted trace after 91 steps with 0 reset with depth 92 and stack size 92 in 2 ms.
FORMULA FileSystem-PT-N03I10B08-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property FileSystem-PT-N03I10B08-LTLFireability-00 finished in 63198 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(((F(p0) U X(p1))&&(p1||F(G(p2)))))))'
Support contains 5 out of 298 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 298/298 places, 353/353 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 298 transition count 343
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 288 transition count 343
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 283 transition count 338
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 283 transition count 338
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 180 place count 208 transition count 263
Applied a total of 180 rules in 51 ms. Remains 208 /298 variables (removed 90) and now considering 263/353 (removed 90) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4527532735730432422.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10662814324743701230.kers'
[2026-06-16 13:59:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4527532735730432422.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10662814324743701230.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 263 rows 200 cols 847 entries
Finished phase 1 with 190 SingleSign rule and 0 generalized
[2026-06-16 13:59:35] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10662814324743701230.kers
Total runtime 3 ms.
[2026-06-16 13:59:36] [INFO ] Implicit Places using invariants in 405 ms returned []
[2026-06-16 13:59:36] [INFO ] Invariant cache hit.
[2026-06-16 13:59:36] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 13:59:37] [INFO ] Implicit Places using invariants and state equation in 1158 ms returned []
Implicit Place search using SMT with State Equation took 1569 ms to find 0 implicit places.
[2026-06-16 13:59:37] [INFO ] Redundant transitions in 4 ms returned []
Running 253 sub problems to find dead transitions.
[2026-06-16 13:59:37] [INFO ] Invariant cache hit.
[2026-06-16 13:59:37] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 11/208 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 208/471 variables, and 45 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/208 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (OVERLAPS) 11/208 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 25/45 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (OVERLAPS) 263/471 variables, 208/255 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD173 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 80/335 constraints. Problems are: Problem set: 12 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 241/576 constraints. Problems are: Problem set: 12 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 471/471 variables, and 576 constraints, problems are : Problem set: 12 solved, 241 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 241/253 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60101ms problems are : Problem set: 12 solved, 241 unsolved
Search for dead transitions found 12 dead transitions in 60103ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 208/298 places, 251/353 transitions.
Applied a total of 0 rules in 20 ms. Remains 208 /208 variables (removed 0) and now considering 251/251 (removed 0) transitions.
[2026-06-16 14:00:37] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 61766 ms. Remains : 208/298 places, 251/353 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(((F(p0) U X(p1))&&(p1||F(G(p2)))))))'
Stuttering acceptance computed with spot in 495 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FileSystem-PT-N03I10B08-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 427 ms.
Stack based approach found an accepted trace after 103 steps with 1 reset with depth 98 and stack size 98 in 2 ms.
FORMULA FileSystem-PT-N03I10B08-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property FileSystem-PT-N03I10B08-LTLFireability-01 finished in 62788 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!p0&&(!p0 U (X(!p1)||G(!p0)))))))'
Support contains 2 out of 298 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 : 298/298 places, 353/353 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 298 transition count 343
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 288 transition count 343
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 283 transition count 338
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 283 transition count 338
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 206 place count 195 transition count 250
Applied a total of 206 rules in 55 ms. Remains 195 /298 variables (removed 103) and now considering 250/353 (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-12193675715794117793.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16649283616603259250.kers'
[2026-06-16 14:00:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12193675715794117793.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16649283616603259250.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 250 rows 187 cols 830 entries
Finished phase 1 with 177 SingleSign rule and 0 generalized
[2026-06-16 14:00:38] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16649283616603259250.kers
Total runtime 4 ms.
[2026-06-16 14:00:39] [INFO ] Implicit Places using invariants in 392 ms returned []
[2026-06-16 14:00:39] [INFO ] Invariant cache hit.
[2026-06-16 14:00:39] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 14:00:40] [INFO ] Implicit Places using invariants and state equation in 1074 ms returned []
Implicit Place search using SMT with State Equation took 1471 ms to find 0 implicit places.
[2026-06-16 14:00:40] [INFO ] Redundant transitions in 3 ms returned []
Running 240 sub problems to find dead transitions.
[2026-06-16 14:00:40] [INFO ] Invariant cache hit.
[2026-06-16 14:00:40] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 11/195 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 250/445 variables, 195/234 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 80/314 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/445 variables, and 314 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 11/195 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 21/39 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (OVERLAPS) 250/445 variables, 195/241 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD148 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 80/321 constraints. Problems are: Problem set: 12 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 228/549 constraints. Problems are: Problem set: 12 solved, 228 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/445 variables, and 549 constraints, problems are : Problem set: 12 solved, 228 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 228/240 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60112ms problems are : Problem set: 12 solved, 228 unsolved
Search for dead transitions found 12 dead transitions in 60114ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 195/298 places, 238/353 transitions.
Applied a total of 0 rules in 14 ms. Remains 195 /195 variables (removed 0) and now considering 238/238 (removed 0) transitions.
[2026-06-16 14:01:40] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 61678 ms. Remains : 195/298 places, 238/353 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((!p0 U (X(!p1)||G(!p0)))&&!p0))))'
Stuttering acceptance computed with spot in 56 ms :[p0]
Running random walk in product with property : FileSystem-PT-N03I10B08-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 199 ms.
Product exploration explored 100000 steps with 0 reset in 431 ms.
Computed a total of 27 stabilizing places and 78 stable transitions
Computed a total of 27 stabilizing places and 78 stable transitions
Knowledge based reduction with 3 factoid took 81 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 36715 steps (8 resets) in 138 ms. (264 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 79 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 47 ms :[p0]
Knowledge-based reduction took 281 ms.
Stuttering acceptance computed with spot in 44 ms :[p0]
Support contains 2 out of 195 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 : 195/195 places, 238/238 transitions.
Applied a total of 0 rules in 22 ms. Remains 195 /195 variables (removed 0) and now considering 238/238 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11117354592884320148.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2964057660449835510.kers'
[2026-06-16 14:01:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11117354592884320148.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2964057660449835510.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 238 rows 187 cols 782 entries
Finished phase 1 with 177 SingleSign rule and 0 generalized
[2026-06-16 14:01:41] [INFO ] Computed 18 invariants in 1 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2964057660449835510.kers
Total runtime 3 ms.
[2026-06-16 14:01:41] [INFO ] Implicit Places using invariants in 395 ms returned []
[2026-06-16 14:01:41] [INFO ] Invariant cache hit.
[2026-06-16 14:01:41] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 14:01:42] [INFO ] Implicit Places using invariants and state equation in 768 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
[2026-06-16 14:01:42] [INFO ] Redundant transitions in 1 ms returned []
Running 228 sub problems to find dead transitions.
[2026-06-16 14:01:42] [INFO ] Invariant cache hit.
[2026-06-16 14:01:42] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 11/195 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 238/433 variables, 195/238 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 80/318 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 433/433 variables, and 318 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 11/195 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 25/43 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (OVERLAPS) 238/433 variables, 195/238 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 80/318 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 228/546 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/433 variables, and 546 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 195/195 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60096ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61296 ms. Remains : 195/195 places, 238/238 transitions.
Computed a total of 27 stabilizing places and 78 stable transitions
Computed a total of 27 stabilizing places and 78 stable transitions
Knowledge based reduction with 3 factoid took 64 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 36693 steps (8 resets) in 217 ms. (168 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 79 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 46 ms :[p0]
Knowledge-based reduction took 261 ms.
Stuttering acceptance computed with spot in 46 ms :[p0]
Stuttering acceptance computed with spot in 47 ms :[p0]
Product exploration explored 100000 steps with 0 reset in 211 ms.
Product exploration explored 100000 steps with 0 reset in 259 ms.
Built C files in :
/tmp/ltsmin6107080740875167409
[2026-06-16 14:02:43] [INFO ] Computing symmetric may disable matrix : 238 transitions.
[2026-06-16 14:02:43] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 14:02:43] [INFO ] Computing symmetric may enable matrix : 238 transitions.
[2026-06-16 14:02:43] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 14:02:43] [INFO ] Computing Do-Not-Accords matrix : 238 transitions.
[2026-06-16 14:02:43] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 14:02:43] [INFO ] Built C files in 93ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6107080740875167409
Running compilation step : cd /tmp/ltsmin6107080740875167409;'/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 1374 ms.
Running link step : cd /tmp/ltsmin6107080740875167409;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin6107080740875167409;'/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/stateBased9489223136310432531.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 195 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 195/195 places, 238/238 transitions.
Applied a total of 0 rules in 9 ms. Remains 195 /195 variables (removed 0) and now considering 238/238 (removed 0) transitions.
[2026-06-16 14:02:58] [INFO ] Invariant cache hit.
[2026-06-16 14:02:58] [INFO ] Implicit Places using invariants in 474 ms returned []
[2026-06-16 14:02:58] [INFO ] Invariant cache hit.
[2026-06-16 14:02:59] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 14:03:00] [INFO ] Implicit Places using invariants and state equation in 1040 ms returned []
Implicit Place search using SMT with State Equation took 1516 ms to find 0 implicit places.
[2026-06-16 14:03:00] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1533 ms. Remains : 195/195 places, 238/238 transitions.
Built C files in :
/tmp/ltsmin7864392743732461751
[2026-06-16 14:03:00] [INFO ] Computing symmetric may disable matrix : 238 transitions.
[2026-06-16 14:03:00] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 14:03:00] [INFO ] Computing symmetric may enable matrix : 238 transitions.
[2026-06-16 14:03:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 14:03:00] [INFO ] Computing Do-Not-Accords matrix : 238 transitions.
[2026-06-16 14:03:00] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 14:03:00] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7864392743732461751
Running compilation step : cd /tmp/ltsmin7864392743732461751;'/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 1058 ms.
Running link step : cd /tmp/ltsmin7864392743732461751;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin7864392743732461751;'/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/stateBased9067259564040332273.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-06-16 14:03:15] [INFO ] Flatten gal took : 21 ms
[2026-06-16 14:03:15] [INFO ] Flatten gal took : 20 ms
[2026-06-16 14:03:15] [INFO ] Time to serialize gal into /tmp/LTL1419498650415675837.gal : 7 ms
[2026-06-16 14:03:15] [INFO ] Time to serialize properties into /tmp/LTL14514467370771570323.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/LTL1419498650415675837.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12390816288119520429.hoa' '-atoms' '/tmp/LTL14514467370771570323.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14514467370771570323.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12390816288119520429.hoa
Reverse transition relation is NOT exact ! Due to transitions t180.t340, t181.t340, t182.t340, t183.t340, t184.t340, t185.t340, t186.t340, t187.t340, t188....1020
Detected timeout of ITS tools.
[2026-06-16 14:03:30] [INFO ] Flatten gal took : 20 ms
[2026-06-16 14:03:30] [INFO ] Flatten gal took : 40 ms
[2026-06-16 14:03:30] [INFO ] Time to serialize gal into /tmp/LTL3971013846609704502.gal : 5 ms
[2026-06-16 14:03:30] [INFO ] Time to serialize properties into /tmp/LTL6218934186752625720.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/LTL3971013846609704502.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6218934186752625720.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 : !((F(G(((!("((busy_16_20>=1)&&(testbusy_2_16>=1))"))U((X(!("((busy_13_19>=1)&&(testbusy_10_13>=1))")))||(G(!("((busy_16_20>=1)&&(testb...219
Formula 0 simplified : GF(!"((busy_16_20<1)||(testbusy_2_16<1))" | ("((busy_16_20>=1)&&(testbusy_2_16>=1))" M X"((busy_13_19>=1)&&(testbusy_10_13>=1))"))
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:188)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:343)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:420)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2026-06-16 14:03:45] [INFO ] Flatten gal took : 17 ms
[2026-06-16 14:03:45] [INFO ] Applying decomposition
[2026-06-16 14:03:45] [INFO ] Flatten gal took : 17 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/graph7729129848095360457.txt' '-o' '/tmp/graph7729129848095360457.bin' '-w' '/tmp/graph7729129848095360457.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7729129848095360457.bin' '-l' '-1' '-v' '-w' '/tmp/graph7729129848095360457.weights' '-q' '0' '-e' '0.001'
[2026-06-16 14:03:45] [INFO ] Decomposing Gal with order
[2026-06-16 14:03:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-16 14:03:45] [INFO ] Removed a total of 75 redundant transitions.
[2026-06-16 14:03:45] [INFO ] Flatten gal took : 107 ms
[2026-06-16 14:03:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 122 labels/synchronizations in 18 ms.
[2026-06-16 14:03:45] [INFO ] Time to serialize gal into /tmp/LTL15460786145536837460.gal : 8 ms
[2026-06-16 14:03:45] [INFO ] Time to serialize properties into /tmp/LTL730840473231190931.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/LTL15460786145536837460.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL730840473231190931.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...254
Read 1 LTL properties
Checking formula 0 : !((F(G(((!("((i5.u17.busy_16_20>=1)&&(i5.u17.testbusy_2_16>=1))"))U((X(!("((u14.busy_13_19>=1)&&(u14.testbusy_10_13>=1))")))||(G(!("((...269
Formula 0 simplified : GF(!"((i5.u17.busy_16_20<1)||(i5.u17.testbusy_2_16<1))" | ("((i5.u17.busy_16_20>=1)&&(i5.u17.testbusy_2_16>=1))" M X"((u14.busy_13_1...189
Reverse transition relation is NOT exact ! Due to transitions t187_t340, t200_t342, t210_t343, t225_t344, t232_t345, t249_t346, t254_t347, t171_t275, t133_...381
Detected timeout of ITS tools.
Treatment of property FileSystem-PT-N03I10B08-LTLFireability-02 finished in 202207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(!p1)) U X(X((F(!p0)||(!p2 U (p3||G(!p2))))))))'
Support contains 8 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 353/353 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 293 transition count 348
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 293 transition count 348
Applied a total of 10 rules in 8 ms. Remains 293 /298 variables (removed 5) and now considering 348/353 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3416720048243463808.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6505407744598964047.kers'
[2026-06-16 14:04:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3416720048243463808.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6505407744598964047.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 348 rows 285 cols 954 entries
Finished phase 1 with 275 SingleSign rule and 0 generalized
[2026-06-16 14:04:00] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6505407744598964047.kers
Total runtime 4 ms.
[2026-06-16 14:04:01] [INFO ] Implicit Places using invariants in 668 ms returned []
[2026-06-16 14:04:01] [INFO ] Invariant cache hit.
[2026-06-16 14:04:01] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 14:04:03] [INFO ] Implicit Places using invariants and state equation in 1592 ms returned []
Implicit Place search using SMT with State Equation took 2266 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2026-06-16 14:04:03] [INFO ] Invariant cache hit.
[2026-06-16 14:04:03] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (OVERLAPS) 11/293 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 338 unsolved
SMT process timed out in 30175ms, After SMT, problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 30177ms
Starting structural reductions in LTL mode, iteration 1 : 293/298 places, 348/353 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32454 ms. Remains : 293/298 places, 348/353 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)||p1) U X(X((F(!p1)||(!p2 U (p3||G(!p2))))))))'
Stuttering acceptance computed with spot in 380 ms :[(AND p1 p2 (NOT p3)), (AND p1 p2 (NOT p3)), (AND p1 p0 (NOT p3) p2), (AND p1 (NOT p3) p2), (AND p1 p0 (NOT p3) p2), (AND p1 p0 (NOT p3) p2), (AND p1 p0)]
Running random walk in product with property : FileSystem-PT-N03I10B08-LTLFireability-03
Product exploration explored 100000 steps with 33333 reset in 511 ms.
Product exploration explored 100000 steps with 33333 reset in 522 ms.
Computed a total of 45 stabilizing places and 108 stable transitions
Computed a total of 45 stabilizing places and 108 stable transitions
Detected a total of 45/293 stabilizing places and 108/348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 12 factoid took 18 ms. Proved property starting from automaton with 7 states, 11 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 30 ms.
FORMULA FileSystem-PT-N03I10B08-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FileSystem-PT-N03I10B08-LTLFireability-03 finished in 33965 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(p1)&&X(X((!p2 U (G(!p2)||(!p2&&G(p3))))))))))'
Support contains 5 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 353/353 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 294 transition count 349
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 294 transition count 349
Applied a total of 8 rules in 6 ms. Remains 294 /298 variables (removed 4) and now considering 349/353 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13391008142321869815.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9595068187172931660.kers'
[2026-06-16 14:04:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13391008142321869815.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9595068187172931660.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 349 rows 286 cols 957 entries
Finished phase 1 with 276 SingleSign rule and 0 generalized
[2026-06-16 14:04:34] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9595068187172931660.kers
Total runtime 3 ms.
[2026-06-16 14:04:35] [INFO ] Implicit Places using invariants in 714 ms returned []
[2026-06-16 14:04:35] [INFO ] Invariant cache hit.
[2026-06-16 14:04:35] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 14:04:37] [INFO ] Implicit Places using invariants and state equation in 1702 ms returned []
Implicit Place search using SMT with State Equation took 2418 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2026-06-16 14:04:37] [INFO ] Invariant cache hit.
[2026-06-16 14:04:37] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (OVERLAPS) 11/294 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 339 unsolved
SMT process timed out in 30304ms, After SMT, problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 30306ms
Starting structural reductions in LTL mode, iteration 1 : 294/298 places, 349/353 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32733 ms. Remains : 294/298 places, 349/353 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(p1)&&X(X((!p2 U (G(!p2)||(!p2&&G(p3))))))))))'
Stuttering acceptance computed with spot in 516 ms :[(OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), true, (NOT p1), p2, p2, (AND p2 (NOT p3)), (NOT p3)]
Running random walk in product with property : FileSystem-PT-N03I10B08-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 282 ms.
Product exploration explored 100000 steps with 0 reset in 310 ms.
Computed a total of 46 stabilizing places and 109 stable transitions
Computed a total of 46 stabilizing places and 109 stable transitions
Detected a total of 46/294 stabilizing places and 109/349 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge based reduction with 5 factoid took 70 ms. Reduced automaton from 9 states, 17 edges and 4 AP (stutter sensitive) to 8 states, 14 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 190 ms. (209 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 179 ms. (222 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 1/3 properties
[2026-06-16 14:05:08] [INFO ] Invariant cache hit.
[2026-06-16 14:05:08] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 278/281 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 13/294 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 349/643 variables, 294/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Real declared 643/643 variables, and 401 constraints, problems are : Problem set: 1 solved, 0 unsolved in 2484 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 294/294 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2491ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 6 factoid took 183 ms. Reduced automaton from 8 states, 14 edges and 2 AP (stutter sensitive) to 8 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 388 ms :[true, p2, (NOT p3), (AND p2 (NOT p3)), p2, p2, p2, p2]
Knowledge-based reduction took 3325 ms.
Stuttering acceptance computed with spot in 385 ms :[true, p2, (NOT p3), (AND p2 (NOT p3)), p2, p2, p2, p2]
Support contains 3 out of 294 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 349/349 transitions.
Applied a total of 0 rules in 5 ms. Remains 294 /294 variables (removed 0) and now considering 349/349 (removed 0) transitions.
[2026-06-16 14:05:12] [INFO ] Invariant cache hit.
[2026-06-16 14:05:13] [INFO ] Implicit Places using invariants in 837 ms returned []
[2026-06-16 14:05:13] [INFO ] Invariant cache hit.
[2026-06-16 14:05:13] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 14:05:14] [INFO ] Implicit Places using invariants and state equation in 1415 ms returned []
Implicit Place search using SMT with State Equation took 2254 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2260 ms. Remains : 294/294 places, 349/349 transitions.
Computed a total of 46 stabilizing places and 109 stable transitions
Computed a total of 46 stabilizing places and 109 stable transitions
Knowledge based reduction with 1 factoid took 51 ms. Reduced automaton from 8 states, 13 edges and 2 AP (stutter sensitive) to 8 states, 13 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 164 ms. (242 steps per ms) remains 1/4 properties
BEST_FIRST walk for 30249 steps (6 resets) in 32 ms. (916 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 8 states, 13 edges and 2 AP (stutter sensitive) to 8 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[true, p2, (NOT p3), (AND p2 (NOT p3)), p2, p2, p2, p2]
Knowledge-based reduction took 472 ms.
Stuttering acceptance computed with spot in 373 ms :[true, p2, (NOT p3), (AND p2 (NOT p3)), p2, p2, p2, p2]
Stuttering acceptance computed with spot in 379 ms :[true, p2, (NOT p3), (AND p2 (NOT p3)), p2, p2, p2, p2]
Product exploration explored 100000 steps with 0 reset in 236 ms.
Product exploration explored 100000 steps with 0 reset in 276 ms.
Spot run failed in 153 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/ltsmin13087502845889501742
[2026-06-16 14:05:16] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13087502845889501742
Running compilation step : cd /tmp/ltsmin13087502845889501742;'/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 1023 ms.
Running link step : cd /tmp/ltsmin13087502845889501742;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin13087502845889501742;'/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/stateBased1560530339570288402.hoa' '--buchi-type=spotba'
LTSmin run took 10985 ms.
FORMULA FileSystem-PT-N03I10B08-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FileSystem-PT-N03I10B08-LTLFireability-04 finished in 53895 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 G((p1 U !p0))))'
Support contains 3 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 353/353 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 294 transition count 349
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 294 transition count 349
Applied a total of 8 rules in 7 ms. Remains 294 /298 variables (removed 4) and now considering 349/353 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6852777902089701321.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7533089937033442050.kers'
[2026-06-16 14:05:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6852777902089701321.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7533089937033442050.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 349 rows 286 cols 957 entries
Finished phase 1 with 276 SingleSign rule and 0 generalized
[2026-06-16 14:05:28] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7533089937033442050.kers
Total runtime 4 ms.
[2026-06-16 14:05:29] [INFO ] Implicit Places using invariants in 451 ms returned []
[2026-06-16 14:05:29] [INFO ] Invariant cache hit.
[2026-06-16 14:05:29] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 14:05:30] [INFO ] Implicit Places using invariants and state equation in 1646 ms returned []
Implicit Place search using SMT with State Equation took 2099 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 294/298 places, 349/353 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2107 ms. Remains : 294/298 places, 349/353 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 G((p1 U !p0))))'
Stuttering acceptance computed with spot in 388 ms :[p0, (NOT p0), false, false, p0, (NOT p0), true, false, p0]
Running random walk in product with property : FileSystem-PT-N03I10B08-LTLFireability-06
Product exploration explored 100000 steps with 25025 reset in 364 ms.
Product exploration explored 100000 steps with 25035 reset in 404 ms.
Computed a total of 46 stabilizing places and 109 stable transitions
Computed a total of 46 stabilizing places and 109 stable transitions
Detected a total of 46/294 stabilizing places and 109/349 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 12 factoid took 111 ms. Reduced automaton from 9 states, 18 edges and 2 AP (stutter sensitive) to 9 states, 18 edges and 2 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 30146 steps (7 resets) in 134 ms. (223 steps per ms) remains 0/4 properties
Knowledge based reduction with 12 factoid took 193 ms. Reduced automaton from 9 states, 18 edges and 2 AP (stutter sensitive) to 9 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 423 ms :[p0, (NOT p0), false, false, p0, (NOT p0), true, false, p0]
[2026-06-16 14:05:32] [INFO ] Invariant cache hit.
[2026-06-16 14:05:33] [INFO ] [Real]Absence check using 18 positive place invariants in 687 ms returned sat
[2026-06-16 14:05:36] [INFO ] [Real]Absence check using state equation in 2777 ms returned sat
[2026-06-16 14:05:36] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:05:37] [INFO ] [Nat]Absence check using 18 positive place invariants in 194 ms returned sat
[2026-06-16 14:05:41] [INFO ] [Nat]Absence check using state equation in 4737 ms returned sat
[2026-06-16 14:05:41] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 14:05:42] [INFO ] [Nat]Added 80 Read/Feed constraints in 145 ms returned sat
[2026-06-16 14:05:42] [INFO ] Computed and/alt/rep : 252/270/252 causal constraints (skipped 87 transitions) in 34 ms.
[2026-06-16 14:05:43] [INFO ] Added : 49 causal constraints over 10 iterations in 1315 ms. Result :sat
Could not prove EG p0
Knowledge-based reduction took 11420 ms.
Stuttering acceptance computed with spot in 430 ms :[p0, (NOT p0), false, false, p0, (NOT p0), true, false, p0]
Support contains 3 out of 294 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 349/349 transitions.
Applied a total of 0 rules in 5 ms. Remains 294 /294 variables (removed 0) and now considering 349/349 (removed 0) transitions.
[2026-06-16 14:05:43] [INFO ] Invariant cache hit.
[2026-06-16 14:05:44] [INFO ] Implicit Places using invariants in 696 ms returned []
[2026-06-16 14:05:44] [INFO ] Invariant cache hit.
[2026-06-16 14:05:44] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 14:05:46] [INFO ] Implicit Places using invariants and state equation in 1825 ms returned []
Implicit Place search using SMT with State Equation took 2523 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2530 ms. Remains : 294/294 places, 349/349 transitions.
Computed a total of 46 stabilizing places and 109 stable transitions
Computed a total of 46 stabilizing places and 109 stable transitions
Detected a total of 46/294 stabilizing places and 109/349 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 12 factoid took 98 ms. Reduced automaton from 9 states, 18 edges and 2 AP (stutter sensitive) to 9 states, 18 edges and 2 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 20211 steps (5 resets) in 128 ms. (156 steps per ms) remains 0/4 properties
Knowledge based reduction with 12 factoid took 184 ms. Reduced automaton from 9 states, 18 edges and 2 AP (stutter sensitive) to 9 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 429 ms :[p0, (NOT p0), false, false, p0, (NOT p0), true, false, p0]
[2026-06-16 14:05:47] [INFO ] Invariant cache hit.
[2026-06-16 14:05:48] [INFO ] [Real]Absence check using 18 positive place invariants in 609 ms returned sat
[2026-06-16 14:05:50] [INFO ] [Real]Absence check using state equation in 2493 ms returned sat
[2026-06-16 14:05:50] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 14:05:51] [INFO ] [Nat]Absence check using 18 positive place invariants in 207 ms returned sat
[2026-06-16 14:05:55] [INFO ] [Nat]Absence check using state equation in 4732 ms returned sat
[2026-06-16 14:05:55] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 14:05:56] [INFO ] [Nat]Added 80 Read/Feed constraints in 147 ms returned sat
[2026-06-16 14:05:56] [INFO ] Computed and/alt/rep : 252/270/252 causal constraints (skipped 87 transitions) in 27 ms.
[2026-06-16 14:05:57] [INFO ] Added : 49 causal constraints over 10 iterations in 1237 ms. Result :sat
Could not prove EG p0
Knowledge-based reduction took 10971 ms.
Stuttering acceptance computed with spot in 434 ms :[p0, (NOT p0), false, false, p0, (NOT p0), true, false, p0]
Stuttering acceptance computed with spot in 419 ms :[p0, (NOT p0), false, false, p0, (NOT p0), true, false, p0]
Product exploration explored 100000 steps with 24992 reset in 369 ms.
Product exploration explored 100000 steps with 25019 reset in 416 ms.
Spot run failed in 85 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/ltsmin1221653119371979683
[2026-06-16 14:05:59] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1221653119371979683
Running compilation step : cd /tmp/ltsmin1221653119371979683;'/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 1023 ms.
Running link step : cd /tmp/ltsmin1221653119371979683;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1221653119371979683;'/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/stateBased6839805599407776968.hoa' '--buchi-type=spotba'
LTSmin run took 61 ms.
FORMULA FileSystem-PT-N03I10B08-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FileSystem-PT-N03I10B08-LTLFireability-06 finished in 31573 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(G(!p0))))'
Support contains 2 out of 298 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 298/298 places, 353/353 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 298 transition count 344
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 289 transition count 344
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 284 transition count 339
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 284 transition count 339
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 180 place count 208 transition count 263
Applied a total of 180 rules in 25 ms. Remains 208 /298 variables (removed 90) and now considering 263/353 (removed 90) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15489790158542037467.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13253526571054880308.kers'
[2026-06-16 14:06:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15489790158542037467.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13253526571054880308.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 263 rows 200 cols 847 entries
Finished phase 1 with 190 SingleSign rule and 0 generalized
[2026-06-16 14:06:00] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13253526571054880308.kers
Total runtime 3 ms.
[2026-06-16 14:06:00] [INFO ] Implicit Places using invariants in 402 ms returned []
[2026-06-16 14:06:00] [INFO ] Invariant cache hit.
[2026-06-16 14:06:00] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 14:06:01] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 1168 ms to find 0 implicit places.
[2026-06-16 14:06:01] [INFO ] Redundant transitions in 1 ms returned []
Running 253 sub problems to find dead transitions.
[2026-06-16 14:06:01] [INFO ] Invariant cache hit.
[2026-06-16 14:06:01] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 11/208 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 11/29 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 208/471 variables, and 45 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/208 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (OVERLAPS) 11/208 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 25/45 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (OVERLAPS) 263/471 variables, 208/259 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD172 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 80/339 constraints. Problems are: Problem set: 12 solved, 241 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 241/580 constraints. Problems are: Problem set: 12 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 471/471 variables, and 580 constraints, problems are : Problem set: 12 solved, 241 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 241/253 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60087ms problems are : Problem set: 12 solved, 241 unsolved
Search for dead transitions found 12 dead transitions in 60089ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 208/298 places, 251/353 transitions.
Applied a total of 0 rules in 13 ms. Remains 208 /208 variables (removed 0) and now considering 251/251 (removed 0) transitions.
[2026-06-16 14:07:01] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 61313 ms. Remains : 208/298 places, 251/353 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(G(!p0))))'
Stuttering acceptance computed with spot in 117 ms :[p0, true, p0]
Running random walk in product with property : FileSystem-PT-N03I10B08-LTLFireability-07
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 0 ms.
FORMULA FileSystem-PT-N03I10B08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FileSystem-PT-N03I10B08-LTLFireability-07 finished in 61467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 298 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 298/298 places, 353/353 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 298 transition count 343
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 288 transition count 343
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 283 transition count 338
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 283 transition count 338
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 158 place count 219 transition count 274
Applied a total of 158 rules in 37 ms. Remains 219 /298 variables (removed 79) and now considering 274/353 (removed 79) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5473838843363237112.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16389791376109149657.kers'
[2026-06-16 14:07:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5473838843363237112.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16389791376109149657.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 274 rows 211 cols 860 entries
Finished phase 1 with 201 SingleSign rule and 0 generalized
[2026-06-16 14:07:01] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16389791376109149657.kers
Total runtime 5 ms.
[2026-06-16 14:07:02] [INFO ] Implicit Places using invariants in 573 ms returned []
[2026-06-16 14:07:02] [INFO ] Invariant cache hit.
[2026-06-16 14:07:02] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 14:07:03] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 1534 ms to find 0 implicit places.
[2026-06-16 14:07:03] [INFO ] Redundant transitions in 1 ms returned []
Running 264 sub problems to find dead transitions.
[2026-06-16 14:07:03] [INFO ] Invariant cache hit.
[2026-06-16 14:07:03] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (OVERLAPS) 11/219 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 219/493 variables, and 43 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/219 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 11/219 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 22/43 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (OVERLAPS) 274/493 variables, 219/274 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD194 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/493 variables, 80/354 constraints. Problems are: Problem set: 12 solved, 252 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/493 variables, 252/606 constraints. Problems are: Problem set: 12 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 493/493 variables, and 606 constraints, problems are : Problem set: 12 solved, 252 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 219/219 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 252/264 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60076ms problems are : Problem set: 12 solved, 252 unsolved
Search for dead transitions found 12 dead transitions in 60079ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 219/298 places, 262/353 transitions.
Applied a total of 0 rules in 7 ms. Remains 219 /219 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2026-06-16 14:08:03] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 61671 ms. Remains : 219/298 places, 262/353 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FileSystem-PT-N03I10B08-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 155 ms.
Product exploration explored 100000 steps with 0 reset in 251 ms.
Computed a total of 29 stabilizing places and 80 stable transitions
Computed a total of 29 stabilizing places and 80 stable transitions
Knowledge based reduction with 5 factoid took 52 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 124 ms. (320 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5677129381957806032.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7805369608253204351.kers'
[2026-06-16 14:08:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5677129381957806032.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7805369608253204351.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 262 rows 211 cols 816 entries
Finished phase 1 with 201 SingleSign rule and 0 generalized
[2026-06-16 14:08:04] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7805369608253204351.kers
Total runtime 2 ms.
[2026-06-16 14:08:04] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 202/204 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/219 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 262/481 variables, 219/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 80/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/481 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/481 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 807 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 219/219 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 202/204 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/219 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 262/481 variables, 219/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 80/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/481 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/481 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/481 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 481/481 variables, and 325 constraints, problems are : Problem set: 0 solved, 1 unsolved in 612 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 219/219 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1432ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 2 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 262/262 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 207 transition count 250
Free-agglomeration rule (complex) applied 70 times.
Iterating global reduction 0 with 70 rules applied. Total rules applied 94 place count 207 transition count 180
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 0 with 76 rules applied. Total rules applied 170 place count 131 transition count 180
Applied a total of 170 rules in 32 ms. Remains 131 /219 variables (removed 88) and now considering 180/262 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 131/219 places, 180/262 transitions.
RANDOM walk for 30039 steps (6 resets) in 48 ms. (613 steps per ms) remains 0/1 properties
Knowledge based reduction with 5 factoid took 84 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 1836 ms.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 262/262 transitions.
Applied a total of 0 rules in 11 ms. Remains 219 /219 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2026-06-16 14:08:05] [INFO ] Invariant cache hit.
[2026-06-16 14:08:06] [INFO ] Implicit Places using invariants in 597 ms returned []
[2026-06-16 14:08:06] [INFO ] Invariant cache hit.
[2026-06-16 14:08:06] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 14:08:07] [INFO ] Implicit Places using invariants and state equation in 1026 ms returned []
Implicit Place search using SMT with State Equation took 1625 ms to find 0 implicit places.
[2026-06-16 14:08:07] [INFO ] Redundant transitions in 1 ms returned []
Running 252 sub problems to find dead transitions.
[2026-06-16 14:08:07] [INFO ] Invariant cache hit.
[2026-06-16 14:08:07] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 11/219 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 219/481 variables, and 62 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/219 constraints, ReadFeed: 0/80 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 11/219 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 41/62 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (OVERLAPS) 262/481 variables, 219/290 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/481 variables, 80/370 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/481 variables, 252/622 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/481 variables, and 622 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 219/219 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61722 ms. Remains : 219/219 places, 262/262 transitions.
Computed a total of 29 stabilizing places and 80 stable transitions
Computed a total of 29 stabilizing places and 80 stable transitions
Knowledge based reduction with 5 factoid took 60 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 144 ms. (275 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
[2026-06-16 14:09:07] [INFO ] Invariant cache hit.
[2026-06-16 14:09:07] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 202/204 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/219 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 262/481 variables, 219/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 80/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/481 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/481 variables, and 322 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1168 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 219/219 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 202/204 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/219 variables, 15/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 262/481 variables, 219/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 80/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/481 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/481 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/481 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 481/481 variables, and 325 constraints, problems are : Problem set: 0 solved, 1 unsolved in 798 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 219/219 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1975ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 472 steps, including 27 resets, run visited all 1 properties in 3 ms. (steps per millisecond=157 )
Parikh walk visited 1 properties in 11 ms.
Knowledge based reduction with 5 factoid took 102 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 2387 ms.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 233 ms.
Product exploration explored 100000 steps with 0 reset in 297 ms.
Built C files in :
/tmp/ltsmin12586148639917926672
[2026-06-16 14:09:10] [INFO ] Computing symmetric may disable matrix : 262 transitions.
[2026-06-16 14:09:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 14:09:10] [INFO ] Computing symmetric may enable matrix : 262 transitions.
[2026-06-16 14:09:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 14:09:10] [INFO ] Computing Do-Not-Accords matrix : 262 transitions.
[2026-06-16 14:09:10] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 14:09:10] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12586148639917926672
Running compilation step : cd /tmp/ltsmin12586148639917926672;'/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 836 ms.
Running link step : cd /tmp/ltsmin12586148639917926672;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12586148639917926672;'/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/stateBased14377300291557615457.hoa' '--buchi-type=spotba'
LTSmin run took 479 ms.
FORMULA FileSystem-PT-N03I10B08-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FileSystem-PT-N03I10B08-LTLFireability-08 finished in 130551 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(X((!(p0 U p1)&&X(p2))))||p0)))'
Support contains 3 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 353/353 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 295 transition count 350
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 295 transition count 350
Applied a total of 6 rules in 8 ms. Remains 295 /298 variables (removed 3) and now considering 350/353 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8307428595222764774.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1912056863983518433.kers'
[2026-06-16 14:09:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8307428595222764774.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1912056863983518433.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 350 rows 287 cols 960 entries
Finished phase 1 with 277 SingleSign rule and 0 generalized
[2026-06-16 14:09:12] [INFO ] Computed 18 invariants in 3 ms
Computed 18 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1912056863983518433.kers
Total runtime 4 ms.
[2026-06-16 14:09:12] [INFO ] Implicit Places using invariants in 605 ms returned []
[2026-06-16 14:09:12] [INFO ] Invariant cache hit.
[2026-06-16 14:09:13] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 14:09:14] [INFO ] Implicit Places using invariants and state equation in 1662 ms returned []
Implicit Place search using SMT with State Equation took 2269 ms to find 0 implicit places.
Running 340 sub problems to find dead transitions.
[2026-06-16 14:09:14] [INFO ] Invariant cache hit.
[2026-06-16 14:09:14] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/284 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (OVERLAPS) 11/295 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 340 unsolved
SMT process timed out in 30104ms, After SMT, problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 30106ms
Starting structural reductions in LTL mode, iteration 1 : 295/298 places, 350/353 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32385 ms. Remains : 295/298 places, 350/353 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(X((!(p0 U p1)&&X(p2))))||p0)))'
Stuttering acceptance computed with spot in 236 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), (OR (NOT p2) p1), true, p1, (NOT p2)]
Running random walk in product with property : FileSystem-PT-N03I10B08-LTLFireability-09
Entered a terminal (fully accepting) state of product in 20 steps with 4 reset in 0 ms.
FORMULA FileSystem-PT-N03I10B08-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FileSystem-PT-N03I10B08-LTLFireability-09 finished in 32666 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 4 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 353/353 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 293 transition count 348
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 293 transition count 348
Applied a total of 10 rules in 10 ms. Remains 293 /298 variables (removed 5) and now considering 348/353 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12644334215753303591.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8934682089534952766.kers'
[2026-06-16 14:09:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12644334215753303591.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8934682089534952766.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 348 rows 285 cols 954 entries
Finished phase 1 with 275 SingleSign rule and 0 generalized
[2026-06-16 14:09:44] [INFO ] Computed 18 invariants in 5 ms
Computed 18 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-8934682089534952766.kers
Total runtime 6 ms.
[2026-06-16 14:09:45] [INFO ] Implicit Places using invariants in 610 ms returned []
[2026-06-16 14:09:45] [INFO ] Invariant cache hit.
[2026-06-16 14:09:45] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 14:09:46] [INFO ] Implicit Places using invariants and state equation in 1226 ms returned []
Implicit Place search using SMT with State Equation took 1838 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2026-06-16 14:09:46] [INFO ] Invariant cache hit.
[2026-06-16 14:09:46] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (OVERLAPS) 11/293 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 338 unsolved
SMT process timed out in 30100ms, After SMT, problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 30101ms
Starting structural reductions in LTL mode, iteration 1 : 293/298 places, 348/353 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31951 ms. Remains : 293/298 places, 348/353 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FileSystem-PT-N03I10B08-LTLFireability-10
Product exploration explored 100000 steps with 20000 reset in 176 ms.
Product exploration explored 100000 steps with 20000 reset in 200 ms.
Computed a total of 45 stabilizing places and 108 stable transitions
Computed a total of 45 stabilizing places and 108 stable transitions
Knowledge based reduction with 1 factoid took 52 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 859879 steps, run timeout after 3001 ms. (steps per millisecond=286 ) properties seen :0 out of 1
Probabilistic random walk after 859879 steps, saw 223923 distinct states, run finished after 3001 ms. (steps per millisecond=286 ) properties seen :0
[2026-06-16 14:10:20] [INFO ] Invariant cache hit.
[2026-06-16 14:10:20] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 275/279 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 14/293 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 348/641 variables, 293/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 80/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/641 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 641/641 variables, and 396 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1460 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 293/293 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 275/279 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 14/293 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 348/641 variables, 293/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 80/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/641 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 641/641 variables, and 397 constraints, problems are : Problem set: 0 solved, 1 unsolved in 651 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 293/293 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2119ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 4 out of 293 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 293/293 places, 348/348 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 293 transition count 338
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 283 transition count 338
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 180 place count 203 transition count 258
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 2 with 79 rules applied. Total rules applied 259 place count 203 transition count 179
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 2 with 79 rules applied. Total rules applied 338 place count 124 transition count 179
Applied a total of 338 rules in 36 ms. Remains 124 /293 variables (removed 169) and now considering 179/348 (removed 169) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 124/293 places, 179/348 transitions.
RANDOM walk for 40000 steps (8 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
BEST_FIRST walk for 33584 steps (7 resets) in 38 ms. (861 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 69 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 5625 ms.
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 348/348 transitions.
Applied a total of 0 rules in 3 ms. Remains 293 /293 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2026-06-16 14:10:23] [INFO ] Invariant cache hit.
[2026-06-16 14:10:24] [INFO ] Implicit Places using invariants in 864 ms returned []
[2026-06-16 14:10:24] [INFO ] Invariant cache hit.
[2026-06-16 14:10:24] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 14:10:25] [INFO ] Implicit Places using invariants and state equation in 1089 ms returned []
Implicit Place search using SMT with State Equation took 1955 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1959 ms. Remains : 293/293 places, 348/348 transitions.
Computed a total of 45 stabilizing places and 108 stable transitions
Computed a total of 45 stabilizing places and 108 stable transitions
Knowledge based reduction with 1 factoid took 56 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 800894 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :0 out of 1
Probabilistic random walk after 800894 steps, saw 208760 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :0
[2026-06-16 14:10:28] [INFO ] Invariant cache hit.
[2026-06-16 14:10:28] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 275/279 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 14/293 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 348/641 variables, 293/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 80/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/641 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 641/641 variables, and 396 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1233 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 293/293 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 275/279 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/279 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 14/293 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 348/641 variables, 293/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 80/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/641 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 641/641 variables, and 397 constraints, problems are : Problem set: 0 solved, 1 unsolved in 869 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 293/293 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2110ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 4 out of 293 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 293/293 places, 348/348 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 293 transition count 338
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 283 transition count 338
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 180 place count 203 transition count 258
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 2 with 79 rules applied. Total rules applied 259 place count 203 transition count 179
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 2 with 79 rules applied. Total rules applied 338 place count 124 transition count 179
Applied a total of 338 rules in 34 ms. Remains 124 /293 variables (removed 169) and now considering 179/348 (removed 169) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 124/293 places, 179/348 transitions.
RANDOM walk for 40000 steps (8 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 357600 steps, run visited all 1 properties in 1040 ms. (steps per millisecond=343 )
Probabilistic random walk after 357600 steps, saw 83462 distinct states, run finished after 1046 ms. (steps per millisecond=341 ) properties seen :1
Knowledge based reduction with 1 factoid took 53 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 6604 ms.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 291 ms.
Product exploration explored 100000 steps with 20000 reset in 337 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/ltsmin1303565205272972186
[2026-06-16 14:10:32] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1303565205272972186
Running compilation step : cd /tmp/ltsmin1303565205272972186;'/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 1047 ms.
Running link step : cd /tmp/ltsmin1303565205272972186;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1303565205272972186;'/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/stateBased16266182917965712266.hoa' '--buchi-type=spotba'
LTSmin run took 103 ms.
FORMULA FileSystem-PT-N03I10B08-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FileSystem-PT-N03I10B08-LTLFireability-10 finished in 49303 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((F(p1)&&X(X(F(p2)))&&p0)) U X(p2)))'
Support contains 3 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 353/353 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 293 transition count 348
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 293 transition count 348
Applied a total of 10 rules in 11 ms. Remains 293 /298 variables (removed 5) and now considering 348/353 (removed 5) transitions.
[2026-06-16 14:10:34] [INFO ] Invariant cache hit.
[2026-06-16 14:10:34] [INFO ] Implicit Places using invariants in 631 ms returned []
[2026-06-16 14:10:34] [INFO ] Invariant cache hit.
[2026-06-16 14:10:35] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 14:10:36] [INFO ] Implicit Places using invariants and state equation in 1203 ms returned []
Implicit Place search using SMT with State Equation took 1836 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 293/298 places, 348/353 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1847 ms. Remains : 293/298 places, 348/353 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((F(p1)&&X(X(F(p2)))&&p0)) U X(p2)))'
Stuttering acceptance computed with spot in 397 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : FileSystem-PT-N03I10B08-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 222 ms.
Stack based approach found an accepted trace after 141 steps with 0 reset with depth 142 and stack size 142 in 1 ms.
FORMULA FileSystem-PT-N03I10B08-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property FileSystem-PT-N03I10B08-LTLFireability-11 finished in 2525 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 353/353 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 293 transition count 348
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 293 transition count 348
Applied a total of 10 rules in 9 ms. Remains 293 /298 variables (removed 5) and now considering 348/353 (removed 5) transitions.
[2026-06-16 14:10:36] [INFO ] Invariant cache hit.
[2026-06-16 14:10:37] [INFO ] Implicit Places using invariants in 633 ms returned []
[2026-06-16 14:10:37] [INFO ] Invariant cache hit.
[2026-06-16 14:10:37] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 14:10:39] [INFO ] Implicit Places using invariants and state equation in 1707 ms returned []
Implicit Place search using SMT with State Equation took 2342 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 293/298 places, 348/353 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2352 ms. Remains : 293/298 places, 348/353 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FileSystem-PT-N03I10B08-LTLFireability-12
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FileSystem-PT-N03I10B08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FileSystem-PT-N03I10B08-LTLFireability-12 finished in 2593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)||G(p2)||p0))))'
Support contains 5 out of 298 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 298/298 places, 353/353 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 293 transition count 348
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 293 transition count 348
Applied a total of 10 rules in 9 ms. Remains 293 /298 variables (removed 5) and now considering 348/353 (removed 5) transitions.
[2026-06-16 14:10:39] [INFO ] Invariant cache hit.
[2026-06-16 14:10:40] [INFO ] Implicit Places using invariants in 711 ms returned []
[2026-06-16 14:10:40] [INFO ] Invariant cache hit.
[2026-06-16 14:10:40] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-06-16 14:10:41] [INFO ] Implicit Places using invariants and state equation in 1460 ms returned []
Implicit Place search using SMT with State Equation took 2173 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 293/298 places, 348/353 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2182 ms. Remains : 293/298 places, 348/353 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)||G(p2)||p0))))'
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : FileSystem-PT-N03I10B08-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 305 ms.
Product exploration explored 100000 steps with 50000 reset in 342 ms.
Computed a total of 45 stabilizing places and 108 stable transitions
Computed a total of 45 stabilizing places and 108 stable transitions
Knowledge based reduction with 7 factoid took 71 ms. Proved property starting from automaton with 3 states, 4 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 76 ms.
FORMULA FileSystem-PT-N03I10B08-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FileSystem-PT-N03I10B08-LTLFireability-13 finished in 3074 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!p0&&(!p0 U (X(!p1)||G(!p0)))))))'
Spot run failed in 77 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-06-16 14:10:42] [INFO ] Flatten gal took : 34 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14318192990527996133
[2026-06-16 14:10:42] [INFO ] Computing symmetric may disable matrix : 353 transitions.
[2026-06-16 14:10:42] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 14:10:42] [INFO ] Applying decomposition
[2026-06-16 14:10:42] [INFO ] Computing symmetric may enable matrix : 353 transitions.
[2026-06-16 14:10:42] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 14:10:42] [INFO ] Flatten gal took : 41 ms
[2026-06-16 14:10:42] [INFO ] Computing Do-Not-Accords matrix : 353 transitions.
[2026-06-16 14:10:42] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-06-16 14:10:42] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14318192990527996133
Running compilation step : cd /tmp/ltsmin14318192990527996133;'/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/graph8140685587631632684.txt' '-o' '/tmp/graph8140685587631632684.bin' '-w' '/tmp/graph8140685587631632684.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8140685587631632684.bin' '-l' '-1' '-v' '-w' '/tmp/graph8140685587631632684.weights' '-q' '0' '-e' '0.001'
[2026-06-16 14:10:42] [INFO ] Decomposing Gal with order
[2026-06-16 14:10:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-16 14:10:42] [INFO ] Removed a total of 340 redundant transitions.
[2026-06-16 14:10:42] [INFO ] Flatten gal took : 80 ms
[2026-06-16 14:10:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 12 ms.
[2026-06-16 14:10:42] [INFO ] Time to serialize gal into /tmp/LTLFireability2909777174133653395.gal : 13 ms
[2026-06-16 14:10:42] [INFO ] Time to serialize properties into /tmp/LTLFireability15404501955344941362.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/LTLFireability2909777174133653395.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15404501955344941362.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...277
Read 1 LTL properties
Checking formula 0 : !((F(G((!("((i4.u63.busy_16_20>=1)&&(i4.u15.testbusy_2_16>=1))"))&&((!("((i4.u63.busy_16_20>=1)&&(i4.u15.testbusy_2_16>=1))"))U((X(!("...279
Formula 0 simplified : GF("((i4.u63.busy_16_20>=1)&&(i4.u15.testbusy_2_16>=1))" | ("((i4.u63.busy_16_20>=1)&&(i4.u15.testbusy_2_16>=1))" M X"((i6.u58.busy_...195
Compilation finished in 1389 ms.
Running link step : cd /tmp/ltsmin14318192990527996133;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14318192990527996133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '<>([]((!(LTLAPp0==true)&&(!(LTLAPp0==true) U (X(!(LTLAPp1==true))||[](!(LTLAPp0==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t180, t199, t210, t211, t222, t226, t235, t242, t249, t254, t257, t261, t277, t297, t309, t32...856
LTSmin run took 245206 ms.
FORMULA FileSystem-PT-N03I10B08-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1058967 ms.
BK_STOP 1781619289476
--------------------
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="FileSystem-PT-N03I10B08"
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 FileSystem-PT-N03I10B08, 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 r338-smll-178021499300436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FileSystem-PT-N03I10B08.tgz
mv FileSystem-PT-N03I10B08 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 '
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 ;