MCC'2026- Execution of r178-oct2-177969020000268

About the Execution of ITS-Tools for MedleyA-PT-22

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16209.060	3600000.00	6563794.00	84339.00	FFTFFFFFFTFFFFF?	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969020000268.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 MedleyA-PT-22, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020000268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 4.8K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 238K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyA-PT-22-LTLFireability-00
FORMULA_NAME MedleyA-PT-22-LTLFireability-01
FORMULA_NAME MedleyA-PT-22-LTLFireability-02
FORMULA_NAME MedleyA-PT-22-LTLFireability-03
FORMULA_NAME MedleyA-PT-22-LTLFireability-04
FORMULA_NAME MedleyA-PT-22-LTLFireability-05
FORMULA_NAME MedleyA-PT-22-LTLFireability-06
FORMULA_NAME MedleyA-PT-22-LTLFireability-07
FORMULA_NAME MedleyA-PT-22-LTLFireability-08
FORMULA_NAME MedleyA-PT-22-LTLFireability-09
FORMULA_NAME MedleyA-PT-22-LTLFireability-10
FORMULA_NAME MedleyA-PT-22-LTLFireability-11
FORMULA_NAME MedleyA-PT-22-LTLFireability-12
FORMULA_NAME MedleyA-PT-22-LTLFireability-13
FORMULA_NAME MedleyA-PT-22-LTLFireability-14
FORMULA_NAME MedleyA-PT-22-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779702666128

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 09:51:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 09:51:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:51:07] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2026-05-25 09:51:07] [INFO ] Transformed 307 places.
[2026-05-25 09:51:07] [INFO ] Transformed 740 transitions.
[2026-05-25 09:51:07] [INFO ] Found NUPN structural information;
[2026-05-25 09:51:07] [INFO ] Parsed PT model containing 307 places and 740 transitions and 3829 arcs in 226 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA MedleyA-PT-22-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 740/740 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 303 transition count 740
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 97 place count 210 transition count 630
Iterating global reduction 1 with 93 rules applied. Total rules applied 190 place count 210 transition count 630
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 199 place count 210 transition count 621
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 220 place count 189 transition count 572
Iterating global reduction 2 with 21 rules applied. Total rules applied 241 place count 189 transition count 572
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 248 place count 182 transition count 555
Iterating global reduction 2 with 7 rules applied. Total rules applied 255 place count 182 transition count 555
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 256 place count 181 transition count 552
Iterating global reduction 2 with 1 rules applied. Total rules applied 257 place count 181 transition count 552
Applied a total of 257 rules in 72 ms. Remains 181 /307 variables (removed 126) and now considering 552/740 (removed 188) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13011235753590497694.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10466596537221140762.kers'
[2026-05-25 09:51:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13011235753590497694.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10466596537221140762.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 552 rows 181 cols 3281 entries
Finished phase 1 with 151 SingleSign rule and 8 generalized
[2026-05-25 09:51:08] [INFO ] Computed 22 invariants in 2 ms
Computed 22 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10466596537221140762.kers
Total runtime 3 ms.
[2026-05-25 09:51:08] [INFO ] Implicit Places using invariants in 268 ms returned []
[2026-05-25 09:51:08] [INFO ] Invariant cache hit.
[2026-05-25 09:51:08] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
Running 551 sub problems to find dead transitions.
[2026-05-25 09:51:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 551 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 551 unsolved
Problem TDEAD181 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD526 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/181 variables, 12/22 constraints. Problems are: Problem set: 144 solved, 407 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 7/29 constraints. Problems are: Problem set: 144 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 1/30 constraints. Problems are: Problem set: 144 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/30 constraints. Problems are: Problem set: 144 solved, 407 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (OVERLAPS) 552/733 variables, 181/211 constraints. Problems are: Problem set: 144 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 733/733 variables, and 211 constraints, problems are : Problem set: 144 solved, 407 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 551/551 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 144 solved, 407 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 10/10 constraints. Problems are: Problem set: 144 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/10 constraints. Problems are: Problem set: 144 solved, 407 unsolved
At refinement iteration 2 (OVERLAPS) 1/181 variables, 12/22 constraints. Problems are: Problem set: 144 solved, 407 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 8/30 constraints. Problems are: Problem set: 144 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/30 constraints. Problems are: Problem set: 144 solved, 407 unsolved
At refinement iteration 5 (OVERLAPS) 552/733 variables, 181/211 constraints. Problems are: Problem set: 144 solved, 407 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/733 variables, 407/618 constraints. Problems are: Problem set: 144 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 733/733 variables, and 627 constraints, problems are : Problem set: 144 solved, 407 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 407/551 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61067ms problems are : Problem set: 144 solved, 407 unsolved
Search for dead transitions found 144 dead transitions in 61087ms
Found 144 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 144 transitions
Dead transitions reduction (with SMT) removed 144 transitions
Starting structural reductions in LTL mode, iteration 1 : 181/307 places, 408/740 transitions.
Applied a total of 0 rules in 7 ms. Remains 181 /181 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61827 ms. Remains : 181/307 places, 408/740 transitions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 408/408 transitions.
Applied a total of 0 rules in 5 ms. Remains 181 /181 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3845940803872723338.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15673723367020969191.kers'
[2026-05-25 09:52:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3845940803872723338.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15673723367020969191.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 408 rows 181 cols 2129 entries
Finished phase 1 with 151 SingleSign rule and 8 generalized
[2026-05-25 09:52:09] [INFO ] Computed 22 invariants in 3 ms
Computed 22 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15673723367020969191.kers
Total runtime 4 ms.
[2026-05-25 09:52:10] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-25 09:52:10] [INFO ] Invariant cache hit.
[2026-05-25 09:52:10] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 407 sub problems to find dead transitions.
[2026-05-25 09:52:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (OVERLAPS) 1/181 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 6 (OVERLAPS) 408/589 variables, 181/211 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 589/589 variables, and 223 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (OVERLAPS) 1/181 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 6 (OVERLAPS) 408/589 variables, 181/225 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/589 variables, 407/632 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 589/589 variables, and 635 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60329ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 60332ms
Finished structural reductions in LTL mode , in 1 iterations and 60815 ms. Remains : 181/181 places, 408/408 transitions.
Support contains 42 out of 181 places after structural reductions.
[2026-05-25 09:53:11] [INFO ] Flatten gal took : 77 ms
[2026-05-25 09:53:11] [INFO ] Flatten gal took : 27 ms
[2026-05-25 09:53:11] [INFO ] Input system was already deterministic with 408 transitions.
Reduction of identical properties reduced properties to check from 30 to 29
RANDOM walk for 40000 steps (1161 resets) in 2672 ms. (14 steps per ms) remains 21/29 properties
BEST_FIRST walk for 4003 steps (25 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (21 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (19 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (23 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (19 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (22 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (22 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (21 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (24 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (25 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (26 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (21 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (23 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (22 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (17 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (21 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (21 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (20 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (25 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (24 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (20 resets) in 47 ms. (83 steps per ms) remains 21/21 properties
[2026-05-25 09:53:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp29 is UNSAT
At refinement iteration 1 (OVERLAPS) 112/144 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 12/156 variables, 6/18 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 393/549 variables, 156/174 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 0/174 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 25/574 variables, 16/190 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/574 variables, 2/192 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 1/193 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 0/193 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 2/576 variables, 2/195 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 2/197 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/576 variables, 0/197 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 7/583 variables, 4/201 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/583 variables, 0/201 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 5/588 variables, 2/203 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/588 variables, 0/203 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 18 (OVERLAPS) 1/589 variables, 1/204 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/589 variables, 1/205 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/589 variables, 0/205 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 21 (OVERLAPS) 0/589 variables, 0/205 constraints. Problems are: Problem set: 2 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 589/589 variables, and 205 constraints, problems are : Problem set: 2 solved, 19 unsolved in 3206 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 114/143 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 1/13 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 19 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 4 (OVERLAPS) 13/156 variables, 6/19 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/19 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 393/549 variables, 156/175 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 11/186 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/549 variables, 1/187 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/549 variables, 1/188 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/549 variables, 1/189 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/549 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 25/574 variables, 16/205 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/574 variables, 2/207 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/574 variables, 7/214 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/574 variables, 1/215 constraints. Problems are: Problem set: 3 solved, 18 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/589 variables, and 215 constraints, problems are : Problem set: 3 solved, 18 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/10 constraints, State Equation: 172/181 constraints, PredecessorRefiner: 18/21 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 8266ms problems are : Problem set: 3 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 408/408 transitions.
Graph (complete) has 770 edges and 181 vertex of which 180 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 180 transition count 389
Reduce places removed 17 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 163 transition count 387
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 161 transition count 387
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 40 place count 161 transition count 382
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 50 place count 156 transition count 382
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 53 place count 153 transition count 378
Iterating global reduction 3 with 3 rules applied. Total rules applied 56 place count 153 transition count 378
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 58 place count 151 transition count 374
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 151 transition count 374
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 102 place count 129 transition count 354
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 105 place count 126 transition count 351
Iterating global reduction 3 with 3 rules applied. Total rules applied 108 place count 126 transition count 351
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -69
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 122 place count 119 transition count 420
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 138 place count 119 transition count 404
Drop transitions (Redundant composition of simpler transitions.) removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 4 with 47 rules applied. Total rules applied 185 place count 119 transition count 357
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 187 place count 119 transition count 355
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 189 place count 117 transition count 355
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 199 place count 117 transition count 347
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 210 place count 107 transition count 346
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 225 place count 107 transition count 346
Applied a total of 225 rules in 132 ms. Remains 107 /181 variables (removed 74) and now considering 346/408 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 107/181 places, 346/408 transitions.
RANDOM walk for 40000 steps (2775 resets) in 733 ms. (54 steps per ms) remains 9/18 properties
BEST_FIRST walk for 40004 steps (502 resets) in 114 ms. (347 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (585 resets) in 169 ms. (235 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (584 resets) in 144 ms. (275 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (598 resets) in 100 ms. (396 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (501 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (458 resets) in 88 ms. (449 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (374 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15118028470263959817.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13424928647021214640.kers'
[2026-05-25 09:53:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15118028470263959817.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13424928647021214640.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 346 rows 107 cols 1843 entries
Finished phase 1 with 81 SingleSign rule and 5 generalized
[2026-05-25 09:53:21] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13424928647021214640.kers
Total runtime 2 ms.
[2026-05-25 09:53:21] [INFO ] State equation strengthened by 105 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 44/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 17/73 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 33/106 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 346/452 variables, 106/127 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 105/232 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1/453 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/453 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 453/453 variables, and 233 constraints, problems are : Problem set: 0 solved, 7 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 44/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 17/73 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 33/106 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 346/452 variables, 106/127 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 105/232 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 3/235 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/453 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 4/240 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/453 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/453 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 453/453 variables, and 240 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3167 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3469ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 5 properties in 826 ms.
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 346/346 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 343
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 104 transition count 343
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 104 transition count 342
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 103 transition count 342
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 99 transition count 333
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 99 transition count 333
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 31 place count 91 transition count 326
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 35 place count 89 transition count 352
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 43 place count 89 transition count 344
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 47 place count 89 transition count 340
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 51 place count 85 transition count 340
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 85 transition count 338
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 60 place count 85 transition count 461
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 76 place count 78 transition count 452
Applied a total of 76 rules in 88 ms. Remains 78 /107 variables (removed 29) and now considering 452/346 (removed -106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 78/107 places, 452/346 transitions.
RANDOM walk for 40000 steps (3786 resets) in 903 ms. (44 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (563 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (557 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 9927 steps, run visited all 2 properties in 97 ms. (steps per millisecond=102 )
Probabilistic random walk after 9927 steps, saw 2912 distinct states, run finished after 102 ms. (steps per millisecond=97 ) properties seen :2
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA MedleyA-PT-22-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 17 stabilizing places and 18 stable transitions
Graph (complete) has 770 edges and 181 vertex of which 180 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X(G(p1)) U (X(!p0)&&p2))))'
Support contains 6 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 408/408 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 168 transition count 374
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 168 transition count 374
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 162 transition count 360
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 162 transition count 360
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 160 transition count 354
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 160 transition count 354
Applied a total of 42 rules in 12 ms. Remains 160 /181 variables (removed 21) and now considering 354/408 (removed 54) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12358952794999488777.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10917305092868708454.kers'
[2026-05-25 09:53:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12358952794999488777.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10917305092868708454.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 354 rows 160 cols 1945 entries
Finished phase 1 with 130 SingleSign rule and 8 generalized
[2026-05-25 09:53:26] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10917305092868708454.kers
Total runtime 3 ms.
[2026-05-25 09:53:26] [INFO ] Implicit Places using invariants in 177 ms returned []
[2026-05-25 09:53:26] [INFO ] Invariant cache hit.
[2026-05-25 09:53:26] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Running 353 sub problems to find dead transitions.
[2026-05-25 09:53:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (OVERLAPS) 354/514 variables, 160/188 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/514 variables, and 192 constraints, problems are : Problem set: 0 solved, 353 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/159 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 2 (OVERLAPS) 1/160 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 5 (OVERLAPS) 354/514 variables, 160/189 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 353/542 constraints. Problems are: Problem set: 0 solved, 353 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 2/544 constraints. Problems are: Problem set: 0 solved, 353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/514 variables, and 548 constraints, problems are : Problem set: 0 solved, 353 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 353/353 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60354ms problems are : Problem set: 0 solved, 353 unsolved
Search for dead transitions found 0 dead transitions in 60356ms
Starting structural reductions in LTL mode, iteration 1 : 160/181 places, 354/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60804 ms. Remains : 160/181 places, 354/408 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X(G(p1)) U (X(!p0)&&p2))))'
Stuttering acceptance computed with spot in 698 ms :[(NOT p1), p0, (OR (NOT p1) p0), true, (OR (NOT p2) p0), (OR (NOT p1) (NOT p2) p0), (OR (NOT p2) (NOT p1) p0)]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-04
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 3 ms.
FORMULA MedleyA-PT-22-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLFireability-04 finished in 61664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&((G(p0) U p1) U (p0&&(F(p2) U X(p1)))))))'
Support contains 3 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 408/408 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 169 transition count 375
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 169 transition count 375
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 164 transition count 362
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 164 transition count 362
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 162 transition count 356
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 162 transition count 356
Applied a total of 38 rules in 10 ms. Remains 162 /181 variables (removed 19) and now considering 356/408 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6170330901390772482.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-326895842543633189.kers'
[2026-05-25 09:54:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6170330901390772482.kers, --Pflows, --basisKERS=/tmp/petrispot-output-326895842543633189.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 356 rows 162 cols 1951 entries
Finished phase 1 with 132 SingleSign rule and 8 generalized
[2026-05-25 09:54:28] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-326895842543633189.kers
Total runtime 2 ms.
[2026-05-25 09:54:28] [INFO ] Implicit Places using invariants in 127 ms returned []
[2026-05-25 09:54:28] [INFO ] Invariant cache hit.
[2026-05-25 09:54:28] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Running 355 sub problems to find dead transitions.
[2026-05-25 09:54:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 5 (OVERLAPS) 356/518 variables, 162/191 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 355 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/518 variables, and 194 constraints, problems are : Problem set: 0 solved, 355 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 355 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 5 (OVERLAPS) 356/518 variables, 162/192 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 355/547 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 2/549 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 2/551 constraints. Problems are: Problem set: 0 solved, 355 unsolved
SMT process timed out in 60327ms, After SMT, problems are : Problem set: 0 solved, 355 unsolved
Search for dead transitions found 0 dead transitions in 60329ms
Starting structural reductions in LTL mode, iteration 1 : 162/181 places, 356/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60750 ms. Remains : 162/181 places, 356/408 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&((G(p0) U p1) U (p0&&(F(p2) U X(p1)))))))'
Stuttering acceptance computed with spot in 342 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-22-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLFireability-05 finished in 61158 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(!p0)&&F((p1&&X(G(!p1))))) U p2)))'
Support contains 5 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 408/408 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 170 transition count 379
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 170 transition count 379
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 165 transition count 368
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 165 transition count 368
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 163 transition count 362
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 163 transition count 362
Applied a total of 36 rules in 7 ms. Remains 163 /181 variables (removed 18) and now considering 362/408 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10679421526598439786.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12419671670782916686.kers'
[2026-05-25 09:55:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10679421526598439786.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12419671670782916686.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 362 rows 163 cols 1977 entries
Finished phase 1 with 133 SingleSign rule and 8 generalized
[2026-05-25 09:55:29] [INFO ] Computed 22 invariants in 3 ms
Computed 22 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12419671670782916686.kers
Total runtime 4 ms.
[2026-05-25 09:55:29] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-25 09:55:29] [INFO ] Invariant cache hit.
[2026-05-25 09:55:29] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2026-05-25 09:55:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/525 variables, 163/191 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/525 variables, and 194 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 362/525 variables, 163/193 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 361/554 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 1/555 constraints. Problems are: Problem set: 0 solved, 361 unsolved
SMT process timed out in 60344ms, After SMT, problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 60345ms
Starting structural reductions in LTL mode, iteration 1 : 163/181 places, 362/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60621 ms. Remains : 163/181 places, 362/408 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(!p0)&&F((p1&&X(G(!p1))))) U p2)))'
Stuttering acceptance computed with spot in 209 ms :[(NOT p2), (NOT p2), p0, true, p1]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-06
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-22-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLFireability-06 finished in 60871 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(p1)&&(p2||G(p3)||G(p4))&&p0)))'
Support contains 5 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 408/408 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 169 transition count 375
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 169 transition count 375
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 163 transition count 361
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 163 transition count 361
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 161 transition count 355
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 161 transition count 355
Applied a total of 40 rules in 8 ms. Remains 161 /181 variables (removed 20) and now considering 355/408 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15291683948578202823.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15161585332611270089.kers'
[2026-05-25 09:56:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15291683948578202823.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15161585332611270089.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 355 rows 161 cols 1949 entries
Finished phase 1 with 131 SingleSign rule and 8 generalized
[2026-05-25 09:56:30] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15161585332611270089.kers
Total runtime 2 ms.
[2026-05-25 09:56:30] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-25 09:56:30] [INFO ] Invariant cache hit.
[2026-05-25 09:56:30] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 354 sub problems to find dead transitions.
[2026-05-25 09:56:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 5 (OVERLAPS) 355/516 variables, 161/189 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 3/193 constraints. Problems are: Problem set: 0 solved, 354 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 516/516 variables, and 193 constraints, problems are : Problem set: 0 solved, 354 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 354/354 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 354 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 5 (OVERLAPS) 355/516 variables, 161/190 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 354/544 constraints. Problems are: Problem set: 0 solved, 354 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 3/547 constraints. Problems are: Problem set: 0 solved, 354 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 516/516 variables, and 550 constraints, problems are : Problem set: 0 solved, 354 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 354/354 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60276ms problems are : Problem set: 0 solved, 354 unsolved
Search for dead transitions found 0 dead transitions in 60277ms
Starting structural reductions in LTL mode, iteration 1 : 161/181 places, 355/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60684 ms. Remains : 161/181 places, 355/408 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(p1)&&(p2||G(p3)||G(p4))&&p0)))'
Stuttering acceptance computed with spot in 497 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3) (NOT p4))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3) (NOT p4))), true, (NOT p1), (NOT p3), (NOT p4), (AND (NOT p3) (NOT p4))]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-22-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLFireability-08 finished in 61250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U X((p1||X(F(p2)))))))'
Support contains 3 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 408/408 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 170 transition count 380
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 170 transition count 380
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 164 transition count 366
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 164 transition count 366
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 162 transition count 360
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 162 transition count 360
Applied a total of 38 rules in 16 ms. Remains 162 /181 variables (removed 19) and now considering 360/408 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3073944196333750720.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5617925937817727588.kers'
[2026-05-25 09:57:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3073944196333750720.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5617925937817727588.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 360 rows 162 cols 1957 entries
Finished phase 1 with 132 SingleSign rule and 8 generalized
[2026-05-25 09:57:31] [INFO ] Computed 22 invariants in 4 ms
Computed 22 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5617925937817727588.kers
Total runtime 6 ms.
[2026-05-25 09:57:31] [INFO ] Implicit Places using invariants in 186 ms returned []
[2026-05-25 09:57:31] [INFO ] Invariant cache hit.
[2026-05-25 09:57:31] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Running 359 sub problems to find dead transitions.
[2026-05-25 09:57:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (OVERLAPS) 360/522 variables, 162/190 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 522/522 variables, and 193 constraints, problems are : Problem set: 0 solved, 359 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 359 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (OVERLAPS) 1/162 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (OVERLAPS) 360/522 variables, 162/191 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 359/550 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 5/555 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 522/522 variables, and 559 constraints, problems are : Problem set: 0 solved, 359 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/2 constraints]
After SMT, in 60303ms problems are : Problem set: 0 solved, 359 unsolved
Search for dead transitions found 0 dead transitions in 60306ms
Starting structural reductions in LTL mode, iteration 1 : 162/181 places, 360/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60760 ms. Remains : 162/181 places, 360/408 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U X((p1||X(F(p2)))))))'
Stuttering acceptance computed with spot in 345 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-09
Product exploration explored 100000 steps with 33333 reset in 158 ms.
Product exploration explored 100000 steps with 33333 reset in 160 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Graph (complete) has 691 edges and 162 vertex of which 161 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 16 stabilizing places and 16 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 5 factoid took 24 ms. Proved property starting from automaton with 7 states, 10 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 36 ms.
FORMULA MedleyA-PT-22-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-22-LTLFireability-09 finished in 61537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((F(p0) U (p1 U X(p2))))) U p2))'
Support contains 8 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 408/408 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 170 transition count 381
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 170 transition count 381
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 165 transition count 369
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 165 transition count 369
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 164 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 164 transition count 366
Applied a total of 34 rules in 5 ms. Remains 164 /181 variables (removed 17) and now considering 366/408 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15307240034686831208.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15262600678145729678.kers'
[2026-05-25 09:58:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15307240034686831208.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15262600678145729678.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 366 rows 164 cols 1989 entries
Finished phase 1 with 134 SingleSign rule and 8 generalized
[2026-05-25 09:58:32] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15262600678145729678.kers
Total runtime 2 ms.
[2026-05-25 09:58:32] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-25 09:58:32] [INFO ] Invariant cache hit.
[2026-05-25 09:58:33] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2026-05-25 09:58:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/530 variables, 164/192 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/530 variables, and 195 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/164 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 5 (OVERLAPS) 366/530 variables, 164/193 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 365/558 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/530 variables, and 564 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/2 constraints]
After SMT, in 60375ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60376ms
Starting structural reductions in LTL mode, iteration 1 : 164/181 places, 366/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60679 ms. Remains : 164/181 places, 366/408 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((F(p0) U (p1 U X(p2))))) U p2))'
Stuttering acceptance computed with spot in 281 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-10
Stuttering criterion allowed to conclude after 1176 steps with 59 reset in 4 ms.
FORMULA MedleyA-PT-22-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLFireability-10 finished in 61043 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 408/408 transitions.
Graph (complete) has 770 edges and 181 vertex of which 180 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 179 transition count 380
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 153 transition count 379
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 152 transition count 379
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 55 place count 152 transition count 373
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 67 place count 146 transition count 373
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 79 place count 134 transition count 340
Iterating global reduction 3 with 12 rules applied. Total rules applied 91 place count 134 transition count 340
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 91 place count 134 transition count 339
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 133 transition count 339
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 98 place count 128 transition count 328
Iterating global reduction 3 with 5 rules applied. Total rules applied 103 place count 128 transition count 328
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 105 place count 126 transition count 322
Iterating global reduction 3 with 2 rules applied. Total rules applied 107 place count 126 transition count 322
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 154 place count 101 transition count 300
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 158 place count 97 transition count 294
Iterating global reduction 3 with 4 rules applied. Total rules applied 162 place count 97 transition count 294
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 174 place count 91 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 194 place count 91 transition count 303
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 196 place count 90 transition count 313
Applied a total of 196 rules in 85 ms. Remains 90 /181 variables (removed 91) and now considering 313/408 (removed 95) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16860831595058907612.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6910527365285098907.kers'
[2026-05-25 09:59:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16860831595058907612.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6910527365285098907.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 313 rows 90 cols 1479 entries
Finished phase 1 with 66 SingleSign rule and 5 generalized
[2026-05-25 09:59:33] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6910527365285098907.kers
Total runtime 1 ms.
[2026-05-25 09:59:34] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-25 09:59:34] [INFO ] Invariant cache hit.
[2026-05-25 09:59:34] [INFO ] State equation strengthened by 171 read => feed constraints.
[2026-05-25 09:59:34] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
[2026-05-25 09:59:34] [INFO ] Redundant transitions in 46 ms returned []
Running 303 sub problems to find dead transitions.
[2026-05-25 09:59:34] [INFO ] Invariant cache hit.
[2026-05-25 09:59:34] [INFO ] State equation strengthened by 171 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 313/402 variables, 89/108 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 171/279 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (OVERLAPS) 1/403 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (OVERLAPS) 0/403 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 303 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 280 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 90/90 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 303 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 4 (OVERLAPS) 313/402 variables, 89/108 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 171/279 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 303/582 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 303 unsolved
At refinement iteration 8 (OVERLAPS) 1/403 variables, 1/583 constraints. Problems are: Problem set: 0 solved, 303 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 403/403 variables, and 583 constraints, problems are : Problem set: 0 solved, 303 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 90/90 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 303/303 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60275ms problems are : Problem set: 0 solved, 303 unsolved
Search for dead transitions found 0 dead transitions in 60276ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/181 places, 313/408 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61010 ms. Remains : 90/181 places, 313/408 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-12
Product exploration explored 100000 steps with 13324 reset in 452 ms.
Product exploration explored 100000 steps with 13320 reset in 423 ms.
Computed a total of 12 stabilizing places and 166 stable transitions
Computed a total of 12 stabilizing places and 166 stable transitions
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 22421 steps (2971 resets) in 395 ms. (56 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Knowledge-based reduction took 397 ms.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0)]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 313/313 transitions.
Applied a total of 0 rules in 16 ms. Remains 90 /90 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2026-05-25 10:00:36] [INFO ] Invariant cache hit.
[2026-05-25 10:00:36] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-25 10:00:36] [INFO ] Invariant cache hit.
[2026-05-25 10:00:36] [INFO ] State equation strengthened by 171 read => feed constraints.
[2026-05-25 10:00:36] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
[2026-05-25 10:00:36] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 619 ms. Remains : 90/90 places, 313/313 transitions.
Computed a total of 12 stabilizing places and 166 stable transitions
Computed a total of 12 stabilizing places and 166 stable transitions
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 36517 steps (4866 resets) in 184 ms. (197 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Knowledge-based reduction took 236 ms.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13286 reset in 396 ms.
Product exploration explored 100000 steps with 13319 reset in 422 ms.
Built C files in :
/tmp/ltsmin13720848530746342170
[2026-05-25 10:00:38] [INFO ] Computing symmetric may disable matrix : 313 transitions.
[2026-05-25 10:00:38] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:00:38] [INFO ] Computing symmetric may enable matrix : 313 transitions.
[2026-05-25 10:00:38] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:00:38] [INFO ] Computing Do-Not-Accords matrix : 313 transitions.
[2026-05-25 10:00:38] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:00:38] [INFO ] Built C files in 107ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13720848530746342170
Running compilation step : cd /tmp/ltsmin13720848530746342170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1160 ms.
Running link step : cd /tmp/ltsmin13720848530746342170;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 91 ms.
Running LTSmin : cd /tmp/ltsmin13720848530746342170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9163793567883264077.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 313/313 transitions.
Applied a total of 0 rules in 7 ms. Remains 90 /90 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2026-05-25 10:00:53] [INFO ] Invariant cache hit.
[2026-05-25 10:00:53] [INFO ] Implicit Places using invariants in 105 ms returned []
[2026-05-25 10:00:53] [INFO ] Invariant cache hit.
[2026-05-25 10:00:53] [INFO ] State equation strengthened by 171 read => feed constraints.
[2026-05-25 10:00:53] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
[2026-05-25 10:00:53] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 669 ms. Remains : 90/90 places, 313/313 transitions.
Built C files in :
/tmp/ltsmin5419865785587507719
[2026-05-25 10:00:53] [INFO ] Computing symmetric may disable matrix : 313 transitions.
[2026-05-25 10:00:53] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:00:53] [INFO ] Computing symmetric may enable matrix : 313 transitions.
[2026-05-25 10:00:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:00:53] [INFO ] Computing Do-Not-Accords matrix : 313 transitions.
[2026-05-25 10:00:53] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:00:53] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5419865785587507719
Running compilation step : cd /tmp/ltsmin5419865785587507719;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 772 ms.
Running link step : cd /tmp/ltsmin5419865785587507719;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin5419865785587507719;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12600922180987427005.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 10:01:09] [INFO ] Flatten gal took : 23 ms
[2026-05-25 10:01:09] [INFO ] Flatten gal took : 33 ms
[2026-05-25 10:01:09] [INFO ] Time to serialize gal into /tmp/LTL11188018872112700447.gal : 10 ms
[2026-05-25 10:01:09] [INFO ] Time to serialize properties into /tmp/LTL18229408986129928672.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/LTL11188018872112700447.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11423516706199898307.hoa' '-atoms' '/tmp/LTL18229408986129928672.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL18229408986129928672.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11423516706199898307.hoa
Reverse transition relation is NOT exact ! Due to transitions t35, t36.t37, t39, t40, t46, t89, t92, t93, t97, t131, t134, t135, t139, t132.t137, t136.t137...1180
Computing Next relation with stutter on 8258 deadlock states
Detected timeout of ITS tools.
[2026-05-25 10:01:24] [INFO ] Flatten gal took : 17 ms
[2026-05-25 10:01:24] [INFO ] Flatten gal took : 15 ms
[2026-05-25 10:01:24] [INFO ] Time to serialize gal into /tmp/LTL2279254081301892086.gal : 4 ms
[2026-05-25 10:01:24] [INFO ] Time to serialize properties into /tmp/LTL9643341091082973751.ltl : 8 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/LTL2279254081301892086.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9643341091082973751.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(p55!=1)"))))
Formula 0 simplified : GF!"(p55!=1)"
Reverse transition relation is NOT exact ! Due to transitions t35, t36.t37, t39, t40, t46, t89, t92, t93, t97, t131, t134, t135, t139, t132.t137, t136.t137...1180
Computing Next relation with stutter on 8258 deadlock states
Detected timeout of ITS tools.
[2026-05-25 10:01:39] [INFO ] Flatten gal took : 36 ms
[2026-05-25 10:01:39] [INFO ] Applying decomposition
[2026-05-25 10:01:39] [INFO ] Flatten gal took : 27 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/graph15295514186840401578.txt' '-o' '/tmp/graph15295514186840401578.bin' '-w' '/tmp/graph15295514186840401578.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15295514186840401578.bin' '-l' '-1' '-v' '-w' '/tmp/graph15295514186840401578.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:01:39] [INFO ] Decomposing Gal with order
[2026-05-25 10:01:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:01:39] [INFO ] Removed a total of 638 redundant transitions.
[2026-05-25 10:01:39] [INFO ] Flatten gal took : 95 ms
[2026-05-25 10:01:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 21 ms.
[2026-05-25 10:01:39] [INFO ] Time to serialize gal into /tmp/LTL10806231907875409579.gal : 3 ms
[2026-05-25 10:01:39] [INFO ] Time to serialize properties into /tmp/LTL14774506465793064460.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/LTL10806231907875409579.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14774506465793064460.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("(i0.u3.p55!=1)"))))
Formula 0 simplified : GF!"(i0.u3.p55!=1)"
Reverse transition relation is NOT exact ! Due to transitions t13_t70_t120_t121_t122_t126_t71_t72_t73_t77_t14_t15_t16_t20_t125_t78_t21, i0.t159_t403_t157_t...628
Computing Next relation with stutter on 8258 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
165 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.6897,63036,1,0,78194,1250,1583,223518,496,7383,105850
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA MedleyA-PT-22-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property MedleyA-PT-22-LTLFireability-12 finished in 127811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(X(F(p1))))))))'
Support contains 5 out of 181 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 408/408 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 169 transition count 377
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 169 transition count 377
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 163 transition count 363
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 163 transition count 363
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 161 transition count 357
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 161 transition count 357
Applied a total of 40 rules in 6 ms. Remains 161 /181 variables (removed 20) and now considering 357/408 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17086772411884804817.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5921658451807210001.kers'
[2026-05-25 10:01:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17086772411884804817.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5921658451807210001.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 357 rows 161 cols 1951 entries
Finished phase 1 with 131 SingleSign rule and 8 generalized
[2026-05-25 10:01:41] [INFO ] Computed 22 invariants in 4 ms
Computed 22 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5921658451807210001.kers
Total runtime 6 ms.
[2026-05-25 10:01:41] [INFO ] Implicit Places using invariants in 164 ms returned []
[2026-05-25 10:01:41] [INFO ] Invariant cache hit.
[2026-05-25 10:01:42] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Running 356 sub problems to find dead transitions.
[2026-05-25 10:01:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (OVERLAPS) 357/518 variables, 161/189 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/518 variables, and 191 constraints, problems are : Problem set: 0 solved, 356 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 2 (OVERLAPS) 1/161 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 5 (OVERLAPS) 357/518 variables, 161/190 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 356/546 constraints. Problems are: Problem set: 0 solved, 356 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 4/550 constraints. Problems are: Problem set: 0 solved, 356 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/518 variables, and 552 constraints, problems are : Problem set: 0 solved, 356 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 356/356 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/1 constraints]
After SMT, in 60442ms problems are : Problem set: 0 solved, 356 unsolved
Search for dead transitions found 0 dead transitions in 60444ms
Starting structural reductions in LTL mode, iteration 1 : 161/181 places, 357/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60898 ms. Remains : 161/181 places, 357/408 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(X(F(p0))))||p1))))'
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-13
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-22-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLFireability-13 finished in 61174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 408/408 transitions.
Graph (complete) has 770 edges and 181 vertex of which 180 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 179 transition count 379
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 152 transition count 379
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 55 place count 152 transition count 373
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 67 place count 146 transition count 373
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 78 place count 135 transition count 341
Iterating global reduction 2 with 11 rules applied. Total rules applied 89 place count 135 transition count 341
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 94 place count 130 transition count 330
Iterating global reduction 2 with 5 rules applied. Total rules applied 99 place count 130 transition count 330
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 101 place count 128 transition count 324
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 128 transition count 324
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 49 rules applied. Total rules applied 152 place count 102 transition count 301
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 156 place count 98 transition count 295
Iterating global reduction 2 with 4 rules applied. Total rules applied 160 place count 98 transition count 295
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 172 place count 92 transition count 324
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 192 place count 92 transition count 304
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 194 place count 91 transition count 314
Applied a total of 194 rules in 32 ms. Remains 91 /181 variables (removed 90) and now considering 314/408 (removed 94) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7800421599074143694.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6891117357719095146.kers'
[2026-05-25 10:02:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7800421599074143694.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6891117357719095146.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 314 rows 91 cols 1501 entries
Finished phase 1 with 67 SingleSign rule and 5 generalized
[2026-05-25 10:02:42] [INFO ] Computed 19 invariants in 1 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6891117357719095146.kers
Total runtime 8 ms.
[2026-05-25 10:02:42] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-25 10:02:42] [INFO ] Invariant cache hit.
[2026-05-25 10:02:43] [INFO ] State equation strengthened by 167 read => feed constraints.
[2026-05-25 10:02:43] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2026-05-25 10:02:43] [INFO ] Redundant transitions in 2 ms returned []
Running 304 sub problems to find dead transitions.
[2026-05-25 10:02:43] [INFO ] Invariant cache hit.
[2026-05-25 10:02:43] [INFO ] State equation strengthened by 167 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 314/404 variables, 90/109 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 167/276 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 1/405 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (OVERLAPS) 0/405 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 304 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 277 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 91/91 constraints, ReadFeed: 167/167 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 314/404 variables, 90/109 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 167/276 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 304/580 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (OVERLAPS) 1/405 variables, 1/581 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 405/405 variables, and 581 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 91/91 constraints, ReadFeed: 167/167 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60219ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60219ms
Starting structural reductions in SI_LTL mode, iteration 1 : 91/181 places, 314/408 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60665 ms. Remains : 91/181 places, 314/408 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-14
Product exploration explored 100000 steps with 13299 reset in 367 ms.
Product exploration explored 100000 steps with 13310 reset in 443 ms.
Computed a total of 9 stabilizing places and 132 stable transitions
Computed a total of 9 stabilizing places and 132 stable transitions
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (5313 resets) in 354 ms. (112 steps per ms) remains 1/1 properties
BEST_FIRST walk for 36700 steps (809 resets) in 129 ms. (282 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Knowledge-based reduction took 348 ms.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 1 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 314/314 transitions.
Applied a total of 0 rules in 16 ms. Remains 91 /91 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2026-05-25 10:03:44] [INFO ] Invariant cache hit.
[2026-05-25 10:03:44] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-25 10:03:44] [INFO ] Invariant cache hit.
[2026-05-25 10:03:45] [INFO ] State equation strengthened by 167 read => feed constraints.
[2026-05-25 10:03:45] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2026-05-25 10:03:45] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 568 ms. Remains : 91/91 places, 314/314 transitions.
Computed a total of 9 stabilizing places and 132 stable transitions
Computed a total of 9 stabilizing places and 132 stable transitions
Knowledge based reduction with 3 factoid took 54 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 34676 steps (4650 resets) in 236 ms. (146 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 48 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Knowledge-based reduction took 215 ms.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13276 reset in 410 ms.
Product exploration explored 100000 steps with 13284 reset in 441 ms.
Built C files in :
/tmp/ltsmin10682693746172901078
[2026-05-25 10:03:46] [INFO ] Computing symmetric may disable matrix : 314 transitions.
[2026-05-25 10:03:46] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:03:46] [INFO ] Computing symmetric may enable matrix : 314 transitions.
[2026-05-25 10:03:46] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:03:46] [INFO ] Computing Do-Not-Accords matrix : 314 transitions.
[2026-05-25 10:03:46] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:03:46] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10682693746172901078
Running compilation step : cd /tmp/ltsmin10682693746172901078;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 807 ms.
Running link step : cd /tmp/ltsmin10682693746172901078;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10682693746172901078;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3693696265409378279.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 314/314 transitions.
Applied a total of 0 rules in 17 ms. Remains 91 /91 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2026-05-25 10:04:01] [INFO ] Invariant cache hit.
[2026-05-25 10:04:01] [INFO ] Implicit Places using invariants in 170 ms returned []
[2026-05-25 10:04:01] [INFO ] Invariant cache hit.
[2026-05-25 10:04:01] [INFO ] State equation strengthened by 167 read => feed constraints.
[2026-05-25 10:04:02] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
[2026-05-25 10:04:02] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 621 ms. Remains : 91/91 places, 314/314 transitions.
Built C files in :
/tmp/ltsmin5290642676827746214
[2026-05-25 10:04:02] [INFO ] Computing symmetric may disable matrix : 314 transitions.
[2026-05-25 10:04:02] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:04:02] [INFO ] Computing symmetric may enable matrix : 314 transitions.
[2026-05-25 10:04:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:04:02] [INFO ] Computing Do-Not-Accords matrix : 314 transitions.
[2026-05-25 10:04:02] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:04:02] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5290642676827746214
Running compilation step : cd /tmp/ltsmin5290642676827746214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 714 ms.
Running link step : cd /tmp/ltsmin5290642676827746214;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5290642676827746214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8379724693161406409.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 10:04:17] [INFO ] Flatten gal took : 36 ms
[2026-05-25 10:04:17] [INFO ] Flatten gal took : 21 ms
[2026-05-25 10:04:17] [INFO ] Time to serialize gal into /tmp/LTL13507656859543405764.gal : 4 ms
[2026-05-25 10:04:17] [INFO ] Time to serialize properties into /tmp/LTL9430704674494888978.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13507656859543405764.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1519109232235484846.hoa' '-atoms' '/tmp/LTL9430704674494888978.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/LTL9430704674494888978.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1519109232235484846.hoa
Reverse transition relation is NOT exact ! Due to transitions t18, t35, t36.t37, t39, t40, t46, t51, t58, t61, t68, t89, t92, t93, t97, t131, t134, t135, t...1237
Computing Next relation with stutter on 8258 deadlock states
Detected timeout of ITS tools.
[2026-05-25 10:04:32] [INFO ] Flatten gal took : 28 ms
[2026-05-25 10:04:32] [INFO ] Flatten gal took : 24 ms
[2026-05-25 10:04:32] [INFO ] Time to serialize gal into /tmp/LTL17097000388111933825.gal : 2 ms
[2026-05-25 10:04:32] [INFO ] Time to serialize properties into /tmp/LTL3123758582491871137.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/LTL17097000388111933825.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3123758582491871137.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 : !((F(G("(p206!=1)"))))
Formula 0 simplified : GF!"(p206!=1)"
Reverse transition relation is NOT exact ! Due to transitions t18, t35, t36.t37, t39, t40, t46, t51, t58, t61, t68, t89, t92, t93, t97, t131, t134, t135, t...1237
Computing Next relation with stutter on 8258 deadlock states
Detected timeout of ITS tools.
[2026-05-25 10:04:47] [INFO ] Flatten gal took : 30 ms
[2026-05-25 10:04:47] [INFO ] Applying decomposition
[2026-05-25 10:04:47] [INFO ] Flatten gal took : 10 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/graph16791381897891932269.txt' '-o' '/tmp/graph16791381897891932269.bin' '-w' '/tmp/graph16791381897891932269.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16791381897891932269.bin' '-l' '-1' '-v' '-w' '/tmp/graph16791381897891932269.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:04:47] [INFO ] Decomposing Gal with order
[2026-05-25 10:04:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:04:47] [INFO ] Removed a total of 659 redundant transitions.
[2026-05-25 10:04:47] [INFO ] Flatten gal took : 22 ms
[2026-05-25 10:04:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 39 ms.
[2026-05-25 10:04:47] [INFO ] Time to serialize gal into /tmp/LTL6958704926872668931.gal : 1 ms
[2026-05-25 10:04:47] [INFO ] Time to serialize properties into /tmp/LTL9106556023254647742.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/LTL6958704926872668931.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9106556023254647742.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("(i4.u10.p206!=1)"))))
Formula 0 simplified : GF!"(i4.u10.p206!=1)"
Reverse transition relation is NOT exact ! Due to transitions t13_t70_t120_t121_t122_t126_t71_t72_t73_t77_t14_t15_t67_t16_t20_t125_t76_t21, u12.t61, i0.u4....850
Computing Next relation with stutter on 8258 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
167 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.69122,63356,1,0,72666,9190,2004,260482,1145,41753,99120
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA MedleyA-PT-22-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property MedleyA-PT-22-LTLFireability-14 finished in 126915 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||G(p1))))'
Support contains 6 out of 181 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 181/181 places, 408/408 transitions.
Graph (complete) has 770 edges and 181 vertex of which 180 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 179 transition count 381
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 154 transition count 381
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 51 place count 154 transition count 376
Deduced a syphon composed of 5 places in 11 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 61 place count 149 transition count 376
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 72 place count 138 transition count 348
Iterating global reduction 2 with 11 rules applied. Total rules applied 83 place count 138 transition count 348
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 87 place count 134 transition count 339
Iterating global reduction 2 with 4 rules applied. Total rules applied 91 place count 134 transition count 339
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 133 transition count 336
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 133 transition count 336
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 10 ms
Ensure Unique test removed 3 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 45 rules applied. Total rules applied 138 place count 109 transition count 315
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 142 place count 105 transition count 309
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 105 transition count 309
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 160 place count 98 transition count 353
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 2 with 38 rules applied. Total rules applied 198 place count 98 transition count 315
Applied a total of 198 rules in 90 ms. Remains 98 /181 variables (removed 83) and now considering 315/408 (removed 93) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-443093550509661248.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5543052963832894084.kers'
[2026-05-25 10:04:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-443093550509661248.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5543052963832894084.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 315 rows 98 cols 1649 entries
Finished phase 1 with 74 SingleSign rule and 5 generalized
[2026-05-25 10:04:49] [INFO ] Computed 19 invariants in 2 ms
Computed 19 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5543052963832894084.kers
Total runtime 5 ms.
[2026-05-25 10:04:49] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-05-25 10:04:49] [INFO ] Invariant cache hit.
[2026-05-25 10:04:50] [INFO ] State equation strengthened by 105 read => feed constraints.
[2026-05-25 10:04:50] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2026-05-25 10:04:50] [INFO ] Redundant transitions in 1 ms returned []
Running 309 sub problems to find dead transitions.
[2026-05-25 10:04:50] [INFO ] Invariant cache hit.
[2026-05-25 10:04:50] [INFO ] State equation strengthened by 105 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 315/412 variables, 97/116 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 105/221 constraints. Problems are: Problem set: 0 solved, 309 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (OVERLAPS) 1/413 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 9 (OVERLAPS) 0/413 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 222 constraints, problems are : Problem set: 0 solved, 309 unsolved in 19058 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 315/412 variables, 97/116 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 105/221 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 309/530 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (OVERLAPS) 1/413 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/413 variables, and 531 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49419ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 49419ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/181 places, 315/408 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49889 ms. Remains : 98/181 places, 315/408 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-15
Product exploration explored 100000 steps with 9304 reset in 387 ms.
Product exploration explored 100000 steps with 9310 reset in 328 ms.
Computed a total of 6 stabilizing places and 86 stable transitions
Computed a total of 6 stabilizing places and 86 stable transitions
Knowledge based reduction with 13 factoid took 63 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (3744 resets) in 626 ms. (63 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (541 resets) in 651 ms. (61 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (590 resets) in 500 ms. (79 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (473 resets) in 39 ms. (1000 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (477 resets) in 41 ms. (952 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (577 resets) in 40 ms. (975 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (481 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 593239 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :0 out of 6
Probabilistic random walk after 593239 steps, saw 115600 distinct states, run finished after 3005 ms. (steps per millisecond=197 ) properties seen :0
[2026-05-25 10:05:44] [INFO ] Invariant cache hit.
[2026-05-25 10:05:44] [INFO ] State equation strengthened by 105 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, 6 unsolved
Problem apf5 is UNSAT
At refinement iteration 1 (OVERLAPS) 28/34 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 42/76 variables, 7/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 8/84 variables, 3/15 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 298/382 variables, 84/99 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 69/168 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/168 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 30/412 variables, 13/181 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/412 variables, 4/185 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 36/221 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/412 variables, 0/221 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1/413 variables, 1/222 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 0/222 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/413 variables, 0/222 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 222 constraints, problems are : Problem set: 1 solved, 5 unsolved in 459 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 105/105 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/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 28/34 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 42/76 variables, 7/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 8/84 variables, 3/15 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 298/382 variables, 84/99 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 69/168 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/168 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 30/412 variables, 13/181 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/412 variables, 4/185 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 36/221 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/412 variables, 5/226 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 0/226 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 1/413 variables, 1/227 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/413 variables, 0/227 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/413 variables, 0/227 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 227 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1749 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2242ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 6787 steps, including 279 resets, run visited all 5 properties in 136 ms. (steps per millisecond=49 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 140 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 14 factoid took 174 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 6221 ms.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Support contains 6 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 315/315 transitions.
Applied a total of 0 rules in 13 ms. Remains 98 /98 variables (removed 0) and now considering 315/315 (removed 0) transitions.
[2026-05-25 10:05:46] [INFO ] Invariant cache hit.
[2026-05-25 10:05:46] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-25 10:05:46] [INFO ] Invariant cache hit.
[2026-05-25 10:05:46] [INFO ] State equation strengthened by 105 read => feed constraints.
[2026-05-25 10:05:47] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2026-05-25 10:05:47] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 449 ms. Remains : 98/98 places, 315/315 transitions.
Computed a total of 6 stabilizing places and 86 stable transitions
Computed a total of 6 stabilizing places and 86 stable transitions
Knowledge based reduction with 13 factoid took 57 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (3714 resets) in 433 ms. (92 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (534 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (571 resets) in 73 ms. (540 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (478 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (476 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (585 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (504 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 713880 steps, run timeout after 3001 ms. (steps per millisecond=237 ) properties seen :0 out of 6
Probabilistic random walk after 713880 steps, saw 136285 distinct states, run finished after 3001 ms. (steps per millisecond=237 ) properties seen :0
[2026-05-25 10:05:50] [INFO ] Invariant cache hit.
[2026-05-25 10:05:50] [INFO ] State equation strengthened by 105 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, 6 unsolved
Problem apf5 is UNSAT
At refinement iteration 1 (OVERLAPS) 28/34 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 42/76 variables, 7/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 8/84 variables, 3/15 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 298/382 variables, 84/99 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 69/168 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/168 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 30/412 variables, 13/181 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/412 variables, 4/185 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 36/221 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/412 variables, 0/221 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1/413 variables, 1/222 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 0/222 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/413 variables, 0/222 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 222 constraints, problems are : Problem set: 1 solved, 5 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 105/105 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/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 28/34 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 42/76 variables, 7/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 8/84 variables, 3/15 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 298/382 variables, 84/99 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 69/168 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/168 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 30/412 variables, 13/181 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/412 variables, 4/185 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 36/221 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/412 variables, 5/226 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 0/226 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 1/413 variables, 1/227 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/413 variables, 0/227 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/413 variables, 0/227 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 413/413 variables, and 227 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1771 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2071ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 288 ms.
Support contains 6 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 315/315 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 98 transition count 314
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 7 place count 98 transition count 308
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 92 transition count 308
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 2 with 18 rules applied. Total rules applied 31 place count 92 transition count 407
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 59 place count 74 transition count 397
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 74 transition count 396
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 65 place count 74 transition count 396
Applied a total of 65 rules in 31 ms. Remains 74 /98 variables (removed 24) and now considering 396/315 (removed -81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 74/98 places, 396/315 transitions.
RANDOM walk for 40000 steps (4898 resets) in 287 ms. (138 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (923 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (954 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 60561 steps, run visited all 2 properties in 238 ms. (steps per millisecond=254 )
Probabilistic random walk after 60561 steps, saw 13831 distinct states, run finished after 238 ms. (steps per millisecond=254 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge based reduction with 14 factoid took 92 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 6364 ms.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 9352 reset in 312 ms.
Product exploration explored 100000 steps with 9368 reset in 315 ms.
Built C files in :
/tmp/ltsmin11756913386691930390
[2026-05-25 10:05:54] [INFO ] Computing symmetric may disable matrix : 315 transitions.
[2026-05-25 10:05:54] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:05:54] [INFO ] Computing symmetric may enable matrix : 315 transitions.
[2026-05-25 10:05:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:05:54] [INFO ] Computing Do-Not-Accords matrix : 315 transitions.
[2026-05-25 10:05:54] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:05:54] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11756913386691930390
Running compilation step : cd /tmp/ltsmin11756913386691930390;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 814 ms.
Running link step : cd /tmp/ltsmin11756913386691930390;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin11756913386691930390;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4504792978920800600.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 315/315 transitions.
Applied a total of 0 rules in 16 ms. Remains 98 /98 variables (removed 0) and now considering 315/315 (removed 0) transitions.
[2026-05-25 10:06:09] [INFO ] Invariant cache hit.
[2026-05-25 10:06:09] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-25 10:06:09] [INFO ] Invariant cache hit.
[2026-05-25 10:06:09] [INFO ] State equation strengthened by 105 read => feed constraints.
[2026-05-25 10:06:09] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2026-05-25 10:06:09] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 498 ms. Remains : 98/98 places, 315/315 transitions.
Built C files in :
/tmp/ltsmin14724934921267612724
[2026-05-25 10:06:09] [INFO ] Computing symmetric may disable matrix : 315 transitions.
[2026-05-25 10:06:09] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:06:09] [INFO ] Computing symmetric may enable matrix : 315 transitions.
[2026-05-25 10:06:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:06:09] [INFO ] Computing Do-Not-Accords matrix : 315 transitions.
[2026-05-25 10:06:09] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:06:09] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14724934921267612724
Running compilation step : cd /tmp/ltsmin14724934921267612724;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 800 ms.
Running link step : cd /tmp/ltsmin14724934921267612724;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14724934921267612724;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6035701937647911639.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 10:06:24] [INFO ] Flatten gal took : 16 ms
[2026-05-25 10:06:24] [INFO ] Flatten gal took : 8 ms
[2026-05-25 10:06:24] [INFO ] Time to serialize gal into /tmp/LTL15472702061793703313.gal : 3 ms
[2026-05-25 10:06:24] [INFO ] Time to serialize properties into /tmp/LTL3745001365818419553.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15472702061793703313.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5186320019677885832.hoa' '-atoms' '/tmp/LTL3745001365818419553.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/LTL3745001365818419553.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5186320019677885832.hoa
Reverse transition relation is NOT exact ! Due to transitions t18, t35, t36.t37, t39, t40, t46, t49, t50, t53, t57, t60, t75, t82, t89, t92, t93, t95, t97,...928
Computing Next relation with stutter on 9520 deadlock states
Detected timeout of ITS tools.
[2026-05-25 10:06:39] [INFO ] Flatten gal took : 26 ms
[2026-05-25 10:06:39] [INFO ] Flatten gal took : 18 ms
[2026-05-25 10:06:39] [INFO ] Time to serialize gal into /tmp/LTL15325014855609081461.gal : 5 ms
[2026-05-25 10:06:39] [INFO ] Time to serialize properties into /tmp/LTL5264022258001456820.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/LTL15325014855609081461.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5264022258001456820.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 : !((F((G("(((p120!=1)||(p181!=1))||((p210!=1)||(p231!=1)))"))||(G("(((p120==0)||(p135==0))||(p177==0))")))))
Formula 0 simplified : G(F!"(((p120!=1)||(p181!=1))||((p210!=1)||(p231!=1)))" & F!"(((p120==0)||(p135==0))||(p177==0))")
Reverse transition relation is NOT exact ! Due to transitions t18, t35, t36.t37, t39, t40, t46, t49, t50, t53, t57, t60, t75, t82, t89, t92, t93, t95, t97,...928
Computing Next relation with stutter on 9520 deadlock states
Detected timeout of ITS tools.
[2026-05-25 10:06:55] [INFO ] Flatten gal took : 23 ms
[2026-05-25 10:06:55] [INFO ] Applying decomposition
[2026-05-25 10:06:55] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7166033484837060397.txt' '-o' '/tmp/graph7166033484837060397.bin' '-w' '/tmp/graph7166033484837060397.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7166033484837060397.bin' '-l' '-1' '-v' '-w' '/tmp/graph7166033484837060397.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:06:55] [INFO ] Decomposing Gal with order
[2026-05-25 10:06:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:06:55] [INFO ] Removed a total of 729 redundant transitions.
[2026-05-25 10:06:55] [INFO ] Flatten gal took : 34 ms
[2026-05-25 10:06:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 9 ms.
[2026-05-25 10:06:55] [INFO ] Time to serialize gal into /tmp/LTL6594237718021987955.gal : 2 ms
[2026-05-25 10:06:55] [INFO ] Time to serialize properties into /tmp/LTL1845168807117736257.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/LTL6594237718021987955.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1845168807117736257.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((G("(((i1.i1.u5.p120!=1)||(i1.i1.u11.p181!=1))||((i2.u13.p210!=1)||(i2.u16.p231!=1)))"))||(G("(((i1.i1.u5.p120==0)||(i1.i0.u6.p13...189
Formula 0 simplified : G(F!"(((i1.i1.u5.p120!=1)||(i1.i1.u11.p181!=1))||((i2.u13.p210!=1)||(i2.u16.p231!=1)))" & F!"(((i1.i1.u5.p120==0)||(i1.i0.u6.p135==0...181
Reverse transition relation is NOT exact ! Due to transitions t13_t70_t120_t121_t122_t126_t71_t72_t73_t77_t14_t15_t16_t20_t127_t19, i0.u2.t143, i0.u3.t144,...926
Computing Next relation with stutter on 9520 deadlock states
Detected timeout of ITS tools.
Treatment of property MedleyA-PT-22-LTLFireability-15 finished in 140531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||G(p1))))'
Spot run failed in 139 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-25 10:07:10] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
[2026-05-25 10:07:10] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin4498866126189879918
[2026-05-25 10:07:10] [INFO ] Computing symmetric may disable matrix : 408 transitions.
[2026-05-25 10:07:10] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:07:10] [INFO ] Computing symmetric may enable matrix : 408 transitions.
[2026-05-25 10:07:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:07:10] [INFO ] Flatten gal took : 16 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/graph12179106229076962744.txt' '-o' '/tmp/graph12179106229076962744.bin' '-w' '/tmp/graph12179106229076962744.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12179106229076962744.bin' '-l' '-1' '-v' '-w' '/tmp/graph12179106229076962744.weights' '-q' '0' '-e' '0.001'
[2026-05-25 10:07:10] [INFO ] Decomposing Gal with order
[2026-05-25 10:07:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:07:10] [INFO ] Computing Do-Not-Accords matrix : 408 transitions.
[2026-05-25 10:07:10] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:07:10] [INFO ] Built C files in 135ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4498866126189879918
Running compilation step : cd /tmp/ltsmin4498866126189879918;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-25 10:07:10] [INFO ] Removed a total of 717 redundant transitions.
[2026-05-25 10:07:10] [INFO ] Flatten gal took : 38 ms
[2026-05-25 10:07:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 21 ms.
[2026-05-25 10:07:10] [INFO ] Time to serialize gal into /tmp/LTLFireability6108572334371374778.gal : 4 ms
[2026-05-25 10:07:10] [INFO ] Time to serialize properties into /tmp/LTLFireability15673111068593299767.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6108572334371374778.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15673111068593299767.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G(!("(((u15.p120==1)&&(u15.p181==1))&&((i6.u28.p210==1)&&(i8.i0.u35.p231==1)))")))||(G("(((u15.p120==0)||(i4.u21.p135==0))||(u15...171
Formula 0 simplified : G(F"(((u15.p120==1)&&(u15.p181==1))&&((i6.u28.p210==1)&&(i8.i0.u35.p231==1)))" & F!"(((u15.p120==0)||(i4.u21.p135==0))||(u15.p177==0...159
Compilation finished in 1077 ms.
Running link step : cd /tmp/ltsmin4498866126189879918;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin4498866126189879918;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>(([](!(LTLAPp0==true))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t49, t56, t77, t126, t161, t163, t176, t188, t196, t198, t226, t228, t234, t236, t240, t2...1664
Computing Next relation with stutter on 49596 deadlock states
Detected timeout of ITS tools.
[2026-05-25 10:32:34] [INFO ] Applying decomposition
[2026-05-25 10:32:34] [INFO ] Flatten gal took : 211 ms
[2026-05-25 10:32:34] [INFO ] Decomposing Gal with order
[2026-05-25 10:32:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 10:32:35] [INFO ] Removed a total of 795 redundant transitions.
[2026-05-25 10:32:35] [INFO ] Flatten gal took : 622 ms
[2026-05-25 10:32:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 122 labels/synchronizations in 93 ms.
[2026-05-25 10:32:36] [INFO ] Time to serialize gal into /tmp/LTLFireability9277861099955043846.gal : 24 ms
[2026-05-25 10:32:36] [INFO ] Time to serialize properties into /tmp/LTLFireability13120664891003678843.ltl : 8 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/LTLFireability9277861099955043846.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13120664891003678843.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G(!("(((i0.i0.i1.u13.p120==1)&&(i0.i0.i1.i1.u20.p181==1))&&((i0.i1.u22.p210==1)&&(i0.i1.i1.i0.u26.p231==1)))")))||(G("(((i0.i0.i...234
Formula 0 simplified : G(F"(((i0.i0.i1.u13.p120==1)&&(i0.i0.i1.i1.u20.p181==1))&&((i0.i1.u22.p210==1)&&(i0.i1.i1.i0.u26.p231==1)))" & F!"(((i0.i0.i1.u13.p1...222
Reverse transition relation is NOT exact ! Due to transitions t195, t205, t218, t224, t225, t234, t235, i0.t290, i0.t289, i0.t285, i0.t284, i0.i0.t377, i0....2659
Computing Next relation with stutter on 49596 deadlock states

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-22"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-22, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-oct2-177969020000268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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