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-178021499300476.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-N08I32B26, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499300476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 9.7K May 27 10:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 27 10:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 27 10:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 27 10:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Jun 16 12:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 16 12:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 18K May 27 10:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K May 27 10:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 27 10:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K May 27 10:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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 1.9M 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-N08I32B26-LTLFireability-00
FORMULA_NAME FileSystem-PT-N08I32B26-LTLFireability-01
FORMULA_NAME FileSystem-PT-N08I32B26-LTLFireability-02
FORMULA_NAME FileSystem-PT-N08I32B26-LTLFireability-03
FORMULA_NAME FileSystem-PT-N08I32B26-LTLFireability-04
FORMULA_NAME FileSystem-PT-N08I32B26-LTLFireability-05
FORMULA_NAME FileSystem-PT-N08I32B26-LTLFireability-06
FORMULA_NAME FileSystem-PT-N08I32B26-LTLFireability-07
FORMULA_NAME FileSystem-PT-N08I32B26-LTLFireability-08
FORMULA_NAME FileSystem-PT-N08I32B26-LTLFireability-09
FORMULA_NAME FileSystem-PT-N08I32B26-LTLFireability-10
FORMULA_NAME FileSystem-PT-N08I32B26-LTLFireability-11
FORMULA_NAME FileSystem-PT-N08I32B26-LTLFireability-12
FORMULA_NAME FileSystem-PT-N08I32B26-LTLFireability-13
FORMULA_NAME FileSystem-PT-N08I32B26-LTLFireability-14
FORMULA_NAME FileSystem-PT-N08I32B26-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1781620076038

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-N08I32B26
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-06-16 14:27:58] [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 14:27:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-16 14:27:59] [INFO ] Load time of PNML (sax parser for PT used): 542 ms
[2026-06-16 14:27:59] [INFO ] Transformed 4335 places.
[2026-06-16 14:27:59] [INFO ] Transformed 4224 transitions.
[2026-06-16 14:27:59] [INFO ] Parsed PT model containing 4335 places and 4224 transitions and 15136 arcs in 799 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Reduce places removed 32 places and 0 transitions.
FORMULA FileSystem-PT-N08I32B26-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N08I32B26-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N08I32B26-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N08I32B26-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N08I32B26-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA FileSystem-PT-N08I32B26-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 4303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4303/4303 places, 4224/4224 transitions.
Reduce places removed 832 places and 0 transitions.
Iterating post reduction 0 with 832 rules applied. Total rules applied 832 place count 3471 transition count 4224
Discarding 802 places :
Symmetric choice reduction at 1 with 802 rule applications. Total rules 1634 place count 2669 transition count 3422
Iterating global reduction 1 with 802 rules applied. Total rules applied 2436 place count 2669 transition count 3422
Applied a total of 2436 rules in 1050 ms. Remains 2669 /4303 variables (removed 1634) and now considering 3422/4224 (removed 802) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10647962502839131039.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9472893588880477574.kers'
[2026-06-16 14:28:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10647962502839131039.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9472893588880477574.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 5 ms.
// Phase 1: matrix 3422 rows 2643 cols 9402 entries
Finished phase 1 with 2615 SingleSign rule and 0 generalized
[2026-06-16 14:28:01] [INFO ] Computed 54 invariants in 186 ms
Computed 54 P flows in 188 ms.
Exported basis to /tmp/petrispot-output-9472893588880477574.kers
Total runtime 192 ms.
[2026-06-16 14:28:05] [INFO ] Implicit Places using invariants in 4886 ms returned []
[2026-06-16 14:28:05] [INFO ] Invariant cache hit.
[2026-06-16 14:28:09] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 14:28:40] [INFO ] Performed 982/2669 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 14:29:10] [INFO ] Performed 1002/2669 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-06-16 14:29:40] [INFO ] Performed 2117/2669 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-06-16 14:30:10] [INFO ] Performed 2451/2669 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-06-16 14:30:10] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-06-16 14:30:10] [INFO ] Implicit Places using invariants and state equation in 124554 ms returned []
Implicit Place search using SMT with State Equation took 129490 ms to find 0 implicit places.
Running 3390 sub problems to find dead transitions.
[2026-06-16 14:30:10] [INFO ] Invariant cache hit.
[2026-06-16 14:30:10] [INFO ] State equation strengthened by 832 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2636 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2636/6091 variables, and 52 constraints, problems are : Problem set: 0 solved, 3390 unsolved in 30231 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/2669 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 3390/3390 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2636 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3390 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2636/6091 variables, and 52 constraints, problems are : Problem set: 0 solved, 3390 unsolved in 30121 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/2669 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/3390 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63526ms problems are : Problem set: 0 solved, 3390 unsolved
Search for dead transitions found 0 dead transitions in 63594ms
Starting structural reductions in LTL mode, iteration 1 : 2669/4303 places, 3422/4224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 194223 ms. Remains : 2669/4303 places, 3422/4224 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2669/2669 places, 3422/3422 transitions.
Applied a total of 0 rules in 292 ms. Remains 2669 /2669 variables (removed 0) and now considering 3422/3422 (removed 0) transitions.
[2026-06-16 14:31:14] [INFO ] Invariant cache hit.
[2026-06-16 14:31:18] [INFO ] Implicit Places using invariants in 3675 ms returned []
[2026-06-16 14:31:18] [INFO ] Invariant cache hit.
[2026-06-16 14:31:21] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 14:31:51] [INFO ] Performed 982/2669 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 14:32:22] [INFO ] Performed 1003/2669 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-06-16 14:32:52] [INFO ] Performed 2142/2669 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-06-16 14:33:22] [INFO ] Performed 2474/2669 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-06-16 14:33:22] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-06-16 14:33:22] [INFO ] Implicit Places using invariants and state equation in 124298 ms returned []
Implicit Place search using SMT with State Equation took 127978 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 128273 ms. Remains : 2669/2669 places, 3422/3422 transitions.
Support contains 41 out of 2669 places after structural reductions.
[2026-06-16 14:33:23] [INFO ] Flatten gal took : 550 ms
[2026-06-16 14:33:23] [INFO ] Flatten gal took : 223 ms
[2026-06-16 14:33:23] [INFO ] Input system was already deterministic with 3422 transitions.
Support contains 35 out of 2669 places (down from 41) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2271 ms. (17 steps per ms) remains 14/21 properties
BEST_FIRST walk for 40002 steps (8 resets) in 205 ms. (194 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 209 ms. (190 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 188 ms. (211 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 213 ms. (186 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 198 ms. (201 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 147 ms. (270 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 171 ms. (232 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 131 ms. (303 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 13/13 properties
[2026-06-16 14:33:25] [INFO ] Invariant cache hit.
[2026-06-16 14:33:25] [INFO ] State equation strengthened by 832 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 2612/2632 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SMT process timed out in 5318ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 20 out of 2669 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2669/2669 places, 3422/3422 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 2669 transition count 3390
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 2637 transition count 3390
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 2636 transition count 3389
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 2636 transition count 3389
Performed 822 Post agglomeration using F-continuation condition.Transition count delta: 822
Deduced a syphon composed of 822 places in 5 ms
Reduce places removed 822 places and 0 transitions.
Iterating global reduction 2 with 1644 rules applied. Total rules applied 1710 place count 1814 transition count 2567
Free-agglomeration rule (complex) applied 793 times.
Iterating global reduction 2 with 793 rules applied. Total rules applied 2503 place count 1814 transition count 1774
Reduce places removed 809 places and 0 transitions.
Iterating post reduction 2 with 809 rules applied. Total rules applied 3312 place count 1005 transition count 1774
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 3315 place count 1005 transition count 1774
Applied a total of 3315 rules in 1981 ms. Remains 1005 /2669 variables (removed 1664) and now considering 1774/3422 (removed 1648) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1982 ms. Remains : 1005/2669 places, 1774/3422 transitions.
RANDOM walk for 40000 steps (8 resets) in 534 ms. (74 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 183 ms. (217 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 124 ms. (320 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 108 ms. (366 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 145 ms. (273 steps per ms) remains 6/6 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4153788681183144622.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14876458089612816285.kers'
[2026-06-16 14:33:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4153788681183144622.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14876458089612816285.kers]
Culling duplicate invariants (modulo rational): removing 33 columns.
Culled 33 columns in 2 ms.
// Phase 1: matrix 1774 rows 972 cols 4494 entries
Finished phase 1 with 961 SingleSign rule and 6 generalized
[2026-06-16 14:33:33] [INFO ] Computed 38 invariants in 43 ms
Computed 38 P flows in 44 ms.
Exported basis to /tmp/petrispot-output-14876458089612816285.kers
Total runtime 47 ms.
[2026-06-16 14:33:33] [INFO ] State equation strengthened by 832 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 70/78 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 896/974 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/974 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/974 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/974 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 31/1005 variables, 31/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1005 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1774/2779 variables, 1005/1071 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2779 variables, 832/1903 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2779 variables, 0/1903 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/2779 variables, 0/1903 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2779/2779 variables, and 1903 constraints, problems are : Problem set: 0 solved, 6 unsolved in 29100 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1005/1005 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 70/78 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 896/974 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/974 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/974 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/974 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 31/1005 variables, 31/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1005 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1774/2779 variables, 1005/1075 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2779 variables, 832/1907 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2779 variables, 6/1913 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2779 variables, 0/1913 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/2779 variables, 0/1913 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2779/2779 variables, and 1913 constraints, problems are : Problem set: 0 solved, 6 unsolved in 19650 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1005/1005 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48862ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 2 properties in 1891 ms.
Support contains 5 out of 1005 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1005/1005 places, 1774/1774 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 1002 transition count 1772
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 12 place count 1002 transition count 1765
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 24 place count 990 transition count 1765
Applied a total of 24 rules in 192 ms. Remains 990 /1005 variables (removed 15) and now considering 1765/1774 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 990/1005 places, 1765/1774 transitions.
RANDOM walk for 40000 steps (8 resets) in 388 ms. (102 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 170485 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 4
Probabilistic random walk after 170485 steps, saw 87561 distinct states, run finished after 3011 ms. (steps per millisecond=56 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10445315237940467976.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7250741403683455430.kers'
[2026-06-16 14:34:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10445315237940467976.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7250741403683455430.kers]
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 1 ms.
// Phase 1: matrix 1765 rows 961 cols 4463 entries
Finished phase 1 with 957 SingleSign rule and 1 generalized
[2026-06-16 14:34:27] [INFO ] Computed 32 invariants in 26 ms
Computed 32 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-7250741403683455430.kers
Total runtime 28 ms.
[2026-06-16 14:34:27] [INFO ] State equation strengthened by 832 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 67/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 891/963 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/963 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/963 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/963 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 27/990 variables, 27/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/990 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1765/2755 variables, 990/1044 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2755 variables, 832/1876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2755 variables, 0/1876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/2755 variables, 0/1876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2755/2755 variables, and 1876 constraints, problems are : Problem set: 0 solved, 4 unsolved in 19410 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 990/990 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 67/72 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 891/963 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/963 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/963 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/963 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 27/990 variables, 27/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/990 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1765/2755 variables, 990/1048 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2755 variables, 832/1880 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2755 variables, 4/1884 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2755 variables, 0/1884 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/2755 variables, 0/1884 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2755/2755 variables, and 1884 constraints, problems are : Problem set: 0 solved, 4 unsolved in 9374 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 990/990 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28856ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1440 ms.
Support contains 5 out of 990 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 990/990 places, 1765/1765 transitions.
Applied a total of 0 rules in 71 ms. Remains 990 /990 variables (removed 0) and now considering 1765/1765 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 990/990 places, 1765/1765 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 990/990 places, 1765/1765 transitions.
Applied a total of 0 rules in 71 ms. Remains 990 /990 variables (removed 0) and now considering 1765/1765 (removed 0) transitions.
[2026-06-16 14:34:58] [INFO ] Invariant cache hit.
[2026-06-16 14:34:59] [INFO ] Implicit Places using invariants in 1657 ms returned []
[2026-06-16 14:34:59] [INFO ] Invariant cache hit.
[2026-06-16 14:35:01] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 14:35:31] [INFO ] Performed 877/990 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 14:35:36] [INFO ] Implicit Places using invariants and state equation in 36493 ms returned []
Implicit Place search using SMT with State Equation took 38155 ms to find 0 implicit places.
[2026-06-16 14:35:36] [INFO ] Redundant transitions in 174 ms returned []
Running 1733 sub problems to find dead transitions.
[2026-06-16 14:35:36] [INFO ] Invariant cache hit.
[2026-06-16 14:35:36] [INFO ] State equation strengthened by 832 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/957 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1733 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 957/2755 variables, and 30 constraints, problems are : Problem set: 0 solved, 1733 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/990 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 1733/1733 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1733 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/957 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1733 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 957/2755 variables, and 30 constraints, problems are : Problem set: 0 solved, 1733 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/990 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/1733 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61008ms problems are : Problem set: 0 solved, 1733 unsolved
Search for dead transitions found 0 dead transitions in 61020ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99444 ms. Remains : 990/990 places, 1765/1765 transitions.
Computed a total of 147 stabilizing places and 926 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 2669 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2669/2669 places, 3422/3422 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 2669 transition count 3390
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 2637 transition count 3390
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 2633 transition count 3386
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 2633 transition count 3386
Performed 858 Post agglomeration using F-continuation condition.Transition count delta: 858
Deduced a syphon composed of 858 places in 5 ms
Reduce places removed 858 places and 0 transitions.
Iterating global reduction 2 with 1716 rules applied. Total rules applied 1788 place count 1775 transition count 2528
Applied a total of 1788 rules in 1013 ms. Remains 1775 /2669 variables (removed 894) and now considering 2528/3422 (removed 894) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17760531439926190524.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1117602517768378685.kers'
[2026-06-16 14:36:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17760531439926190524.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1117602517768378685.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 2 ms.
// Phase 1: matrix 2528 rows 1749 cols 8416 entries
Finished phase 1 with 1721 SingleSign rule and 0 generalized
[2026-06-16 14:36:38] [INFO ] Computed 54 invariants in 62 ms
Computed 54 P flows in 63 ms.
Exported basis to /tmp/petrispot-output-1117602517768378685.kers
Total runtime 66 ms.
[2026-06-16 14:36:41] [INFO ] Implicit Places using invariants in 2682 ms returned []
[2026-06-16 14:36:41] [INFO ] Invariant cache hit.
[2026-06-16 14:36:43] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 14:37:15] [INFO ] Performed 920/1775 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2026-06-16 14:37:46] [INFO ] Performed 942/1775 implicitness test of which 0 returned IMPLICIT in 62 seconds.
[2026-06-16 14:38:16] [INFO ] Performed 1250/1775 implicitness test of which 0 returned IMPLICIT in 92 seconds.
[2026-06-16 14:38:46] [INFO ] Performed 1536/1775 implicitness test of which 0 returned IMPLICIT in 122 seconds.
[2026-06-16 14:38:46] [INFO ] Timeout of Implicit test with SMT after 122 seconds.
[2026-06-16 14:38:46] [INFO ] Implicit Places using invariants and state equation in 124668 ms returned []
Implicit Place search using SMT with State Equation took 127358 ms to find 0 implicit places.
[2026-06-16 14:38:46] [INFO ] Redundant transitions in 235 ms returned []
Running 2496 sub problems to find dead transitions.
[2026-06-16 14:38:46] [INFO ] Invariant cache hit.
[2026-06-16 14:38:46] [INFO ] State equation strengthened by 832 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1742 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 2496 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1742/4303 variables, and 52 constraints, problems are : Problem set: 0 solved, 2496 unsolved in 30094 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/1775 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 2496/2496 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1742 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 2496 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1742/4303 variables, and 52 constraints, problems are : Problem set: 0 solved, 2496 unsolved in 30095 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/1775 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/2496 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61734ms problems are : Problem set: 0 solved, 2496 unsolved
Search for dead transitions found 0 dead transitions in 61745ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1775/2669 places, 2528/3422 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 190395 ms. Remains : 1775/2669 places, 2528/3422 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 282 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FileSystem-PT-N08I32B26-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 886 ms.
Product exploration explored 100000 steps with 0 reset in 663 ms.
Computed a total of 85 stabilizing places and 864 stable transitions
Computed a total of 85 stabilizing places and 864 stable transitions
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 238 ms. (167 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 182135 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 1
Probabilistic random walk after 182135 steps, saw 154901 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
[2026-06-16 14:39:53] [INFO ] Invariant cache hit.
[2026-06-16 14:39:53] [INFO ] State equation strengthened by 832 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) 1723/1725 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 6964ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1775 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1775/1775 places, 2528/2528 transitions.
Free-agglomeration rule (complex) applied 831 times.
Iterating global reduction 0 with 831 rules applied. Total rules applied 831 place count 1775 transition count 1697
Reduce places removed 856 places and 0 transitions.
Iterating post reduction 0 with 856 rules applied. Total rules applied 1687 place count 919 transition count 1697
Applied a total of 1687 rules in 377 ms. Remains 919 /1775 variables (removed 856) and now considering 1697/2528 (removed 831) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 378 ms. Remains : 919/1775 places, 1697/2528 transitions.
RANDOM walk for 40000 steps (8 resets) in 202 ms. (197 steps per ms) remains 1/1 properties
BEST_FIRST walk for 8405 steps (0 resets) in 28 ms. (289 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
[2026-06-16 14:40:01] [INFO ] Invariant cache hit.
[2026-06-16 14:40:07] [INFO ] [Real]Absence check using 54 positive place invariants in 679 ms returned sat
[2026-06-16 14:40:16] [INFO ] [Real]Absence check using state equation in 8728 ms returned unknown
Could not prove EG (NOT p0)
Knowledge-based reduction took 25907 ms.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 1775 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1775/1775 places, 2528/2528 transitions.
Applied a total of 0 rules in 173 ms. Remains 1775 /1775 variables (removed 0) and now considering 2528/2528 (removed 0) transitions.
[2026-06-16 14:40:16] [INFO ] Invariant cache hit.
[2026-06-16 14:40:19] [INFO ] Implicit Places using invariants in 3173 ms returned []
[2026-06-16 14:40:19] [INFO ] Invariant cache hit.
[2026-06-16 14:40:21] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 14:40:51] [INFO ] Performed 919/1775 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 14:41:22] [INFO ] Performed 942/1775 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-06-16 14:41:52] [INFO ] Performed 1246/1775 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-06-16 14:42:22] [INFO ] Performed 1547/1775 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-06-16 14:42:22] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-06-16 14:42:22] [INFO ] Implicit Places using invariants and state equation in 122873 ms returned []
Implicit Place search using SMT with State Equation took 126052 ms to find 0 implicit places.
[2026-06-16 14:42:22] [INFO ] Redundant transitions in 74 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126317 ms. Remains : 1775/1775 places, 2528/2528 transitions.
Computed a total of 85 stabilizing places and 864 stable transitions
Computed a total of 85 stabilizing places and 864 stable transitions
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 477 ms. (83 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 159309 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 1
Probabilistic random walk after 159309 steps, saw 135504 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
[2026-06-16 14:42:25] [INFO ] Invariant cache hit.
[2026-06-16 14:42:25] [INFO ] State equation strengthened by 832 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) 1723/1725 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 6962ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1775 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1775/1775 places, 2528/2528 transitions.
Free-agglomeration rule (complex) applied 831 times.
Iterating global reduction 0 with 831 rules applied. Total rules applied 831 place count 1775 transition count 1697
Reduce places removed 856 places and 0 transitions.
Iterating post reduction 0 with 856 rules applied. Total rules applied 1687 place count 919 transition count 1697
Applied a total of 1687 rules in 287 ms. Remains 919 /1775 variables (removed 856) and now considering 1697/2528 (removed 831) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 287 ms. Remains : 919/1775 places, 1697/2528 transitions.
RANDOM walk for 40000 steps (8 resets) in 195 ms. (204 steps per ms) remains 1/1 properties
BEST_FIRST walk for 29602 steps (6 resets) in 60 ms. (485 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
[2026-06-16 14:42:33] [INFO ] Invariant cache hit.
[2026-06-16 14:42:39] [INFO ] [Real]Absence check using 54 positive place invariants in 707 ms returned sat
[2026-06-16 14:42:48] [INFO ] [Real]Absence check using state equation in 8850 ms returned unknown
Could not prove EG (NOT p0)
Knowledge-based reduction took 25830 ms.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 438 ms.
Product exploration explored 100000 steps with 0 reset in 588 ms.
Built C files in :
/tmp/ltsmin3291582460656303392
[2026-06-16 14:42:49] [INFO ] Too many transitions (2528) to apply POR reductions. Disabling POR matrices.
[2026-06-16 14:42:49] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3291582460656303392
Running compilation step : cd /tmp/ltsmin3291582460656303392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3291582460656303392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3291582460656303392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 1775 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1775/1775 places, 2528/2528 transitions.
Applied a total of 0 rules in 162 ms. Remains 1775 /1775 variables (removed 0) and now considering 2528/2528 (removed 0) transitions.
[2026-06-16 14:42:52] [INFO ] Invariant cache hit.
[2026-06-16 14:42:55] [INFO ] Implicit Places using invariants in 2760 ms returned []
[2026-06-16 14:42:55] [INFO ] Invariant cache hit.
[2026-06-16 14:42:57] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 14:43:29] [INFO ] Performed 922/1775 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2026-06-16 14:43:59] [INFO ] Performed 1014/1775 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2026-06-16 14:44:29] [INFO ] Performed 1314/1775 implicitness test of which 0 returned IMPLICIT in 91 seconds.
[2026-06-16 14:44:59] [INFO ] Performed 1596/1775 implicitness test of which 0 returned IMPLICIT in 121 seconds.
[2026-06-16 14:44:59] [INFO ] Timeout of Implicit test with SMT after 121 seconds.
[2026-06-16 14:44:59] [INFO ] Implicit Places using invariants and state equation in 123813 ms returned []
Implicit Place search using SMT with State Equation took 126583 ms to find 0 implicit places.
[2026-06-16 14:44:59] [INFO ] Redundant transitions in 71 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126831 ms. Remains : 1775/1775 places, 2528/2528 transitions.
Built C files in :
/tmp/ltsmin2966381087983478649
[2026-06-16 14:44:59] [INFO ] Too many transitions (2528) to apply POR reductions. Disabling POR matrices.
[2026-06-16 14:44:59] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2966381087983478649
Running compilation step : cd /tmp/ltsmin2966381087983478649;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2966381087983478649;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2966381087983478649;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-06-16 14:45:02] [INFO ] Flatten gal took : 87 ms
[2026-06-16 14:45:03] [INFO ] Flatten gal took : 88 ms
[2026-06-16 14:45:03] [INFO ] Time to serialize gal into /tmp/LTL10228323578016121387.gal : 42 ms
[2026-06-16 14:45:03] [INFO ] Time to serialize properties into /tmp/LTL11916789026810204747.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10228323578016121387.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1060012270338060674.hoa' '-atoms' '/tmp/LTL11916789026810204747.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/LTL11916789026810204747.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1060012270338060674.hoa
Detected timeout of ITS tools.
[2026-06-16 14:45:18] [INFO ] Flatten gal took : 78 ms
[2026-06-16 14:45:18] [INFO ] Flatten gal took : 82 ms
[2026-06-16 14:45:18] [INFO ] Time to serialize gal into /tmp/LTL7416531044359820670.gal : 26 ms
[2026-06-16 14:45:18] [INFO ] Time to serialize properties into /tmp/LTL16494778479363743755.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7416531044359820670.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16494778479363743755.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((busy_58_60>=1)&&(testbusy_32_58>=1))"))))
Formula 0 simplified : FG!"((busy_58_60>=1)&&(testbusy_32_58>=1))"
Detected timeout of ITS tools.
[2026-06-16 14:45:33] [INFO ] Flatten gal took : 63 ms
[2026-06-16 14:45:33] [INFO ] Applying decomposition
[2026-06-16 14:45:33] [INFO ] Flatten gal took : 74 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/graph12363890073534971456.txt' '-o' '/tmp/graph12363890073534971456.bin' '-w' '/tmp/graph12363890073534971456.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12363890073534971456.bin' '-l' '-1' '-v' '-w' '/tmp/graph12363890073534971456.weights' '-q' '0' '-e' '0.001'
[2026-06-16 14:45:34] [INFO ] Decomposing Gal with order
[2026-06-16 14:45:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-16 14:45:34] [INFO ] Removed a total of 861 redundant transitions.
[2026-06-16 14:45:34] [INFO ] Flatten gal took : 740 ms
[2026-06-16 14:45:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 1627 labels/synchronizations in 136 ms.
[2026-06-16 14:45:35] [INFO ] Time to serialize gal into /tmp/LTL12736366907411756838.gal : 35 ms
[2026-06-16 14:45:35] [INFO ] Time to serialize properties into /tmp/LTL314973601684177639.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/LTL12736366907411756838.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL314973601684177639.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 : !((G(F("((i12.u57.busy_58_60>=1)&&(i12.u57.testbusy_32_58>=1))"))))
Formula 0 simplified : FG!"((i12.u57.busy_58_60>=1)&&(i12.u57.testbusy_32_58>=1))"
Detected timeout of ITS tools.
Treatment of property FileSystem-PT-N08I32B26-LTLFireability-00 finished in 552476 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) U X((X(X(p1))&&F(p0))))))'
Support contains 4 out of 2669 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2669/2669 places, 3422/3422 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2665 transition count 3418
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2665 transition count 3418
Applied a total of 8 rules in 328 ms. Remains 2665 /2669 variables (removed 4) and now considering 3418/3422 (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-2805207322563166743.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14100018251200547117.kers'
[2026-06-16 14:45:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2805207322563166743.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14100018251200547117.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 3 ms.
// Phase 1: matrix 3418 rows 2639 cols 9390 entries
Finished phase 1 with 2611 SingleSign rule and 0 generalized
[2026-06-16 14:45:50] [INFO ] Computed 54 invariants in 120 ms
Computed 54 P flows in 121 ms.
Exported basis to /tmp/petrispot-output-14100018251200547117.kers
Total runtime 123 ms.
[2026-06-16 14:45:54] [INFO ] Implicit Places using invariants in 3400 ms returned []
[2026-06-16 14:45:54] [INFO ] Invariant cache hit.
[2026-06-16 14:45:56] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 14:46:27] [INFO ] Performed 976/2665 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 14:46:57] [INFO ] Performed 1890/2665 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-06-16 14:47:27] [INFO ] Performed 2363/2665 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-06-16 14:47:46] [INFO ] Implicit Places using invariants and state equation in 112923 ms returned []
Implicit Place search using SMT with State Equation took 116326 ms to find 0 implicit places.
Running 3386 sub problems to find dead transitions.
[2026-06-16 14:47:47] [INFO ] Invariant cache hit.
[2026-06-16 14:47:47] [INFO ] State equation strengthened by 832 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2632 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2632/6083 variables, and 52 constraints, problems are : Problem set: 0 solved, 3386 unsolved in 30118 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/2665 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 3386/3386 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2632 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3386 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2632/6083 variables, and 52 constraints, problems are : Problem set: 0 solved, 3386 unsolved in 30117 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/2665 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/3386 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62314ms problems are : Problem set: 0 solved, 3386 unsolved
Search for dead transitions found 0 dead transitions in 62332ms
Starting structural reductions in LTL mode, iteration 1 : 2665/2669 places, 3418/3422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 179026 ms. Remains : 2665/2669 places, 3418/3422 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) U X((X(X(p1))&&F(p0))))))'
Stuttering acceptance computed with spot in 732 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (NOT p1), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running random walk in product with property : FileSystem-PT-N08I32B26-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 599 ms.
Product exploration explored 100000 steps with 0 reset in 497 ms.
Computed a total of 143 stabilizing places and 922 stable transitions
Computed a total of 143 stabilizing places and 922 stable transitions
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 13 states, 21 edges and 2 AP (stutter sensitive) to 13 states, 21 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 555 ms. (71 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
[2026-06-16 14:48:51] [INFO ] Invariant cache hit.
[2026-06-16 14:48:51] [INFO ] State equation strengthened by 832 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2612/2616 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2616 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 49/2665 variables, 49/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2665 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3418/6083 variables, 2665/2719 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6083/6083 variables, and 3551 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3923 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 2665/2665 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2612/2616 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 9007ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2665 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2665/2665 places, 3418/3418 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 2665 transition count 3386
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 2633 transition count 3386
Performed 824 Post agglomeration using F-continuation condition.Transition count delta: 824
Deduced a syphon composed of 824 places in 3 ms
Reduce places removed 824 places and 0 transitions.
Iterating global reduction 2 with 1648 rules applied. Total rules applied 1712 place count 1809 transition count 2562
Free-agglomeration rule (complex) applied 799 times.
Iterating global reduction 2 with 799 rules applied. Total rules applied 2511 place count 1809 transition count 1763
Reduce places removed 822 places and 0 transitions.
Iterating post reduction 2 with 822 rules applied. Total rules applied 3333 place count 987 transition count 1763
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 3336 place count 987 transition count 1763
Applied a total of 3336 rules in 750 ms. Remains 987 /2665 variables (removed 1678) and now considering 1763/3418 (removed 1655) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 751 ms. Remains : 987/2665 places, 1763/3418 transitions.
RANDOM walk for 40000 steps (8 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 209662 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 2
Probabilistic random walk after 209662 steps, saw 107677 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6308481606078616977.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5716020482837434646.kers'
[2026-06-16 14:49:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6308481606078616977.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5716020482837434646.kers]
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 2 ms.
// Phase 1: matrix 1763 rows 959 cols 4458 entries
Finished phase 1 with 954 SingleSign rule and 2 generalized
[2026-06-16 14:49:04] [INFO ] Computed 31 invariants in 30 ms
Computed 31 P flows in 31 ms.
Exported basis to /tmp/petrispot-output-5716020482837434646.kers
Total runtime 33 ms.
[2026-06-16 14:49:04] [INFO ] State equation strengthened by 832 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 67/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 890/961 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/961 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/961 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 26/987 variables, 26/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/987 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1763/2750 variables, 987/1034 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2750 variables, 832/1866 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2750 variables, 0/1866 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2750 variables, 0/1866 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2750/2750 variables, and 1866 constraints, problems are : Problem set: 0 solved, 2 unsolved in 15432 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 987/987 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 67/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 890/961 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/961 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/961 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/961 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 26/987 variables, 26/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/987 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1763/2750 variables, 987/1048 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2750 variables, 832/1880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2750 variables, 2/1882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2750 variables, 0/1882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2750 variables, 0/1882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2750/2750 variables, and 1882 constraints, problems are : Problem set: 0 solved, 2 unsolved in 15039 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 987/987 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30532ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 234 ms.
Support contains 4 out of 987 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 987/987 places, 1763/1763 transitions.
Applied a total of 0 rules in 111 ms. Remains 987 /987 variables (removed 0) and now considering 1763/1763 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 987/987 places, 1763/1763 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 987/987 places, 1763/1763 transitions.
Applied a total of 0 rules in 107 ms. Remains 987 /987 variables (removed 0) and now considering 1763/1763 (removed 0) transitions.
[2026-06-16 14:49:35] [INFO ] Invariant cache hit.
[2026-06-16 14:49:37] [INFO ] Implicit Places using invariants in 1983 ms returned []
[2026-06-16 14:49:37] [INFO ] Invariant cache hit.
[2026-06-16 14:49:38] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 14:50:09] [INFO ] Performed 975/987 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 14:50:09] [INFO ] Implicit Places using invariants and state equation in 31784 ms returned []
Implicit Place search using SMT with State Equation took 33769 ms to find 0 implicit places.
[2026-06-16 14:50:09] [INFO ] Redundant transitions in 57 ms returned []
Running 1731 sub problems to find dead transitions.
[2026-06-16 14:50:09] [INFO ] Invariant cache hit.
[2026-06-16 14:50:09] [INFO ] State equation strengthened by 832 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/954 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1731 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 954/2750 variables, and 29 constraints, problems are : Problem set: 0 solved, 1731 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/987 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 1731/1731 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1731 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/954 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1731 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 954/2750 variables, and 29 constraints, problems are : Problem set: 0 solved, 1731 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/987 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/1731 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61047ms problems are : Problem set: 0 solved, 1731 unsolved
Search for dead transitions found 0 dead transitions in 61053ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95010 ms. Remains : 987/987 places, 1763/1763 transitions.
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 13 states, 21 edges and 2 AP (stutter sensitive) to 13 states, 21 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 508 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (NOT p1), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17055227141680785244.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9461915605443260453.kers'
[2026-06-16 14:51:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17055227141680785244.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9461915605443260453.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 4 ms.
// Phase 1: matrix 3418 rows 2639 cols 9390 entries
Finished phase 1 with 2611 SingleSign rule and 0 generalized
[2026-06-16 14:51:11] [INFO ] Computed 54 invariants in 134 ms
Computed 54 P flows in 135 ms.
Exported basis to /tmp/petrispot-output-9461915605443260453.kers
Total runtime 138 ms.
[2026-06-16 14:51:20] [INFO ] [Real]Absence check using 54 positive place invariants in 1361 ms returned sat
[2026-06-16 14:51:26] [INFO ] [Real]Absence check using state equation in 5329 ms returned unknown
Could not prove EG (NOT p0)
[2026-06-16 14:51:26] [INFO ] Invariant cache hit.
[2026-06-16 14:51:35] [INFO ] [Real]Absence check using 54 positive place invariants in 1543 ms returned sat
[2026-06-16 14:51:41] [INFO ] [Real]Absence check using state equation in 5368 ms returned unknown
Could not prove EG (NOT p1)
Knowledge-based reduction took 170101 ms.
Stuttering acceptance computed with spot in 471 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (NOT p1), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Support contains 4 out of 2665 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2665/2665 places, 3418/3418 transitions.
Applied a total of 0 rules in 156 ms. Remains 2665 /2665 variables (removed 0) and now considering 3418/3418 (removed 0) transitions.
[2026-06-16 14:51:41] [INFO ] Invariant cache hit.
[2026-06-16 14:51:45] [INFO ] Implicit Places using invariants in 3584 ms returned []
[2026-06-16 14:51:45] [INFO ] Invariant cache hit.
[2026-06-16 14:51:48] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 14:52:19] [INFO ] Performed 976/2665 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2026-06-16 14:52:49] [INFO ] Performed 1856/2665 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2026-06-16 14:53:19] [INFO ] Performed 2245/2665 implicitness test of which 0 returned IMPLICIT in 91 seconds.
[2026-06-16 14:53:48] [INFO ] Implicit Places using invariants and state equation in 122720 ms returned []
Implicit Place search using SMT with State Equation took 126323 ms to find 0 implicit places.
Running 3386 sub problems to find dead transitions.
[2026-06-16 14:53:48] [INFO ] Invariant cache hit.
[2026-06-16 14:53:48] [INFO ] State equation strengthened by 832 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2632 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2632/6083 variables, and 52 constraints, problems are : Problem set: 0 solved, 3386 unsolved in 30111 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/2665 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 3386/3386 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2632 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3386 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2632/6083 variables, and 52 constraints, problems are : Problem set: 0 solved, 3386 unsolved in 30105 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/2665 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/3386 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62421ms problems are : Problem set: 0 solved, 3386 unsolved
Search for dead transitions found 0 dead transitions in 62433ms
Finished structural reductions in LTL mode , in 1 iterations and 188927 ms. Remains : 2665/2665 places, 3418/3418 transitions.
Computed a total of 143 stabilizing places and 922 stable transitions
Computed a total of 143 stabilizing places and 922 stable transitions
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 13 states, 21 edges and 2 AP (stutter sensitive) to 13 states, 21 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 409 ms. (97 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
[2026-06-16 14:54:51] [INFO ] Invariant cache hit.
[2026-06-16 14:54:51] [INFO ] State equation strengthened by 832 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2612/2616 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2616 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 49/2665 variables, 49/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2665 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6083/6083 variables, and 2719 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3087 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 2665/2665 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2612/2616 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 10873ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2665 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2665/2665 places, 3418/3418 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 2665 transition count 3386
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 2633 transition count 3386
Performed 824 Post agglomeration using F-continuation condition.Transition count delta: 824
Deduced a syphon composed of 824 places in 3 ms
Reduce places removed 824 places and 0 transitions.
Iterating global reduction 2 with 1648 rules applied. Total rules applied 1712 place count 1809 transition count 2562
Free-agglomeration rule (complex) applied 799 times.
Iterating global reduction 2 with 799 rules applied. Total rules applied 2511 place count 1809 transition count 1763
Reduce places removed 822 places and 0 transitions.
Iterating post reduction 2 with 822 rules applied. Total rules applied 3333 place count 987 transition count 1763
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 3336 place count 987 transition count 1763
Applied a total of 3336 rules in 742 ms. Remains 987 /2665 variables (removed 1678) and now considering 1763/3418 (removed 1655) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 742 ms. Remains : 987/2665 places, 1763/3418 transitions.
RANDOM walk for 40000 steps (8 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 31667 steps (6 resets) in 49 ms. (633 steps per ms) remains 0/2 properties
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 13 states, 21 edges and 2 AP (stutter sensitive) to 13 states, 21 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 548 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (NOT p1), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
[2026-06-16 14:55:03] [INFO ] Invariant cache hit.
[2026-06-16 14:55:13] [INFO ] [Real]Absence check using 54 positive place invariants in 1487 ms returned sat
[2026-06-16 14:55:18] [INFO ] [Real]Absence check using state equation in 5091 ms returned unknown
Could not prove EG (NOT p0)
[2026-06-16 14:55:18] [INFO ] Invariant cache hit.
[2026-06-16 14:55:28] [INFO ] [Real]Absence check using 54 positive place invariants in 1384 ms returned sat
[2026-06-16 14:55:33] [INFO ] [Real]Absence check using state equation in 5297 ms returned unknown
Could not prove EG (NOT p1)
Knowledge-based reduction took 42831 ms.
Stuttering acceptance computed with spot in 576 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (NOT p1), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 581 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (NOT p1), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Product exploration explored 100000 steps with 0 reset in 591 ms.
Product exploration explored 100000 steps with 0 reset in 600 ms.
Spot run failed in 121 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/ltsmin3817632197299354827
[2026-06-16 14:55:36] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3817632197299354827
Running compilation step : cd /tmp/ltsmin3817632197299354827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3817632197299354827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3817632197299354827;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 2665 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2665/2665 places, 3418/3418 transitions.
Applied a total of 0 rules in 156 ms. Remains 2665 /2665 variables (removed 0) and now considering 3418/3418 (removed 0) transitions.
[2026-06-16 14:55:39] [INFO ] Invariant cache hit.
[2026-06-16 14:55:42] [INFO ] Implicit Places using invariants in 2944 ms returned []
[2026-06-16 14:55:42] [INFO ] Invariant cache hit.
[2026-06-16 14:55:44] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 14:56:14] [INFO ] Performed 973/2665 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 14:56:45] [INFO ] Performed 1000/2665 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-06-16 14:57:15] [INFO ] Performed 2266/2665 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-06-16 14:57:43] [INFO ] Implicit Places using invariants and state equation in 121638 ms returned []
Implicit Place search using SMT with State Equation took 124588 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 124747 ms. Remains : 2665/2665 places, 3418/3418 transitions.
Built C files in :
/tmp/ltsmin5005150418515588256
[2026-06-16 14:57:43] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5005150418515588256
Running compilation step : cd /tmp/ltsmin5005150418515588256;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5005150418515588256;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5005150418515588256;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-06-16 14:57:47] [INFO ] Flatten gal took : 94 ms
[2026-06-16 14:57:47] [INFO ] Flatten gal took : 90 ms
[2026-06-16 14:57:47] [INFO ] Time to serialize gal into /tmp/LTL14906269482660841715.gal : 45 ms
[2026-06-16 14:57:47] [INFO ] Time to serialize properties into /tmp/LTL11315244257345136777.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14906269482660841715.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4618525341389273218.hoa' '-atoms' '/tmp/LTL11315244257345136777.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/LTL11315244257345136777.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4618525341389273218.hoa
Detected timeout of ITS tools.
[2026-06-16 14:58:02] [INFO ] Flatten gal took : 69 ms
[2026-06-16 14:58:02] [INFO ] Flatten gal took : 71 ms
[2026-06-16 14:58:02] [INFO ] Time to serialize gal into /tmp/LTL17642112307555308647.gal : 15 ms
[2026-06-16 14:58:02] [INFO ] Time to serialize properties into /tmp/LTL4214647371195950667.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/LTL17642112307555308647.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4214647371195950667.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F(!("((busy_41_60>=1)&&(testbusy_9_41>=1))")))U(X((X(X("((beginloop_29_33>=1)&&(lockb_33>=1))")))&&(F("((busy_41_60>=1)&&(testbu...175
Formula 0 simplified : F(G"((busy_41_60>=1)&&(testbusy_9_41>=1))" R X(XX!"((beginloop_29_33>=1)&&(lockb_33>=1))" | G!"((busy_41_60>=1)&&(testbusy_9_41>=1))...158
Detected timeout of ITS tools.
[2026-06-16 14:58:17] [INFO ] Flatten gal took : 79 ms
[2026-06-16 14:58:17] [INFO ] Applying decomposition
[2026-06-16 14:58:17] [INFO ] Flatten gal took : 85 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/graph10543407369104924602.txt' '-o' '/tmp/graph10543407369104924602.bin' '-w' '/tmp/graph10543407369104924602.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10543407369104924602.bin' '-l' '-1' '-v' '-w' '/tmp/graph10543407369104924602.weights' '-q' '0' '-e' '0.001'
[2026-06-16 14:58:18] [INFO ] Decomposing Gal with order
[2026-06-16 14:58:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-16 14:58:18] [INFO ] Removed a total of 3826 redundant transitions.
[2026-06-16 14:58:19] [INFO ] Flatten gal took : 216 ms
[2026-06-16 14:58:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 482 labels/synchronizations in 116 ms.
[2026-06-16 14:58:19] [INFO ] Time to serialize gal into /tmp/LTL13799930349733418172.gal : 45 ms
[2026-06-16 14:58:19] [INFO ] Time to serialize properties into /tmp/LTL9177554951162869145.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/LTL13799930349733418172.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9177554951162869145.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((F(!("((i5.i1.u569.busy_41_60>=1)&&(i5.i1.u541.testbusy_9_41>=1))")))U(X((X(X("((i9.i1.u339.beginloop_29_33>=1)&&(i9.i2.u976.lock...241
Formula 0 simplified : F(G"((i5.i1.u569.busy_41_60>=1)&&(i5.i1.u541.testbusy_9_41>=1))" R X(XX!"((i9.i1.u339.beginloop_29_33>=1)&&(i9.i2.u976.lockb_33>=1))...224
Detected timeout of ITS tools.
Treatment of property FileSystem-PT-N08I32B26-LTLFireability-02 finished in 764138 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)||p1)) U G((X(X(p2)) U p3))))'
Support contains 7 out of 2669 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2669/2669 places, 3422/3422 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2666 transition count 3419
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2666 transition count 3419
Applied a total of 6 rules in 328 ms. Remains 2666 /2669 variables (removed 3) and now considering 3419/3422 (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-17086826956621521770.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9778962076134258116.kers'
[2026-06-16 14:58:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17086826956621521770.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9778962076134258116.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 3 ms.
// Phase 1: matrix 3419 rows 2640 cols 9393 entries
Finished phase 1 with 2612 SingleSign rule and 0 generalized
[2026-06-16 14:58:34] [INFO ] Computed 54 invariants in 126 ms
Computed 54 P flows in 126 ms.
Exported basis to /tmp/petrispot-output-9778962076134258116.kers
Total runtime 131 ms.
[2026-06-16 14:58:38] [INFO ] Implicit Places using invariants in 3337 ms returned []
[2026-06-16 14:58:38] [INFO ] Invariant cache hit.
[2026-06-16 14:58:41] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 14:59:12] [INFO ] Performed 870/2666 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2026-06-16 14:59:44] [INFO ] Performed 994/2666 implicitness test of which 0 returned IMPLICIT in 62 seconds.
[2026-06-16 15:00:14] [INFO ] Performed 2100/2666 implicitness test of which 0 returned IMPLICIT in 92 seconds.
[2026-06-16 15:00:44] [INFO ] Performed 2463/2666 implicitness test of which 0 returned IMPLICIT in 122 seconds.
[2026-06-16 15:00:44] [INFO ] Timeout of Implicit test with SMT after 122 seconds.
[2026-06-16 15:00:44] [INFO ] Implicit Places using invariants and state equation in 126243 ms returned []
Implicit Place search using SMT with State Equation took 129592 ms to find 0 implicit places.
Running 3387 sub problems to find dead transitions.
[2026-06-16 15:00:44] [INFO ] Invariant cache hit.
[2026-06-16 15:00:44] [INFO ] State equation strengthened by 832 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2633 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3387 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2633/6085 variables, and 52 constraints, problems are : Problem set: 0 solved, 3387 unsolved in 30101 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/2666 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 3387/3387 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3387 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2633 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3387 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2633/6085 variables, and 52 constraints, problems are : Problem set: 0 solved, 3387 unsolved in 30107 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/2666 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/3387 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62187ms problems are : Problem set: 0 solved, 3387 unsolved
Search for dead transitions found 0 dead transitions in 62196ms
Starting structural reductions in LTL mode, iteration 1 : 2666/2669 places, 3419/3422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 192147 ms. Remains : 2666/2669 places, 3419/3422 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!(G(p0)||p1)) U G((X(X(p2)) U p3))))'
Stuttering acceptance computed with spot in 478 ms :[(NOT p3), (NOT p3), (OR (AND p0 p1 (NOT p3)) (AND p0 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), p0, (OR p1 p0)]
Running random walk in product with property : FileSystem-PT-N08I32B26-LTLFireability-04
Product exploration explored 100000 steps with 19 reset in 596 ms.
Product exploration explored 100000 steps with 24 reset in 646 ms.
Computed a total of 144 stabilizing places and 923 stable transitions
Computed a total of 144 stabilizing places and 923 stable transitions
Detected a total of 144/2666 stabilizing places and 923/3419 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge based reduction with 15 factoid took 1179 ms. Reduced automaton from 9 states, 22 edges and 4 AP (stutter sensitive) to 9 states, 22 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 411 ms. (97 steps per ms) remains 6/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 156 ms. (254 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 6/6 properties
[2026-06-16 15:01:50] [INFO ] Invariant cache hit.
[2026-06-16 15:01:50] [INFO ] State equation strengthened by 832 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2612/2619 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SMT process timed out in 7407ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 2666 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2666/2666 places, 3419/3419 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 2666 transition count 3387
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 2634 transition count 3387
Performed 832 Post agglomeration using F-continuation condition.Transition count delta: 832
Deduced a syphon composed of 832 places in 4 ms
Reduce places removed 832 places and 0 transitions.
Iterating global reduction 2 with 1664 rules applied. Total rules applied 1728 place count 1802 transition count 2555
Free-agglomeration rule (complex) applied 830 times.
Iterating global reduction 2 with 830 rules applied. Total rules applied 2558 place count 1802 transition count 1725
Reduce places removed 830 places and 0 transitions.
Iterating post reduction 2 with 830 rules applied. Total rules applied 3388 place count 972 transition count 1725
Applied a total of 3388 rules in 799 ms. Remains 972 /2666 variables (removed 1694) and now considering 1725/3419 (removed 1694) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 799 ms. Remains : 972/2666 places, 1725/3419 transitions.
RANDOM walk for 40000 steps (8 resets) in 276 ms. (144 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 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-2412037164529093175.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-19016602528948399.kers'
[2026-06-16 15:01:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2412037164529093175.kers, --Pflows, --basisKERS=/tmp/petrispot-output-19016602528948399.kers]
Culling duplicate invariants (modulo rational): removing 49 columns.
Culled 49 columns in 1 ms.
// Phase 1: matrix 1725 rows 923 cols 4416 entries
Finished phase 1 with 918 SingleSign rule and 0 generalized
[2026-06-16 15:01:58] [INFO ] Computed 54 invariants in 25 ms
Computed 54 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-19016602528948399.kers
Total runtime 28 ms.
[2026-06-16 15:01:58] [INFO ] State equation strengthened by 832 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) 862/863 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/863 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/946 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/946 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/946 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/972 variables, 26/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/972 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1725/2697 variables, 972/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2697 variables, 832/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2697 variables, 0/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/2697 variables, 0/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2697/2697 variables, and 1885 constraints, problems are : Problem set: 0 solved, 1 unsolved in 20565 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 972/972 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 27/27 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) 862/863 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/863 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/946 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/946 variables, 27/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/946 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/972 variables, 26/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/972 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1725/2697 variables, 972/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2697 variables, 832/1889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2697 variables, 1/1890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2697 variables, 0/1890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2697 variables, 0/1890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2697/2697 variables, and 1890 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5723 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 972/972 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26350ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 246 ms.
Support contains 1 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 1725/1725 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 0 with 75 rules applied. Total rules applied 75 place count 923 transition count 1699
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 77 place count 923 transition count 1697
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 81 place count 919 transition count 1697
Applied a total of 81 rules in 317 ms. Remains 919 /972 variables (removed 53) and now considering 1697/1725 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 317 ms. Remains : 919/972 places, 1697/1725 transitions.
RANDOM walk for 40000 steps (8 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 385590 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 1
Probabilistic random walk after 385590 steps, saw 320543 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11560146960237205173.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6817989126005856997.kers'
[2026-06-16 15:02:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11560146960237205173.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6817989126005856997.kers]
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 1 ms.
// Phase 1: matrix 1697 rows 892 cols 4258 entries
Finished phase 1 with 890 SingleSign rule and 0 generalized
[2026-06-16 15:02:28] [INFO ] Computed 29 invariants in 25 ms
Computed 29 P flows in 31 ms.
Exported basis to /tmp/petrispot-output-6817989126005856997.kers
Total runtime 33 ms.
[2026-06-16 15:02:28] [INFO ] State equation strengthened by 832 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) 834/835 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 58/893 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/893 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/893 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/893 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/919 variables, 26/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/919 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1697/2616 variables, 919/969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2616 variables, 832/1801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2616 variables, 0/1801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/2616 variables, 0/1801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2616/2616 variables, and 1801 constraints, problems are : Problem set: 0 solved, 1 unsolved in 15494 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, State Equation: 919/919 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 21/21 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) 834/835 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 58/893 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/893 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/893 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/893 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/919 variables, 26/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/919 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1697/2616 variables, 919/976 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2616 variables, 832/1808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2616 variables, 1/1809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2616 variables, 0/1809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2616 variables, 0/1809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2616/2616 variables, and 1809 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8084 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, State Equation: 919/919 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23635ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 112 ms.
Support contains 1 out of 919 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 919/919 places, 1697/1697 transitions.
Applied a total of 0 rules in 96 ms. Remains 919 /919 variables (removed 0) and now considering 1697/1697 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 919/919 places, 1697/1697 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 919/919 places, 1697/1697 transitions.
Applied a total of 0 rules in 94 ms. Remains 919 /919 variables (removed 0) and now considering 1697/1697 (removed 0) transitions.
[2026-06-16 15:02:52] [INFO ] Invariant cache hit.
[2026-06-16 15:02:54] [INFO ] Implicit Places using invariants in 1516 ms returned []
[2026-06-16 15:02:54] [INFO ] Invariant cache hit.
[2026-06-16 15:02:54] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 15:03:21] [INFO ] Implicit Places using invariants and state equation in 27353 ms returned []
Implicit Place search using SMT with State Equation took 28872 ms to find 0 implicit places.
[2026-06-16 15:03:21] [INFO ] Redundant transitions in 33 ms returned []
Running 1665 sub problems to find dead transitions.
[2026-06-16 15:03:21] [INFO ] Invariant cache hit.
[2026-06-16 15:03:21] [INFO ] State equation strengthened by 832 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/886 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 1665 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 886/2616 variables, and 27 constraints, problems are : Problem set: 0 solved, 1665 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 27/29 constraints, State Equation: 0/919 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 1665/1665 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1665 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/886 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 1665 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 886/2616 variables, and 27 constraints, problems are : Problem set: 0 solved, 1665 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 27/29 constraints, State Equation: 0/919 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/1665 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60673ms problems are : Problem set: 0 solved, 1665 unsolved
Search for dead transitions found 0 dead transitions in 60678ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89696 ms. Remains : 919/919 places, 1697/1697 transitions.
Knowledge based reduction with 15 factoid took 2792 ms. Reduced automaton from 9 states, 22 edges and 4 AP (stutter sensitive) to 9 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 382 ms :[(NOT p3), (NOT p3), (OR (AND p0 p1 (NOT p3)) (AND p0 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), p0, (OR p1 p0)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3232583128622636898.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13062106510765858268.kers'
[2026-06-16 15:04:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3232583128622636898.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13062106510765858268.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 5 ms.
// Phase 1: matrix 3419 rows 2640 cols 9393 entries
Finished phase 1 with 2612 SingleSign rule and 0 generalized
[2026-06-16 15:04:25] [INFO ] Computed 54 invariants in 192 ms
Computed 54 P flows in 193 ms.
Exported basis to /tmp/petrispot-output-13062106510765858268.kers
Total runtime 197 ms.
[2026-06-16 15:04:35] [INFO ] [Real]Absence check using 54 positive place invariants in 1702 ms returned sat
[2026-06-16 15:04:40] [INFO ] [Real]Absence check using state equation in 5343 ms returned unknown
Could not prove EG (NOT p3)
Knowledge-based reduction took 172122 ms.
Stuttering acceptance computed with spot in 373 ms :[(NOT p3), (NOT p3), (OR (AND p0 p1 (NOT p3)) (AND p0 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), p0, (OR p1 p0)]
Support contains 7 out of 2666 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2666/2666 places, 3419/3419 transitions.
Applied a total of 0 rules in 266 ms. Remains 2666 /2666 variables (removed 0) and now considering 3419/3419 (removed 0) transitions.
[2026-06-16 15:04:41] [INFO ] Invariant cache hit.
[2026-06-16 15:04:44] [INFO ] Implicit Places using invariants in 3464 ms returned []
[2026-06-16 15:04:44] [INFO ] Invariant cache hit.
[2026-06-16 15:04:47] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 15:05:18] [INFO ] Performed 871/2666 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 15:05:49] [INFO ] Performed 994/2666 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2026-06-16 15:06:19] [INFO ] Performed 2124/2666 implicitness test of which 0 returned IMPLICIT in 91 seconds.
[2026-06-16 15:06:49] [INFO ] Performed 2490/2666 implicitness test of which 0 returned IMPLICIT in 121 seconds.
[2026-06-16 15:06:49] [INFO ] Timeout of Implicit test with SMT after 121 seconds.
[2026-06-16 15:06:49] [INFO ] Implicit Places using invariants and state equation in 124668 ms returned []
Implicit Place search using SMT with State Equation took 128140 ms to find 0 implicit places.
Running 3387 sub problems to find dead transitions.
[2026-06-16 15:06:49] [INFO ] Invariant cache hit.
[2026-06-16 15:06:49] [INFO ] State equation strengthened by 832 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2633 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3387 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2633/6085 variables, and 52 constraints, problems are : Problem set: 0 solved, 3387 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/2666 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 3387/3387 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3387 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2633 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3387 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2633/6085 variables, and 52 constraints, problems are : Problem set: 0 solved, 3387 unsolved in 30124 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/2666 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/3387 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62208ms problems are : Problem set: 0 solved, 3387 unsolved
Search for dead transitions found 0 dead transitions in 62216ms
Finished structural reductions in LTL mode , in 1 iterations and 190633 ms. Remains : 2666/2666 places, 3419/3419 transitions.
Computed a total of 144 stabilizing places and 923 stable transitions
Computed a total of 144 stabilizing places and 923 stable transitions
Detected a total of 144/2666 stabilizing places and 923/3419 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge based reduction with 15 factoid took 1566 ms. Reduced automaton from 9 states, 22 edges and 4 AP (stutter sensitive) to 9 states, 22 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 422 ms. (94 steps per ms) remains 6/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
[2026-06-16 15:07:53] [INFO ] Invariant cache hit.
[2026-06-16 15:07:53] [INFO ] State equation strengthened by 832 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 2612/2619 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SMT process timed out in 6877ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 2666 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2666/2666 places, 3419/3419 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 2666 transition count 3387
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 2634 transition count 3387
Performed 832 Post agglomeration using F-continuation condition.Transition count delta: 832
Deduced a syphon composed of 832 places in 3 ms
Reduce places removed 832 places and 0 transitions.
Iterating global reduction 2 with 1664 rules applied. Total rules applied 1728 place count 1802 transition count 2555
Free-agglomeration rule (complex) applied 830 times.
Iterating global reduction 2 with 830 rules applied. Total rules applied 2558 place count 1802 transition count 1725
Reduce places removed 830 places and 0 transitions.
Iterating post reduction 2 with 830 rules applied. Total rules applied 3388 place count 972 transition count 1725
Applied a total of 3388 rules in 657 ms. Remains 972 /2666 variables (removed 1694) and now considering 1725/3419 (removed 1694) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 657 ms. Remains : 972/2666 places, 1725/3419 transitions.
RANDOM walk for 40000 steps (8 resets) in 275 ms. (144 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 133 ms. (298 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 94 ms. (421 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-14098694154984253585.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13482246243266849592.kers'
[2026-06-16 15:08:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14098694154984253585.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13482246243266849592.kers]
Culling duplicate invariants (modulo rational): removing 49 columns.
Culled 49 columns in 1 ms.
// Phase 1: matrix 1725 rows 923 cols 4416 entries
Finished phase 1 with 918 SingleSign rule and 0 generalized
[2026-06-16 15:08:01] [INFO ] Computed 54 invariants in 27 ms
Computed 54 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-13482246243266849592.kers
Total runtime 30 ms.
[2026-06-16 15:08:01] [INFO ] State equation strengthened by 832 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) 862/863 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/863 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/946 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/946 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/946 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/972 variables, 26/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/972 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1725/2697 variables, 972/1053 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2697 variables, 832/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2697 variables, 0/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/2697 variables, 0/1885 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2697/2697 variables, and 1885 constraints, problems are : Problem set: 0 solved, 1 unsolved in 21154 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 972/972 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 27/27 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) 862/863 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/863 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/946 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/946 variables, 27/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/946 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/972 variables, 26/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/972 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1725/2697 variables, 972/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2697 variables, 832/1889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2697 variables, 1/1890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2697 variables, 0/1890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2697 variables, 0/1890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2697/2697 variables, and 1890 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5565 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 972/972 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26772ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 181 ms.
Support contains 1 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 1725/1725 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 0 with 75 rules applied. Total rules applied 75 place count 923 transition count 1699
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 77 place count 923 transition count 1697
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 81 place count 919 transition count 1697
Applied a total of 81 rules in 215 ms. Remains 919 /972 variables (removed 53) and now considering 1697/1725 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 919/972 places, 1697/1725 transitions.
RANDOM walk for 40000 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 383077 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :0 out of 1
Probabilistic random walk after 383077 steps, saw 318635 distinct states, run finished after 3006 ms. (steps per millisecond=127 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10107375075195922270.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17843842144161518517.kers'
[2026-06-16 15:08:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10107375075195922270.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17843842144161518517.kers]
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 1 ms.
// Phase 1: matrix 1697 rows 892 cols 4258 entries
Finished phase 1 with 890 SingleSign rule and 0 generalized
[2026-06-16 15:08:31] [INFO ] Computed 29 invariants in 26 ms
Computed 29 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-17843842144161518517.kers
Total runtime 30 ms.
[2026-06-16 15:08:31] [INFO ] State equation strengthened by 832 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) 834/835 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 58/893 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/893 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/893 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/893 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/919 variables, 26/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/919 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1697/2616 variables, 919/969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2616 variables, 832/1801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2616 variables, 0/1801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/2616 variables, 0/1801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2616/2616 variables, and 1801 constraints, problems are : Problem set: 0 solved, 1 unsolved in 14284 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, State Equation: 919/919 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 21/21 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) 834/835 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 58/893 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/893 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/893 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/893 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/919 variables, 26/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/919 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1697/2616 variables, 919/976 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2616 variables, 832/1808 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2616 variables, 1/1809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2616 variables, 0/1809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2616 variables, 0/1809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2616/2616 variables, and 1809 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8435 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, State Equation: 919/919 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22788ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 94 ms.
Support contains 1 out of 919 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 919/919 places, 1697/1697 transitions.
Applied a total of 0 rules in 95 ms. Remains 919 /919 variables (removed 0) and now considering 1697/1697 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 919/919 places, 1697/1697 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 919/919 places, 1697/1697 transitions.
Applied a total of 0 rules in 94 ms. Remains 919 /919 variables (removed 0) and now considering 1697/1697 (removed 0) transitions.
[2026-06-16 15:08:54] [INFO ] Invariant cache hit.
[2026-06-16 15:08:55] [INFO ] Implicit Places using invariants in 1449 ms returned []
[2026-06-16 15:08:55] [INFO ] Invariant cache hit.
[2026-06-16 15:08:56] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 15:09:23] [INFO ] Implicit Places using invariants and state equation in 27852 ms returned []
Implicit Place search using SMT with State Equation took 29313 ms to find 0 implicit places.
[2026-06-16 15:09:23] [INFO ] Redundant transitions in 55 ms returned []
Running 1665 sub problems to find dead transitions.
[2026-06-16 15:09:23] [INFO ] Invariant cache hit.
[2026-06-16 15:09:23] [INFO ] State equation strengthened by 832 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/886 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 1665 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 886/2616 variables, and 27 constraints, problems are : Problem set: 0 solved, 1665 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 27/29 constraints, State Equation: 0/919 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 1665/1665 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1665 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/886 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 1665 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 886/2616 variables, and 27 constraints, problems are : Problem set: 0 solved, 1665 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 27/29 constraints, State Equation: 0/919 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/1665 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60794ms problems are : Problem set: 0 solved, 1665 unsolved
Search for dead transitions found 0 dead transitions in 60799ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90279 ms. Remains : 919/919 places, 1697/1697 transitions.
Knowledge based reduction with 15 factoid took 2185 ms. Reduced automaton from 9 states, 22 edges and 4 AP (stutter sensitive) to 9 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 404 ms :[(NOT p3), (NOT p3), (OR (AND p0 p1 (NOT p3)) (AND p0 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), p0, (OR p1 p0)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15025986440627272559.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15135866900930034848.kers'
[2026-06-16 15:10:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15025986440627272559.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15135866900930034848.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 5 ms.
// Phase 1: matrix 3419 rows 2640 cols 9393 entries
Finished phase 1 with 2612 SingleSign rule and 0 generalized
[2026-06-16 15:10:27] [INFO ] Computed 54 invariants in 206 ms
Computed 54 P flows in 207 ms.
Exported basis to /tmp/petrispot-output-15135866900930034848.kers
Total runtime 217 ms.
[2026-06-16 15:10:37] [INFO ] [Real]Absence check using 54 positive place invariants in 1550 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:857)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:590)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeFacts.computeEGknowledge(KnowledgeFacts.java:240)
at fr.lip6.move.gal.application.solver.ltl.knowledge.KnowledgeOrchestrator.applyKnowledgeBasedReductions(KnowledgeOrchestrator.java:52)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-06-16 15:10:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression EG (NOT p3)
Could not prove EG (NOT p3)
Knowledge-based reduction took 170966 ms.
Stuttering acceptance computed with spot in 449 ms :[(NOT p3), (NOT p3), (OR (AND p0 p1 (NOT p3)) (AND p0 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), p0, (OR p1 p0)]
Stuttering acceptance computed with spot in 411 ms :[(NOT p3), (NOT p3), (OR (AND p0 p1 (NOT p3)) (AND p0 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), p0, (OR p1 p0)]
Product exploration explored 100000 steps with 9 reset in 650 ms.
Stack based approach found an accepted trace after 31088 steps with 30 reset with depth 30738 and stack size 30738 in 217 ms.
FORMULA FileSystem-PT-N08I32B26-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property FileSystem-PT-N08I32B26-LTLFireability-04 finished in 729860 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(!(p0 U p1))&&X(F(p0)))))'
Support contains 3 out of 2669 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2669/2669 places, 3422/3422 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2666 transition count 3419
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2666 transition count 3419
Applied a total of 6 rules in 301 ms. Remains 2666 /2669 variables (removed 3) and now considering 3419/3422 (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-11734981085053184019.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3625465278493680747.kers'
[2026-06-16 15:10:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11734981085053184019.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3625465278493680747.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 3 ms.
// Phase 1: matrix 3419 rows 2640 cols 9393 entries
Finished phase 1 with 2612 SingleSign rule and 0 generalized
[2026-06-16 15:10:44] [INFO ] Computed 54 invariants in 119 ms
Computed 54 P flows in 119 ms.
Exported basis to /tmp/petrispot-output-3625465278493680747.kers
Total runtime 123 ms.
[2026-06-16 15:10:48] [INFO ] Implicit Places using invariants in 3512 ms returned []
[2026-06-16 15:10:48] [INFO ] Invariant cache hit.
[2026-06-16 15:10:50] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 15:11:21] [INFO ] Performed 983/2666 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 15:11:51] [INFO ] Performed 2017/2666 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-06-16 15:12:21] [INFO ] Performed 2499/2666 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-06-16 15:12:31] [INFO ] Implicit Places using invariants and state equation in 103136 ms returned []
Implicit Place search using SMT with State Equation took 106657 ms to find 0 implicit places.
Running 3387 sub problems to find dead transitions.
[2026-06-16 15:12:31] [INFO ] Invariant cache hit.
[2026-06-16 15:12:31] [INFO ] State equation strengthened by 832 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/2633 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3387 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2633/6085 variables, and 52 constraints, problems are : Problem set: 0 solved, 3387 unsolved in 30111 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/2666 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 3387/3387 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3387 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2633 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3387 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2633/6085 variables, and 52 constraints, problems are : Problem set: 0 solved, 3387 unsolved in 30105 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/2666 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/3387 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62172ms problems are : Problem set: 0 solved, 3387 unsolved
Search for dead transitions found 0 dead transitions in 62179ms
Starting structural reductions in LTL mode, iteration 1 : 2666/2669 places, 3419/3422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169146 ms. Remains : 2666/2669 places, 3419/3422 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(!(p0 U p1))&&X(F(p0)))))'
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : FileSystem-PT-N08I32B26-LTLFireability-05
Product exploration explored 100000 steps with 4 reset in 605 ms.
Product exploration explored 100000 steps with 0 reset in 488 ms.
Computed a total of 144 stabilizing places and 923 stable transitions
Computed a total of 144 stabilizing places and 923 stable transitions
Detected a total of 144/2666 stabilizing places and 923/3419 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 8 factoid took 58 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 286 ms. (139 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
[2026-06-16 15:13:35] [INFO ] Invariant cache hit.
[2026-06-16 15:13:35] [INFO ] State equation strengthened by 832 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2613/2616 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2616 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 50/2666 variables, 50/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2666 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3419/6085 variables, 2666/2720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 5027ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 2666 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2666/2666 places, 3419/3419 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 2666 transition count 3387
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 2634 transition count 3387
Performed 824 Post agglomeration using F-continuation condition.Transition count delta: 824
Deduced a syphon composed of 824 places in 4 ms
Reduce places removed 824 places and 0 transitions.
Iterating global reduction 2 with 1648 rules applied. Total rules applied 1712 place count 1810 transition count 2563
Free-agglomeration rule (complex) applied 800 times.
Iterating global reduction 2 with 800 rules applied. Total rules applied 2512 place count 1810 transition count 1763
Reduce places removed 823 places and 0 transitions.
Iterating post reduction 2 with 823 rules applied. Total rules applied 3335 place count 987 transition count 1763
Applied a total of 3335 rules in 735 ms. Remains 987 /2666 variables (removed 1679) and now considering 1763/3419 (removed 1656) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 735 ms. Remains : 987/2666 places, 1763/3419 transitions.
RANDOM walk for 40000 steps (8 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 217969 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 2
Probabilistic random walk after 217969 steps, saw 111177 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3522153524682970192.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10786414588747397014.kers'
[2026-06-16 15:13:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3522153524682970192.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10786414588747397014.kers]
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 2 ms.
// Phase 1: matrix 1763 rows 959 cols 4455 entries
Finished phase 1 with 955 SingleSign rule and 1 generalized
[2026-06-16 15:13:44] [INFO ] Computed 31 invariants in 42 ms
Computed 31 P flows in 42 ms.
Exported basis to /tmp/petrispot-output-10786414588747397014.kers
Total runtime 46 ms.
[2026-06-16 15:13:44] [INFO ] State equation strengthened by 832 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 66/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 891/960 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/960 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/960 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/960 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 27/987 variables, 27/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/987 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1763/2750 variables, 987/1039 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2750 variables, 832/1871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2750 variables, 0/1871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/2750 variables, 0/1871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2750/2750 variables, and 1871 constraints, problems are : Problem set: 0 solved, 2 unsolved in 17491 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 987/987 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 66/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 891/960 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/960 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/960 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/960 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 27/987 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/987 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1763/2750 variables, 987/1043 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2750 variables, 832/1875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2750 variables, 2/1877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2750 variables, 0/1877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2750 variables, 0/1877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2750/2750 variables, and 1877 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7065 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 987/987 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24653ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 246 ms.
Support contains 3 out of 987 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 987/987 places, 1763/1763 transitions.
Applied a total of 0 rules in 93 ms. Remains 987 /987 variables (removed 0) and now considering 1763/1763 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 987/987 places, 1763/1763 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 987/987 places, 1763/1763 transitions.
Applied a total of 0 rules in 93 ms. Remains 987 /987 variables (removed 0) and now considering 1763/1763 (removed 0) transitions.
[2026-06-16 15:14:09] [INFO ] Invariant cache hit.
[2026-06-16 15:14:10] [INFO ] Implicit Places using invariants in 1736 ms returned []
[2026-06-16 15:14:10] [INFO ] Invariant cache hit.
[2026-06-16 15:14:11] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 15:14:36] [INFO ] Implicit Places using invariants and state equation in 25902 ms returned []
Implicit Place search using SMT with State Equation took 27642 ms to find 0 implicit places.
[2026-06-16 15:14:36] [INFO ] Redundant transitions in 59 ms returned []
Running 1731 sub problems to find dead transitions.
[2026-06-16 15:14:36] [INFO ] Invariant cache hit.
[2026-06-16 15:14:36] [INFO ] State equation strengthened by 832 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/954 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1731 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 954/2750 variables, and 29 constraints, problems are : Problem set: 0 solved, 1731 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/987 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 1731/1731 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1731 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/954 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1731 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 954/2750 variables, and 29 constraints, problems are : Problem set: 0 solved, 1731 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/987 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/1731 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60792ms problems are : Problem set: 0 solved, 1731 unsolved
Search for dead transitions found 0 dead transitions in 60798ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88605 ms. Remains : 987/987 places, 1763/1763 transitions.
Knowledge based reduction with 8 factoid took 141 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 128 ms :[p1, p1, false]
Knowledge-based reduction took 123136 ms.
Stuttering acceptance computed with spot in 127 ms :[p1, p1, false]
Support contains 3 out of 2666 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2666/2666 places, 3419/3419 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 2666 transition count 3387
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 2634 transition count 3387
Performed 824 Post agglomeration using F-continuation condition.Transition count delta: 824
Deduced a syphon composed of 824 places in 3 ms
Reduce places removed 824 places and 0 transitions.
Iterating global reduction 2 with 1648 rules applied. Total rules applied 1712 place count 1810 transition count 2563
Applied a total of 1712 rules in 479 ms. Remains 1810 /2666 variables (removed 856) and now considering 2563/3419 (removed 856) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4831427892660111503.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6959009133249293080.kers'
[2026-06-16 15:15:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4831427892660111503.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6959009133249293080.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 10 ms.
// Phase 1: matrix 2563 rows 1784 cols 8455 entries
Finished phase 1 with 1756 SingleSign rule and 0 generalized
[2026-06-16 15:15:38] [INFO ] Computed 54 invariants in 114 ms
Computed 54 P flows in 114 ms.
Exported basis to /tmp/petrispot-output-6959009133249293080.kers
Total runtime 118 ms.
[2026-06-16 15:15:41] [INFO ] Implicit Places using invariants in 2991 ms returned []
[2026-06-16 15:15:41] [INFO ] Invariant cache hit.
[2026-06-16 15:15:43] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 15:16:14] [INFO ] Performed 926/1810 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2026-06-16 15:16:45] [INFO ] Performed 1132/1810 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2026-06-16 15:17:15] [INFO ] Performed 1603/1810 implicitness test of which 0 returned IMPLICIT in 91 seconds.
[2026-06-16 15:17:28] [INFO ] Implicit Places using invariants and state equation in 107131 ms returned []
Implicit Place search using SMT with State Equation took 110138 ms to find 0 implicit places.
[2026-06-16 15:17:28] [INFO ] Redundant transitions in 87 ms returned []
Running 2531 sub problems to find dead transitions.
[2026-06-16 15:17:28] [INFO ] Invariant cache hit.
[2026-06-16 15:17:28] [INFO ] State equation strengthened by 832 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1777 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 2531 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1777/4373 variables, and 52 constraints, problems are : Problem set: 0 solved, 2531 unsolved in 30083 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/1810 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 2531/2531 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2531 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1777 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 2531 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1777/4373 variables, and 52 constraints, problems are : Problem set: 0 solved, 2531 unsolved in 30093 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/1810 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/2531 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61544ms problems are : Problem set: 0 solved, 2531 unsolved
Search for dead transitions found 0 dead transitions in 61550ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1810/2666 places, 2563/3419 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 172279 ms. Remains : 1810/2666 places, 2563/3419 transitions.
Computed a total of 87 stabilizing places and 866 stable transitions
Computed a total of 87 stabilizing places and 866 stable transitions
Detected a total of 87/1810 stabilizing places and 866/2563 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 10 factoid took 88 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 453 ms. (88 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
[2026-06-16 15:18:30] [INFO ] Invariant cache hit.
[2026-06-16 15:18:30] [INFO ] State equation strengthened by 832 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1757/1760 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1760 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 50/1810 variables, 50/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1810 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2563/4373 variables, 1810/1864 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4373 variables, 832/2696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4373 variables, 0/2696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/4373 variables, 0/2696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4373/4373 variables, and 2696 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3214 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, State Equation: 1810/1810 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1757/1760 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SMT process timed out in 8410ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 1810 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1810/1810 places, 2563/2563 transitions.
Free-agglomeration rule (complex) applied 800 times.
Iterating global reduction 0 with 800 rules applied. Total rules applied 800 place count 1810 transition count 1763
Reduce places removed 823 places and 0 transitions.
Iterating post reduction 0 with 823 rules applied. Total rules applied 1623 place count 987 transition count 1763
Applied a total of 1623 rules in 466 ms. Remains 987 /1810 variables (removed 823) and now considering 1763/2563 (removed 800) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 466 ms. Remains : 987/1810 places, 1763/2563 transitions.
RANDOM walk for 40000 steps (8 resets) in 263 ms. (151 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 185950 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 2
Probabilistic random walk after 185950 steps, saw 95284 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5853347923545777344.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7075425460441385213.kers'
[2026-06-16 15:18:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5853347923545777344.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7075425460441385213.kers]
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 2 ms.
// Phase 1: matrix 1763 rows 959 cols 4455 entries
Finished phase 1 with 955 SingleSign rule and 1 generalized
[2026-06-16 15:18:42] [INFO ] Computed 31 invariants in 44 ms
Computed 31 P flows in 44 ms.
Exported basis to /tmp/petrispot-output-7075425460441385213.kers
Total runtime 48 ms.
[2026-06-16 15:18:42] [INFO ] State equation strengthened by 832 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 66/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 891/960 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/960 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/960 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/960 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 27/987 variables, 27/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/987 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1763/2750 variables, 987/1039 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2750 variables, 832/1871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2750 variables, 0/1871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/2750 variables, 0/1871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2750/2750 variables, and 1871 constraints, problems are : Problem set: 0 solved, 2 unsolved in 20526 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 987/987 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 66/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 891/960 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/960 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/960 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/960 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 27/987 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/987 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1763/2750 variables, 987/1043 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2750 variables, 832/1875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2750 variables, 2/1877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2750 variables, 0/1877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2750 variables, 0/1877 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2750/2750 variables, and 1877 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7764 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 987/987 constraints, ReadFeed: 832/832 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28381ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 205 ms.
Support contains 3 out of 987 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 987/987 places, 1763/1763 transitions.
Applied a total of 0 rules in 81 ms. Remains 987 /987 variables (removed 0) and now considering 1763/1763 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 987/987 places, 1763/1763 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 987/987 places, 1763/1763 transitions.
Applied a total of 0 rules in 82 ms. Remains 987 /987 variables (removed 0) and now considering 1763/1763 (removed 0) transitions.
[2026-06-16 15:19:11] [INFO ] Invariant cache hit.
[2026-06-16 15:19:12] [INFO ] Implicit Places using invariants in 1177 ms returned []
[2026-06-16 15:19:12] [INFO ] Invariant cache hit.
[2026-06-16 15:19:13] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 15:19:39] [INFO ] Implicit Places using invariants and state equation in 26539 ms returned []
Implicit Place search using SMT with State Equation took 27721 ms to find 0 implicit places.
[2026-06-16 15:19:39] [INFO ] Redundant transitions in 35 ms returned []
Running 1731 sub problems to find dead transitions.
[2026-06-16 15:19:39] [INFO ] Invariant cache hit.
[2026-06-16 15:19:39] [INFO ] State equation strengthened by 832 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/954 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1731 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 954/2750 variables, and 29 constraints, problems are : Problem set: 0 solved, 1731 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/987 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 1731/1731 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1731 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/954 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1731 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 954/2750 variables, and 29 constraints, problems are : Problem set: 0 solved, 1731 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/987 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/1731 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60827ms problems are : Problem set: 0 solved, 1731 unsolved
Search for dead transitions found 0 dead transitions in 60830ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88680 ms. Remains : 987/987 places, 1763/1763 transitions.
Knowledge based reduction with 10 factoid took 132 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 167 ms :[p1, p1, false]
Knowledge-based reduction took 130136 ms.
Stuttering acceptance computed with spot in 150 ms :[p1, p1, false]
Stuttering acceptance computed with spot in 156 ms :[p1, p1, false]
Product exploration explored 100000 steps with 0 reset in 573 ms.
Product exploration explored 100000 steps with 0 reset in 621 ms.
Built C files in :
/tmp/ltsmin14883543850952294232
[2026-06-16 15:20:41] [INFO ] Too many transitions (2563) to apply POR reductions. Disabling POR matrices.
[2026-06-16 15:20:42] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14883543850952294232
Running compilation step : cd /tmp/ltsmin14883543850952294232;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14883543850952294232;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14883543850952294232;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 1810 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1810/1810 places, 2563/2563 transitions.
Applied a total of 0 rules in 168 ms. Remains 1810 /1810 variables (removed 0) and now considering 2563/2563 (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-8512502374892370355.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5882001684414012927.kers'
[2026-06-16 15:20:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8512502374892370355.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5882001684414012927.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 4 ms.
// Phase 1: matrix 2563 rows 1784 cols 8455 entries
Finished phase 1 with 1756 SingleSign rule and 0 generalized
[2026-06-16 15:20:45] [INFO ] Computed 54 invariants in 106 ms
Computed 54 P flows in 111 ms.
Exported basis to /tmp/petrispot-output-5882001684414012927.kers
Total runtime 114 ms.
[2026-06-16 15:20:48] [INFO ] Implicit Places using invariants in 3417 ms returned []
[2026-06-16 15:20:48] [INFO ] Invariant cache hit.
[2026-06-16 15:20:50] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 15:21:22] [INFO ] Performed 922/1810 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2026-06-16 15:21:52] [INFO ] Performed 1082/1810 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2026-06-16 15:22:22] [INFO ] Performed 1529/1810 implicitness test of which 0 returned IMPLICIT in 91 seconds.
[2026-06-16 15:22:40] [INFO ] Implicit Places using invariants and state equation in 112367 ms returned []
Implicit Place search using SMT with State Equation took 115789 ms to find 0 implicit places.
[2026-06-16 15:22:41] [INFO ] Redundant transitions in 69 ms returned []
Running 2531 sub problems to find dead transitions.
[2026-06-16 15:22:41] [INFO ] Invariant cache hit.
[2026-06-16 15:22:41] [INFO ] State equation strengthened by 832 read => feed constraints.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/1777 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 2531 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1777/4373 variables, and 52 constraints, problems are : Problem set: 0 solved, 2531 unsolved in 30080 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/1810 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 2531/2531 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2531 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1777 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 2531 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1777/4373 variables, and 52 constraints, problems are : Problem set: 0 solved, 2531 unsolved in 30089 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/1810 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/2531 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61720ms problems are : Problem set: 0 solved, 2531 unsolved
Search for dead transitions found 0 dead transitions in 61725ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 177764 ms. Remains : 1810/1810 places, 2563/2563 transitions.
Built C files in :
/tmp/ltsmin8639590212120891823
[2026-06-16 15:23:42] [INFO ] Too many transitions (2563) to apply POR reductions. Disabling POR matrices.
[2026-06-16 15:23:42] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8639590212120891823
Running compilation step : cd /tmp/ltsmin8639590212120891823;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8639590212120891823;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8639590212120891823;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-06-16 15:23:46] [INFO ] Flatten gal took : 96 ms
[2026-06-16 15:23:46] [INFO ] Flatten gal took : 99 ms
[2026-06-16 15:23:46] [INFO ] Time to serialize gal into /tmp/LTL671540291132167770.gal : 22 ms
[2026-06-16 15:23:46] [INFO ] Time to serialize properties into /tmp/LTL18182514325019947023.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/LTL671540291132167770.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4300649015669823079.hoa' '-atoms' '/tmp/LTL18182514325019947023.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL18182514325019947023.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4300649015669823079.hoa
Detected timeout of ITS tools.
[2026-06-16 15:24:01] [INFO ] Flatten gal took : 93 ms
[2026-06-16 15:24:01] [INFO ] Flatten gal took : 95 ms
[2026-06-16 15:24:01] [INFO ] Time to serialize gal into /tmp/LTL3717972678333084316.gal : 20 ms
[2026-06-16 15:24:01] [INFO ] Time to serialize properties into /tmp/LTL7129290446726682234.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/LTL3717972678333084316.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7129290446726682234.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((F(!(("(endloop_17_33<1)")U("((beginloop_32_38>=1)&&(lockb_38>=1))"))))&&(X(F("(endloop_17_33<1)"))))))
Formula 0 simplified : G("(endloop_17_33<1)" U "((beginloop_32_38>=1)&&(lockb_38>=1))") | XG!"(endloop_17_33<1)"
Detected timeout of ITS tools.
[2026-06-16 15:24:16] [INFO ] Flatten gal took : 54 ms
[2026-06-16 15:24:16] [INFO ] Applying decomposition
[2026-06-16 15:24:16] [INFO ] Flatten gal took : 55 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/graph2024957611113330191.txt' '-o' '/tmp/graph2024957611113330191.bin' '-w' '/tmp/graph2024957611113330191.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2024957611113330191.bin' '-l' '-1' '-v' '-w' '/tmp/graph2024957611113330191.weights' '-q' '0' '-e' '0.001'
[2026-06-16 15:24:16] [INFO ] Decomposing Gal with order
[2026-06-16 15:24:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-16 15:24:17] [INFO ] Removed a total of 953 redundant transitions.
[2026-06-16 15:24:17] [INFO ] Flatten gal took : 305 ms
[2026-06-16 15:24:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 1529 labels/synchronizations in 69 ms.
[2026-06-16 15:24:17] [INFO ] Time to serialize gal into /tmp/LTL7982403063126067829.gal : 34 ms
[2026-06-16 15:24:17] [INFO ] Time to serialize properties into /tmp/LTL549795759427506396.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/LTL7982403063126067829.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL549795759427506396.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((F((F(!(("(i4.u67.endloop_17_33<1)")U("((i12.u114.beginloop_32_38>=1)&&(i12.u85.lockb_38>=1))"))))&&(X(F("(i4.u67.endloop_17_33<1)")...160
Formula 0 simplified : G("(i4.u67.endloop_17_33<1)" U "((i12.u114.beginloop_32_38>=1)&&(i12.u85.lockb_38>=1))") | XG!"(i4.u67.endloop_17_33<1)"
Detected timeout of ITS tools.
Treatment of property FileSystem-PT-N08I32B26-LTLFireability-05 finished in 828345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U (G(!p0)||(!p0&&G(!p1)))) U (G(!p0)||((!p0 U (G(!p0)||(!p0&&G(!p1))))&&X(((p0 U p2)||F(!p3))))))))'
Support contains 8 out of 2669 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2669/2669 places, 3422/3422 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2665 transition count 3418
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2665 transition count 3418
Applied a total of 8 rules in 399 ms. Remains 2665 /2669 variables (removed 4) and now considering 3418/3422 (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-9486083092037948029.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7693590512614163580.kers'
[2026-06-16 15:24:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9486083092037948029.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7693590512614163580.kers]
Culling duplicate invariants (modulo rational): removing 26 columns.
Culled 26 columns in 5 ms.
// Phase 1: matrix 3418 rows 2639 cols 9390 entries
Finished phase 1 with 2611 SingleSign rule and 0 generalized
[2026-06-16 15:24:33] [INFO ] Computed 54 invariants in 207 ms
Computed 54 P flows in 208 ms.
Exported basis to /tmp/petrispot-output-7693590512614163580.kers
Total runtime 214 ms.
[2026-06-16 15:24:36] [INFO ] Implicit Places using invariants in 3835 ms returned []
[2026-06-16 15:24:36] [INFO ] Invariant cache hit.
[2026-06-16 15:24:39] [INFO ] State equation strengthened by 832 read => feed constraints.
[2026-06-16 15:25:09] [INFO ] Performed 950/2665 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 15:25:39] [INFO ] Performed 987/2665 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-06-16 15:26:09] [INFO ] Performed 2048/2665 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2026-06-16 15:26:39] [INFO ] Performed 2414/2665 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2026-06-16 15:26:39] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2026-06-16 15:26:39] [INFO ] Implicit Places using invariants and state equation in 123079 ms returned []
Implicit Place search using SMT with State Equation took 126917 ms to find 0 implicit places.
Running 3386 sub problems to find dead transitions.
[2026-06-16 15:26:40] [INFO ] Invariant cache hit.
[2026-06-16 15:26:40] [INFO ] State equation strengthened by 832 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2632 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2632/6083 variables, and 52 constraints, problems are : Problem set: 0 solved, 3386 unsolved in 30109 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/2665 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 3386/3386 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2632 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2632/6083 variables, and 52 constraints, problems are : Problem set: 0 solved, 3386 unsolved in 30109 ms.
Refiners :[Positive P Invariants (semi-flows): 52/54 constraints, State Equation: 0/2665 constraints, ReadFeed: 0/832 constraints, PredecessorRefiner: 0/3386 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62285ms problems are : Problem set: 0 solved, 3386 unsolved
Search for dead transitions found 0 dead transitions in 62296ms
Starting structural reductions in LTL mode, iteration 1 : 2665/2669 places, 3418/3422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189626 ms. Remains : 2665/2669 places, 3418/3422 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U (G(!p0)||(!p0&&G(!p1)))) U (G(!p0)||((!p0 U (G(!p0)||(!p0&&G(!p1))))&&X(((p0 U p2)||F(!p3))))))))'
Stuttering acceptance computed with spot in 460 ms :[true, p0, p0, (OR p1 (AND (NOT p2) p3)), (OR p3 p1), p0, p0, (OR (AND p0 (NOT p2) p3) (AND p0 p1)), p1, (AND p0 p1)]
Running random walk in product with property : FileSystem-PT-N08I32B26-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 538 ms.
Product exploration explored 100000 steps with 0 reset in 614 ms.
Computed a total of 143 stabilizing places and 922 stable transitions
Computed a total of 143 stabilizing places and 922 stable transitions
Knowledge based reduction with 16 factoid took 67 ms. Reduced automaton from 10 states, 33 edges and 4 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 254 ms. (156 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 118 ms. (336 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
[2026-06-16 15:27:44] [INFO ] Invariant cache hit.
[2026-06-16 15:27:44] [INFO ] State equation strengthened by 832 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2612/2616 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 7410ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 2665 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2665/2665 places, 3418/3418 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 2665 transition count 3386
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 2633 transition count 3386
Performed 824 Post agglomeration using F-continuation condition.Transition count delta: 824
Deduced a syphon composed of 824 places in 2 ms
Reduce places removed 824 places and 0 transitions.
Iterating global reduction 2 with 1648 rules applied. Total rules applied 1712 place count 1809 transition count 2562
Free-agglomeration rule (complex) applied 799 times.
Iterating global reduction 2 with 799 rules applied. Total rules applied 2511 place count 1809 transition count 1763
Reduce places removed 822 places and 0 transitions.
Iterating post reduction 2 with 822 rules applied. Total rules applied 3333 place count 987 transition count 1763
Applied a total of 3333 rules in 797 ms. Remains 987 /2665 variables (removed 1678) and now considering 1763/3418 (removed 1655) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 797 ms. Remains : 987/2665 places, 1763/3418 transitions.
RANDOM walk for 40000 steps (8 resets) in 271 ms. (147 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 72 ms. (547 steps per ms) remains 1/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6263936841618897906.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4599516575570741768.kers'
[2026-06-16 15:27:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6263936841618897906.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4599516575570741768.kers]
Culling duplicate invariants (modulo rational): removing 28 columns.
Culled 28 columns in 1 ms.
// Phase 1: matrix 1763 rows 959 cols 4455 entries
Finished phase 1 with 954 SingleSign rule and 2 generalized
[2026-06-16 15:27:52] [INFO ] Computed 31 invariants in 25 ms
Computed 31 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-4599516575570741768.kers
Total runtime 27 ms.
[2026-06-16 15:27:52] [INFO ] State equation strengthened by 832 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) 67/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 890/961 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

tar xzf /home/mcc/BenchKit/INPUTS/FileSystem-PT-N08I32B26.tgz
mv FileSystem-PT-N08I32B26 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;