Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969019900180.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is MedleyA-PT-11, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969019900180
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.7K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 11:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:28 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 160K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779699918940

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 09:05:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 09:05:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:05:20] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2026-05-25 09:05:20] [INFO ] Transformed 150 places.
[2026-05-25 09:05:20] [INFO ] Transformed 478 transitions.
[2026-05-25 09:05:20] [INFO ] Found NUPN structural information;
[2026-05-25 09:05:20] [INFO ] Parsed PT model containing 150 places and 478 transitions and 2705 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
FORMULA MedleyA-PT-11-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 469/469 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 114 transition count 416
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 114 transition count 416
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 108 transition count 384
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 108 transition count 384
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 105 transition count 372
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 105 transition count 372
Applied a total of 90 rules in 51 ms. Remains 105 /150 variables (removed 45) and now considering 372/469 (removed 97) transitions.
[2026-05-25 09:05:20] [INFO ] Flow matrix only has 300 transitions (discarded 72 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1986465987212786930.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16921505129399623243.kers'
[2026-05-25 09:05:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1986465987212786930.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16921505129399623243.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 300 rows 102 cols 1252 entries
Finished phase 1 with 78 SingleSign rule and 4 generalized
[2026-05-25 09:05:20] [INFO ] Computed 23 invariants in 3 ms
Computed 23 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16921505129399623243.kers
Total runtime 4 ms.
[2026-05-25 09:05:21] [INFO ] Implicit Places using invariants in 309 ms returned []
[2026-05-25 09:05:21] [INFO ] Flow matrix only has 300 transitions (discarded 72 similar events)
[2026-05-25 09:05:21] [INFO ] Invariant cache hit.
[2026-05-25 09:05:21] [INFO ] State equation strengthened by 156 read => feed constraints.
[2026-05-25 09:05:21] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
Running 371 sub problems to find dead transitions.
[2026-05-25 09:05:21] [INFO ] Flow matrix only has 300 transitions (discarded 72 similar events)
[2026-05-25 09:05:21] [INFO ] Invariant cache hit.
[2026-05-25 09:05:21] [INFO ] State equation strengthened by 156 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/105 variables, 15/23 constraints. Problems are: Problem set: 108 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 16/39 constraints. Problems are: Problem set: 108 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 6/45 constraints. Problems are: Problem set: 108 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 1/46 constraints. Problems are: Problem set: 108 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/46 constraints. Problems are: Problem set: 108 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 300/405 variables, 105/151 constraints. Problems are: Problem set: 108 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 156/307 constraints. Problems are: Problem set: 108 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 1/308 constraints. Problems are: Problem set: 108 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/405 variables, 2/310 constraints. Problems are: Problem set: 108 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/405 variables, 0/310 constraints. Problems are: Problem set: 108 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 405/405 variables, and 311 constraints, problems are : Problem set: 108 solved, 263 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 156/156 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 108 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 108 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 108 solved, 263 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 15/23 constraints. Problems are: Problem set: 108 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 27/50 constraints. Problems are: Problem set: 108 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/50 constraints. Problems are: Problem set: 108 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 300/405 variables, 105/155 constraints. Problems are: Problem set: 108 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 156/311 constraints. Problems are: Problem set: 108 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/405 variables, 263/574 constraints. Problems are: Problem set: 108 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 1/575 constraints. Problems are: Problem set: 108 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 1/576 constraints. Problems are: Problem set: 108 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 405/405 variables, and 576 constraints, problems are : Problem set: 108 solved, 263 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 156/156 constraints, PredecessorRefiner: 263/371 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60511ms problems are : Problem set: 108 solved, 263 unsolved
Search for dead transitions found 108 dead transitions in 60549ms
Found 108 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 108 transitions
Dead transitions reduction (with SMT) removed 108 transitions
Starting structural reductions in LTL mode, iteration 1 : 105/150 places, 264/469 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61247 ms. Remains : 105/150 places, 264/469 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 264/264 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 264/264 (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-15946335961827855055.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8319008354725632924.kers'
[2026-05-25 09:06:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15946335961827855055.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8319008354725632924.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 264 rows 102 cols 1072 entries
Finished phase 1 with 78 SingleSign rule and 4 generalized
[2026-05-25 09:06:22] [INFO ] Computed 23 invariants in 1 ms
Computed 23 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8319008354725632924.kers
Total runtime 2 ms.
[2026-05-25 09:06:22] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-25 09:06:22] [INFO ] Invariant cache hit.
[2026-05-25 09:06:22] [INFO ] State equation strengthened by 120 read => feed constraints.
[2026-05-25 09:06:23] [INFO ] Implicit Places using invariants and state equation in 1228 ms returned []
Implicit Place search using SMT with State Equation took 1304 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2026-05-25 09:06:23] [INFO ] Invariant cache hit.
[2026-05-25 09:06:23] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (OVERLAPS) 264/369 variables, 105/146 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 120/266 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 266 constraints, problems are : Problem set: 0 solved, 263 unsolved in 19497 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 18/41 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 264/369 variables, 105/148 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 120/268 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 263/531 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 2/533 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 3/536 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/369 variables, and 537 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49643ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 49644ms
Finished structural reductions in LTL mode , in 1 iterations and 50955 ms. Remains : 105/105 places, 264/264 transitions.
Support contains 40 out of 105 places after structural reductions.
[2026-05-25 09:07:13] [INFO ] Flatten gal took : 54 ms
[2026-05-25 09:07:13] [INFO ] Flatten gal took : 37 ms
[2026-05-25 09:07:13] [INFO ] Input system was already deterministic with 264 transitions.
Support contains 38 out of 105 places (down from 40) after GAL structural reductions.
RANDOM walk for 40000 steps (3116 resets) in 2445 ms. (16 steps per ms) remains 17/25 properties
BEST_FIRST walk for 4004 steps (46 resets) in 49 ms. (80 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (56 resets) in 39 ms. (100 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (45 resets) in 41 ms. (95 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (63 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (53 resets) in 25 ms. (153 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (53 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (49 resets) in 25 ms. (154 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (48 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (50 resets) in 27 ms. (142 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (51 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (44 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (54 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (56 resets) in 49 ms. (80 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (47 resets) in 27 ms. (142 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (53 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (49 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (54 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
[2026-05-25 09:07:14] [INFO ] Invariant cache hit.
[2026-05-25 09:07:14] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 2 (OVERLAPS) 55/85 variables, 12/14 constraints. Problems are: Problem set: 6 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 1/15 constraints. Problems are: Problem set: 6 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/15 constraints. Problems are: Problem set: 6 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 9/94 variables, 3/18 constraints. Problems are: Problem set: 6 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/18 constraints. Problems are: Problem set: 6 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 9/103 variables, 5/23 constraints. Problems are: Problem set: 6 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/23 constraints. Problems are: Problem set: 6 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 263/366 variables, 103/126 constraints. Problems are: Problem set: 6 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 120/246 constraints. Problems are: Problem set: 6 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 0/246 constraints. Problems are: Problem set: 6 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 3/369 variables, 2/248 constraints. Problems are: Problem set: 6 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/369 variables, 0/248 constraints. Problems are: Problem set: 6 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 0/369 variables, 0/248 constraints. Problems are: Problem set: 6 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 248 constraints, problems are : Problem set: 6 solved, 11 unsolved in 743 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 60/82 variables, 12/12 constraints. Problems are: Problem set: 6 solved, 11 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/13 constraints. Problems are: Problem set: 7 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/13 constraints. Problems are: Problem set: 7 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 9/91 variables, 3/16 constraints. Problems are: Problem set: 7 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/16 constraints. Problems are: Problem set: 7 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 12/103 variables, 7/23 constraints. Problems are: Problem set: 7 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 1/24 constraints. Problems are: Problem set: 7 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/24 constraints. Problems are: Problem set: 7 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 263/366 variables, 103/127 constraints. Problems are: Problem set: 7 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 120/247 constraints. Problems are: Problem set: 7 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 5/252 constraints. Problems are: Problem set: 7 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/366 variables, 0/252 constraints. Problems are: Problem set: 7 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 3/369 variables, 2/254 constraints. Problems are: Problem set: 7 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/369 variables, 5/259 constraints. Problems are: Problem set: 7 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/369 variables, 0/259 constraints. Problems are: Problem set: 7 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 0/369 variables, 0/259 constraints. Problems are: Problem set: 7 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 259 constraints, problems are : Problem set: 7 solved, 10 unsolved in 2870 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 10/17 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3639ms problems are : Problem set: 7 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 9 properties in 479 ms.
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 264/264 transitions.
Graph (complete) has 518 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 101 transition count 263
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 11 place count 94 transition count 229
Iterating global reduction 1 with 7 rules applied. Total rules applied 18 place count 94 transition count 229
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 91 transition count 215
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 91 transition count 215
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 90 transition count 214
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 86 transition count 241
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 1 with 17 rules applied. Total rules applied 51 place count 86 transition count 224
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 85 transition count 223
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 1 with 18 rules applied. Total rules applied 71 place count 85 transition count 417
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 112 place count 67 transition count 394
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 67 transition count 393
Applied a total of 113 rules in 90 ms. Remains 67 /105 variables (removed 38) and now considering 393/264 (removed -129) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 67/105 places, 393/264 transitions.
RANDOM walk for 16832 steps (2301 resets) in 884 ms. (19 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-11-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 7 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-11-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 16 stabilizing places and 108 stable transitions
Graph (complete) has 690 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
FORMULA MedleyA-PT-11-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 7 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 264/264 transitions.
Graph (complete) has 690 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 3 places
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 94 transition count 229
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 94 transition count 229
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 18 place count 91 transition count 215
Iterating global reduction 0 with 3 rules applied. Total rules applied 21 place count 91 transition count 215
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 23 place count 90 transition count 214
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 29 place count 87 transition count 229
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 42 place count 87 transition count 216
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 86 transition count 215
Applied a total of 44 rules in 37 ms. Remains 86 /105 variables (removed 19) and now considering 215/264 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9623744168700726577.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4758722283567369598.kers'
[2026-05-25 09:07:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9623744168700726577.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4758722283567369598.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 215 rows 86 cols 909 entries
Finished phase 1 with 62 SingleSign rule and 4 generalized
[2026-05-25 09:07:19] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4758722283567369598.kers
Total runtime 1 ms.
[2026-05-25 09:07:19] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-25 09:07:19] [INFO ] Invariant cache hit.
[2026-05-25 09:07:19] [INFO ] State equation strengthened by 109 read => feed constraints.
[2026-05-25 09:07:19] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2026-05-25 09:07:19] [INFO ] Redundant transitions in 4 ms returned []
Running 213 sub problems to find dead transitions.
[2026-05-25 09:07:19] [INFO ] Invariant cache hit.
[2026-05-25 09:07:19] [INFO ] State equation strengthened by 109 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 215/301 variables, 86/109 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 109/218 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/301 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 218 constraints, problems are : Problem set: 0 solved, 213 unsolved in 11916 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 215/301 variables, 86/109 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 109/218 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 213/431 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (OVERLAPS) 0/301 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 431 constraints, problems are : Problem set: 0 solved, 213 unsolved in 21913 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 109/109 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33925ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 33926ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/105 places, 215/264 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34242 ms. Remains : 86/105 places, 215/264 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 175 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-01
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-11-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-01 finished in 34515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((X(X(p1))&&p0)))&&F(p2)))'
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 264/264 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 103 transition count 264
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 96 transition count 234
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 96 transition count 234
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 94 transition count 224
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 94 transition count 224
Applied a total of 20 rules in 16 ms. Remains 94 /105 variables (removed 11) and now considering 224/264 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15833987313183843143.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15341710414284883743.kers'
[2026-05-25 09:07:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15833987313183843143.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15341710414284883743.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 224 rows 93 cols 916 entries
Finished phase 1 with 69 SingleSign rule and 4 generalized
[2026-05-25 09:07:53] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-15341710414284883743.kers
Total runtime 18 ms.
[2026-05-25 09:07:53] [INFO ] Implicit Places using invariants in 147 ms returned []
[2026-05-25 09:07:53] [INFO ] Invariant cache hit.
[2026-05-25 09:07:53] [INFO ] State equation strengthened by 108 read => feed constraints.
[2026-05-25 09:07:53] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2026-05-25 09:07:53] [INFO ] Invariant cache hit.
[2026-05-25 09:07:53] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 224/318 variables, 94/124 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 108/232 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (OVERLAPS) 0/318 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 232 constraints, problems are : Problem set: 0 solved, 223 unsolved in 17498 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 224/318 variables, 94/126 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 108/234 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 223/457 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (OVERLAPS) 0/318 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 457 constraints, problems are : Problem set: 0 solved, 223 unsolved in 29369 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46937ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 46938ms
Starting structural reductions in LTL mode, iteration 1 : 94/105 places, 224/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47310 ms. Remains : 94/105 places, 224/264 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((X(X(p1))&&p0)))&&F(p2)))'
Stuttering acceptance computed with spot in 351 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-05
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-11-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-05 finished in 47698 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)||p0))))'
Support contains 6 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 264/264 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 102 transition count 264
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 95 transition count 235
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 95 transition count 235
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 92 transition count 221
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 92 transition count 221
Applied a total of 23 rules in 28 ms. Remains 92 /105 variables (removed 13) and now considering 221/264 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17442264494302794823.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4743975085822858327.kers'
[2026-05-25 09:08:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17442264494302794823.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4743975085822858327.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 221 rows 92 cols 908 entries
Finished phase 1 with 68 SingleSign rule and 4 generalized
[2026-05-25 09:08:41] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4743975085822858327.kers
Total runtime 1 ms.
[2026-05-25 09:08:41] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-25 09:08:41] [INFO ] Invariant cache hit.
[2026-05-25 09:08:41] [INFO ] State equation strengthened by 107 read => feed constraints.
[2026-05-25 09:08:41] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2026-05-25 09:08:41] [INFO ] Invariant cache hit.
[2026-05-25 09:08:41] [INFO ] State equation strengthened by 107 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/313 variables, 92/115 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 107/222 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 0/313 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 222 constraints, problems are : Problem set: 0 solved, 220 unsolved in 9430 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/313 variables, 92/115 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 107/222 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 220/442 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (OVERLAPS) 0/313 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/313 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 445 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39528ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 39529ms
Starting structural reductions in LTL mode, iteration 1 : 92/105 places, 221/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39905 ms. Remains : 92/105 places, 221/264 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)||p0))))'
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 534 ms.
Product exploration explored 100000 steps with 50000 reset in 423 ms.
Computed a total of 12 stabilizing places and 94 stable transitions
Graph (complete) has 533 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 12 stabilizing places and 94 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 5 factoid took 30 ms. Proved property starting from automaton with 3 states, 3 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 37 ms.
FORMULA MedleyA-PT-11-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-11-LTLFireability-06 finished in 41135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)||(!p0 U (p1||G(!p0))))) U ((!p2&&X((G(p0)||(!p0 U (p1||G(!p0))))))||X(G((G(p0)||(!p0 U (p1||G(!p0)))))))))'
Support contains 9 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 264/264 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 102 transition count 264
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 95 transition count 234
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 95 transition count 234
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 93 transition count 224
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 93 transition count 224
Applied a total of 21 rules in 5 ms. Remains 93 /105 variables (removed 12) and now considering 224/264 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9029988662758491527.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-962656903429729188.kers'
[2026-05-25 09:09:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9029988662758491527.kers, --Pflows, --basisKERS=/tmp/petrispot-output-962656903429729188.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 224 rows 93 cols 916 entries
Finished phase 1 with 69 SingleSign rule and 4 generalized
[2026-05-25 09:09:22] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-962656903429729188.kers
Total runtime 1 ms.
[2026-05-25 09:09:22] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-25 09:09:22] [INFO ] Invariant cache hit.
[2026-05-25 09:09:22] [INFO ] State equation strengthened by 108 read => feed constraints.
[2026-05-25 09:09:22] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2026-05-25 09:09:22] [INFO ] Invariant cache hit.
[2026-05-25 09:09:22] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 224/317 variables, 93/117 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 108/225 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 0/317 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 225 constraints, problems are : Problem set: 0 solved, 223 unsolved in 10203 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 224/317 variables, 93/117 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 108/225 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 223/448 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/317 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (OVERLAPS) 0/317 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 448 constraints, problems are : Problem set: 0 solved, 223 unsolved in 25982 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36276ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 36278ms
Starting structural reductions in LTL mode, iteration 1 : 93/105 places, 224/264 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36496 ms. Remains : 93/105 places, 224/264 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)||(!p0 U (p1||G(!p0))))) U (X(G((G(p0)||(!p0 U (p1||G(!p0))))))||(!p2&&X((G(p0)||(!p0 U (p1||G(!p0)))))))))'
Stuttering acceptance computed with spot in 215 ms :[true, false, (AND p0 (NOT p1)), false, false, (AND p0 (NOT p1)), (NOT p0)]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 428 ms.
Product exploration explored 100000 steps with 50000 reset in 417 ms.
Computed a total of 12 stabilizing places and 95 stable transitions
Graph (complete) has 538 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 12 stabilizing places and 95 stable transitions
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, 19 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 15 ms.
FORMULA MedleyA-PT-11-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-11-LTLFireability-07 finished in 37616 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 264/264 transitions.
Graph (complete) has 690 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 92 transition count 227
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 92 transition count 227
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 20 place count 89 transition count 213
Iterating global reduction 0 with 3 rules applied. Total rules applied 23 place count 89 transition count 213
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 31 place count 85 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 43 place count 85 transition count 206
Applied a total of 43 rules in 22 ms. Remains 85 /105 variables (removed 20) and now considering 206/264 (removed 58) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8790730599923144079.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4919871496132548957.kers'
[2026-05-25 09:10:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8790730599923144079.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4919871496132548957.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 206 rows 85 cols 837 entries
Finished phase 1 with 61 SingleSign rule and 4 generalized
[2026-05-25 09:10:00] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4919871496132548957.kers
Total runtime 1 ms.
[2026-05-25 09:10:00] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-25 09:10:00] [INFO ] Invariant cache hit.
[2026-05-25 09:10:00] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 09:10:00] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2026-05-25 09:10:00] [INFO ] Redundant transitions in 4 ms returned []
Running 197 sub problems to find dead transitions.
[2026-05-25 09:10:00] [INFO ] Invariant cache hit.
[2026-05-25 09:10:00] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (OVERLAPS) 3/85 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 206/291 variables, 85/109 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 36/145 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 145 constraints, problems are : Problem set: 0 solved, 197 unsolved in 14251 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (OVERLAPS) 3/85 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 206/291 variables, 85/109 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 36/145 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 197/342 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 11 (OVERLAPS) 0/291 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 13 (OVERLAPS) 0/291 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 344 constraints, problems are : Problem set: 0 solved, 197 unsolved in 29839 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 85/85 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44163ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 44164ms
Starting structural reductions in SI_LTL mode, iteration 1 : 85/105 places, 206/264 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44470 ms. Remains : 85/105 places, 206/264 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-10
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-11-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-10 finished in 44534 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 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 264/264 transitions.
Graph (complete) has 690 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 93 transition count 233
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 93 transition count 233
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 18 place count 90 transition count 219
Iterating global reduction 0 with 3 rules applied. Total rules applied 21 place count 90 transition count 219
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 29 place count 86 transition count 226
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 43 place count 86 transition count 212
Applied a total of 43 rules in 14 ms. Remains 86 /105 variables (removed 19) and now considering 212/264 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6618652323354885613.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4454804286130747682.kers'
[2026-05-25 09:10:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6618652323354885613.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4454804286130747682.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 212 rows 86 cols 863 entries
Finished phase 1 with 62 SingleSign rule and 4 generalized
[2026-05-25 09:10:44] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4454804286130747682.kers
Total runtime 1 ms.
[2026-05-25 09:10:44] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-25 09:10:44] [INFO ] Invariant cache hit.
[2026-05-25 09:10:44] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-25 09:10:45] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2026-05-25 09:10:45] [INFO ] Redundant transitions in 2 ms returned []
Running 203 sub problems to find dead transitions.
[2026-05-25 09:10:45] [INFO ] Invariant cache hit.
[2026-05-25 09:10:45] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 3/86 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (OVERLAPS) 212/298 variables, 86/112 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 36/148 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/298 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 148 constraints, problems are : Problem set: 0 solved, 203 unsolved in 10036 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 3/86 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (OVERLAPS) 212/298 variables, 86/112 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 36/148 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 203/351 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (OVERLAPS) 0/298 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/298 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 12 (OVERLAPS) 0/298 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 352 constraints, problems are : Problem set: 0 solved, 203 unsolved in 23690 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 86/86 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33780ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 33781ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/105 places, 212/264 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34250 ms. Remains : 86/105 places, 212/264 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 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-11
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-11-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-11 finished in 34396 ms.
All properties solved by simple procedures.
Total runtime 358482 ms.

BK_STOP 1779700278999

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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