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.r354-tall-178024402800123.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 LastZero-PT-N18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402800123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 9.6K May 27 10:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 27 10:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 27 10:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 27 10:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K 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.2K Jun 16 12:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 16 12:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.2K May 27 10:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 27 10:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 27 10:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K May 27 10:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 16 12:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 2.4M Jun 10 11:58 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 LastZero-PT-N18-LTLCardinality-00
FORMULA_NAME LastZero-PT-N18-LTLCardinality-01
FORMULA_NAME LastZero-PT-N18-LTLCardinality-02
FORMULA_NAME LastZero-PT-N18-LTLCardinality-03
FORMULA_NAME LastZero-PT-N18-LTLCardinality-04
FORMULA_NAME LastZero-PT-N18-LTLCardinality-05
FORMULA_NAME LastZero-PT-N18-LTLCardinality-06
FORMULA_NAME LastZero-PT-N18-LTLCardinality-07
FORMULA_NAME LastZero-PT-N18-LTLCardinality-08
FORMULA_NAME LastZero-PT-N18-LTLCardinality-09
FORMULA_NAME LastZero-PT-N18-LTLCardinality-10
FORMULA_NAME LastZero-PT-N18-LTLCardinality-11
FORMULA_NAME LastZero-PT-N18-LTLCardinality-12
FORMULA_NAME LastZero-PT-N18-LTLCardinality-13
FORMULA_NAME LastZero-PT-N18-LTLCardinality-14
FORMULA_NAME LastZero-PT-N18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1781642948805

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LastZero-PT-N18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-06-16 20:49:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-16 20:49:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-16 20:49:10] [INFO ] Load time of PNML (sax parser for PT used): 258 ms
[2026-06-16 20:49:10] [INFO ] Transformed 760 places.
[2026-06-16 20:49:10] [INFO ] Transformed 7507 transitions.
[2026-06-16 20:49:10] [INFO ] Parsed PT model containing 760 places and 7507 transitions and 23169 arcs in 388 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 362 places in 64 ms
Reduce places removed 362 places and 4885 transitions.
Reduce places removed 1 places and 0 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA LastZero-PT-N18-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N18-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N18-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N18-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N18-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N18-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N18-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N18-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N18-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 397 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 397/397 places, 2622/2622 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 396 transition count 2622
Applied a total of 1 rules in 62 ms. Remains 396 /397 variables (removed 1) and now considering 2622/2622 (removed 0) transitions.
[2026-06-16 20:49:10] [INFO ] Flow matrix only has 2469 transitions (discarded 153 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16547658037559196788.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14274864278395496575.kers'
[2026-06-16 20:49:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16547658037559196788.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14274864278395496575.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 2469 rows 395 cols 6874 entries
Finished phase 1 with 378 SingleSign rule and 0 generalized
[2026-06-16 20:49:10] [INFO ] Computed 18 invariants in 8 ms
Computed 18 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-14274864278395496575.kers
Total runtime 11 ms.
[2026-06-16 20:49:11] [INFO ] Implicit Places using invariants in 925 ms returned []
[2026-06-16 20:49:11] [INFO ] Flow matrix only has 2469 transitions (discarded 153 similar events)
[2026-06-16 20:49:11] [INFO ] Invariant cache hit.
[2026-06-16 20:49:12] [INFO ] State equation strengthened by 342 read => feed constraints.
[2026-06-16 20:49:24] [INFO ] Implicit Places using invariants and state equation in 12476 ms returned [126]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 13479 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 395/397 places, 2622/2622 transitions.
Applied a total of 0 rules in 14 ms. Remains 395 /395 variables (removed 0) and now considering 2622/2622 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13569 ms. Remains : 395/397 places, 2622/2622 transitions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 2622/2622 transitions.
Applied a total of 0 rules in 12 ms. Remains 395 /395 variables (removed 0) and now considering 2622/2622 (removed 0) transitions.
[2026-06-16 20:49:24] [INFO ] Flow matrix only has 2469 transitions (discarded 153 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-213208100332410244.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4235284695882960148.kers'
[2026-06-16 20:49:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-213208100332410244.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4235284695882960148.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 2469 rows 394 cols 6856 entries
Finished phase 1 with 378 SingleSign rule and 0 generalized
[2026-06-16 20:49:24] [INFO ] Computed 17 invariants in 10 ms
Computed 17 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-4235284695882960148.kers
Total runtime 13 ms.
[2026-06-16 20:49:24] [INFO ] Implicit Places using invariants in 251 ms returned []
[2026-06-16 20:49:24] [INFO ] Flow matrix only has 2469 transitions (discarded 153 similar events)
[2026-06-16 20:49:24] [INFO ] Invariant cache hit.
[2026-06-16 20:49:24] [INFO ] State equation strengthened by 342 read => feed constraints.
[2026-06-16 20:49:37] [INFO ] Implicit Places using invariants and state equation in 12531 ms returned []
Implicit Place search using SMT with State Equation took 12786 ms to find 0 implicit places.
Running 2604 sub problems to find dead transitions.
[2026-06-16 20:49:37] [INFO ] Flow matrix only has 2469 transitions (discarded 153 similar events)
[2026-06-16 20:49:37] [INFO ] Invariant cache hit.
[2026-06-16 20:49:37] [INFO ] State equation strengthened by 342 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/2864 variables, and 17 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30070 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/395 constraints, ReadFeed: 0/342 constraints, PredecessorRefiner: 2604/2604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/2864 variables, and 17 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/395 constraints, ReadFeed: 0/342 constraints, PredecessorRefiner: 0/2604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61425ms problems are : Problem set: 0 solved, 2604 unsolved
Search for dead transitions found 0 dead transitions in 61454ms
Finished structural reductions in LTL mode , in 1 iterations and 74295 ms. Remains : 395/395 places, 2622/2622 transitions.
Support contains 14 out of 395 places after structural reductions.
[2026-06-16 20:50:38] [INFO ] Flatten gal took : 187 ms
[2026-06-16 20:50:39] [INFO ] Flatten gal took : 123 ms
[2026-06-16 20:50:39] [INFO ] Input system was already deterministic with 2622 transitions.
RANDOM walk for 40000 steps (724 resets) in 1025 ms. (38 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40003 steps (77 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (80 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (76 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (80 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (80 resets) in 122 ms. (325 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (79 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
[2026-06-16 20:50:39] [INFO ] Flow matrix only has 2469 transitions (discarded 153 similar events)
[2026-06-16 20:50:39] [INFO ] Invariant cache hit.
[2026-06-16 20:50:39] [INFO ] State equation strengthened by 342 read => feed constraints.
All remaining problems are real, not stopping.
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) 45/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 710/763 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/763 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 6 (OVERLAPS) 429/1192 variables, 74/134 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1192 variables, 2/136 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1192 variables, 85/221 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1192 variables, 0/221 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 45/1237 variables, 23/244 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1237 variables, 21/265 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1237 variables, 0/265 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 2/1239 variables, 1/266 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1239 variables, 0/266 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/1241 variables, 1/267 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1241 variables, 0/267 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/1243 variables, 1/268 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1243 variables, 0/268 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 2/1245 variables, 1/269 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1245 variables, 0/269 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 2/1247 variables, 1/270 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1247 variables, 1/271 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1247/2864 variables, and 271 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 5/17 constraints, State Equation: 155/395 constraints, ReadFeed: 111/342 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 45/52 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 708/760 variables, 52/55 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/760 variables, 3/58 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/760 variables, 1/59 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/760 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 431/1191 variables, 74/133 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1191 variables, 2/135 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1191 variables, 86/221 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1191 variables, 1/222 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1191 variables, 0/222 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 46/1237 variables, 24/246 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1237 variables, 21/267 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1237 variables, 0/267 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/1239 variables, 1/268 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1239 variables, 0/268 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/1241 variables, 1/269 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1241 variables, 0/269 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 2/1243 variables, 1/270 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1243 variables, 0/270 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 2/1245 variables, 1/271 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1245 variables, 0/271 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 2/1247 variables, 1/272 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1247 variables, 1/273 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1247 variables, 0/273 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 2/1249 variables, 1/274 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1249 variables, 0/274 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 2/1251 variables, 1/275 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1251 variables, 0/275 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 2/1253 variables, 1/276 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1253 variables, 1/277 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1253 variables, 0/277 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 33 (OVERLAPS) 2/1255 variables, 1/278 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1255 variables, 1/279 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1255 variables, 0/279 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 36 (OVERLAPS) 2/1257 variables, 1/280 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1257 variables, 1/281 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1257 variables, 0/281 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 39 (OVERLAPS) 2/1259 variables, 1/282 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1259 variables, 1/283 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1259 variables, 0/283 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 42 (OVERLAPS) 2/1261 variables, 1/284 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1261 variables, 0/284 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 44 (OVERLAPS) 2/1263 variables, 1/285 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1263 variables, 0/285 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 46 (OVERLAPS) 1/1264 variables, 1/286 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1264 variables, 0/286 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 48 (OVERLAPS) 1189/2453 variables, 60/346 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/2453 variables, 0/346 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 400/2853 variables, 220/566 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/2853 variables, 12/578 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2853 variables, 167/745 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/2853 variables, 2/747 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2853/2864 variables, and 747 constraints, problems are : Problem set: 2 solved, 4 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 384/395 constraints, ReadFeed: 342/342 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10045ms problems are : Problem set: 2 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 6 out of 395 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 395/395 places, 2622/2622 transitions.
Graph (complete) has 2790 edges and 395 vertex of which 304 are kept as prefixes of interest. Removing 91 places using SCC suffix rule.10 ms
Discarding 91 places :
Also discarding 701 output transitions
Drop transitions (Output transitions of discarded places.) removed 701 transitions
Drop transitions (Empty/Sink Transition effects.) removed 153 transitions
Reduce isomorphic transitions removed 153 transitions.
Iterating post reduction 0 with 153 rules applied. Total rules applied 154 place count 304 transition count 1768
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 154 place count 304 transition count 1767
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 156 place count 303 transition count 1767
Applied a total of 156 rules in 76 ms. Remains 303 /395 variables (removed 92) and now considering 1767/2622 (removed 855) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 303/395 places, 1767/2622 transitions.
RANDOM walk for 40000 steps (1248 resets) in 654 ms. (61 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (113 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (113 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (113 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (112 resets) in 82 ms. (481 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 342303 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 4
Probabilistic random walk after 342303 steps, saw 61993 distinct states, run finished after 3005 ms. (steps per millisecond=113 ) 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-13846377242929607028.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11814877131781203900.kers'
[2026-06-16 20:50:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13846377242929607028.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11814877131781203900.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 1767 rows 302 cols 4893 entries
Finished phase 1 with 287 SingleSign rule and 0 generalized
[2026-06-16 20:50:53] [INFO ] Computed 16 invariants in 6 ms
Computed 16 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-11814877131781203900.kers
Total runtime 10 ms.
[2026-06-16 20:50:53] [INFO ] State equation strengthened by 256 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 45/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 706/757 variables, 51/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/757 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/757 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 427/1184 variables, 72/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1184 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1184 variables, 86/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1184 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 44/1228 variables, 23/240 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1228 variables, 21/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1228 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 235/1463 variables, 31/292 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1463 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 218/1681 variables, 55/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1681 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1681 variables, 41/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1681 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 27/1708 variables, 15/405 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1708 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1708 variables, 2/408 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1708 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 64/1772 variables, 8/416 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1772 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 33/1805 variables, 17/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1805 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1805 variables, 8/442 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1805 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 1/1806 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1806 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 49/1855 variables, 7/450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1855 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 29/1884 variables, 15/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1884 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1884 variables, 7/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1884 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 1/1885 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1885 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 36/1921 variables, 6/480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1921 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 25/1946 variables, 13/493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1946 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1946 variables, 6/500 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1946 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 1/1947 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1947 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (OVERLAPS) 25/1972 variables, 5/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1972 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (OVERLAPS) 21/1993 variables, 11/517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1993 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1993 variables, 5/523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1993 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (OVERLAPS) 1/1994 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1994 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (OVERLAPS) 16/2010 variables, 4/528 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/2010 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (OVERLAPS) 17/2027 variables, 9/537 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/2027 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2027 variables, 4/542 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2027 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (OVERLAPS) 1/2028 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/2028 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (OVERLAPS) 9/2037 variables, 3/546 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/2037 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (OVERLAPS) 13/2050 variables, 7/553 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/2050 variables, 1/554 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/2050 variables, 3/557 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/2050 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (OVERLAPS) 1/2051 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/2051 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (OVERLAPS) 4/2055 variables, 2/560 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/2055 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (OVERLAPS) 9/2064 variables, 5/565 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/2064 variables, 1/566 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/2064 variables, 2/568 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/2064 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (OVERLAPS) 1/2065 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/2065 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 79 (OVERLAPS) 1/2066 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/2066 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 81 (OVERLAPS) 4/2070 variables, 3/573 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/2070 variables, 1/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/2070 variables, 1/575 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/2070 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 85 (OVERLAPS) 0/2070 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2070/2070 variables, and 575 constraints, problems are : Problem set: 0 solved, 4 unsolved in 10451 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 303/303 constraints, ReadFeed: 256/256 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 45/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 706/757 variables, 51/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/757 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/757 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/757 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 427/1184 variables, 72/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1184 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1184 variables, 86/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1184 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1184 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 44/1228 variables, 23/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1228 variables, 21/263 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1228 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 235/1463 variables, 31/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1463 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 218/1681 variables, 55/349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1681 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1681 variables, 41/392 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1681 variables, 2/394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1681 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 27/1708 variables, 15/409 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1708 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1708 variables, 2/412 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1708 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 64/1772 variables, 8/420 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1772 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 33/1805 variables, 17/437 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1805 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1805 variables, 8/446 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1805 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 1/1806 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1806 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (OVERLAPS) 49/1855 variables, 7/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1855 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (OVERLAPS) 29/1884 variables, 15/469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1884 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1884 variables, 7/477 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1884 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (OVERLAPS) 1/1885 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1885 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 36/1921 variables, 6/484 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1921 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (OVERLAPS) 25/1946 variables, 13/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1946 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1946 variables, 6/504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1946 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (OVERLAPS) 1/1947 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1947 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 25/1972 variables, 5/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1972 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 21/1993 variables, 11/521 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1993 variables, 1/522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1993 variables, 5/527 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1993 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (OVERLAPS) 1/1994 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1994 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (OVERLAPS) 16/2010 variables, 4/532 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/2010 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (OVERLAPS) 17/2027 variables, 9/541 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/2027 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/2027 variables, 4/546 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2027 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (OVERLAPS) 1/2028 variables, 1/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/2028 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (OVERLAPS) 9/2037 variables, 3/550 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/2037 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (OVERLAPS) 13/2050 variables, 7/557 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2050 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/2050 variables, 3/561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/2050 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 72 (OVERLAPS) 1/2051 variables, 1/562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/2051 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 74 (OVERLAPS) 4/2055 variables, 2/564 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/2055 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 76 (OVERLAPS) 9/2064 variables, 5/569 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/2064 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/2064 variables, 2/572 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/2064 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 80 (OVERLAPS) 1/2065 variables, 1/573 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/2065 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 82 (OVERLAPS) 1/2066 variables, 1/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/2066 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 84 (OVERLAPS) 4/2070 variables, 3/577 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/2070 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/2070 variables, 1/579 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/2070 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 88 (OVERLAPS) 0/2070 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2070/2070 variables, and 579 constraints, problems are : Problem set: 0 solved, 4 unsolved in 10062 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 303/303 constraints, ReadFeed: 256/256 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20551ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 26 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
Parikh walk visited 4 properties in 73 ms.
Successfully simplified 2 atomic propositions for a total of 7 simplifications.
FORMULA LastZero-PT-N18-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N18-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 395 stabilizing places and 2622 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 395 transition count 2622
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X(F((p0&&X(F(!p0)))))))))'
Support contains 2 out of 395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 2622/2622 transitions.
Applied a total of 0 rules in 10 ms. Remains 395 /395 variables (removed 0) and now considering 2622/2622 (removed 0) transitions.
[2026-06-16 20:51:14] [INFO ] Flow matrix only has 2469 transitions (discarded 153 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3070040151875331168.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5408574078948936635.kers'
[2026-06-16 20:51:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3070040151875331168.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5408574078948936635.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 2469 rows 394 cols 6856 entries
Finished phase 1 with 378 SingleSign rule and 0 generalized
[2026-06-16 20:51:14] [INFO ] Computed 17 invariants in 5 ms
Computed 17 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-5408574078948936635.kers
Total runtime 7 ms.
[2026-06-16 20:51:14] [INFO ] Implicit Places using invariants in 250 ms returned []
[2026-06-16 20:51:14] [INFO ] Flow matrix only has 2469 transitions (discarded 153 similar events)
[2026-06-16 20:51:14] [INFO ] Invariant cache hit.
[2026-06-16 20:51:14] [INFO ] State equation strengthened by 342 read => feed constraints.
[2026-06-16 20:51:27] [INFO ] Implicit Places using invariants and state equation in 13538 ms returned []
Implicit Place search using SMT with State Equation took 13793 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 13806 ms. Remains : 395/395 places, 2622/2622 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X(F((p0&&X(F(!p0)))))))))'
Stuttering acceptance computed with spot in 325 ms :[p0, (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : LastZero-PT-N18-LTLCardinality-03
Product exploration explored 100000 steps with 2275 reset in 465 ms.
Product exploration explored 100000 steps with 2276 reset in 470 ms.
Computed a total of 395 stabilizing places and 2622 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 395 transition count 2622
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 168 steps (0 resets) in 10 ms. (15 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[p0, true, true, true, true]
[2026-06-16 20:51:29] [INFO ] Flow matrix only has 2469 transitions (discarded 153 similar events)
[2026-06-16 20:51:29] [INFO ] Invariant cache hit.
Proved EG true asserting that LTL formula F !true is false.
Knowledge-based reduction took 1683 ms.
Stuttering acceptance computed with spot in 221 ms :[p0, true, true, true, true]
Support contains 2 out of 395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 2622/2622 transitions.
Applied a total of 0 rules in 11 ms. Remains 395 /395 variables (removed 0) and now considering 2622/2622 (removed 0) transitions.
[2026-06-16 20:51:31] [INFO ] Flow matrix only has 2469 transitions (discarded 153 similar events)
[2026-06-16 20:51:31] [INFO ] Invariant cache hit.
[2026-06-16 20:51:31] [INFO ] Implicit Places using invariants in 259 ms returned []
[2026-06-16 20:51:31] [INFO ] Flow matrix only has 2469 transitions (discarded 153 similar events)
[2026-06-16 20:51:31] [INFO ] Invariant cache hit.
[2026-06-16 20:51:31] [INFO ] State equation strengthened by 342 read => feed constraints.
[2026-06-16 20:51:44] [INFO ] Implicit Places using invariants and state equation in 13228 ms returned []
Implicit Place search using SMT with State Equation took 13491 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 13505 ms. Remains : 395/395 places, 2622/2622 transitions.
Computed a total of 395 stabilizing places and 2622 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 395 transition count 2622
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
RANDOM walk for 168 steps (0 resets) in 5 ms. (28 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[p0, true, true, true, true]
[2026-06-16 20:51:45] [INFO ] Flow matrix only has 2469 transitions (discarded 153 similar events)
[2026-06-16 20:51:45] [INFO ] Invariant cache hit.
Proved EG true asserting that LTL formula F !true is false.
Knowledge-based reduction took 1618 ms.
Stuttering acceptance computed with spot in 156 ms :[p0, true, true, true, true]
Stuttering acceptance computed with spot in 202 ms :[p0, true, true, true, true]
Product exploration explored 100000 steps with 2275 reset in 368 ms.
Product exploration explored 100000 steps with 2275 reset in 383 ms.
Spot run failed in 81 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/ltsmin10377179708073668106
[2026-06-16 20:51:47] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10377179708073668106
Running compilation step : cd /tmp/ltsmin10377179708073668106;'/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/ltsmin10377179708073668106;'/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/ltsmin10377179708073668106;'/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 395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 2622/2622 transitions.
Applied a total of 0 rules in 6 ms. Remains 395 /395 variables (removed 0) and now considering 2622/2622 (removed 0) transitions.
[2026-06-16 20:51:50] [INFO ] Flow matrix only has 2469 transitions (discarded 153 similar events)
[2026-06-16 20:51:50] [INFO ] Invariant cache hit.
[2026-06-16 20:51:50] [INFO ] Implicit Places using invariants in 247 ms returned []
[2026-06-16 20:51:50] [INFO ] Flow matrix only has 2469 transitions (discarded 153 similar events)
[2026-06-16 20:51:50] [INFO ] Invariant cache hit.
[2026-06-16 20:51:51] [INFO ] State equation strengthened by 342 read => feed constraints.
[2026-06-16 20:52:04] [INFO ] Implicit Places using invariants and state equation in 13557 ms returned []
Implicit Place search using SMT with State Equation took 13808 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 13816 ms. Remains : 395/395 places, 2622/2622 transitions.
Built C files in :
/tmp/ltsmin9058246557692795035
[2026-06-16 20:52:04] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9058246557692795035
Running compilation step : cd /tmp/ltsmin9058246557692795035;'/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/ltsmin9058246557692795035;'/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/ltsmin9058246557692795035;'/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 20:52:07] [INFO ] Flatten gal took : 72 ms
[2026-06-16 20:52:07] [INFO ] Flatten gal took : 69 ms
[2026-06-16 20:52:07] [INFO ] Time to serialize gal into /tmp/LTL4389453869636542005.gal : 23 ms
[2026-06-16 20:52:07] [INFO ] Time to serialize properties into /tmp/LTL16777408121125466579.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/LTL4389453869636542005.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9207790150572257667.hoa' '-atoms' '/tmp/LTL16777408121125466579.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16777408121125466579.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9207790150572257667.hoa
Detected timeout of ITS tools.
[2026-06-16 20:52:23] [INFO ] Flatten gal took : 113 ms
[2026-06-16 20:52:23] [INFO ] Flatten gal took : 92 ms
[2026-06-16 20:52:23] [INFO ] Time to serialize gal into /tmp/LTL16194134368139443610.gal : 14 ms
[2026-06-16 20:52:23] [INFO ] Time to serialize properties into /tmp/LTL13835502708144973881.ltl : 34 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/LTL16194134368139443610.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13835502708144973881.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(("(lastzero_13>array_14_12)")||(X(F(("(lastzero_13>array_14_12)")&&(X(F("(lastzero_13<=array_14_12)"))))))))))
Formula 0 simplified : XX(!"(lastzero_13>array_14_12)" & XG(!"(lastzero_13>array_14_12)" | XG!"(lastzero_13<=array_14_12)"))
Detected timeout of ITS tools.
[2026-06-16 20:52:38] [INFO ] Flatten gal took : 54 ms
[2026-06-16 20:52:38] [INFO ] Applying decomposition
[2026-06-16 20:52:38] [INFO ] Flatten gal took : 58 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/graph4218049472933544348.txt' '-o' '/tmp/graph4218049472933544348.bin' '-w' '/tmp/graph4218049472933544348.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4218049472933544348.bin' '-l' '-1' '-v' '-w' '/tmp/graph4218049472933544348.weights' '-q' '0' '-e' '0.001'
[2026-06-16 20:52:38] [INFO ] Decomposing Gal with order
[2026-06-16 20:52:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-16 20:52:39] [INFO ] Removed a total of 4287 redundant transitions.
[2026-06-16 20:52:39] [INFO ] Flatten gal took : 519 ms
[2026-06-16 20:52:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 54 ms.
[2026-06-16 20:52:40] [INFO ] Time to serialize gal into /tmp/LTL3461640111198597957.gal : 43 ms
[2026-06-16 20:52:40] [INFO ] Time to serialize properties into /tmp/LTL14041975215131684502.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/LTL3461640111198597957.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14041975215131684502.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(("(gu91.lastzero_13>gu91.array_14_12)")||(X(F(("(gu91.lastzero_13>gu91.array_14_12)")&&(X(F("(gu91.lastzero_13<=gu91.array_14_1...168
Formula 0 simplified : XX(!"(gu91.lastzero_13>gu91.array_14_12)" & XG(!"(gu91.lastzero_13>gu91.array_14_12)" | XG!"(gu91.lastzero_13<=gu91.array_14_12)"))
Detected timeout of ITS tools.
Treatment of property LastZero-PT-N18-LTLCardinality-03 finished in 101090 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0)))||(!p0 U X(X(!p0))))))'
Support contains 2 out of 395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 2622/2622 transitions.
Applied a total of 0 rules in 11 ms. Remains 395 /395 variables (removed 0) and now considering 2622/2622 (removed 0) transitions.
[2026-06-16 20:52:55] [INFO ] Flow matrix only has 2469 transitions (discarded 153 similar events)
[2026-06-16 20:52:55] [INFO ] Invariant cache hit.
[2026-06-16 20:52:55] [INFO ] Implicit Places using invariants in 472 ms returned []
[2026-06-16 20:52:55] [INFO ] Flow matrix only has 2469 transitions (discarded 153 similar events)
[2026-06-16 20:52:55] [INFO ] Invariant cache hit.
[2026-06-16 20:52:56] [INFO ] State equation strengthened by 342 read => feed constraints.
[2026-06-16 20:53:11] [INFO ] Implicit Places using invariants and state equation in 16265 ms returned []
Implicit Place search using SMT with State Equation took 16765 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 16776 ms. Remains : 395/395 places, 2622/2622 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0)))||(!p0 U X(X(!p0))))))'
Stuttering acceptance computed with spot in 258 ms :[true, (NOT p0), false, false, false, false, false, false, false]
Running random walk in product with property : LastZero-PT-N18-LTLCardinality-04
Product exploration explored 100000 steps with 25000 reset in 335 ms.
Product exploration explored 100000 steps with 25000 reset in 347 ms.
Computed a total of 395 stabilizing places and 2622 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 395 transition count 2622
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 50 ms. Reduced automaton from 9 states, 12 edges and 1 AP (stutter sensitive) to 8 states, 9 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (724 resets) in 286 ms. (139 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (77 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 258099 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 1
Probabilistic random walk after 258099 steps, saw 51997 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
[2026-06-16 20:53:16] [INFO ] Flow matrix only has 2469 transitions (discarded 153 similar events)
[2026-06-16 20:53:16] [INFO ] Invariant cache hit.
[2026-06-16 20:53:16] [INFO ] State equation strengthened by 342 read => feed constraints.
All remaining problems are real, not stopping.
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) 16/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 268/286 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 159/445 variables, 28/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/464 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/464 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 334/798 variables, 52/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/798 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 544/1342 variables, 82/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1342 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1342 variables, 52/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1342 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 72/1414 variables, 38/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1414 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1414 variables, 4/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1414 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/1420 variables, 4/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1420 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/1422 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1422 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/1424 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1424 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/1426 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1426 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 2/1428 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1428 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 2/1430 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1430 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 2/1432 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1432 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 1065/2497 variables, 62/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2497 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 357/2854 variables, 199/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2854 variables, 11/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2854 variables, 146/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2854 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 10/2864 variables, 10/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2864 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 0/2864 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2864/2864 variables, and 754 constraints, problems are : Problem set: 0 solved, 1 unsolved in 857 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 395/395 constraints, ReadFeed: 342/342 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 268/286 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 159/445 variables, 28/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/464 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/464 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 334/798 variables, 52/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/798 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 544/1342 variables, 82/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1342 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1342 variables, 52/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1342 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1342 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 72/1414 variables, 38/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1414 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1414 variables, 4/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1414 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 6/1420 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1420 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/1422 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1422 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 2/1424 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1424 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 2/1426 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1426 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 2/1428 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1428 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 2/1430 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1430 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 2/1432 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1432 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 1065/2497 variables, 62/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2497 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 357/2854 variables, 199/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2854 variables, 11/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2854 variables, 146/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2854 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 10/2864 variables, 10/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2864 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 0/2864 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2864/2864 variables, and 755 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2047 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 395/395 constraints, ReadFeed: 342/342 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2929ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 2 ms.
Knowledge based reduction with 4 factoid took 74 ms. Reduced automaton from 8 states, 9 edges and 1 AP (stutter sensitive) to 8 states, 9 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[true, (NOT p0), false, false, false, false, false, false]
Knowledge-based reduction took 6797 ms.
Stuttering acceptance computed with spot in 245 ms :[true, (NOT p0), false, false, false, false, false, false]
Support contains 2 out of 395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 2622/2622 transitions.
Applied a total of 0 rules in 6 ms. Remains 395 /395 variables (removed 0) and now considering 2622/2622 (removed 0) transitions.
[2026-06-16 20:53:19] [INFO ] Flow matrix only has 2469 transitions (discarded 153 similar events)
[2026-06-16 20:53:19] [INFO ] Invariant cache hit.
[2026-06-16 20:53:20] [INFO ] Implicit Places using invariants in 264 ms returned []
[2026-06-16 20:53:20] [INFO ] Flow matrix only has 2469 transitions (discarded 153 similar events)
[2026-06-16 20:53:20] [INFO ] Invariant cache hit.
[2026-06-16 20:53:20] [INFO ] State equation strengthened by 342 read => feed constraints.
[2026-06-16 20:53:36] [INFO ] Implicit Places using invariants and state equation in 16447 ms returned []
Implicit Place search using SMT with State Equation took 16714 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 16723 ms. Remains : 395/395 places, 2622/2622 transitions.
Computed a total of 395 stabilizing places and 2622 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 395 transition count 2622
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 2 factoid took 55 ms. Reduced automaton from 8 states, 9 edges and 1 AP (stutter sensitive) to 8 states, 9 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (724 resets) in 271 ms. (147 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (80 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 256134 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 1
Probabilistic random walk after 256134 steps, saw 51582 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
[2026-06-16 20:53:40] [INFO ] Flow matrix only has 2469 transitions (discarded 153 similar events)
[2026-06-16 20:53:40] [INFO ] Invariant cache hit.
[2026-06-16 20:53:40] [INFO ] State equation strengthened by 342 read => feed constraints.
All remaining problems are real, not stopping.
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) 16/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 268/286 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 159/445 variables, 28/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/464 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/464 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 334/798 variables, 52/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/798 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 544/1342 variables, 82/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1342 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1342 variables, 52/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1342 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 72/1414 variables, 38/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1414 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1414 variables, 4/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1414 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/1420 variables, 4/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1420 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/1422 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1422 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/1424 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1424 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/1426 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1426 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 2/1428 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1428 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 2/1430 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1430 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 2/1432 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1432 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 1065/2497 variables, 62/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2497 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 357/2854 variables, 199/587 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2854 variables, 11/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2854 variables, 146/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2854 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 10/2864 variables, 10/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2864 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 0/2864 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2864/2864 variables, and 754 constraints, problems are : Problem set: 0 solved, 1 unsolved in 890 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 395/395 constraints, ReadFeed: 342/342 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 268/286 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 159/445 variables, 28/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 16/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/464 variables, 10/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/464 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/464 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 334/798 variables, 52/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/798 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 544/1342 variables, 82/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1342 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1342 variables, 52/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1342 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1342 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 72/1414 variables, 38/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1414 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1414 variables, 4/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1414 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 6/1420 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1420 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/1422 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1422 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 2/1424 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1424 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 2/1426 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1426 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 2/1428 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1428 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 2/1430 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1430 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 2/1432 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1432 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 1065/2497 variables, 62/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2497 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 357/2854 variables, 199/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2854 variables, 11/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2854 variables, 146/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2854 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 10/2864 variables, 10/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2864 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 0/2864 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2864/2864 variables, and 755 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2058 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 395/395 constraints, ReadFeed: 342/342 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2979ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 1 ms.
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 8 states, 9 edges and 1 AP (stutter sensitive) to 8 states, 9 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[true, (NOT p0), false, false, false, false, false, false]
Knowledge-based reduction took 6861 ms.
Stuttering acceptance computed with spot in 237 ms :[true, (NOT p0), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 240 ms :[true, (NOT p0), false, false, false, false, false, false]
Product exploration explored 100000 steps with 25000 reset in 321 ms.
Product exploration explored 100000 steps with 25000 reset in 363 ms.
Spot run failed in 48 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin11497407097803221027
[2026-06-16 20:53:44] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11497407097803221027
Running compilation step : cd /tmp/ltsmin11497407097803221027;'/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/ltsmin11497407097803221027;'/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/ltsmin11497407097803221027;'/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 395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 2622/2622 transitions.
Applied a total of 0 rules in 6 ms. Remains 395 /395 variables (removed 0) and now considering 2622/2622 (removed 0) transitions.
[2026-06-16 20:53:47] [INFO ] Flow matrix only has 2469 transitions (discarded 153 similar events)
[2026-06-16 20:53:47] [INFO ] Invariant cache hit.
[2026-06-16 20:53:48] [INFO ] Implicit Places using invariants in 298 ms returned []
[2026-06-16 20:53:48] [INFO ] Flow matrix only has 2469 transitions (discarded 153 similar events)
[2026-06-16 20:53:48] [INFO ] Invariant cache hit.
[2026-06-16 20:53:48] [INFO ] State equation strengthened by 342 read => feed constraints.
[2026-06-16 20:54:04] [INFO ] Implicit Places using invariants and state equation in 16600 ms returned []
Implicit Place search using SMT with State Equation took 16902 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 16911 ms. Remains : 395/395 places, 2622/2622 transitions.
Built C files in :
/tmp/ltsmin12059610013412214059
[2026-06-16 20:54:04] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12059610013412214059
Running compilation step : cd /tmp/ltsmin12059610013412214059;'/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/ltsmin12059610013412214059;'/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/ltsmin12059610013412214059;'/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 20:54:07] [INFO ] Flatten gal took : 69 ms
[2026-06-16 20:54:07] [INFO ] Flatten gal took : 56 ms
[2026-06-16 20:54:07] [INFO ] Time to serialize gal into /tmp/LTL3330812840673239187.gal : 9 ms
[2026-06-16 20:54:07] [INFO ] Time to serialize properties into /tmp/LTL988714048830147731.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/LTL3330812840673239187.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12183639405479791540.hoa' '-atoms' '/tmp/LTL988714048830147731.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/LTL988714048830147731.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12183639405479791540.hoa
Detected timeout of ITS tools.
[2026-06-16 20:54:23] [INFO ] Flatten gal took : 50 ms
[2026-06-16 20:54:23] [INFO ] Flatten gal took : 52 ms
[2026-06-16 20:54:23] [INFO ] Time to serialize gal into /tmp/LTL7986991902580445619.gal : 10 ms
[2026-06-16 20:54:23] [INFO ] Time to serialize properties into /tmp/LTL12726677093076537415.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/LTL7986991902580445619.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12726677093076537415.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((X(X(G("(tmp_11_9>array_17_14)"))))||(("(tmp_11_9<=array_17_14)")U(X(X("(tmp_11_9<=array_17_14)")))))))
Formula 0 simplified : X(XXF!"(tmp_11_9>array_17_14)" & (!"(tmp_11_9<=array_17_14)" R XX!"(tmp_11_9<=array_17_14)"))
Detected timeout of ITS tools.
[2026-06-16 20:54:38] [INFO ] Flatten gal took : 62 ms
[2026-06-16 20:54:38] [INFO ] Applying decomposition
[2026-06-16 20:54:38] [INFO ] Flatten gal took : 53 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/graph15405477715446198533.txt' '-o' '/tmp/graph15405477715446198533.bin' '-w' '/tmp/graph15405477715446198533.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15405477715446198533.bin' '-l' '-1' '-v' '-w' '/tmp/graph15405477715446198533.weights' '-q' '0' '-e' '0.001'
[2026-06-16 20:54:38] [INFO ] Decomposing Gal with order
[2026-06-16 20:54:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-16 20:54:38] [INFO ] Removed a total of 4315 redundant transitions.
[2026-06-16 20:54:38] [INFO ] Flatten gal took : 104 ms
[2026-06-16 20:54:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 35 ms.
[2026-06-16 20:54:38] [INFO ] Time to serialize gal into /tmp/LTL9869187665885472380.gal : 9 ms
[2026-06-16 20:54:38] [INFO ] Time to serialize properties into /tmp/LTL6813744195665527028.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/LTL9869187665885472380.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6813744195665527028.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((X(X(G("(gu47.tmp_11_9>gu47.array_17_14)"))))||(("(gu47.tmp_11_9<=gu47.array_17_14)")U(X(X("(gu47.tmp_11_9<=gu47.array_17_14)")))...159
Formula 0 simplified : X(XXF!"(gu47.tmp_11_9>gu47.array_17_14)" & (!"(gu47.tmp_11_9<=gu47.array_17_14)" R XX!"(gu47.tmp_11_9<=gu47.array_17_14)"))
Detected timeout of ITS tools.
Treatment of property LastZero-PT-N18-LTLCardinality-04 finished in 118657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 395 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 395/395 places, 2622/2622 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 43 ms. Remains 394 /395 variables (removed 1) and now considering 2621/2622 (removed 1) transitions.
[2026-06-16 20:54:53] [INFO ] Flow matrix only has 2468 transitions (discarded 153 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10160922451514896548.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-799485760154512348.kers'
[2026-06-16 20:54:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10160922451514896548.kers, --Pflows, --basisKERS=/tmp/petrispot-output-799485760154512348.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 2468 rows 393 cols 6854 entries
Finished phase 1 with 377 SingleSign rule and 0 generalized
[2026-06-16 20:54:53] [INFO ] Computed 17 invariants in 6 ms
Computed 17 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-799485760154512348.kers
Total runtime 11 ms.
[2026-06-16 20:54:54] [INFO ] Implicit Places using invariants in 285 ms returned []
[2026-06-16 20:54:54] [INFO ] Flow matrix only has 2468 transitions (discarded 153 similar events)
[2026-06-16 20:54:54] [INFO ] Invariant cache hit.
[2026-06-16 20:54:54] [INFO ] State equation strengthened by 342 read => feed constraints.
[2026-06-16 20:55:17] [INFO ] Implicit Places using invariants and state equation in 23568 ms returned []
Implicit Place search using SMT with State Equation took 23858 ms to find 0 implicit places.
[2026-06-16 20:55:17] [INFO ] Redundant transitions in 181 ms returned []
Running 2603 sub problems to find dead transitions.
[2026-06-16 20:55:17] [INFO ] Flow matrix only has 2468 transitions (discarded 153 similar events)
[2026-06-16 20:55:17] [INFO ] Invariant cache hit.
[2026-06-16 20:55:17] [INFO ] State equation strengthened by 342 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 393/2862 variables, and 16 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, State Equation: 0/394 constraints, ReadFeed: 0/342 constraints, PredecessorRefiner: 2603/2603 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/2862 variables, and 16 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, State Equation: 0/394 constraints, ReadFeed: 0/342 constraints, PredecessorRefiner: 0/2603 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61110ms problems are : Problem set: 0 solved, 2603 unsolved
Search for dead transitions found 0 dead transitions in 61116ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 85220 ms. Remains : 394/395 places, 2621/2622 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : LastZero-PT-N18-LTLCardinality-10
Product exploration explored 100000 steps with 1851 reset in 408 ms.
Product exploration explored 100000 steps with 1851 reset in 363 ms.
Computed a total of 394 stabilizing places and 2621 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 394 transition count 2621
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 7 factoid took 60 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (740 resets) in 360 ms. (110 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (81 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (82 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 228832 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 2
Probabilistic random walk after 228832 steps, saw 46174 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
[2026-06-16 20:56:23] [INFO ] Flow matrix only has 2468 transitions (discarded 153 similar events)
[2026-06-16 20:56:23] [INFO ] Invariant cache hit.
[2026-06-16 20:56:23] [INFO ] State equation strengthened by 342 read => feed constraints.
All remaining problems are real, not stopping.
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) 15/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 256/274 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 439/713 variables, 46/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/713 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/713 variables, 42/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/713 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 51/764 variables, 26/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/764 variables, 25/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/764 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 162/926 variables, 30/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/926 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 327/1253 variables, 45/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1253 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1253 variables, 28/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1253 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 40/1293 variables, 21/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1293 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1293 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1293 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 4/1297 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1297 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 3/1300 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1300 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 2/1302 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1302 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 2/1304 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1304 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 2/1306 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1306 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 2/1308 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1308 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 2/1310 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1310 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 2/1312 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1312 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 2/1314 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1314 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 2/1316 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1316 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 1135/2451 variables, 40/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2451 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 400/2851 variables, 215/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2851 variables, 12/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2851 variables, 173/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2851 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (OVERLAPS) 11/2862 variables, 11/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2862 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (OVERLAPS) 0/2862 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2862/2862 variables, and 753 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1489 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 394/394 constraints, ReadFeed: 342/342 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) 15/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 256/274 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 439/713 variables, 46/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/713 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/713 variables, 42/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/713 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/713 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 51/764 variables, 26/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/764 variables, 25/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 162/926 variables, 30/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/926 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 327/1253 variables, 45/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1253 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1253 variables, 28/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1253 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1253 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 40/1293 variables, 21/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1293 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1293 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1293 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 4/1297 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1297 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 3/1300 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1300 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 2/1302 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1302 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 2/1304 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1304 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 2/1306 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1306 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 2/1308 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1308 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 2/1310 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1310 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 2/1312 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1312 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 2/1314 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1314 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 2/1316 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1316 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 1135/2451 variables, 40/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2451 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 400/2851 variables, 215/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2851 variables, 12/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/2851 variables, 173/744 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2851 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (OVERLAPS) 11/2862 variables, 11/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2862 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (OVERLAPS) 0/2862 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2862/2862 variables, and 755 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2926 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 394/394 constraints, ReadFeed: 342/342 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4426ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 26 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
Parikh walk visited 2 properties in 11 ms.
Knowledge based reduction with 7 factoid took 102 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 8285 ms.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 394 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 394/394 places, 2621/2621 transitions.
Applied a total of 0 rules in 35 ms. Remains 394 /394 variables (removed 0) and now considering 2621/2621 (removed 0) transitions.
[2026-06-16 20:56:28] [INFO ] Flow matrix only has 2468 transitions (discarded 153 similar events)
[2026-06-16 20:56:28] [INFO ] Invariant cache hit.
[2026-06-16 20:56:28] [INFO ] Implicit Places using invariants in 263 ms returned []
[2026-06-16 20:56:28] [INFO ] Flow matrix only has 2468 transitions (discarded 153 similar events)
[2026-06-16 20:56:28] [INFO ] Invariant cache hit.
[2026-06-16 20:56:29] [INFO ] State equation strengthened by 342 read => feed constraints.
[2026-06-16 20:56:52] [INFO ] Implicit Places using invariants and state equation in 23416 ms returned []
Implicit Place search using SMT with State Equation took 23683 ms to find 0 implicit places.
[2026-06-16 20:56:52] [INFO ] Redundant transitions in 152 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23884 ms. Remains : 394/394 places, 2621/2621 transitions.
Computed a total of 394 stabilizing places and 2621 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 394 transition count 2621
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 7 factoid took 55 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 (740 resets) in 364 ms. (109 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (83 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (81 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 228491 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 2
Probabilistic random walk after 228491 steps, saw 46115 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
[2026-06-16 20:56:55] [INFO ] Flow matrix only has 2468 transitions (discarded 153 similar events)
[2026-06-16 20:56:55] [INFO ] Invariant cache hit.
[2026-06-16 20:56:55] [INFO ] State equation strengthened by 342 read => feed constraints.
All remaining problems are real, not stopping.
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) 15/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 256/274 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 439/713 variables, 46/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/713 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/713 variables, 42/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/713 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 51/764 variables, 26/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/764 variables, 25/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/764 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 162/926 variables, 30/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/926 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 327/1253 variables, 45/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1253 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1253 variables, 28/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1253 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 40/1293 variables, 21/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1293 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1293 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1293 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 4/1297 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1297 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 3/1300 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1300 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 2/1302 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1302 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 2/1304 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1304 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 2/1306 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1306 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 2/1308 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1308 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 2/1310 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1310 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 2/1312 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1312 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 2/1314 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1314 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 2/1316 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1316 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 1135/2451 variables, 40/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2451 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 400/2851 variables, 215/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2851 variables, 12/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2851 variables, 173/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2851 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (OVERLAPS) 11/2862 variables, 11/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2862 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (OVERLAPS) 0/2862 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2862/2862 variables, and 753 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1670 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 394/394 constraints, ReadFeed: 342/342 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) 15/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 256/274 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 439/713 variables, 46/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/713 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/713 variables, 42/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/713 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/713 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 51/764 variables, 26/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/764 variables, 25/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 162/926 variables, 30/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/926 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 327/1253 variables, 45/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1253 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1253 variables, 28/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1253 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1253 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 40/1293 variables, 21/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1293 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1293 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1293 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 4/1297 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1297 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 3/1300 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1300 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 2/1302 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1302 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 2/1304 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1304 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 2/1306 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1306 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 2/1308 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1308 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 2/1310 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1310 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 2/1312 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1312 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 2/1314 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1314 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 2/1316 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1316 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 1135/2451 variables, 40/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2451 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (OVERLAPS) 400/2851 variables, 215/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2851 variables, 12/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/2851 variables, 173/744 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2851 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (OVERLAPS) 11/2862 variables, 11/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/2862 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (OVERLAPS) 0/2862 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2862/2862 variables, and 755 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2825 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 394/394 constraints, ReadFeed: 342/342 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4519ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 26 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
Parikh walk visited 2 properties in 12 ms.
Knowledge based reduction with 7 factoid took 82 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 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Knowledge-based reduction took 8378 ms.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1851 reset in 308 ms.
Product exploration explored 100000 steps with 1851 reset in 322 ms.
Built C files in :
/tmp/ltsmin12154486796964775636
[2026-06-16 20:57:01] [INFO ] Too many transitions (2621) to apply POR reductions. Disabling POR matrices.
[2026-06-16 20:57:01] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12154486796964775636
Running compilation step : cd /tmp/ltsmin12154486796964775636;'/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/ltsmin12154486796964775636;'/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/ltsmin12154486796964775636;'/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 394 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 394/394 places, 2621/2621 transitions.
Applied a total of 0 rules in 54 ms. Remains 394 /394 variables (removed 0) and now considering 2621/2621 (removed 0) transitions.
[2026-06-16 20:57:04] [INFO ] Flow matrix only has 2468 transitions (discarded 153 similar events)
[2026-06-16 20:57:04] [INFO ] Invariant cache hit.
[2026-06-16 20:57:04] [INFO ] Implicit Places using invariants in 266 ms returned []
[2026-06-16 20:57:04] [INFO ] Flow matrix only has 2468 transitions (discarded 153 similar events)
[2026-06-16 20:57:04] [INFO ] Invariant cache hit.
[2026-06-16 20:57:05] [INFO ] State equation strengthened by 342 read => feed constraints.
[2026-06-16 20:57:28] [INFO ] Implicit Places using invariants and state equation in 23268 ms returned []
Implicit Place search using SMT with State Equation took 23539 ms to find 0 implicit places.
[2026-06-16 20:57:28] [INFO ] Redundant transitions in 82 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23691 ms. Remains : 394/394 places, 2621/2621 transitions.
Built C files in :
/tmp/ltsmin2981483197862116292
[2026-06-16 20:57:28] [INFO ] Too many transitions (2621) to apply POR reductions. Disabling POR matrices.
[2026-06-16 20:57:28] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2981483197862116292
Running compilation step : cd /tmp/ltsmin2981483197862116292;'/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/ltsmin2981483197862116292;'/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/ltsmin2981483197862116292;'/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 20:57:31] [INFO ] Flatten gal took : 39 ms
[2026-06-16 20:57:31] [INFO ] Flatten gal took : 42 ms
[2026-06-16 20:57:31] [INFO ] Time to serialize gal into /tmp/LTL6541500384985466449.gal : 8 ms
[2026-06-16 20:57:31] [INFO ] Time to serialize properties into /tmp/LTL15615212201241343746.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/LTL6541500384985466449.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14133106218999765027.hoa' '-atoms' '/tmp/LTL15615212201241343746.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/LTL15615212201241343746.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14133106218999765027.hoa
Detected timeout of ITS tools.
[2026-06-16 20:57:46] [INFO ] Flatten gal took : 40 ms
[2026-06-16 20:57:46] [INFO ] Flatten gal took : 40 ms
[2026-06-16 20:57:46] [INFO ] Time to serialize gal into /tmp/LTL12602507004503567156.gal : 14 ms
[2026-06-16 20:57:46] [INFO ] Time to serialize properties into /tmp/LTL8106535551213369951.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/LTL12602507004503567156.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8106535551213369951.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("(tmp_15_14<1)"))&&(F(G("(array_16_13<=tmp_14_14)"))))))
Formula 0 simplified : F(G!"(tmp_15_14<1)" | GF!"(array_16_13<=tmp_14_14)")
Detected timeout of ITS tools.
[2026-06-16 20:58:01] [INFO ] Flatten gal took : 37 ms
[2026-06-16 20:58:01] [INFO ] Applying decomposition
[2026-06-16 20:58:01] [INFO ] Flatten gal took : 37 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/graph3850693268499585239.txt' '-o' '/tmp/graph3850693268499585239.bin' '-w' '/tmp/graph3850693268499585239.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3850693268499585239.bin' '-l' '-1' '-v' '-w' '/tmp/graph3850693268499585239.weights' '-q' '0' '-e' '0.001'
[2026-06-16 20:58:01] [INFO ] Decomposing Gal with order
[2026-06-16 20:58:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-16 20:58:02] [INFO ] Removed a total of 4268 redundant transitions.
[2026-06-16 20:58:02] [INFO ] Flatten gal took : 154 ms
[2026-06-16 20:58:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 61 ms.
[2026-06-16 20:58:02] [INFO ] Time to serialize gal into /tmp/LTL13910031472727346917.gal : 7 ms
[2026-06-16 20:58:02] [INFO ] Time to serialize properties into /tmp/LTL14448500738254009802.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/LTL13910031472727346917.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14448500738254009802.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F("(gi5.gu113.tmp_15_14<1)"))&&(F(G("(gu37.array_16_13<=gu37.tmp_14_14)"))))))
Formula 0 simplified : F(G!"(gi5.gu113.tmp_15_14<1)" | GF!"(gu37.array_16_13<=gu37.tmp_14_14)")
Detected timeout of ITS tools.
Treatment of property LastZero-PT-N18-LTLCardinality-10 finished in 203644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 395 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 395/395 places, 2622/2622 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 28 ms. Remains 394 /395 variables (removed 1) and now considering 2621/2622 (removed 1) transitions.
[2026-06-16 20:58:17] [INFO ] Flow matrix only has 2468 transitions (discarded 153 similar events)
[2026-06-16 20:58:17] [INFO ] Invariant cache hit.
[2026-06-16 20:58:17] [INFO ] Implicit Places using invariants in 491 ms returned []
[2026-06-16 20:58:17] [INFO ] Flow matrix only has 2468 transitions (discarded 153 similar events)
[2026-06-16 20:58:17] [INFO ] Invariant cache hit.
[2026-06-16 20:58:18] [INFO ] State equation strengthened by 342 read => feed constraints.
[2026-06-16 20:58:33] [INFO ] Implicit Places using invariants and state equation in 15749 ms returned []
Implicit Place search using SMT with State Equation took 16251 ms to find 0 implicit places.
[2026-06-16 20:58:33] [INFO ] Redundant transitions in 80 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16374 ms. Remains : 394/395 places, 2621/2622 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : LastZero-PT-N18-LTLCardinality-13
Stuttering criterion allowed to conclude after 141 steps with 2 reset in 2 ms.
FORMULA LastZero-PT-N18-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-PT-N18-LTLCardinality-13 finished in 16507 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 2622/2622 transitions.
Applied a total of 0 rules in 14 ms. Remains 395 /395 variables (removed 0) and now considering 2622/2622 (removed 0) transitions.
[2026-06-16 20:58:33] [INFO ] Flow matrix only has 2469 transitions (discarded 153 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3407031473375900964.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6674488391108602582.kers'
[2026-06-16 20:58:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3407031473375900964.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6674488391108602582.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 2469 rows 394 cols 6856 entries
Finished phase 1 with 378 SingleSign rule and 0 generalized
[2026-06-16 20:58:33] [INFO ] Computed 17 invariants in 5 ms
Computed 17 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-6674488391108602582.kers
Total runtime 7 ms.
[2026-06-16 20:58:34] [INFO ] Implicit Places using invariants in 276 ms returned []
[2026-06-16 20:58:34] [INFO ] Flow matrix only has 2469 transitions (discarded 153 similar events)
[2026-06-16 20:58:34] [INFO ] Invariant cache hit.
[2026-06-16 20:58:34] [INFO ] State equation strengthened by 342 read => feed constraints.
[2026-06-16 20:58:48] [INFO ] Implicit Places using invariants and state equation in 14680 ms returned []
Implicit Place search using SMT with State Equation took 14984 ms to find 0 implicit places.
Running 2604 sub problems to find dead transitions.
[2026-06-16 20:58:48] [INFO ] Flow matrix only has 2469 transitions (discarded 153 similar events)
[2026-06-16 20:58:48] [INFO ] Invariant cache hit.
[2026-06-16 20:58:48] [INFO ] State equation strengthened by 342 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/2864 variables, and 17 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/395 constraints, ReadFeed: 0/342 constraints, PredecessorRefiner: 2604/2604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/2864 variables, and 17 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 0/395 constraints, ReadFeed: 0/342 constraints, PredecessorRefiner: 0/2604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61008ms problems are : Problem set: 0 solved, 2604 unsolved
Search for dead transitions found 0 dead transitions in 61015ms
Finished structural reductions in LTL mode , in 1 iterations and 76037 ms. Remains : 395/395 places, 2622/2622 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LastZero-PT-N18-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 335 steps with 6 reset in 2 ms.
FORMULA LastZero-PT-N18-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LastZero-PT-N18-LTLCardinality-15 finished in 76223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X(F((p0&&X(F(!p0)))))))))'
Spot run failed in 39 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0)))||(!p0 U X(X(!p0))))))'
Spot run failed in 46 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Spot run failed in 43 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-06-16 20:59:50] [INFO ] Flatten gal took : 38 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9931033000354832564
[2026-06-16 20:59:50] [INFO ] Too many transitions (2622) to apply POR reductions. Disabling POR matrices.
[2026-06-16 20:59:50] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9931033000354832564
Running compilation step : cd /tmp/ltsmin9931033000354832564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-06-16 20:59:50] [INFO ] Applying decomposition
[2026-06-16 20:59:50] [INFO ] Flatten gal took : 43 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/graph5381151467620143514.txt' '-o' '/tmp/graph5381151467620143514.bin' '-w' '/tmp/graph5381151467620143514.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5381151467620143514.bin' '-l' '-1' '-v' '-w' '/tmp/graph5381151467620143514.weights' '-q' '0' '-e' '0.001'
[2026-06-16 20:59:50] [INFO ] Decomposing Gal with order
[2026-06-16 20:59:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-16 20:59:50] [INFO ] Removed a total of 4273 redundant transitions.
[2026-06-16 20:59:50] [INFO ] Flatten gal took : 81 ms
[2026-06-16 20:59:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 255 labels/synchronizations in 60 ms.
[2026-06-16 20:59:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality10844423121928901290.gal : 8 ms
[2026-06-16 20:59:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality5468571369610840716.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/LTLCardinality10844423121928901290.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5468571369610840716.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...298
Read 3 LTL properties
Checking formula 0 : !((X(X(("(gu31.lastzero_13>gu31.array_14_12)")||(X(F(("(gu31.lastzero_13>gu31.array_14_12)")&&(X(F("(gu31.lastzero_13<=gu31.array_14_1...168
Formula 0 simplified : XX(!"(gu31.lastzero_13>gu31.array_14_12)" & XG(!"(gu31.lastzero_13>gu31.array_14_12)" | XG!"(gu31.lastzero_13<=gu31.array_14_12)"))
Compilation finished in 5252 ms.
Running link step : cd /tmp/ltsmin9931033000354832564;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin9931033000354832564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(((LTLAPp0==true)||X(<>(((LTLAPp0==true)&&X(<>(!(LTLAPp0==true)))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gi3.gu49.t1462, gi3.gu59.t1735, gi3.gu35.t1012, gi3.gu127.t1223, gi3.gu66.t2044, gi3.gu67.t20...3202
Computing Next relation with stutter on 131072 deadlock states
80 unique states visited
55 strongly connected components in search stack
95 transitions explored
55 items max in DFS search stack
5889 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,59.058,1487176,1,0,2024,4.69455e+06,2904,1099,23637,3.63794e+06,5158
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA LastZero-PT-N18-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X((X(X(G("(gu104.tmp_11_9>gu104.array_17_14)"))))||(("(gu104.tmp_11_9<=gu104.array_17_14)")U(X(X("(gu104.tmp_11_9<=gu104.array_17_1...165
Formula 1 simplified : X(XXF!"(gu104.tmp_11_9>gu104.array_17_14)" & (!"(gu104.tmp_11_9<=gu104.array_17_14)" R XX!"(gu104.tmp_11_9<=gu104.array_17_14)"))
Computing Next relation with stutter on 131072 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,59.0649,1488072,1,0,2024,4.69455e+06,2916,1099,23647,3.63795e+06,5170
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA LastZero-PT-N18-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G((F("(gi3.gu38.tmp_15_14<1)"))&&(F(G("(gu113.array_16_13<=gu113.tmp_14_14)"))))))
Formula 2 simplified : F(G!"(gi3.gu38.tmp_15_14<1)" | GF!"(gu113.array_16_13<=gu113.tmp_14_14)")
Computing Next relation with stutter on 131072 deadlock states
57 unique states visited
57 strongly connected components in search stack
58 transitions explored
57 items max in DFS search stack
752 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,66.5934,1695536,1,0,2121,4.96521e+06,2936,1250,24375,4.29343e+06,5780
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA LastZero-PT-N18-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 713825 ms.

BK_STOP 1781643664286

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="LastZero-PT-N18"
export BK_EXAMINATION="LTLCardinality"
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 LastZero-PT-N18, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r354-tall-178024402800123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LastZero-PT-N18.tgz
mv LastZero-PT-N18 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;