Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r018-smll-177946788100300.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is BlocksWorld-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946788100300
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 9.1K Mar 5 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 5 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 5 16:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 5 16:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 15 07:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 07:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 5 16:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Mar 5 16:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 5 16:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Mar 5 16:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:26 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 175K 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 BlocksWorld-PT-02-LTLFireability-00
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-01
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-02
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-03
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-04
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-05
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-06
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-07
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-08
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-09
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-10
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-11
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-12
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-13
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-14
FORMULA_NAME BlocksWorld-PT-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779571129349

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BlocksWorld-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 21:18:51] [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-23 21:18:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 21:18:51] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2026-05-23 21:18:51] [INFO ] Transformed 209 places.
[2026-05-23 21:18:51] [INFO ] Transformed 365 transitions.
[2026-05-23 21:18:51] [INFO ] Found NUPN structural information;
[2026-05-23 21:18:51] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12]
[2026-05-23 21:18:51] [INFO ] Parsed PT model containing 209 places and 365 transitions and 1810 arcs in 366 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA BlocksWorld-PT-02-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-02-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 365/365 transitions.
Applied a total of 0 rules in 93 ms. Remains 209 /209 variables (removed 0) and now considering 365/365 (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-4638332782023153853.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13749234196341597702.kers'
[2026-05-23 21:18:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4638332782023153853.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13749234196341597702.kers]
Normalized transition count is 364 out of 365 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 364 rows 209 cols 1742 entries
Finished phase 1 with 182 SingleSign rule and 0 generalized
[2026-05-23 21:18:52] [INFO ] Computed 27 invariants in 1 ms
Computed 27 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13749234196341597702.kers
Total runtime 4 ms.
[2026-05-23 21:18:53] [INFO ] Implicit Places using invariants in 808 ms returned []
[2026-05-23 21:18:53] [INFO ] Invariant cache hit.
[2026-05-23 21:18:53] [INFO ] State equation strengthened by 19 read => feed constraints.
[2026-05-23 21:18:54] [INFO ] Implicit Places using invariants and state equation in 1222 ms returned []
Implicit Place search using SMT with State Equation took 2103 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2026-05-23 21:18:54] [INFO ] Invariant cache hit.
[2026-05-23 21:18:54] [INFO ] State equation strengthened by 19 read => feed constraints.
Problem TDEAD1 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD358 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 20/20 constraints. Problems are: Problem set: 20 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 0/20 constraints. Problems are: Problem set: 20 solved, 341 unsolved
Problem TDEAD40 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD362 is UNSAT
At refinement iteration 2 (OVERLAPS) 4/209 variables, 7/27 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 2/29 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/29 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 5 (OVERLAPS) 364/573 variables, 209/238 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 18/256 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/256 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 1/574 variables, 1/257 constraints. Problems are: Problem set: 26 solved, 335 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 574/574 variables, and 257 constraints, problems are : Problem set: 26 solved, 335 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 209/209 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 26 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 1/1 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/1 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 17/209 variables, 26/27 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 2/29 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 5/34 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 3/37 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 3/40 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 4/44 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 2/46 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/46 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 10 (OVERLAPS) 364/573 variables, 209/255 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/573 variables, 18/273 constraints. Problems are: Problem set: 26 solved, 335 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/573 variables, 335/608 constraints. Problems are: Problem set: 26 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/574 variables, and 608 constraints, problems are : Problem set: 26 solved, 335 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 209/209 constraints, ReadFeed: 18/19 constraints, PredecessorRefiner: 335/361 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61383ms problems are : Problem set: 26 solved, 335 unsolved
Search for dead transitions found 26 dead transitions in 61414ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 209/209 places, 339/365 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 198 transition count 339
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 11 rules in 23 ms. Remains 198 /209 variables (removed 11) and now considering 339/339 (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-2233454162102060729.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3311374188883494644.kers'
[2026-05-23 21:19:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2233454162102060729.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3311374188883494644.kers]
Normalized transition count is 338 out of 339 initially.
Culling trivial invariants: removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 338 rows 196 cols 1664 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-23 21:19:55] [INFO ] Computed 29 invariants in 2 ms
Computed 29 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3311374188883494644.kers
Total runtime 2 ms.
[2026-05-23 21:19:56] [INFO ] Implicit Places using invariants in 223 ms returned []
[2026-05-23 21:19:56] [INFO ] Invariant cache hit.
[2026-05-23 21:19:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 21:19:56] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 198/209 places, 339/365 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64380 ms. Remains : 198/209 places, 339/365 transitions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 339/339 transitions.
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 0 rules in 9 ms. Remains 198 /198 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2026-05-23 21:19:56] [INFO ] Invariant cache hit.
[2026-05-23 21:19:56] [INFO ] Implicit Places using invariants in 254 ms returned []
[2026-05-23 21:19:56] [INFO ] Invariant cache hit.
[2026-05-23 21:19:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 21:19:57] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2026-05-23 21:19:57] [INFO ] Invariant cache hit.
[2026-05-23 21:19:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/537 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 27/29 constraints, State Equation: 196/198 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/537 variables, and 578 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 27/29 constraints, State Equation: 196/198 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60862ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 60865ms
Finished structural reductions in LTL mode , in 1 iterations and 61582 ms. Remains : 198/198 places, 339/339 transitions.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Support contains 40 out of 196 places after structural reductions.
FORMULA BlocksWorld-PT-02-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 21:20:58] [INFO ] Flatten gal took : 100 ms
[2026-05-23 21:20:58] [INFO ] Flatten gal took : 49 ms
[2026-05-23 21:20:58] [INFO ] Input system was already deterministic with 339 transitions.
Support contains 39 out of 196 places (down from 40) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 3605 ms. (11 steps per ms) remains 4/26 properties
BEST_FIRST walk for 40003 steps (8 resets) in 234 ms. (170 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 244 ms. (163 steps per ms) remains 4/4 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18363871760249116127.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13719655740379130420.kers'
[2026-05-23 21:21:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18363871760249116127.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13719655740379130420.kers]
Normalized transition count is 338 out of 339 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 338 rows 196 cols 1664 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-23 21:21:00] [INFO ] Computed 27 invariants in 2 ms
Computed 27 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13719655740379130420.kers
Total runtime 4 ms.
[2026-05-23 21:21:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 1 (OVERLAPS) 165/182 variables, 21/21 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 0/21 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/196 variables, 6/27 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 1/28 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/28 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 338/534 variables, 196/224 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 0/224 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/535 variables, 1/225 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 0/225 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/535 variables, 0/225 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 225 constraints, problems are : Problem set: 3 solved, 1 unsolved in 521 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/160 variables, 16/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/196 variables, 11/27 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 1/28 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/28 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 338/534 variables, 196/224 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 1/225 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 0/225 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/535 variables, 1/226 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 0/226 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/535 variables, 0/226 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 226 constraints, problems are : Problem set: 3 solved, 1 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 913ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 8 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 339/339 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 196 transition count 338
Applied a total of 1 rules in 355 ms. Remains 196 /196 variables (removed 0) and now considering 338/339 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 355 ms. Remains : 196/196 places, 338/339 transitions.
RANDOM walk for 40000 steps (8 resets) in 443 ms. (90 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 937129 steps, run timeout after 3016 ms. (steps per millisecond=310 ) properties seen :0 out of 1
Probabilistic random walk after 937129 steps, saw 653655 distinct states, run finished after 3023 ms. (steps per millisecond=309 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-897809598246497712.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1513193542452417844.kers'
[2026-05-23 21:21:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-897809598246497712.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1513193542452417844.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 338 rows 196 cols 1664 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-23 21:21:04] [INFO ] Computed 27 invariants in 1 ms
Computed 27 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1513193542452417844.kers
Total runtime 2 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/196 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 223 constraints, problems are : Problem set: 0 solved, 1 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/196 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/534 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 503 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 804ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 8 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 338/338 transitions.
Applied a total of 0 rules in 117 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 196/196 places, 338/338 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 338/338 transitions.
Applied a total of 0 rules in 114 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
[2026-05-23 21:21:05] [INFO ] Invariant cache hit.
[2026-05-23 21:21:05] [INFO ] Implicit Places using invariants in 351 ms returned []
[2026-05-23 21:21:05] [INFO ] Invariant cache hit.
[2026-05-23 21:21:06] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
[2026-05-23 21:21:06] [INFO ] Redundant transitions in 41 ms returned []
Running 334 sub problems to find dead transitions.
[2026-05-23 21:21:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/534 variables, and 223 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 334/557 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/577 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/534 variables, and 577 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60698ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 60700ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61767 ms. Remains : 196/196 places, 338/338 transitions.
FORMULA BlocksWorld-PT-02-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA BlocksWorld-PT-02-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BlocksWorld-PT-02-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U p1)))'
Support contains 5 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 7 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (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-11751479851548427218.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18037959644644868812.kers'
[2026-05-23 21:22:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11751479851548427218.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18037959644644868812.kers]
Normalized transition count is 338 out of 339 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 338 rows 196 cols 1664 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-23 21:22:07] [INFO ] Computed 27 invariants in 1 ms
Computed 27 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18037959644644868812.kers
Total runtime 3 ms.
[2026-05-23 21:22:07] [INFO ] Implicit Places using invariants in 252 ms returned []
[2026-05-23 21:22:07] [INFO ] Invariant cache hit.
[2026-05-23 21:22:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 21:22:08] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2026-05-23 21:22:08] [INFO ] Invariant cache hit.
[2026-05-23 21:22:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 578 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60494ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 60496ms
Finished structural reductions in LTL mode , in 1 iterations and 61172 ms. Remains : 196/196 places, 339/339 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U p1)))'
Stuttering acceptance computed with spot in 313 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA BlocksWorld-PT-02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-02-LTLFireability-00 finished in 61623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(X(p1)))||p0))))'
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 3 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2026-05-23 21:23:09] [INFO ] Invariant cache hit.
[2026-05-23 21:23:09] [INFO ] Implicit Places using invariants in 236 ms returned []
[2026-05-23 21:23:09] [INFO ] Invariant cache hit.
[2026-05-23 21:23:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 21:23:09] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 724 ms. Remains : 196/196 places, 339/339 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(p1)))||p0))))'
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-01
Product exploration explored 100000 steps with 185 reset in 1063 ms.
Product exploration explored 100000 steps with 192 reset in 837 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
RANDOM walk for 2404 steps (0 resets) in 51 ms. (46 steps per ms) remains 0/2 properties
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Knowledge-based reduction took 426 ms.
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 2 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2026-05-23 21:23:12] [INFO ] Invariant cache hit.
[2026-05-23 21:23:12] [INFO ] Implicit Places using invariants in 232 ms returned []
[2026-05-23 21:23:13] [INFO ] Invariant cache hit.
[2026-05-23 21:23:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 21:23:13] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 643 ms. Remains : 196/196 places, 339/339 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 52 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
RANDOM walk for 2082 steps (0 resets) in 50 ms. (40 steps per ms) remains 0/2 properties
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Knowledge-based reduction took 428 ms.
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 191 reset in 1078 ms.
Product exploration explored 100000 steps with 205 reset in 685 ms.
Spot run failed in 114 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin11715527809419352976
[2026-05-23 21:23:16] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11715527809419352976
Running compilation step : cd /tmp/ltsmin11715527809419352976;'/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 1245 ms.
Running link step : cd /tmp/ltsmin11715527809419352976;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin11715527809419352976;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased8020329422727101001.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 3 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2026-05-23 21:23:31] [INFO ] Invariant cache hit.
[2026-05-23 21:23:31] [INFO ] Implicit Places using invariants in 355 ms returned []
[2026-05-23 21:23:31] [INFO ] Invariant cache hit.
[2026-05-23 21:23:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 21:23:32] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 838 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 841 ms. Remains : 196/196 places, 339/339 transitions.
Built C files in :
/tmp/ltsmin7931946232054491658
[2026-05-23 21:23:32] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7931946232054491658
Running compilation step : cd /tmp/ltsmin7931946232054491658;'/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 1129 ms.
Running link step : cd /tmp/ltsmin7931946232054491658;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin7931946232054491658;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased10520718787864101510.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-23 21:23:47] [INFO ] Flatten gal took : 37 ms
[2026-05-23 21:23:47] [INFO ] Flatten gal took : 52 ms
[2026-05-23 21:23:47] [INFO ] Time to serialize gal into /tmp/LTL456617231349930372.gal : 11 ms
[2026-05-23 21:23:47] [INFO ] Time to serialize properties into /tmp/LTL12555917814628903422.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/LTL456617231349930372.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5263522547538710306.hoa' '-atoms' '/tmp/LTL12555917814628903422.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL12555917814628903422.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5263522547538710306.hoa
Detected timeout of ITS tools.
[2026-05-23 21:24:02] [INFO ] Flatten gal took : 45 ms
[2026-05-23 21:24:02] [INFO ] Flatten gal took : 28 ms
[2026-05-23 21:24:02] [INFO ] Time to serialize gal into /tmp/LTL17025566988078703750.gal : 6 ms
[2026-05-23 21:24:02] [INFO ] Time to serialize properties into /tmp/LTL7464671243511861245.ltl : 6 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/LTL17025566988078703750.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7464671243511861245.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G(("((pred_clear_3<1)||(pred_holding_5<1))")||(X(X(X("((pred_holding_0<1)||(pred_clear_2<1))"))))))))
Formula 0 simplified : XF(!"((pred_clear_3<1)||(pred_holding_5<1))" & XXX!"((pred_holding_0<1)||(pred_clear_2<1))")
Detected timeout of ITS tools.
[2026-05-23 21:24:17] [INFO ] Flatten gal took : 24 ms
[2026-05-23 21:24:17] [INFO ] Applying decomposition
[2026-05-23 21:24:17] [INFO ] Flatten gal took : 21 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/graph3074677333450285001.txt' '-o' '/tmp/graph3074677333450285001.bin' '-w' '/tmp/graph3074677333450285001.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3074677333450285001.bin' '-l' '-1' '-v' '-w' '/tmp/graph3074677333450285001.weights' '-q' '0' '-e' '0.001'
[2026-05-23 21:24:17] [INFO ] Decomposing Gal with order
[2026-05-23 21:24:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 21:24:17] [INFO ] Removed a total of 546 redundant transitions.
[2026-05-23 21:24:18] [INFO ] Flatten gal took : 149 ms
[2026-05-23 21:24:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2026-05-23 21:24:18] [INFO ] Time to serialize gal into /tmp/LTL8763285114096399144.gal : 11 ms
[2026-05-23 21:24:18] [INFO ] Time to serialize properties into /tmp/LTL8457665468149229058.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/LTL8763285114096399144.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8457665468149229058.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 : !((X(G(("((u3.pred_clear_3<1)||(u5.pred_holding_5<1))")||(X(X(X("((u0.pred_holding_0<1)||(u2.pred_clear_2<1))"))))))))
Formula 0 simplified : XF(!"((u3.pred_clear_3<1)||(u5.pred_holding_5<1))" & XXX!"((u0.pred_holding_0<1)||(u2.pred_clear_2<1))")
Detected timeout of ITS tools.
Treatment of property BlocksWorld-PT-02-LTLFireability-01 finished in 83921 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))&&F(!p0)&&F(p1))))'
Support contains 5 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 2 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2026-05-23 21:24:33] [INFO ] Invariant cache hit.
[2026-05-23 21:24:33] [INFO ] Implicit Places using invariants in 232 ms returned []
[2026-05-23 21:24:33] [INFO ] Invariant cache hit.
[2026-05-23 21:24:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 21:24:33] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 622 ms. Remains : 196/196 places, 339/339 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))&&F(!p0)&&F(p1))))'
Stuttering acceptance computed with spot in 227 ms :[true, true, (NOT p0), p0, (NOT p1), (NOT p0), true]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-02
Product exploration explored 100000 steps with 769 reset in 724 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 1 ms.
FORMULA BlocksWorld-PT-02-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-02-LTLFireability-02 finished in 1616 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)&&X(G(p1)))))'
Support contains 5 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 20 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2026-05-23 21:24:34] [INFO ] Invariant cache hit.
[2026-05-23 21:24:35] [INFO ] Implicit Places using invariants in 236 ms returned []
[2026-05-23 21:24:35] [INFO ] Invariant cache hit.
[2026-05-23 21:24:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 21:24:35] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2026-05-23 21:24:35] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 681 ms. Remains : 196/196 places, 339/339 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)&&X(G(p1)))))'
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 765 ms.
Stack based approach found an accepted trace after 1361 steps with 0 reset with depth 1362 and stack size 890 in 14 ms.
FORMULA BlocksWorld-PT-02-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-02-LTLFireability-03 finished in 1668 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((!p0||X(X(X(X(!p1)))))) U X(p1)))'
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 2 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2026-05-23 21:24:36] [INFO ] Invariant cache hit.
[2026-05-23 21:24:36] [INFO ] Implicit Places using invariants in 230 ms returned []
[2026-05-23 21:24:36] [INFO ] Invariant cache hit.
[2026-05-23 21:24:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 21:24:37] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 645 ms. Remains : 196/196 places, 339/339 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((!p0||X(X(X(X(!p1)))))) U X(p1)))'
Stuttering acceptance computed with spot in 307 ms :[(NOT p1), (NOT p1), false, p1, (AND p0 p1), p1, p1, p1, true]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-05
Entered a terminal (fully accepting) state of product in 38997 steps with 70 reset in 265 ms.
FORMULA BlocksWorld-PT-02-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-02-LTLFireability-05 finished in 1284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(p0)))||(F(p1) U G(p2)))))'
Support contains 12 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 2 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2026-05-23 21:24:37] [INFO ] Invariant cache hit.
[2026-05-23 21:24:38] [INFO ] Implicit Places using invariants in 304 ms returned []
[2026-05-23 21:24:38] [INFO ] Invariant cache hit.
[2026-05-23 21:24:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 21:24:38] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 774 ms. Remains : 196/196 places, 339/339 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(p0)))||(F(p1) U G(p2)))))'
Stuttering acceptance computed with spot in 430 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p0) (NOT p2)), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-08
Product exploration explored 100000 steps with 30836 reset in 537 ms.
Product exploration explored 100000 steps with 30736 reset in 574 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 9 factoid took 124 ms. Reduced automaton from 9 states, 16 edges and 3 AP (stutter sensitive) to 9 states, 16 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 1191 ms. (33 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 350 ms. (113 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 517 ms. (77 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 505 ms. (79 steps per ms) remains 3/3 properties
[2026-05-23 21:24:41] [INFO ] Invariant cache hit.
[2026-05-23 21:24:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 168/180 variables, 20/20 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/196 variables, 7/27 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 1 solved, 2 unsolved in 452 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 159/169 variables, 18/18 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 27/196 variables, 9/27 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 2/225 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 1/226 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 0/226 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/535 variables, 1/227 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 0/227 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/535 variables, 0/227 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 227 constraints, problems are : Problem set: 1 solved, 2 unsolved in 618 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1086ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 45 ms.
Support contains 10 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 339/339 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 196 transition count 338
Applied a total of 1 rules in 219 ms. Remains 196 /196 variables (removed 0) and now considering 338/339 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 196/196 places, 338/339 transitions.
RANDOM walk for 40000 steps (8 resets) in 591 ms. (67 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 162 ms. (245 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 315789 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 2
Probabilistic random walk after 315789 steps, saw 224481 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12501252268957897017.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17350757913121098190.kers'
[2026-05-23 21:24:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12501252268957897017.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17350757913121098190.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 338 rows 196 cols 1664 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-23 21:24:45] [INFO ] Computed 27 invariants in 2 ms
Computed 27 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17350757913121098190.kers
Total runtime 3 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 159/169 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 27/196 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 223 constraints, problems are : Problem set: 0 solved, 2 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 159/169 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 27/196 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/534 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 226 constraints, problems are : Problem set: 0 solved, 2 unsolved in 569 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 899ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 66 ms.
Support contains 10 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 338/338 transitions.
Applied a total of 0 rules in 175 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 196/196 places, 338/338 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 338/338 transitions.
Applied a total of 0 rules in 174 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
[2026-05-23 21:24:47] [INFO ] Invariant cache hit.
[2026-05-23 21:24:47] [INFO ] Implicit Places using invariants in 294 ms returned []
[2026-05-23 21:24:47] [INFO ] Invariant cache hit.
[2026-05-23 21:24:47] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
[2026-05-23 21:24:47] [INFO ] Redundant transitions in 9 ms returned []
Running 334 sub problems to find dead transitions.
[2026-05-23 21:24:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (OVERLAPS) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 223 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 334/557 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/577 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/534 variables, and 577 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61017ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 61020ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61962 ms. Remains : 196/196 places, 338/338 transitions.
Found 1 invariant AP formulas.
Knowledge based reduction with 10 factoid took 190 ms. Reduced automaton from 9 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2)]
Knowledge-based reduction took 69262 ms.
Stuttering acceptance computed with spot in 336 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2)]
Support contains 12 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 4 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (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-6970133694482983317.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11049602432538411775.kers'
[2026-05-23 21:25:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6970133694482983317.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11049602432538411775.kers]
Normalized transition count is 338 out of 339 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 338 rows 196 cols 1664 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-23 21:25:49] [INFO ] Computed 27 invariants in 2 ms
Computed 27 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11049602432538411775.kers
Total runtime 4 ms.
[2026-05-23 21:25:50] [INFO ] Implicit Places using invariants in 323 ms returned []
[2026-05-23 21:25:50] [INFO ] Invariant cache hit.
[2026-05-23 21:25:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 21:25:50] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 999 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2026-05-23 21:25:50] [INFO ] Invariant cache hit.
[2026-05-23 21:25:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 578 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60627ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 60629ms
Finished structural reductions in LTL mode , in 1 iterations and 61636 ms. Remains : 196/196 places, 339/339 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 1 factoid took 58 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 348 ms. (114 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
[2026-05-23 21:26:51] [INFO ] Invariant cache hit.
[2026-05-23 21:26:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/196 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/196 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/535 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/535 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 225 constraints, problems are : Problem set: 0 solved, 1 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 617ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 8 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 339/339 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 196 transition count 338
Applied a total of 1 rules in 128 ms. Remains 196 /196 variables (removed 0) and now considering 338/339 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 196/196 places, 338/339 transitions.
RANDOM walk for 40000 steps (8 resets) in 413 ms. (96 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 973781 steps, run timeout after 3014 ms. (steps per millisecond=323 ) properties seen :0 out of 1
Probabilistic random walk after 973781 steps, saw 678782 distinct states, run finished after 3014 ms. (steps per millisecond=323 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9921684904928311701.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12794693928764124202.kers'
[2026-05-23 21:26:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9921684904928311701.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12794693928764124202.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 338 rows 196 cols 1664 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-23 21:26:55] [INFO ] Computed 27 invariants in 1 ms
Computed 27 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12794693928764124202.kers
Total runtime 3 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/196 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/534 variables, and 223 constraints, problems are : Problem set: 0 solved, 1 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/160 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/196 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/534 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/534 variables, and 224 constraints, problems are : Problem set: 0 solved, 1 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 613ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 8 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 338/338 transitions.
Applied a total of 0 rules in 139 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 196/196 places, 338/338 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 338/338 transitions.
Applied a total of 0 rules in 108 ms. Remains 196 /196 variables (removed 0) and now considering 338/338 (removed 0) transitions.
[2026-05-23 21:26:56] [INFO ] Invariant cache hit.
[2026-05-23 21:26:56] [INFO ] Implicit Places using invariants in 223 ms returned []
[2026-05-23 21:26:56] [INFO ] Invariant cache hit.
[2026-05-23 21:26:57] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
[2026-05-23 21:26:57] [INFO ] Redundant transitions in 3 ms returned []
Running 334 sub problems to find dead transitions.
[2026-05-23 21:26:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/534 variables, and 223 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 334/557 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/577 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/534 variables, and 577 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60464ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 60466ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61281 ms. Remains : 196/196 places, 338/338 transitions.
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2)]
Knowledge-based reduction took 66532 ms.
Stuttering acceptance computed with spot in 257 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 275 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 19977 reset in 489 ms.
Stack based approach found an accepted trace after 44121 steps with 8834 reset with depth 12 and stack size 12 in 222 ms.
FORMULA BlocksWorld-PT-02-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BlocksWorld-PT-02-LTLFireability-08 finished in 201435 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0 U G(!p1))))))'
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 2 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (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-1700009101448651856.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7519235702289883923.kers'
[2026-05-23 21:27:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1700009101448651856.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7519235702289883923.kers]
Normalized transition count is 338 out of 339 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 338 rows 196 cols 1664 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-23 21:27:59] [INFO ] Computed 27 invariants in 2 ms
Computed 27 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7519235702289883923.kers
Total runtime 4 ms.
[2026-05-23 21:27:59] [INFO ] Implicit Places using invariants in 322 ms returned []
[2026-05-23 21:27:59] [INFO ] Invariant cache hit.
[2026-05-23 21:27:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 21:27:59] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2026-05-23 21:27:59] [INFO ] Invariant cache hit.
[2026-05-23 21:27:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (OVERLAPS) 1/535 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 535/535 variables, and 224 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 4/196 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 338/534 variables, 196/223 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 335/558 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/578 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/535 variables, and 578 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 196/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60709ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 60712ms
Finished structural reductions in LTL mode , in 1 iterations and 61427 ms. Remains : 196/196 places, 339/339 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0 U G(!p1))))))'
Stuttering acceptance computed with spot in 233 ms :[p1, p1, p1, p1, true, p1]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-09
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 0 ms.
FORMULA BlocksWorld-PT-02-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BlocksWorld-PT-02-LTLFireability-09 finished in 61705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||X(p1)))))'
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 2 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2026-05-23 21:29:00] [INFO ] Invariant cache hit.
[2026-05-23 21:29:01] [INFO ] Implicit Places using invariants in 242 ms returned []
[2026-05-23 21:29:01] [INFO ] Invariant cache hit.
[2026-05-23 21:29:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 21:29:01] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 738 ms. Remains : 196/196 places, 339/339 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||X(p1)))))'
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-11
Product exploration explored 100000 steps with 33333 reset in 479 ms.
Product exploration explored 100000 steps with 33333 reset in 483 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 14 ms. Proved property starting from automaton with 5 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 22 ms.
FORMULA BlocksWorld-PT-02-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-02-LTLFireability-11 finished in 1970 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 12 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2026-05-23 21:29:02] [INFO ] Invariant cache hit.
[2026-05-23 21:29:03] [INFO ] Implicit Places using invariants in 236 ms returned []
[2026-05-23 21:29:03] [INFO ] Invariant cache hit.
[2026-05-23 21:29:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 21:29:03] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
[2026-05-23 21:29:03] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 711 ms. Remains : 196/196 places, 339/339 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-14
Product exploration explored 100000 steps with 634 reset in 642 ms.
Product exploration explored 100000 steps with 707 reset in 745 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 168 steps (0 resets) in 7 ms. (21 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 265 ms.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 11 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2026-05-23 21:29:05] [INFO ] Invariant cache hit.
[2026-05-23 21:29:05] [INFO ] Implicit Places using invariants in 335 ms returned []
[2026-05-23 21:29:05] [INFO ] Invariant cache hit.
[2026-05-23 21:29:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 21:29:06] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
[2026-05-23 21:29:06] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 779 ms. Remains : 196/196 places, 339/339 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 47 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 198 steps (0 resets) in 27 ms. (7 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 223 ms.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 782 reset in 965 ms.
Product exploration explored 100000 steps with 697 reset in 700 ms.
Built C files in :
/tmp/ltsmin13626341022994780979
[2026-05-23 21:29:08] [INFO ] Computing symmetric may disable matrix : 339 transitions.
[2026-05-23 21:29:08] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 21:29:08] [INFO ] Computing symmetric may enable matrix : 339 transitions.
[2026-05-23 21:29:08] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 21:29:08] [INFO ] Computing Do-Not-Accords matrix : 339 transitions.
[2026-05-23 21:29:08] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 21:29:08] [INFO ] Built C files in 158ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13626341022994780979
Running compilation step : cd /tmp/ltsmin13626341022994780979;'/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 1780 ms.
Running link step : cd /tmp/ltsmin13626341022994780979;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin13626341022994780979;'/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/stateBased17325079421727242428.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 42 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2026-05-23 21:29:23] [INFO ] Invariant cache hit.
[2026-05-23 21:29:23] [INFO ] Implicit Places using invariants in 303 ms returned []
[2026-05-23 21:29:23] [INFO ] Invariant cache hit.
[2026-05-23 21:29:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 21:29:24] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 914 ms to find 0 implicit places.
[2026-05-23 21:29:24] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 965 ms. Remains : 196/196 places, 339/339 transitions.
Built C files in :
/tmp/ltsmin18021489839882886056
[2026-05-23 21:29:24] [INFO ] Computing symmetric may disable matrix : 339 transitions.
[2026-05-23 21:29:24] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 21:29:24] [INFO ] Computing symmetric may enable matrix : 339 transitions.
[2026-05-23 21:29:24] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 21:29:24] [INFO ] Computing Do-Not-Accords matrix : 339 transitions.
[2026-05-23 21:29:24] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 21:29:24] [INFO ] Built C files in 99ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18021489839882886056
Running compilation step : cd /tmp/ltsmin18021489839882886056;'/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 1440 ms.
Running link step : cd /tmp/ltsmin18021489839882886056;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin18021489839882886056;'/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/stateBased12149012512820715093.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-23 21:29:39] [INFO ] Flatten gal took : 34 ms
[2026-05-23 21:29:39] [INFO ] Flatten gal took : 19 ms
[2026-05-23 21:29:39] [INFO ] Time to serialize gal into /tmp/LTL9668813793911607998.gal : 5 ms
[2026-05-23 21:29:39] [INFO ] Time to serialize properties into /tmp/LTL17165073035819573132.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/LTL9668813793911607998.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7058065904813840964.hoa' '-atoms' '/tmp/LTL17165073035819573132.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/LTL17165073035819573132.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7058065904813840964.hoa
Detected timeout of ITS tools.
[2026-05-23 21:29:54] [INFO ] Flatten gal took : 14 ms
[2026-05-23 21:29:54] [INFO ] Flatten gal took : 14 ms
[2026-05-23 21:29:54] [INFO ] Time to serialize gal into /tmp/LTL4210377293016245262.gal : 5 ms
[2026-05-23 21:29:54] [INFO ] Time to serialize properties into /tmp/LTL16286272064176418034.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/LTL4210377293016245262.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16286272064176418034.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((pred_holding_1<1)||(pred_clear_8<1))"))))
Formula 0 simplified : FG!"((pred_holding_1<1)||(pred_clear_8<1))"
Detected timeout of ITS tools.
[2026-05-23 21:30:09] [INFO ] Flatten gal took : 18 ms
[2026-05-23 21:30:09] [INFO ] Applying decomposition
[2026-05-23 21:30:09] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15401387212044342258.txt' '-o' '/tmp/graph15401387212044342258.bin' '-w' '/tmp/graph15401387212044342258.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15401387212044342258.bin' '-l' '-1' '-v' '-w' '/tmp/graph15401387212044342258.weights' '-q' '0' '-e' '0.001'
[2026-05-23 21:30:09] [INFO ] Decomposing Gal with order
[2026-05-23 21:30:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 21:30:09] [INFO ] Removed a total of 546 redundant transitions.
[2026-05-23 21:30:09] [INFO ] Flatten gal took : 77 ms
[2026-05-23 21:30:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2026-05-23 21:30:09] [INFO ] Time to serialize gal into /tmp/LTL1214158578207113699.gal : 7 ms
[2026-05-23 21:30:09] [INFO ] Time to serialize properties into /tmp/LTL10820940956367865802.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/LTL1214158578207113699.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10820940956367865802.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i3.u1.pred_holding_1<1)||(u8.pred_clear_8<1))"))))
Formula 0 simplified : FG!"((i3.u1.pred_holding_1<1)||(u8.pred_clear_8<1))"
Detected timeout of ITS tools.
Treatment of property BlocksWorld-PT-02-LTLFireability-14 finished in 82015 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||(X(X((!p1||F(!p2)))) U ((!p3&&X(X((!p1||F(!p2)))))||X(X(G((!p1||F(!p2))))))))))'
Support contains 7 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 339/339 transitions.
Applied a total of 0 rules in 2 ms. Remains 196 /196 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2026-05-23 21:30:24] [INFO ] Invariant cache hit.
[2026-05-23 21:30:25] [INFO ] Implicit Places using invariants in 243 ms returned []
[2026-05-23 21:30:25] [INFO ] Invariant cache hit.
[2026-05-23 21:30:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 21:30:25] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 698 ms. Remains : 196/196 places, 339/339 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||(X(X((!p1||F(!p2)))) U ((!p3&&X(X((!p1||F(!p2)))))||X(X(G((!p1||F(!p2))))))))))'
Stuttering acceptance computed with spot in 339 ms :[(AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2 p3), (AND (NOT p0) p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2)]
Running random walk in product with property : BlocksWorld-PT-02-LTLFireability-15
Product exploration explored 100000 steps with 1060 reset in 679 ms.
Product exploration explored 100000 steps with 1019 reset in 713 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 14 factoid took 98 ms. Reduced automaton from 7 states, 11 edges and 4 AP (stutter sensitive) to 7 states, 11 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 717 ms. (55 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 113 ms. (350 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 155 ms. (256 steps per ms) remains 5/5 properties
[2026-05-23 21:30:27] [INFO ] Invariant cache hit.
[2026-05-23 21:30:27] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf2 is UNSAT
Problem apf4 is UNSAT
Problem apf5 is UNSAT
Problem apf6 is UNSAT
Problem apf7 is UNSAT
After SMT solving in domain Real declared 106/535 variables, and 9 constraints, problems are : Problem set: 5 solved, 0 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 9/27 constraints, State Equation: 0/196 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 5/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 96ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 5 invariant AP formulas.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 19 factoid took 12 ms. Proved property starting from automaton with 7 states, 11 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 695 ms.
FORMULA BlocksWorld-PT-02-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BlocksWorld-PT-02-LTLFireability-15 finished in 3209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(X(p1)))||p0))))'
Spot run failed in 82 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Spot run failed in 76 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-23 21:30:28] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14950545254770987207
[2026-05-23 21:30:28] [INFO ] Computing symmetric may disable matrix : 339 transitions.
[2026-05-23 21:30:28] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 21:30:28] [INFO ] Applying decomposition
[2026-05-23 21:30:28] [INFO ] Computing symmetric may enable matrix : 339 transitions.
[2026-05-23 21:30:28] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 21:30:28] [INFO ] Flatten gal took : 28 ms
[2026-05-23 21:30:28] [INFO ] Computing Do-Not-Accords matrix : 339 transitions.
[2026-05-23 21:30:28] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 21:30:28] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14950545254770987207
Running compilation step : cd /tmp/ltsmin14950545254770987207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12212690481524088202.txt' '-o' '/tmp/graph12212690481524088202.bin' '-w' '/tmp/graph12212690481524088202.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12212690481524088202.bin' '-l' '-1' '-v' '-w' '/tmp/graph12212690481524088202.weights' '-q' '0' '-e' '0.001'
[2026-05-23 21:30:28] [INFO ] Decomposing Gal with order
[2026-05-23 21:30:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 21:30:28] [INFO ] Removed a total of 546 redundant transitions.
[2026-05-23 21:30:28] [INFO ] Flatten gal took : 98 ms
[2026-05-23 21:30:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2026-05-23 21:30:28] [INFO ] Time to serialize gal into /tmp/LTLFireability6190020472586548113.gal : 7 ms
[2026-05-23 21:30:28] [INFO ] Time to serialize properties into /tmp/LTLFireability12792869480167771273.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/LTLFireability6190020472586548113.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12792869480167771273.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 2 LTL properties
Checking formula 0 : !((X(G(("((u3.pred_clear_3<1)||(u5.pred_holding_5<1))")||(X(X(X("((i0.u0.pred_holding_0<1)||(u2.pred_clear_2<1))"))))))))
Formula 0 simplified : XF(!"((u3.pred_clear_3<1)||(u5.pred_holding_5<1))" & XXX!"((i0.u0.pred_holding_0<1)||(u2.pred_clear_2<1))")
Compilation finished in 1373 ms.
Running link step : cd /tmp/ltsmin14950545254770987207;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin14950545254770987207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X([]((X(X(X((LTLAPp1==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin14950545254770987207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X([]((X(X(X((LTLAPp1==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14950545254770987207;'/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' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-23 21:54:22] [INFO ] Applying decomposition
[2026-05-23 21:54:23] [INFO ] Flatten gal took : 415 ms
[2026-05-23 21:54:23] [INFO ] Decomposing Gal with order
[2026-05-23 21:54:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 21:54:24] [INFO ] Removed a total of 934 redundant transitions.
[2026-05-23 21:54:24] [INFO ] Flatten gal took : 581 ms
[2026-05-23 21:54:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 58 ms.
[2026-05-23 21:54:24] [INFO ] Time to serialize gal into /tmp/LTLFireability10360466335988751478.gal : 71 ms
[2026-05-23 21:54:24] [INFO ] Time to serialize properties into /tmp/LTLFireability810950566945242448.ltl : 9 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/LTLFireability10360466335988751478.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability810950566945242448.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...276
Read 2 LTL properties
Checking formula 0 : !((X(G(("((u18.pred_clear_3<1)||(u10.pred_holding_5<1))")||(X(X(X("((u2.pred_holding_0<1)||(u17.pred_clear_2<1))"))))))))
Formula 0 simplified : XF(!"((u18.pred_clear_3<1)||(u10.pred_holding_5<1))" & XXX!"((u2.pred_holding_0<1)||(u17.pred_clear_2<1))")
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin14950545254770987207;'/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' '[](<>((LTLAPp2==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin14950545254770987207;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X([]((X(X(X((LTLAPp1==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-23 22:18:19] [INFO ] Flatten gal took : 556 ms
[2026-05-23 22:18:23] [INFO ] Input system was already deterministic with 339 transitions.
[2026-05-23 22:18:24] [INFO ] Transformed 196 places.
[2026-05-23 22:18:24] [INFO ] Transformed 339 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-23 22:18:24] [INFO ] Time to serialize gal into /tmp/LTLFireability5900044356223157447.gal : 18 ms
[2026-05-23 22:18:24] [INFO ] Time to serialize properties into /tmp/LTLFireability12327946114354042741.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/LTLFireability5900044356223157447.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12327946114354042741.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(("((pred_clear_3<1)||(pred_holding_5<1))")||(X(X(X("((pred_holding_0<1)||(pred_clear_2<1))"))))))))
Formula 0 simplified : XF(!"((pred_clear_3<1)||(pred_holding_5<1))" & XXX!"((pred_holding_0<1)||(pred_clear_2<1))")

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="BlocksWorld-PT-02"
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 BlocksWorld-PT-02, 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 r018-smll-177946788100300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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