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-177969020100292.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 MedleyB-PT-B02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020100292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 796K
-rw-r--r-- 1 mcc users 7.7K Mar 7 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Mar 7 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 7 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 15 11:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 11:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Mar 7 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 7 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 7 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 120K Mar 7 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 359K 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 MedleyB-PT-B02-LTLFireability-00
FORMULA_NAME MedleyB-PT-B02-LTLFireability-01
FORMULA_NAME MedleyB-PT-B02-LTLFireability-02
FORMULA_NAME MedleyB-PT-B02-LTLFireability-03
FORMULA_NAME MedleyB-PT-B02-LTLFireability-04
FORMULA_NAME MedleyB-PT-B02-LTLFireability-05
FORMULA_NAME MedleyB-PT-B02-LTLFireability-06
FORMULA_NAME MedleyB-PT-B02-LTLFireability-07
FORMULA_NAME MedleyB-PT-B02-LTLFireability-08
FORMULA_NAME MedleyB-PT-B02-LTLFireability-09
FORMULA_NAME MedleyB-PT-B02-LTLFireability-10
FORMULA_NAME MedleyB-PT-B02-LTLFireability-11
FORMULA_NAME MedleyB-PT-B02-LTLFireability-12
FORMULA_NAME MedleyB-PT-B02-LTLFireability-13
FORMULA_NAME MedleyB-PT-B02-LTLFireability-14
FORMULA_NAME MedleyB-PT-B02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779705015337

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 10:30:16] [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 10:30:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 10:30:17] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2026-05-25 10:30:17] [INFO ] Transformed 1227 places.
[2026-05-25 10:30:17] [INFO ] Transformed 1472 transitions.
[2026-05-25 10:30:17] [INFO ] Found NUPN structural information;
[2026-05-25 10:30:17] [INFO ] Parsed PT model containing 1227 places and 1472 transitions and 4160 arcs in 274 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MedleyB-PT-B02-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B02-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 1227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1227/1227 places, 1472/1472 transitions.
Discarding 94 places :
Symmetric choice reduction at 0 with 94 rule applications. Total rules 94 place count 1133 transition count 1378
Iterating global reduction 0 with 94 rules applied. Total rules applied 188 place count 1133 transition count 1378
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 247 place count 1074 transition count 1319
Iterating global reduction 0 with 59 rules applied. Total rules applied 306 place count 1074 transition count 1319
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 340 place count 1040 transition count 1285
Iterating global reduction 0 with 34 rules applied. Total rules applied 374 place count 1040 transition count 1285
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 402 place count 1012 transition count 1257
Iterating global reduction 0 with 28 rules applied. Total rules applied 430 place count 1012 transition count 1257
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 454 place count 988 transition count 1233
Iterating global reduction 0 with 24 rules applied. Total rules applied 478 place count 988 transition count 1233
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 502 place count 964 transition count 1209
Iterating global reduction 0 with 24 rules applied. Total rules applied 526 place count 964 transition count 1209
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 550 place count 940 transition count 1185
Iterating global reduction 0 with 24 rules applied. Total rules applied 574 place count 940 transition count 1185
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 597 place count 917 transition count 1162
Iterating global reduction 0 with 23 rules applied. Total rules applied 620 place count 917 transition count 1162
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 641 place count 896 transition count 1141
Iterating global reduction 0 with 21 rules applied. Total rules applied 662 place count 896 transition count 1141
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 679 place count 879 transition count 1124
Iterating global reduction 0 with 17 rules applied. Total rules applied 696 place count 879 transition count 1124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 699 place count 879 transition count 1121
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 704 place count 874 transition count 1116
Iterating global reduction 1 with 5 rules applied. Total rules applied 709 place count 874 transition count 1116
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 714 place count 869 transition count 1111
Iterating global reduction 1 with 5 rules applied. Total rules applied 719 place count 869 transition count 1111
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 721 place count 867 transition count 1109
Iterating global reduction 1 with 2 rules applied. Total rules applied 723 place count 867 transition count 1109
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 725 place count 865 transition count 1107
Iterating global reduction 1 with 2 rules applied. Total rules applied 727 place count 865 transition count 1107
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 729 place count 863 transition count 1105
Iterating global reduction 1 with 2 rules applied. Total rules applied 731 place count 863 transition count 1105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 733 place count 861 transition count 1103
Iterating global reduction 1 with 2 rules applied. Total rules applied 735 place count 861 transition count 1103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 737 place count 859 transition count 1101
Iterating global reduction 1 with 2 rules applied. Total rules applied 739 place count 859 transition count 1101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 741 place count 857 transition count 1099
Iterating global reduction 1 with 2 rules applied. Total rules applied 743 place count 857 transition count 1099
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 745 place count 855 transition count 1097
Iterating global reduction 1 with 2 rules applied. Total rules applied 747 place count 855 transition count 1097
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 749 place count 853 transition count 1095
Iterating global reduction 1 with 2 rules applied. Total rules applied 751 place count 853 transition count 1095
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 753 place count 851 transition count 1093
Iterating global reduction 1 with 2 rules applied. Total rules applied 755 place count 851 transition count 1093
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 757 place count 849 transition count 1091
Iterating global reduction 1 with 2 rules applied. Total rules applied 759 place count 849 transition count 1091
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 761 place count 849 transition count 1089
Applied a total of 761 rules in 1187 ms. Remains 849 /1227 variables (removed 378) and now considering 1089/1472 (removed 383) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16423137637923625387.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5657941987919504027.kers'
[2026-05-25 10:30:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16423137637923625387.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5657941987919504027.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1089 rows 849 cols 3374 entries
Finished phase 1 with 844 SingleSign rule and 0 generalized
[2026-05-25 10:30:18] [INFO ] Computed 5 invariants in 17 ms
Computed 5 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-5657941987919504027.kers
Total runtime 19 ms.
[2026-05-25 10:30:19] [INFO ] Implicit Places using invariants in 939 ms returned []
[2026-05-25 10:30:19] [INFO ] Invariant cache hit.
[2026-05-25 10:30:20] [INFO ] Implicit Places using invariants and state equation in 1307 ms returned []
Implicit Place search using SMT with State Equation took 2282 ms to find 0 implicit places.
Running 1088 sub problems to find dead transitions.
[2026-05-25 10:30:21] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 848/1938 variables, and 0 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/849 constraints, PredecessorRefiner: 1088/1088 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1088 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 848/1938 variables, and 0 constraints, problems are : Problem set: 0 solved, 1088 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/849 constraints, PredecessorRefiner: 0/1088 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60551ms problems are : Problem set: 0 solved, 1088 unsolved
Search for dead transitions found 0 dead transitions in 60600ms
Starting structural reductions in LTL mode, iteration 1 : 849/1227 places, 1089/1472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64163 ms. Remains : 849/1227 places, 1089/1472 transitions.
Starting structural reductions in LTL mode, iteration 0 : 849/849 places, 1089/1089 transitions.
Applied a total of 0 rules in 25 ms. Remains 849 /849 variables (removed 0) and now considering 1089/1089 (removed 0) transitions.
[2026-05-25 10:31:21] [INFO ] Invariant cache hit.
[2026-05-25 10:31:22] [INFO ] Implicit Places using invariants in 535 ms returned []
[2026-05-25 10:31:22] [INFO ] Invariant cache hit.
[2026-05-25 10:31:23] [INFO ] Implicit Places using invariants and state equation in 1326 ms returned []
Implicit Place search using SMT with State Equation took 1865 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1890 ms. Remains : 849/849 places, 1089/1089 transitions.
Support contains 45 out of 849 places after structural reductions.
[2026-05-25 10:31:23] [INFO ] Flatten gal took : 101 ms
[2026-05-25 10:31:23] [INFO ] Flatten gal took : 54 ms
[2026-05-25 10:31:24] [INFO ] Input system was already deterministic with 1089 transitions.
Support contains 43 out of 849 places (down from 45) after GAL structural reductions.
RANDOM walk for 40000 steps (503 resets) in 1394 ms. (28 steps per ms) remains 19/34 properties
BEST_FIRST walk for 4003 steps (11 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4000 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (10 resets) in 45 ms. (86 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (11 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (10 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (11 resets) in 27 ms. (142 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (9 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (11 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (10 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (11 resets) in 20 ms. (190 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4003 steps (10 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (11 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (11 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
[2026-05-25 10:31:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 811/835 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 835/1938 variables, and 13 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/5 constraints, State Equation: 0/849 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 811/835 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/835 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/835 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/835 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 14/849 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/849 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1089/1938 variables, 849/865 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1938 variables, 18/883 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1938/1938 variables, and 883 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 849/849 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10058ms problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 849 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 849/849 places, 1089/1089 transitions.
Graph (trivial) has 794 edges and 849 vertex of which 51 / 849 are part of one of the 10 SCC in 30 ms
Free SCC test removed 41 places
Drop transitions (Empty/Sink Transition effects.) removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Graph (complete) has 1274 edges and 808 vertex of which 804 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 568 transitions
Trivial Post-agglo rules discarded 568 transitions
Performed 568 trivial Post agglomeration. Transition count delta: 568
Iterating post reduction 0 with 572 rules applied. Total rules applied 574 place count 804 transition count 461
Reduce places removed 568 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 579 rules applied. Total rules applied 1153 place count 236 transition count 450
Reduce places removed 4 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 2 with 20 rules applied. Total rules applied 1173 place count 232 transition count 434
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 19 rules applied. Total rules applied 1192 place count 216 transition count 431
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1193 place count 215 transition count 431
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 46 Pre rules applied. Total rules applied 1193 place count 215 transition count 385
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 1285 place count 169 transition count 385
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 4 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 1345 place count 139 transition count 355
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1349 place count 139 transition count 351
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1366 place count 122 transition count 230
Iterating global reduction 6 with 17 rules applied. Total rules applied 1383 place count 122 transition count 230
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1391 place count 122 transition count 222
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1399 place count 114 transition count 214
Iterating global reduction 7 with 8 rules applied. Total rules applied 1407 place count 114 transition count 214
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1413 place count 108 transition count 208
Iterating global reduction 7 with 6 rules applied. Total rules applied 1419 place count 108 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1421 place count 108 transition count 206
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 1433 place count 102 transition count 200
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1441 place count 98 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1442 place count 98 transition count 209
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1445 place count 98 transition count 206
Free-agglomeration rule applied 21 times.
Iterating global reduction 9 with 21 rules applied. Total rules applied 1466 place count 98 transition count 185
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 9 with 21 rules applied. Total rules applied 1487 place count 77 transition count 185
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1490 place count 74 transition count 182
Iterating global reduction 10 with 3 rules applied. Total rules applied 1493 place count 74 transition count 182
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 10 with 9 rules applied. Total rules applied 1502 place count 74 transition count 173
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1503 place count 74 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1504 place count 73 transition count 172
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 1509 place count 73 transition count 172
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1511 place count 73 transition count 170
Applied a total of 1511 rules in 185 ms. Remains 73 /849 variables (removed 776) and now considering 170/1089 (removed 919) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 73/849 places, 170/1089 transitions.
RANDOM walk for 34517 steps (1959 resets) in 391 ms. (88 steps per ms) remains 0/18 properties
FORMULA MedleyB-PT-B02-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA MedleyB-PT-B02-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 166 stabilizing places and 174 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(X(G((X(X(X(p0)))||F(p1))))))'
Support contains 2 out of 849 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 849/849 places, 1089/1089 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 836 transition count 1076
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 836 transition count 1076
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 829 transition count 1069
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 829 transition count 1069
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 823 transition count 1063
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 823 transition count 1063
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 817 transition count 1057
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 817 transition count 1057
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 811 transition count 1051
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 811 transition count 1051
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 807 transition count 1047
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 807 transition count 1047
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 803 transition count 1043
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 803 transition count 1043
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 96 place count 799 transition count 1039
Iterating global reduction 0 with 4 rules applied. Total rules applied 100 place count 799 transition count 1039
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 104 place count 795 transition count 1035
Iterating global reduction 0 with 4 rules applied. Total rules applied 108 place count 795 transition count 1035
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 109 place count 795 transition count 1034
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 111 place count 793 transition count 1032
Iterating global reduction 1 with 2 rules applied. Total rules applied 113 place count 793 transition count 1032
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 791 transition count 1030
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 791 transition count 1030
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 789 transition count 1028
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 789 transition count 1028
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 122 place count 789 transition count 1027
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 788 transition count 1026
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 788 transition count 1026
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 787 transition count 1025
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 787 transition count 1025
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 786 transition count 1024
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 786 transition count 1024
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 129 place count 786 transition count 1023
Applied a total of 129 rules in 472 ms. Remains 786 /849 variables (removed 63) and now considering 1023/1089 (removed 66) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-165652636101783732.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16631814425621956430.kers'
[2026-05-25 10:31:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-165652636101783732.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16631814425621956430.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1023 rows 786 cols 3230 entries
Finished phase 1 with 781 SingleSign rule and 0 generalized
[2026-05-25 10:31:36] [INFO ] Computed 5 invariants in 13 ms
Computed 5 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-16631814425621956430.kers
Total runtime 15 ms.
[2026-05-25 10:31:36] [INFO ] Implicit Places using invariants in 546 ms returned []
[2026-05-25 10:31:36] [INFO ] Invariant cache hit.
[2026-05-25 10:31:37] [INFO ] Implicit Places using invariants and state equation in 1067 ms returned []
Implicit Place search using SMT with State Equation took 1625 ms to find 0 implicit places.
Running 1022 sub problems to find dead transitions.
[2026-05-25 10:31:37] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 785/1809 variables, and 0 constraints, problems are : Problem set: 0 solved, 1022 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/786 constraints, PredecessorRefiner: 1022/1022 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1022 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/785 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1022 unsolved
At refinement iteration 1 (OVERLAPS) 1/786 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1022 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 786/1809 variables, and 5 constraints, problems are : Problem set: 0 solved, 1022 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/786 constraints, PredecessorRefiner: 0/1022 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60362ms problems are : Problem set: 0 solved, 1022 unsolved
Search for dead transitions found 0 dead transitions in 60365ms
Starting structural reductions in LTL mode, iteration 1 : 786/849 places, 1023/1089 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62467 ms. Remains : 786/849 places, 1023/1089 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(X(X(p0)))||F(p1))))))'
Stuttering acceptance computed with spot in 648 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MedleyB-PT-B02-LTLFireability-00
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 5 ms.
FORMULA MedleyB-PT-B02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B02-LTLFireability-00 finished in 63232 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(G(p0))&&(p1||X(X(p1))))))'
Support contains 2 out of 849 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 849/849 places, 1089/1089 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 836 transition count 1076
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 836 transition count 1076
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 829 transition count 1069
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 829 transition count 1069
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 823 transition count 1063
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 823 transition count 1063
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 817 transition count 1057
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 817 transition count 1057
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 811 transition count 1051
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 811 transition count 1051
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 807 transition count 1047
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 807 transition count 1047
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 803 transition count 1043
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 803 transition count 1043
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 96 place count 799 transition count 1039
Iterating global reduction 0 with 4 rules applied. Total rules applied 100 place count 799 transition count 1039
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 104 place count 795 transition count 1035
Iterating global reduction 0 with 4 rules applied. Total rules applied 108 place count 795 transition count 1035
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 109 place count 795 transition count 1034
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 111 place count 793 transition count 1032
Iterating global reduction 1 with 2 rules applied. Total rules applied 113 place count 793 transition count 1032
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 791 transition count 1030
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 791 transition count 1030
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 789 transition count 1028
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 789 transition count 1028
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 122 place count 789 transition count 1027
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 788 transition count 1026
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 788 transition count 1026
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 787 transition count 1025
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 787 transition count 1025
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 786 transition count 1024
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 786 transition count 1024
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 129 place count 786 transition count 1023
Applied a total of 129 rules in 417 ms. Remains 786 /849 variables (removed 63) and now considering 1023/1089 (removed 66) transitions.
[2026-05-25 10:32:39] [INFO ] Invariant cache hit.
[2026-05-25 10:32:39] [INFO ] Implicit Places using invariants in 466 ms returned []
[2026-05-25 10:32:39] [INFO ] Invariant cache hit.
[2026-05-25 10:32:40] [INFO ] Implicit Places using invariants and state equation in 986 ms returned []
Implicit Place search using SMT with State Equation took 1460 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 786/849 places, 1023/1089 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1878 ms. Remains : 786/849 places, 1023/1089 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(G(p0))&&(p1||X(X(p1))))))'
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : MedleyB-PT-B02-LTLFireability-02
Stuttering criterion allowed to conclude after 82 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B02-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B02-LTLFireability-02 finished in 2250 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((X(G((p0 U p1)))&&G(p2))))'
Support contains 3 out of 849 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 849/849 places, 1089/1089 transitions.
Graph (trivial) has 838 edges and 849 vertex of which 60 / 849 are part of one of the 11 SCC in 2 ms
Free SCC test removed 49 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 589 transitions
Trivial Post-agglo rules discarded 589 transitions
Performed 589 trivial Post agglomeration. Transition count delta: 589
Iterating post reduction 0 with 589 rules applied. Total rules applied 590 place count 799 transition count 443
Reduce places removed 589 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 601 rules applied. Total rules applied 1191 place count 210 transition count 431
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 1197 place count 206 transition count 429
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1199 place count 204 transition count 429
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1199 place count 204 transition count 383
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1291 place count 158 transition count 383
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1300 place count 149 transition count 374
Iterating global reduction 4 with 9 rules applied. Total rules applied 1309 place count 149 transition count 374
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1309 place count 149 transition count 373
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1311 place count 148 transition count 373
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1314 place count 145 transition count 370
Iterating global reduction 4 with 3 rules applied. Total rules applied 1317 place count 145 transition count 370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1318 place count 145 transition count 369
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1319 place count 144 transition count 368
Iterating global reduction 5 with 1 rules applied. Total rules applied 1320 place count 144 transition count 368
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1321 place count 144 transition count 367
Performed 28 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 1377 place count 116 transition count 338
Discarding 23 places :
Symmetric choice reduction at 6 with 23 rule applications. Total rules 1400 place count 93 transition count 190
Iterating global reduction 6 with 23 rules applied. Total rules applied 1423 place count 93 transition count 190
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1434 place count 93 transition count 179
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1446 place count 81 transition count 164
Iterating global reduction 7 with 12 rules applied. Total rules applied 1458 place count 81 transition count 164
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1469 place count 70 transition count 151
Iterating global reduction 7 with 11 rules applied. Total rules applied 1480 place count 70 transition count 151
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1485 place count 70 transition count 146
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 1503 place count 61 transition count 155
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1504 place count 60 transition count 144
Iterating global reduction 8 with 1 rules applied. Total rules applied 1505 place count 60 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1506 place count 60 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1512 place count 60 transition count 137
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1513 place count 60 transition count 137
Applied a total of 1513 rules in 102 ms. Remains 60 /849 variables (removed 789) and now considering 137/1089 (removed 952) transitions.
[2026-05-25 10:32:41] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6323057412848877264.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17177445634614758303.kers'
[2026-05-25 10:32:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6323057412848877264.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17177445634614758303.kers]
Normalized transition count is 131 out of 132 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 131 rows 59 cols 543 entries
Finished phase 1 with 58 SingleSign rule and 0 generalized
[2026-05-25 10:32:41] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17177445634614758303.kers
Total runtime 4 ms.
[2026-05-25 10:32:41] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-25 10:32:41] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2026-05-25 10:32:41] [INFO ] Invariant cache hit.
[2026-05-25 10:32:41] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-25 10:32:41] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2026-05-25 10:32:41] [INFO ] Redundant transitions in 6 ms returned []
Running 120 sub problems to find dead transitions.
[2026-05-25 10:32:41] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2026-05-25 10:32:41] [INFO ] Invariant cache hit.
[2026-05-25 10:32:41] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 131/191 variables, 60/76 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 91 constraints, problems are : Problem set: 0 solved, 120 unsolved in 9186 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 131/191 variables, 60/77 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 14/91 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 120/211 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (OVERLAPS) 1/192 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (OVERLAPS) 0/192 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 215 constraints, problems are : Problem set: 0 solved, 120 unsolved in 23012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32261ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 32262ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/849 places, 137/1089 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32589 ms. Remains : 60/849 places, 137/1089 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((X(G((p0 U p1)))&&G(p2))))'
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1)]
Running random walk in product with property : MedleyB-PT-B02-LTLFireability-04
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B02-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B02-LTLFireability-04 finished in 32889 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 849 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 849/849 places, 1089/1089 transitions.
Graph (trivial) has 844 edges and 849 vertex of which 67 / 849 are part of one of the 12 SCC in 1 ms
Free SCC test removed 55 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 591 transitions
Trivial Post-agglo rules discarded 591 transitions
Performed 591 trivial Post agglomeration. Transition count delta: 591
Iterating post reduction 0 with 591 rules applied. Total rules applied 592 place count 793 transition count 434
Reduce places removed 591 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 603 rules applied. Total rules applied 1195 place count 202 transition count 422
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1199 place count 198 transition count 422
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 1199 place count 198 transition count 377
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 1289 place count 153 transition count 377
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1297 place count 145 transition count 369
Iterating global reduction 3 with 8 rules applied. Total rules applied 1305 place count 145 transition count 369
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 1308 place count 142 transition count 366
Iterating global reduction 3 with 3 rules applied. Total rules applied 1311 place count 142 transition count 366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1312 place count 142 transition count 365
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1313 place count 141 transition count 364
Iterating global reduction 4 with 1 rules applied. Total rules applied 1314 place count 141 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1315 place count 141 transition count 363
Performed 29 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 1373 place count 112 transition count 333
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 1396 place count 89 transition count 191
Iterating global reduction 5 with 23 rules applied. Total rules applied 1419 place count 89 transition count 191
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1429 place count 89 transition count 181
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 1442 place count 76 transition count 164
Iterating global reduction 6 with 13 rules applied. Total rules applied 1455 place count 76 transition count 164
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 1468 place count 63 transition count 147
Iterating global reduction 6 with 13 rules applied. Total rules applied 1481 place count 63 transition count 147
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1486 place count 63 transition count 142
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 1502 place count 55 transition count 149
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1503 place count 54 transition count 141
Iterating global reduction 7 with 1 rules applied. Total rules applied 1504 place count 54 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1505 place count 54 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1509 place count 54 transition count 136
Applied a total of 1509 rules in 65 ms. Remains 54 /849 variables (removed 795) and now considering 136/1089 (removed 953) transitions.
[2026-05-25 10:33:13] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16359294974579265569.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2997492361706728146.kers'
[2026-05-25 10:33:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16359294974579265569.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2997492361706728146.kers]
Normalized transition count is 130 out of 131 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 130 rows 53 cols 585 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-25 10:33:13] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2997492361706728146.kers
Total runtime 1 ms.
[2026-05-25 10:33:13] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-25 10:33:13] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
[2026-05-25 10:33:13] [INFO ] Invariant cache hit.
[2026-05-25 10:33:14] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-25 10:33:14] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2026-05-25 10:33:14] [INFO ] Redundant transitions in 5 ms returned []
Running 119 sub problems to find dead transitions.
[2026-05-25 10:33:14] [INFO ] Flow matrix only has 131 transitions (discarded 5 similar events)
[2026-05-25 10:33:14] [INFO ] Invariant cache hit.
[2026-05-25 10:33:14] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 130/184 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 14/80 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 1/185 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (OVERLAPS) 0/185 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 82 constraints, problems are : Problem set: 0 solved, 119 unsolved in 8864 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 130/184 variables, 54/68 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 14/82 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 119/201 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (OVERLAPS) 1/185 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/185 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/185 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/185 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 16 (OVERLAPS) 0/185 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 206 constraints, problems are : Problem set: 0 solved, 119 unsolved in 27989 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 54/54 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36917ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 36917ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/849 places, 136/1089 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37132 ms. Remains : 54/849 places, 136/1089 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 41 ms :[(NOT p0)]
Running random walk in product with property : MedleyB-PT-B02-LTLFireability-06
Stuttering criterion allowed to conclude after 808 steps with 115 reset in 4 ms.
FORMULA MedleyB-PT-B02-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B02-LTLFireability-06 finished in 37227 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&&X(X(p1))))) U (p2 U p3))))'
Support contains 7 out of 849 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 849/849 places, 1089/1089 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 838 transition count 1078
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 838 transition count 1078
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 833 transition count 1073
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 833 transition count 1073
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 829 transition count 1069
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 829 transition count 1069
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 825 transition count 1065
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 825 transition count 1065
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 821 transition count 1061
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 821 transition count 1061
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 819 transition count 1059
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 819 transition count 1059
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 817 transition count 1057
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 817 transition count 1057
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 815 transition count 1055
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 815 transition count 1055
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 813 transition count 1053
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 813 transition count 1053
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 812 transition count 1052
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 812 transition count 1052
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 811 transition count 1051
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 811 transition count 1051
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 810 transition count 1050
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 810 transition count 1050
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 809 transition count 1049
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 809 transition count 1049
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 808 transition count 1048
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 808 transition count 1048
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 807 transition count 1047
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 807 transition count 1047
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 85 place count 807 transition count 1046
Applied a total of 85 rules in 307 ms. Remains 807 /849 variables (removed 42) and now considering 1046/1089 (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-11718527884344300415.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8942117356588580539.kers'
[2026-05-25 10:33:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11718527884344300415.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8942117356588580539.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1046 rows 807 cols 3280 entries
Finished phase 1 with 802 SingleSign rule and 0 generalized
[2026-05-25 10:33:51] [INFO ] Computed 5 invariants in 5 ms
Computed 5 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-8942117356588580539.kers
Total runtime 10 ms.
[2026-05-25 10:33:51] [INFO ] Implicit Places using invariants in 442 ms returned []
[2026-05-25 10:33:51] [INFO ] Invariant cache hit.
[2026-05-25 10:33:52] [INFO ] Implicit Places using invariants and state equation in 1135 ms returned []
Implicit Place search using SMT with State Equation took 1598 ms to find 0 implicit places.
Running 1045 sub problems to find dead transitions.
[2026-05-25 10:33:52] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 806/1853 variables, and 0 constraints, problems are : Problem set: 0 solved, 1045 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/807 constraints, PredecessorRefiner: 1045/1045 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1045 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/1853 variables, and 0 constraints, problems are : Problem set: 0 solved, 1045 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/807 constraints, PredecessorRefiner: 0/1045 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60337ms problems are : Problem set: 0 solved, 1045 unsolved
Search for dead transitions found 0 dead transitions in 60340ms
Starting structural reductions in LTL mode, iteration 1 : 807/849 places, 1046/1089 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62250 ms. Remains : 807/849 places, 1046/1089 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&&X(X(p1))))) U (p2 U p3))))'
Stuttering acceptance computed with spot in 704 ms :[(NOT p3), (NOT p3), (OR (NOT p1) p0), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (OR (NOT p1) p0), true, (NOT p1), (NOT p1), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : MedleyB-PT-B02-LTLFireability-07
Product exploration explored 100000 steps with 14263 reset in 208 ms.
Product exploration explored 100000 steps with 14272 reset in 187 ms.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge based reduction with 9 factoid took 122 ms. Reduced automaton from 12 states, 22 edges and 4 AP (stutter sensitive) to 12 states, 22 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (517 resets) in 373 ms. (106 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40001 steps (106 resets) in 142 ms. (279 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (110 resets) in 157 ms. (253 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (108 resets) in 118 ms. (336 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (106 resets) in 49 ms. (800 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (107 resets) in 71 ms. (555 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (116 resets) in 58 ms. (678 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40004 steps (104 resets) in 54 ms. (727 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (111 resets) in 55 ms. (714 steps per ms) remains 7/7 properties
[2026-05-25 10:34:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf11 is UNSAT
At refinement iteration 1 (OVERLAPS) 786/793 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/793 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14/807 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/807 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1046/1853 variables, 807/812 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1853 variables, 0/812 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/1853 variables, 0/812 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1853/1853 variables, and 812 constraints, problems are : Problem set: 1 solved, 6 unsolved in 1265 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 807/807 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 786/793 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/793 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14/807 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/807 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/807 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/807 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/807 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1046/1853 variables, 807/816 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1853 variables, 6/822 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1853 variables, 0/822 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1853/1853 variables, and 822 constraints, problems are : Problem set: 1 solved, 6 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 807/807 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6290ms problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 807 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 807/807 places, 1046/1046 transitions.
Graph (trivial) has 789 edges and 807 vertex of which 64 / 807 are part of one of the 12 SCC in 1 ms
Free SCC test removed 52 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Graph (complete) has 1207 edges and 755 vertex of which 751 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 563 rules applied. Total rules applied 565 place count 751 transition count 411
Reduce places removed 559 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 571 rules applied. Total rules applied 1136 place count 192 transition count 399
Reduce places removed 4 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 10 rules applied. Total rules applied 1146 place count 188 transition count 393
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1152 place count 182 transition count 393
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 44 Pre rules applied. Total rules applied 1152 place count 182 transition count 349
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 1240 place count 138 transition count 349
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 1300 place count 108 transition count 319
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1308 place count 108 transition count 311
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1333 place count 83 transition count 157
Iterating global reduction 5 with 25 rules applied. Total rules applied 1358 place count 83 transition count 157
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1371 place count 83 transition count 144
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1383 place count 71 transition count 132
Iterating global reduction 6 with 12 rules applied. Total rules applied 1395 place count 71 transition count 132
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1403 place count 63 transition count 124
Iterating global reduction 6 with 8 rules applied. Total rules applied 1411 place count 63 transition count 124
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1415 place count 63 transition count 120
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1423 place count 59 transition count 116
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1431 place count 55 transition count 137
Free-agglomeration rule applied 15 times.
Iterating global reduction 7 with 15 rules applied. Total rules applied 1446 place count 55 transition count 122
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1461 place count 40 transition count 122
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1465 place count 36 transition count 118
Iterating global reduction 8 with 4 rules applied. Total rules applied 1469 place count 36 transition count 118
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1470 place count 36 transition count 117
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1476 place count 36 transition count 117
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1479 place count 36 transition count 114
Applied a total of 1479 rules in 57 ms. Remains 36 /807 variables (removed 771) and now considering 114/1046 (removed 932) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 36/807 places, 114/1046 transitions.
RANDOM walk for 7697 steps (458 resets) in 20 ms. (366 steps per ms) remains 0/6 properties
Found 1 invariant AP formulas.
Knowledge based reduction with 10 factoid took 222 ms. Reduced automaton from 12 states, 22 edges and 4 AP (stutter sensitive) to 12 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 477 ms :[(NOT p3), (NOT p3), (OR (NOT p1) p0), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (OR (NOT p1) p0), true, (NOT p1), (NOT p1), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3)))]
[2026-05-25 10:35:02] [INFO ] Invariant cache hit.
[2026-05-25 10:35:02] [INFO ] [Real]Absence check using 5 positive place invariants in 101 ms returned sat
[2026-05-25 10:35:06] [INFO ] [Real]Absence check using state equation in 3916 ms returned sat
[2026-05-25 10:35:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 10:35:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 28 ms returned sat
[2026-05-25 10:35:08] [INFO ] [Nat]Absence check using state equation in 1784 ms returned sat
[2026-05-25 10:35:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 348 ms
[2026-05-25 10:35:09] [INFO ] Computed and/alt/rep : 1020/1725/1020 causal constraints (skipped 25 transitions) in 55 ms.
[2026-05-25 10:35:21] [INFO ] Added : 595 causal constraints over 119 iterations in 12529 ms. Result :unknown
Could not prove EG (NOT p3)
Knowledge-based reduction took 27240 ms.
Stuttering acceptance computed with spot in 540 ms :[(NOT p3), (NOT p3), (OR (NOT p1) p0), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (OR (NOT p1) p0), true, (NOT p1), (NOT p1), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3)))]
Support contains 7 out of 807 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 807/807 places, 1046/1046 transitions.
Applied a total of 0 rules in 18 ms. Remains 807 /807 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
[2026-05-25 10:35:22] [INFO ] Invariant cache hit.
[2026-05-25 10:35:22] [INFO ] Implicit Places using invariants in 400 ms returned []
[2026-05-25 10:35:22] [INFO ] Invariant cache hit.
[2026-05-25 10:35:23] [INFO ] Implicit Places using invariants and state equation in 1221 ms returned []
Implicit Place search using SMT with State Equation took 1644 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1676 ms. Remains : 807/807 places, 1046/1046 transitions.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge based reduction with 9 factoid took 121 ms. Reduced automaton from 12 states, 21 edges and 4 AP (stutter sensitive) to 12 states, 21 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (509 resets) in 217 ms. (183 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40004 steps (108 resets) in 44 ms. (888 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (108 resets) in 45 ms. (869 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (106 resets) in 40 ms. (975 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (112 resets) in 75 ms. (526 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40003 steps (108 resets) in 31 ms. (1250 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (105 resets) in 31 ms. (1250 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (107 resets) in 30 ms. (1290 steps per ms) remains 6/6 properties
[2026-05-25 10:35:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 786/793 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/793 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 14/807 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/807 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1046/1853 variables, 807/812 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1853 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/1853 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1853/1853 variables, and 812 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1118 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 807/807 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 786/793 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/793 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14/807 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/807 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/807 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/807 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1046/1853 variables, 807/816 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1853 variables, 6/822 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1853 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1853 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1853/1853 variables, and 822 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 807/807 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6165ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 208 ms.
Support contains 7 out of 807 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 807/807 places, 1046/1046 transitions.
Graph (trivial) has 789 edges and 807 vertex of which 64 / 807 are part of one of the 12 SCC in 1 ms
Free SCC test removed 52 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Graph (complete) has 1207 edges and 755 vertex of which 751 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 563 rules applied. Total rules applied 565 place count 751 transition count 411
Reduce places removed 559 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 571 rules applied. Total rules applied 1136 place count 192 transition count 399
Reduce places removed 4 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 10 rules applied. Total rules applied 1146 place count 188 transition count 393
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1152 place count 182 transition count 393
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 44 Pre rules applied. Total rules applied 1152 place count 182 transition count 349
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 1240 place count 138 transition count 349
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 1300 place count 108 transition count 319
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1308 place count 108 transition count 311
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1333 place count 83 transition count 157
Iterating global reduction 5 with 25 rules applied. Total rules applied 1358 place count 83 transition count 157
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 5 with 13 rules applied. Total rules applied 1371 place count 83 transition count 144
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1383 place count 71 transition count 132
Iterating global reduction 6 with 12 rules applied. Total rules applied 1395 place count 71 transition count 132
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1403 place count 63 transition count 124
Iterating global reduction 6 with 8 rules applied. Total rules applied 1411 place count 63 transition count 124
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1415 place count 63 transition count 120
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1423 place count 59 transition count 116
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1431 place count 55 transition count 137
Free-agglomeration rule applied 15 times.
Iterating global reduction 7 with 15 rules applied. Total rules applied 1446 place count 55 transition count 122
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 1461 place count 40 transition count 122
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1465 place count 36 transition count 118
Iterating global reduction 8 with 4 rules applied. Total rules applied 1469 place count 36 transition count 118
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1470 place count 36 transition count 117
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1476 place count 36 transition count 117
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1479 place count 36 transition count 114
Applied a total of 1479 rules in 35 ms. Remains 36 /807 variables (removed 771) and now considering 114/1046 (removed 932) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 36/807 places, 114/1046 transitions.
RANDOM walk for 7083 steps (434 resets) in 12 ms. (544 steps per ms) remains 0/6 properties
Knowledge based reduction with 9 factoid took 196 ms. Reduced automaton from 12 states, 21 edges and 4 AP (stutter sensitive) to 12 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 641 ms :[(NOT p3), (NOT p3), (OR (NOT p1) p0), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (OR (NOT p1) p0), true, (NOT p1), (NOT p1), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3)))]
[2026-05-25 10:35:31] [INFO ] Invariant cache hit.
[2026-05-25 10:35:32] [INFO ] [Real]Absence check using 5 positive place invariants in 58 ms returned sat
[2026-05-25 10:35:36] [INFO ] [Real]Absence check using state equation in 4125 ms returned sat
[2026-05-25 10:35:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 10:35:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 35 ms returned sat
[2026-05-25 10:35:38] [INFO ] [Nat]Absence check using state equation in 1776 ms returned sat
[2026-05-25 10:35:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 457 ms
[2026-05-25 10:35:38] [INFO ] Computed and/alt/rep : 1020/1725/1020 causal constraints (skipped 25 transitions) in 64 ms.
[2026-05-25 10:35:51] [INFO ] Added : 555 causal constraints over 111 iterations in 12304 ms. Result :unknown
Could not prove EG (NOT p3)
Knowledge-based reduction took 27280 ms.
Stuttering acceptance computed with spot in 679 ms :[(NOT p3), (NOT p3), (OR (NOT p1) p0), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (OR (NOT p1) p0), true, (NOT p1), (NOT p1), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3)))]
Stuttering acceptance computed with spot in 703 ms :[(NOT p3), (NOT p3), (OR (NOT p1) p0), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (OR (NOT p1) p0), true, (NOT p1), (NOT p1), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND p2 (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3)))]
Product exploration explored 100000 steps with 14312 reset in 241 ms.
Product exploration explored 100000 steps with 14318 reset in 238 ms.
Spot run failed in 141 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/ltsmin5534109502036969216
[2026-05-25 10:35:53] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5534109502036969216
Running compilation step : cd /tmp/ltsmin5534109502036969216;'/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 1873 ms.
Running link step : cd /tmp/ltsmin5534109502036969216;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin5534109502036969216;'/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/stateBased6523442657945443371.hoa' '--buchi-type=spotba'
LTSmin run took 210 ms.
FORMULA MedleyB-PT-B02-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyB-PT-B02-LTLFireability-07 finished in 124471 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(G(p0))||G(((F(p1) U p2) U X(p1))))))'
Support contains 3 out of 849 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 849/849 places, 1089/1089 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 836 transition count 1076
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 836 transition count 1076
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 829 transition count 1069
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 829 transition count 1069
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 823 transition count 1063
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 823 transition count 1063
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 817 transition count 1057
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 817 transition count 1057
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 811 transition count 1051
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 811 transition count 1051
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 807 transition count 1047
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 807 transition count 1047
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 803 transition count 1043
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 803 transition count 1043
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 96 place count 799 transition count 1039
Iterating global reduction 0 with 4 rules applied. Total rules applied 100 place count 799 transition count 1039
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 104 place count 795 transition count 1035
Iterating global reduction 0 with 4 rules applied. Total rules applied 108 place count 795 transition count 1035
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 109 place count 795 transition count 1034
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 111 place count 793 transition count 1032
Iterating global reduction 1 with 2 rules applied. Total rules applied 113 place count 793 transition count 1032
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 791 transition count 1030
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 791 transition count 1030
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 789 transition count 1028
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 789 transition count 1028
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 122 place count 789 transition count 1027
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 788 transition count 1026
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 788 transition count 1026
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 787 transition count 1025
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 787 transition count 1025
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 786 transition count 1024
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 786 transition count 1024
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 129 place count 786 transition count 1023
Applied a total of 129 rules in 422 ms. Remains 786 /849 variables (removed 63) and now considering 1023/1089 (removed 66) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4655380746539446613.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5195125005257579096.kers'
[2026-05-25 10:35:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4655380746539446613.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5195125005257579096.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1023 rows 786 cols 3230 entries
Finished phase 1 with 781 SingleSign rule and 0 generalized
[2026-05-25 10:35:55] [INFO ] Computed 5 invariants in 5 ms
Computed 5 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-5195125005257579096.kers
Total runtime 6 ms.
[2026-05-25 10:35:56] [INFO ] Implicit Places using invariants in 536 ms returned []
[2026-05-25 10:35:56] [INFO ] Invariant cache hit.
[2026-05-25 10:35:58] [INFO ] Implicit Places using invariants and state equation in 1690 ms returned []
Implicit Place search using SMT with State Equation took 2228 ms to find 0 implicit places.
Running 1022 sub problems to find dead transitions.
[2026-05-25 10:35:58] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/785 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1022 unsolved
SMT process timed out in 30268ms, After SMT, problems are : Problem set: 0 solved, 1022 unsolved
Search for dead transitions found 0 dead transitions in 30273ms
Starting structural reductions in LTL mode, iteration 1 : 786/849 places, 1023/1089 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32929 ms. Remains : 786/849 places, 1023/1089 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(G(p0))||G(((F(p1) U p2) U X(p1))))))'
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyB-PT-B02-LTLFireability-08
Stuttering criterion allowed to conclude after 129 steps with 1 reset in 1 ms.
FORMULA MedleyB-PT-B02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B02-LTLFireability-08 finished in 33228 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0) U X((p1||G(!p1))))))))'
Support contains 2 out of 849 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 849/849 places, 1089/1089 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 837 transition count 1077
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 837 transition count 1077
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 831 transition count 1071
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 831 transition count 1071
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 826 transition count 1066
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 826 transition count 1066
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 821 transition count 1061
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 821 transition count 1061
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 61 place count 816 transition count 1056
Iterating global reduction 0 with 5 rules applied. Total rules applied 66 place count 816 transition count 1056
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 813 transition count 1053
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 813 transition count 1053
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 810 transition count 1050
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 810 transition count 1050
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 81 place count 807 transition count 1047
Iterating global reduction 0 with 3 rules applied. Total rules applied 84 place count 807 transition count 1047
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 804 transition count 1044
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 804 transition count 1044
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 91 place count 804 transition count 1043
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 803 transition count 1042
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 803 transition count 1042
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 802 transition count 1041
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 802 transition count 1041
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 801 transition count 1040
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 801 transition count 1040
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 98 place count 801 transition count 1039
Applied a total of 98 rules in 289 ms. Remains 801 /849 variables (removed 48) and now considering 1039/1089 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5665693335405575312.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16752666990451481425.kers'
[2026-05-25 10:36:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5665693335405575312.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16752666990451481425.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1039 rows 801 cols 3268 entries
Finished phase 1 with 796 SingleSign rule and 0 generalized
[2026-05-25 10:36:29] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16752666990451481425.kers
Total runtime 5 ms.
[2026-05-25 10:36:29] [INFO ] Implicit Places using invariants in 513 ms returned []
[2026-05-25 10:36:29] [INFO ] Invariant cache hit.
[2026-05-25 10:36:30] [INFO ] Implicit Places using invariants and state equation in 1009 ms returned []
Implicit Place search using SMT with State Equation took 1535 ms to find 0 implicit places.
Running 1038 sub problems to find dead transitions.
[2026-05-25 10:36:30] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1038 unsolved
SMT process timed out in 30278ms, After SMT, problems are : Problem set: 0 solved, 1038 unsolved
Search for dead transitions found 0 dead transitions in 30280ms
Starting structural reductions in LTL mode, iteration 1 : 801/849 places, 1039/1089 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32107 ms. Remains : 801/849 places, 1039/1089 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0) U X((p1||G(!p1))))))))'
Stuttering acceptance computed with spot in 531 ms :[true, (AND p1 (NOT p0)), (NOT p0), false, false, false, false, false, false, p1]
Running random walk in product with property : MedleyB-PT-B02-LTLFireability-09
Product exploration explored 100000 steps with 20000 reset in 229 ms.
Product exploration explored 100000 steps with 20000 reset in 255 ms.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 10 states, 17 edges and 2 AP (stutter sensitive) to 10 states, 17 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (512 resets) in 180 ms. (220 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (108 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (109 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (104 resets) in 35 ms. (1111 steps per ms) remains 3/3 properties
[2026-05-25 10:37:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 401/403 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 398/801 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/801 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/801 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1039/1840 variables, 801/807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1840 variables, 1/808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1840 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1840 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1840/1840 variables, and 808 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2155 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 801/801 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 401/403 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 398/801 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/801 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/801 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/801 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1039/1840 variables, 801/811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1840 variables, 3/814 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1840 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1840 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1840/1840 variables, and 814 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2315 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 801/801 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4500ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 210 ms.
Support contains 2 out of 801 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 801/801 places, 1039/1039 transitions.
Graph (trivial) has 794 edges and 801 vertex of which 64 / 801 are part of one of the 12 SCC in 1 ms
Free SCC test removed 52 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Graph (complete) has 1202 edges and 749 vertex of which 745 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 557 transitions
Trivial Post-agglo rules discarded 557 transitions
Performed 557 trivial Post agglomeration. Transition count delta: 557
Iterating post reduction 0 with 561 rules applied. Total rules applied 563 place count 745 transition count 406
Reduce places removed 557 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 569 rules applied. Total rules applied 1132 place count 188 transition count 394
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 1137 place count 184 transition count 393
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1138 place count 183 transition count 393
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1138 place count 183 transition count 346
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1232 place count 136 transition count 346
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1233 place count 136 transition count 345
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 1293 place count 106 transition count 315
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1301 place count 106 transition count 307
Discarding 25 places :
Symmetric choice reduction at 6 with 25 rule applications. Total rules 1326 place count 81 transition count 153
Iterating global reduction 6 with 25 rules applied. Total rules applied 1351 place count 81 transition count 153
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1364 place count 81 transition count 140
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1376 place count 69 transition count 128
Iterating global reduction 7 with 12 rules applied. Total rules applied 1388 place count 69 transition count 128
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1396 place count 61 transition count 120
Iterating global reduction 7 with 8 rules applied. Total rules applied 1404 place count 61 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1408 place count 61 transition count 116
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1416 place count 57 transition count 112
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1424 place count 53 transition count 133
Free-agglomeration rule applied 22 times with reduction of 7 identical transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1446 place count 53 transition count 104
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 32 rules applied. Total rules applied 1478 place count 31 transition count 94
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1482 place count 27 transition count 90
Iterating global reduction 9 with 4 rules applied. Total rules applied 1486 place count 27 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1487 place count 27 transition count 89
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 10 with 26 rules applied. Total rules applied 1513 place count 27 transition count 63
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 1517 place count 25 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 1525 place count 25 transition count 73
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1527 place count 25 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1528 place count 25 transition count 72
Applied a total of 1528 rules in 29 ms. Remains 25 /801 variables (removed 776) and now considering 72/1039 (removed 967) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 25/801 places, 72/1039 transitions.
RANDOM walk for 1209 steps (0 resets) in 5 ms. (201 steps per ms) remains 0/3 properties
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 10 states, 17 edges and 2 AP (stutter sensitive) to 10 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 396 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), false, false, false, false, false, false]
Knowledge-based reduction took 5483 ms.
Stuttering acceptance computed with spot in 444 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), false, false, false, false, false, false]
Support contains 2 out of 801 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 801/801 places, 1039/1039 transitions.
Applied a total of 0 rules in 41 ms. Remains 801 /801 variables (removed 0) and now considering 1039/1039 (removed 0) transitions.
[2026-05-25 10:37:07] [INFO ] Invariant cache hit.
[2026-05-25 10:37:08] [INFO ] Implicit Places using invariants in 525 ms returned []
[2026-05-25 10:37:08] [INFO ] Invariant cache hit.
[2026-05-25 10:37:09] [INFO ] Implicit Places using invariants and state equation in 926 ms returned []
Implicit Place search using SMT with State Equation took 1468 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1510 ms. Remains : 801/801 places, 1039/1039 transitions.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 10 states, 17 edges and 2 AP (stutter sensitive) to 10 states, 17 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (517 resets) in 202 ms. (197 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (110 resets) in 38 ms. (1025 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (109 resets) in 39 ms. (1000 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (108 resets) in 34 ms. (1142 steps per ms) remains 3/3 properties
[2026-05-25 10:37:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 401/403 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 398/801 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/801 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/801 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1039/1840 variables, 801/807 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1840 variables, 1/808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1840 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1840 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1840/1840 variables, and 808 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2116 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 801/801 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 401/403 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 398/801 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/801 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/801 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/801 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1039/1840 variables, 801/811 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1840 variables, 3/814 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1840 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1840 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1840/1840 variables, and 814 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2756 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 801/801 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4888ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 285 ms.
Support contains 2 out of 801 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 801/801 places, 1039/1039 transitions.
Graph (trivial) has 794 edges and 801 vertex of which 64 / 801 are part of one of the 12 SCC in 1 ms
Free SCC test removed 52 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Graph (complete) has 1202 edges and 749 vertex of which 745 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 557 transitions
Trivial Post-agglo rules discarded 557 transitions
Performed 557 trivial Post agglomeration. Transition count delta: 557
Iterating post reduction 0 with 561 rules applied. Total rules applied 563 place count 745 transition count 406
Reduce places removed 557 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 569 rules applied. Total rules applied 1132 place count 188 transition count 394
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 1137 place count 184 transition count 393
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1138 place count 183 transition count 393
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1138 place count 183 transition count 346
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1232 place count 136 transition count 346
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1233 place count 136 transition count 345
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 1293 place count 106 transition count 315
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1301 place count 106 transition count 307
Discarding 25 places :
Symmetric choice reduction at 6 with 25 rule applications. Total rules 1326 place count 81 transition count 153
Iterating global reduction 6 with 25 rules applied. Total rules applied 1351 place count 81 transition count 153
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1364 place count 81 transition count 140
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1376 place count 69 transition count 128
Iterating global reduction 7 with 12 rules applied. Total rules applied 1388 place count 69 transition count 128
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1396 place count 61 transition count 120
Iterating global reduction 7 with 8 rules applied. Total rules applied 1404 place count 61 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1408 place count 61 transition count 116
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1416 place count 57 transition count 112
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1424 place count 53 transition count 133
Free-agglomeration rule applied 22 times with reduction of 7 identical transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1446 place count 53 transition count 104
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 32 rules applied. Total rules applied 1478 place count 31 transition count 94
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1482 place count 27 transition count 90
Iterating global reduction 9 with 4 rules applied. Total rules applied 1486 place count 27 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1487 place count 27 transition count 89
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 10 with 26 rules applied. Total rules applied 1513 place count 27 transition count 63
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 1517 place count 25 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 1525 place count 25 transition count 73
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1527 place count 25 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1528 place count 25 transition count 72
Applied a total of 1528 rules in 38 ms. Remains 25 /801 variables (removed 776) and now considering 72/1039 (removed 967) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 25/801 places, 72/1039 transitions.
RANDOM walk for 1559 steps (0 resets) in 7 ms. (194 steps per ms) remains 0/3 properties
Knowledge based reduction with 1 factoid took 138 ms. Reduced automaton from 10 states, 17 edges and 2 AP (stutter sensitive) to 10 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 338 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), false, false, false, false, false, false]
Knowledge-based reduction took 5909 ms.
Stuttering acceptance computed with spot in 603 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 562 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), false, false, false, false, false, false]
Product exploration explored 100000 steps with 20000 reset in 211 ms.
Product exploration explored 100000 steps with 20000 reset in 231 ms.
Spot run failed in 88 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/ltsmin7945165511184920076
[2026-05-25 10:37:17] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7945165511184920076
Running compilation step : cd /tmp/ltsmin7945165511184920076;'/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 1820 ms.
Running link step : cd /tmp/ltsmin7945165511184920076;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin7945165511184920076;'/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/stateBased2162771433773458714.hoa' '--buchi-type=spotba'
LTSmin run took 103 ms.
FORMULA MedleyB-PT-B02-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyB-PT-B02-LTLFireability-09 finished in 50304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 849 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 849/849 places, 1089/1089 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 836 transition count 1076
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 836 transition count 1076
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 829 transition count 1069
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 829 transition count 1069
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 823 transition count 1063
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 823 transition count 1063
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 817 transition count 1057
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 817 transition count 1057
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 811 transition count 1051
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 811 transition count 1051
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 807 transition count 1047
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 807 transition count 1047
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 803 transition count 1043
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 803 transition count 1043
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 96 place count 799 transition count 1039
Iterating global reduction 0 with 4 rules applied. Total rules applied 100 place count 799 transition count 1039
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 104 place count 795 transition count 1035
Iterating global reduction 0 with 4 rules applied. Total rules applied 108 place count 795 transition count 1035
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 109 place count 795 transition count 1034
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 111 place count 793 transition count 1032
Iterating global reduction 1 with 2 rules applied. Total rules applied 113 place count 793 transition count 1032
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 791 transition count 1030
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 791 transition count 1030
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 789 transition count 1028
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 789 transition count 1028
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 122 place count 789 transition count 1027
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 788 transition count 1026
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 788 transition count 1026
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 787 transition count 1025
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 787 transition count 1025
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 786 transition count 1024
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 786 transition count 1024
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 129 place count 786 transition count 1023
Applied a total of 129 rules in 406 ms. Remains 786 /849 variables (removed 63) and now considering 1023/1089 (removed 66) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6945698474339087249.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-523379788226068349.kers'
[2026-05-25 10:37:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6945698474339087249.kers, --Pflows, --basisKERS=/tmp/petrispot-output-523379788226068349.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1023 rows 786 cols 3230 entries
Finished phase 1 with 781 SingleSign rule and 0 generalized
[2026-05-25 10:37:19] [INFO ] Computed 5 invariants in 12 ms
Computed 5 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-523379788226068349.kers
Total runtime 14 ms.
[2026-05-25 10:37:19] [INFO ] Implicit Places using invariants in 479 ms returned []
[2026-05-25 10:37:19] [INFO ] Invariant cache hit.
[2026-05-25 10:37:21] [INFO ] Implicit Places using invariants and state equation in 1067 ms returned []
Implicit Place search using SMT with State Equation took 1551 ms to find 0 implicit places.
Running 1022 sub problems to find dead transitions.
[2026-05-25 10:37:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/785 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1022 unsolved
SMT process timed out in 30279ms, After SMT, problems are : Problem set: 0 solved, 1022 unsolved
Search for dead transitions found 0 dead transitions in 30284ms
Starting structural reductions in LTL mode, iteration 1 : 786/849 places, 1023/1089 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32247 ms. Remains : 786/849 places, 1023/1089 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B02-LTLFireability-10
Entered a terminal (fully accepting) state of product in 59 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B02-LTLFireability-10 finished in 32408 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)) U (!p0||G(p1))))&&F(p2)))'
Support contains 3 out of 849 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 849/849 places, 1089/1089 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 837 transition count 1077
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 837 transition count 1077
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 830 transition count 1070
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 830 transition count 1070
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 824 transition count 1064
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 824 transition count 1064
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 818 transition count 1058
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 818 transition count 1058
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 812 transition count 1052
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 812 transition count 1052
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 808 transition count 1048
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 808 transition count 1048
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 86 place count 804 transition count 1044
Iterating global reduction 0 with 4 rules applied. Total rules applied 90 place count 804 transition count 1044
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 94 place count 800 transition count 1040
Iterating global reduction 0 with 4 rules applied. Total rules applied 98 place count 800 transition count 1040
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 102 place count 796 transition count 1036
Iterating global reduction 0 with 4 rules applied. Total rules applied 106 place count 796 transition count 1036
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 107 place count 796 transition count 1035
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 109 place count 794 transition count 1033
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 794 transition count 1033
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 113 place count 792 transition count 1031
Iterating global reduction 1 with 2 rules applied. Total rules applied 115 place count 792 transition count 1031
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 117 place count 790 transition count 1029
Iterating global reduction 1 with 2 rules applied. Total rules applied 119 place count 790 transition count 1029
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 120 place count 790 transition count 1028
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 789 transition count 1027
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 789 transition count 1027
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 788 transition count 1026
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 788 transition count 1026
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 787 transition count 1025
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 787 transition count 1025
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 127 place count 787 transition count 1024
Applied a total of 127 rules in 328 ms. Remains 787 /849 variables (removed 62) and now considering 1024/1089 (removed 65) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15851369090923955615.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5380659156120345181.kers'
[2026-05-25 10:37:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15851369090923955615.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5380659156120345181.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1024 rows 787 cols 3232 entries
Finished phase 1 with 782 SingleSign rule and 0 generalized
[2026-05-25 10:37:51] [INFO ] Computed 5 invariants in 18 ms
Computed 5 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-5380659156120345181.kers
Total runtime 20 ms.
[2026-05-25 10:37:52] [INFO ] Implicit Places using invariants in 578 ms returned []
[2026-05-25 10:37:52] [INFO ] Invariant cache hit.
[2026-05-25 10:37:53] [INFO ] Implicit Places using invariants and state equation in 1038 ms returned []
Implicit Place search using SMT with State Equation took 1620 ms to find 0 implicit places.
Running 1023 sub problems to find dead transitions.
[2026-05-25 10:37:53] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/786 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1023 unsolved
SMT process timed out in 30230ms, After SMT, problems are : Problem set: 0 solved, 1023 unsolved
Search for dead transitions found 0 dead transitions in 30231ms
Starting structural reductions in LTL mode, iteration 1 : 787/849 places, 1024/1089 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32182 ms. Remains : 787/849 places, 1024/1089 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)) U (!p0||G(p1))))&&F(p2)))'
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyB-PT-B02-LTLFireability-11
Stuttering criterion allowed to conclude after 83 steps with 1 reset in 1 ms.
FORMULA MedleyB-PT-B02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B02-LTLFireability-11 finished in 32424 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(p0)) U X(!p1))&&X(F(p2)))) U p0))'
Support contains 9 out of 849 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 849/849 places, 1089/1089 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 836 transition count 1076
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 836 transition count 1076
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 829 transition count 1069
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 829 transition count 1069
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 823 transition count 1063
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 823 transition count 1063
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 817 transition count 1057
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 817 transition count 1057
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 811 transition count 1051
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 811 transition count 1051
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 807 transition count 1047
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 807 transition count 1047
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 88 place count 803 transition count 1043
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 803 transition count 1043
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 96 place count 799 transition count 1039
Iterating global reduction 0 with 4 rules applied. Total rules applied 100 place count 799 transition count 1039
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 104 place count 795 transition count 1035
Iterating global reduction 0 with 4 rules applied. Total rules applied 108 place count 795 transition count 1035
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 109 place count 795 transition count 1034
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 111 place count 793 transition count 1032
Iterating global reduction 1 with 2 rules applied. Total rules applied 113 place count 793 transition count 1032
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 791 transition count 1030
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 791 transition count 1030
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 789 transition count 1028
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 789 transition count 1028
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 122 place count 789 transition count 1027
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 788 transition count 1026
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 788 transition count 1026
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 787 transition count 1025
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 787 transition count 1025
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 786 transition count 1024
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 786 transition count 1024
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 129 place count 786 transition count 1023
Applied a total of 129 rules in 418 ms. Remains 786 /849 variables (removed 63) and now considering 1023/1089 (removed 66) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17009233730481062605.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11706539551856319497.kers'
[2026-05-25 10:38:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17009233730481062605.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11706539551856319497.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1023 rows 786 cols 3230 entries
Finished phase 1 with 781 SingleSign rule and 0 generalized
[2026-05-25 10:38:24] [INFO ] Computed 5 invariants in 6 ms
Computed 5 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-11706539551856319497.kers
Total runtime 38 ms.
[2026-05-25 10:38:24] [INFO ] Implicit Places using invariants in 392 ms returned []
[2026-05-25 10:38:24] [INFO ] Invariant cache hit.
[2026-05-25 10:38:25] [INFO ] Implicit Places using invariants and state equation in 1062 ms returned []
Implicit Place search using SMT with State Equation took 1502 ms to find 0 implicit places.
Running 1022 sub problems to find dead transitions.
[2026-05-25 10:38:25] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/785 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1022 unsolved
SMT process timed out in 30200ms, After SMT, problems are : Problem set: 0 solved, 1022 unsolved
Search for dead transitions found 0 dead transitions in 30201ms
Starting structural reductions in LTL mode, iteration 1 : 786/849 places, 1023/1089 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32126 ms. Remains : 786/849 places, 1023/1089 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(p0)) U X(!p1))&&X(F(p2)))) U p0))'
Stuttering acceptance computed with spot in 339 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), true, p2, (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 p2)]
Running random walk in product with property : MedleyB-PT-B02-LTLFireability-12
Product exploration explored 100000 steps with 1277 reset in 171 ms.
Product exploration explored 100000 steps with 1284 reset in 173 ms.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Knowledge based reduction with 9 factoid took 90 ms. Reduced automaton from 9 states, 19 edges and 3 AP (stutter sensitive) to 9 states, 19 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (504 resets) in 295 ms. (135 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (106 resets) in 75 ms. (526 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (108 resets) in 43 ms. (909 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (103 resets) in 45 ms. (869 steps per ms) remains 9/13 properties
BEST_FIRST walk for 40004 steps (107 resets) in 50 ms. (784 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (103 resets) in 45 ms. (869 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (102 resets) in 49 ms. (800 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (108 resets) in 150 ms. (264 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (104 resets) in 95 ms. (416 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (109 resets) in 58 ms. (678 steps per ms) remains 9/9 properties
[2026-05-25 10:38:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
Problem apf11 is UNSAT
At refinement iteration 1 (OVERLAPS) 763/772 variables, 4/4 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/772 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 14/786 variables, 1/5 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/786 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1023/1809 variables, 786/791 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1809 variables, 0/791 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/1809 variables, 0/791 constraints. Problems are: Problem set: 5 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1809/1809 variables, and 791 constraints, problems are : Problem set: 5 solved, 4 unsolved in 1423 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 786/786 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 767/772 variables, 4/4 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/772 variables, 3/7 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/772 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 14/786 variables, 1/8 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/786 variables, 0/8 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1023/1809 variables, 786/794 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1809 variables, 4/798 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1809 variables, 0/798 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1809 variables, 0/798 constraints. Problems are: Problem set: 5 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1809/1809 variables, and 798 constraints, problems are : Problem set: 5 solved, 4 unsolved in 3768 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 786/786 constraints, PredecessorRefiner: 4/9 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5223ms problems are : Problem set: 5 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 441 ms.
Support contains 5 out of 786 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 786/786 places, 1023/1023 transitions.
Graph (trivial) has 775 edges and 786 vertex of which 64 / 786 are part of one of the 12 SCC in 1 ms
Free SCC test removed 52 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Graph (complete) has 1180 edges and 734 vertex of which 730 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 545 transitions
Trivial Post-agglo rules discarded 545 transitions
Performed 545 trivial Post agglomeration. Transition count delta: 545
Iterating post reduction 0 with 549 rules applied. Total rules applied 551 place count 730 transition count 402
Reduce places removed 545 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 556 rules applied. Total rules applied 1107 place count 185 transition count 391
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 8 rules applied. Total rules applied 1115 place count 181 transition count 387
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 1120 place count 177 transition count 386
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 44 Pre rules applied. Total rules applied 1120 place count 177 transition count 342
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 1208 place count 133 transition count 342
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1209 place count 133 transition count 341
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 1267 place count 104 transition count 312
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1275 place count 104 transition count 304
Discarding 23 places :
Symmetric choice reduction at 6 with 23 rule applications. Total rules 1298 place count 81 transition count 170
Iterating global reduction 6 with 23 rules applied. Total rules applied 1321 place count 81 transition count 170
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1332 place count 81 transition count 159
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1344 place count 69 transition count 147
Iterating global reduction 7 with 12 rules applied. Total rules applied 1356 place count 69 transition count 147
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1364 place count 61 transition count 139
Iterating global reduction 7 with 8 rules applied. Total rules applied 1372 place count 61 transition count 139
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1376 place count 61 transition count 135
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1384 place count 57 transition count 131
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1392 place count 53 transition count 152
Free-agglomeration rule applied 23 times with reduction of 6 identical transitions.
Iterating global reduction 8 with 23 rules applied. Total rules applied 1415 place count 53 transition count 123
Reduce places removed 23 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 30 rules applied. Total rules applied 1445 place count 30 transition count 116
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1449 place count 26 transition count 112
Iterating global reduction 9 with 4 rules applied. Total rules applied 1453 place count 26 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1454 place count 26 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 10 with 23 rules applied. Total rules applied 1477 place count 26 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1479 place count 25 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1481 place count 25 transition count 95
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1483 place count 25 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1484 place count 25 transition count 94
Applied a total of 1484 rules in 27 ms. Remains 25 /786 variables (removed 761) and now considering 94/1023 (removed 929) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 25/786 places, 94/1023 transitions.
RANDOM walk for 331 steps (0 resets) in 4 ms. (66 steps per ms) remains 0/2 properties
Found 5 invariant AP formulas.
Knowledge based reduction with 14 factoid took 152 ms. Reduced automaton from 9 states, 19 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (AND p2 (NOT p1)), true, p2]
[2026-05-25 10:39:03] [INFO ] Invariant cache hit.
Proved EG (NOT p0) asserting that LTL formula F !(NOT p0) is false.
Negative knowledge disproves property using: (F p0)
Knowledge-based reduction took 6919 ms.
FORMULA MedleyB-PT-B02-LTLFireability-12 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property MedleyB-PT-B02-LTLFireability-12 finished in 39794 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&(p0 U p1)))||G(p2)))'
Support contains 3 out of 849 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 849/849 places, 1089/1089 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 838 transition count 1078
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 838 transition count 1078
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 833 transition count 1073
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 833 transition count 1073
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 829 transition count 1069
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 829 transition count 1069
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 825 transition count 1065
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 825 transition count 1065
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 821 transition count 1061
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 821 transition count 1061
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 818 transition count 1058
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 818 transition count 1058
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 65 place count 815 transition count 1055
Iterating global reduction 0 with 3 rules applied. Total rules applied 68 place count 815 transition count 1055
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 812 transition count 1052
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 812 transition count 1052
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 77 place count 809 transition count 1049
Iterating global reduction 0 with 3 rules applied. Total rules applied 80 place count 809 transition count 1049
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 81 place count 809 transition count 1048
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 807 transition count 1046
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 807 transition count 1046
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 805 transition count 1044
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 805 transition count 1044
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 91 place count 803 transition count 1042
Iterating global reduction 1 with 2 rules applied. Total rules applied 93 place count 803 transition count 1042
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 94 place count 803 transition count 1041
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 802 transition count 1040
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 802 transition count 1040
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 801 transition count 1039
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 801 transition count 1039
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 800 transition count 1038
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 800 transition count 1038
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 101 place count 800 transition count 1037
Applied a total of 101 rules in 381 ms. Remains 800 /849 variables (removed 49) and now considering 1037/1089 (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-16782075994513676221.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13562467599699978277.kers'
[2026-05-25 10:39:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16782075994513676221.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13562467599699978277.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1037 rows 800 cols 3260 entries
Finished phase 1 with 795 SingleSign rule and 0 generalized
[2026-05-25 10:39:04] [INFO ] Computed 5 invariants in 4 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13562467599699978277.kers
Total runtime 6 ms.
[2026-05-25 10:39:04] [INFO ] Implicit Places using invariants in 439 ms returned []
[2026-05-25 10:39:04] [INFO ] Invariant cache hit.
[2026-05-25 10:39:05] [INFO ] Implicit Places using invariants and state equation in 949 ms returned []
Implicit Place search using SMT with State Equation took 1413 ms to find 0 implicit places.
Running 1036 sub problems to find dead transitions.
[2026-05-25 10:39:05] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 799/1837 variables, and 0 constraints, problems are : Problem set: 0 solved, 1036 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/800 constraints, PredecessorRefiner: 1036/1036 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1036 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 799/1837 variables, and 0 constraints, problems are : Problem set: 0 solved, 1036 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/800 constraints, PredecessorRefiner: 0/1036 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60360ms problems are : Problem set: 0 solved, 1036 unsolved
Search for dead transitions found 0 dead transitions in 60363ms
Starting structural reductions in LTL mode, iteration 1 : 800/849 places, 1037/1089 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62164 ms. Remains : 800/849 places, 1037/1089 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&(p0 U p1)))||G(p2)))'
Stuttering acceptance computed with spot in 268 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyB-PT-B02-LTLFireability-13
Product exploration explored 100000 steps with 1296 reset in 146 ms.
Product exploration explored 100000 steps with 1280 reset in 134 ms.
Computed a total of 164 stabilizing places and 172 stable transitions
Computed a total of 164 stabilizing places and 172 stable transitions
Detected a total of 164/800 stabilizing places and 172/1037 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 19 factoid took 63 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 9 states, 30 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (507 resets) in 388 ms. (102 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (109 resets) in 55 ms. (714 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (110 resets) in 77 ms. (512 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (107 resets) in 77 ms. (512 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (106 resets) in 42 ms. (930 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (107 resets) in 43 ms. (909 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (106 resets) in 42 ms. (930 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (108 resets) in 43 ms. (909 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (103 resets) in 62 ms. (634 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (106 resets) in 41 ms. (952 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (108 resets) in 45 ms. (869 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (110 resets) in 43 ms. (909 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (106 resets) in 41 ms. (952 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (110 resets) in 43 ms. (909 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 358245 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 13
Probabilistic random walk after 358245 steps, saw 72393 distinct states, run finished after 3007 ms. (steps per millisecond=119 ) properties seen :0
[2026-05-25 10:40:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem apf1 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 399/402 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 398/800 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/800 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/800 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 1037/1837 variables, 800/806 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1837 variables, 1/807 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1837 variables, 0/807 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/1837 variables, 0/807 constraints. Problems are: Problem set: 2 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1837/1837 variables, and 807 constraints, problems are : Problem set: 2 solved, 11 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 800/800 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 399/402 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 398/800 variables, 3/6 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/800 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 11 unsolved
Problem apf6 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/800 variables, 4/11 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/800 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 1037/1837 variables, 800/811 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1837 variables, 10/821 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1837 variables, 0/821 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/1837 variables, 0/821 constraints. Problems are: Problem set: 3 solved, 10 unsolved
No progress, stopping.
Error getting values : (error "Timeout of Z3 solver reached")
After SMT solving in domain Int declared 1837/1837 variables, and 821 constraints, problems are : Problem set: 3 solved, 10 unsolved in 5025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 800/800 constraints, PredecessorRefiner: 10/13 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10050ms problems are : Problem set: 3 solved, 10 unsolved
Fused 10 Parikh solutions to 2 different solutions.
Parikh walk visited 5 properties in 156 ms.
Support contains 3 out of 800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 1037/1037 transitions.
Graph (trivial) has 793 edges and 800 vertex of which 64 / 800 are part of one of the 12 SCC in 1 ms
Free SCC test removed 52 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Graph (complete) has 1196 edges and 748 vertex of which 744 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 564 rules applied. Total rules applied 566 place count 744 transition count 401
Reduce places removed 560 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 572 rules applied. Total rules applied 1138 place count 184 transition count 389
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 1143 place count 180 transition count 388
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1144 place count 179 transition count 388
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 46 Pre rules applied. Total rules applied 1144 place count 179 transition count 342
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1236 place count 133 transition count 342
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1237 place count 133 transition count 341
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 1293 place count 105 transition count 313
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 1301 place count 105 transition count 305
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 1325 place count 81 transition count 152
Iterating global reduction 6 with 24 rules applied. Total rules applied 1349 place count 81 transition count 152
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1361 place count 81 transition count 140
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 1373 place count 69 transition count 128
Iterating global reduction 7 with 12 rules applied. Total rules applied 1385 place count 69 transition count 128
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1392 place count 62 transition count 121
Iterating global reduction 7 with 7 rules applied. Total rules applied 1399 place count 62 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1402 place count 62 transition count 118
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1410 place count 58 transition count 114
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1418 place count 54 transition count 142
Free-agglomeration rule applied 23 times with reduction of 7 identical transitions.
Iterating global reduction 8 with 23 rules applied. Total rules applied 1441 place count 54 transition count 112
Reduce places removed 23 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 41 rules applied. Total rules applied 1482 place count 31 transition count 94
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1486 place count 27 transition count 90
Iterating global reduction 9 with 4 rules applied. Total rules applied 1490 place count 27 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1491 place count 27 transition count 89
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 10 with 24 rules applied. Total rules applied 1515 place count 27 transition count 65
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 1519 place count 25 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1521 place count 25 transition count 81
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1522 place count 25 transition count 81
Applied a total of 1522 rules in 37 ms. Remains 25 /800 variables (removed 775) and now considering 81/1037 (removed 956) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 25/800 places, 81/1037 transitions.
RANDOM walk for 232 steps (0 resets) in 4 ms. (46 steps per ms) remains 0/5 properties
Found 3 invariant AP formulas.
Negative knowledge disproves property using: (G (OR p0 p1 p2))
Knowledge based reduction with 22 factoid took 38 ms. Proved property starting from automaton with 9 states, 30 edges and 3 AP (stutter insensitive
Knowledge-based reduction took 13713 ms.
FORMULA MedleyB-PT-B02-LTLFireability-13 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property MedleyB-PT-B02-LTLFireability-13 finished in 76483 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(((p0 U X(p1))&&F(p2))))'
Support contains 3 out of 849 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 849/849 places, 1089/1089 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 837 transition count 1077
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 837 transition count 1077
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 831 transition count 1071
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 831 transition count 1071
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 826 transition count 1066
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 826 transition count 1066
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 821 transition count 1061
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 821 transition count 1061
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 61 place count 816 transition count 1056
Iterating global reduction 0 with 5 rules applied. Total rules applied 66 place count 816 transition count 1056
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 812 transition count 1052
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 812 transition count 1052
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 808 transition count 1048
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 808 transition count 1048
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 86 place count 804 transition count 1044
Iterating global reduction 0 with 4 rules applied. Total rules applied 90 place count 804 transition count 1044
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 94 place count 800 transition count 1040
Iterating global reduction 0 with 4 rules applied. Total rules applied 98 place count 800 transition count 1040
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 99 place count 800 transition count 1039
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 101 place count 798 transition count 1037
Iterating global reduction 1 with 2 rules applied. Total rules applied 103 place count 798 transition count 1037
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 105 place count 796 transition count 1035
Iterating global reduction 1 with 2 rules applied. Total rules applied 107 place count 796 transition count 1035
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 109 place count 794 transition count 1033
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 794 transition count 1033
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 112 place count 794 transition count 1032
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 793 transition count 1031
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 793 transition count 1031
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 792 transition count 1030
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 792 transition count 1030
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 791 transition count 1029
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 791 transition count 1029
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 119 place count 791 transition count 1028
Applied a total of 119 rules in 284 ms. Remains 791 /849 variables (removed 58) and now considering 1028/1089 (removed 61) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4497996475326190873.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16378091019227823126.kers'
[2026-05-25 10:40:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4497996475326190873.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16378091019227823126.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1028 rows 791 cols 3240 entries
Finished phase 1 with 786 SingleSign rule and 0 generalized
[2026-05-25 10:40:20] [INFO ] Computed 5 invariants in 14 ms
Computed 5 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-16378091019227823126.kers
Total runtime 18 ms.
[2026-05-25 10:40:21] [INFO ] Implicit Places using invariants in 624 ms returned []
[2026-05-25 10:40:21] [INFO ] Invariant cache hit.
[2026-05-25 10:40:22] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 1643 ms to find 0 implicit places.
Running 1027 sub problems to find dead transitions.
[2026-05-25 10:40:22] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/790 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
SMT process timed out in 30233ms, After SMT, problems are : Problem set: 0 solved, 1027 unsolved
Search for dead transitions found 0 dead transitions in 30235ms
Starting structural reductions in LTL mode, iteration 1 : 791/849 places, 1028/1089 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32166 ms. Remains : 791/849 places, 1028/1089 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 U X(p1))&&F(p2))))'
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1)]
Running random walk in product with property : MedleyB-PT-B02-LTLFireability-15
Stuttering criterion allowed to conclude after 61 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B02-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B02-LTLFireability-15 finished in 32410 ms.
All properties solved by simple procedures.
Total runtime 635599 ms.

BK_STOP 1779705652657

--------------------
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="MedleyB-PT-B02"
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 MedleyB-PT-B02, 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-177969020100292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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