fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r178-oct2-177969020100291
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for MedleyB-PT-B02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
845.659 333894.00 454490.00 177.70 FFFFFTFFTTFTTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969020100291.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020100291
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME MedleyB-PT-B02-LTLCardinality-01
FORMULA_NAME MedleyB-PT-B02-LTLCardinality-02
FORMULA_NAME MedleyB-PT-B02-LTLCardinality-03
FORMULA_NAME MedleyB-PT-B02-LTLCardinality-04
FORMULA_NAME MedleyB-PT-B02-LTLCardinality-05
FORMULA_NAME MedleyB-PT-B02-LTLCardinality-06
FORMULA_NAME MedleyB-PT-B02-LTLCardinality-07
FORMULA_NAME MedleyB-PT-B02-LTLCardinality-08
FORMULA_NAME MedleyB-PT-B02-LTLCardinality-09
FORMULA_NAME MedleyB-PT-B02-LTLCardinality-10
FORMULA_NAME MedleyB-PT-B02-LTLCardinality-11
FORMULA_NAME MedleyB-PT-B02-LTLCardinality-12
FORMULA_NAME MedleyB-PT-B02-LTLCardinality-13
FORMULA_NAME MedleyB-PT-B02-LTLCardinality-14
FORMULA_NAME MedleyB-PT-B02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779705007681

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
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
LTLCardinality PT
Running Version 202604301425
[2026-05-25 10:30:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 10:30:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 10:30:09] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2026-05-25 10:30:09] [INFO ] Transformed 1227 places.
[2026-05-25 10:30:09] [INFO ] Transformed 1472 transitions.
[2026-05-25 10:30:09] [INFO ] Found NUPN structural information;
[2026-05-25 10:30:09] [INFO ] Parsed PT model containing 1227 places and 1472 transitions and 4160 arcs in 236 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MedleyB-PT-B02-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B02-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B02-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B02-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B02-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B02-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B02-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B02-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 1227 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1227/1227 places, 1472/1472 transitions.
Discarding 95 places :
Symmetric choice reduction at 0 with 95 rule applications. Total rules 95 place count 1132 transition count 1377
Iterating global reduction 0 with 95 rules applied. Total rules applied 190 place count 1132 transition count 1377
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 250 place count 1072 transition count 1317
Iterating global reduction 0 with 60 rules applied. Total rules applied 310 place count 1072 transition count 1317
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 343 place count 1039 transition count 1284
Iterating global reduction 0 with 33 rules applied. Total rules applied 376 place count 1039 transition count 1284
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 405 place count 1010 transition count 1255
Iterating global reduction 0 with 29 rules applied. Total rules applied 434 place count 1010 transition count 1255
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 458 place count 986 transition count 1231
Iterating global reduction 0 with 24 rules applied. Total rules applied 482 place count 986 transition count 1231
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 505 place count 963 transition count 1208
Iterating global reduction 0 with 23 rules applied. Total rules applied 528 place count 963 transition count 1208
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 551 place count 940 transition count 1185
Iterating global reduction 0 with 23 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 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 639 place count 898 transition count 1143
Iterating global reduction 0 with 19 rules applied. Total rules applied 658 place count 898 transition count 1143
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 673 place count 883 transition count 1128
Iterating global reduction 0 with 15 rules applied. Total rules applied 688 place count 883 transition count 1128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 691 place count 883 transition count 1125
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 696 place count 878 transition count 1120
Iterating global reduction 1 with 5 rules applied. Total rules applied 701 place count 878 transition count 1120
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 706 place count 873 transition count 1115
Iterating global reduction 1 with 5 rules applied. Total rules applied 711 place count 873 transition count 1115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 712 place count 872 transition count 1114
Iterating global reduction 1 with 1 rules applied. Total rules applied 713 place count 872 transition count 1114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 714 place count 871 transition count 1113
Iterating global reduction 1 with 1 rules applied. Total rules applied 715 place count 871 transition count 1113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 716 place count 870 transition count 1112
Iterating global reduction 1 with 1 rules applied. Total rules applied 717 place count 870 transition count 1112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 718 place count 869 transition count 1111
Iterating global reduction 1 with 1 rules applied. Total rules applied 719 place count 869 transition count 1111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 720 place count 868 transition count 1110
Iterating global reduction 1 with 1 rules applied. Total rules applied 721 place count 868 transition count 1110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 722 place count 867 transition count 1109
Iterating global reduction 1 with 1 rules applied. Total rules applied 723 place count 867 transition count 1109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 724 place count 866 transition count 1108
Iterating global reduction 1 with 1 rules applied. Total rules applied 725 place count 866 transition count 1108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 726 place count 865 transition count 1107
Iterating global reduction 1 with 1 rules applied. Total rules applied 727 place count 865 transition count 1107
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 728 place count 864 transition count 1106
Iterating global reduction 1 with 1 rules applied. Total rules applied 729 place count 864 transition count 1106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 730 place count 863 transition count 1105
Iterating global reduction 1 with 1 rules applied. Total rules applied 731 place count 863 transition count 1105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 732 place count 863 transition count 1104
Applied a total of 732 rules in 1023 ms. Remains 863 /1227 variables (removed 364) and now considering 1104/1472 (removed 368) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2362065863436741915.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15295524182689451392.kers'
[2026-05-25 10:30:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2362065863436741915.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15295524182689451392.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1104 rows 863 cols 3408 entries
Finished phase 1 with 858 SingleSign rule and 0 generalized
[2026-05-25 10:30:10] [INFO ] Computed 5 invariants in 9 ms
Computed 5 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-15295524182689451392.kers
Total runtime 11 ms.
[2026-05-25 10:30:11] [INFO ] Implicit Places using invariants in 976 ms returned []
[2026-05-25 10:30:11] [INFO ] Invariant cache hit.
[2026-05-25 10:30:12] [INFO ] Implicit Places using invariants and state equation in 1322 ms returned []
Implicit Place search using SMT with State Equation took 2333 ms to find 0 implicit places.
Running 1103 sub problems to find dead transitions.
[2026-05-25 10:30:12] [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 862/1967 variables, and 0 constraints, problems are : Problem set: 0 solved, 1103 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/863 constraints, PredecessorRefiner: 1103/1103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1103 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 862/1967 variables, and 0 constraints, problems are : Problem set: 0 solved, 1103 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/863 constraints, PredecessorRefiner: 0/1103 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60555ms problems are : Problem set: 0 solved, 1103 unsolved
Search for dead transitions found 0 dead transitions in 60577ms
Starting structural reductions in LTL mode, iteration 1 : 863/1227 places, 1104/1472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63972 ms. Remains : 863/1227 places, 1104/1472 transitions.
Starting structural reductions in LTL mode, iteration 0 : 863/863 places, 1104/1104 transitions.
Applied a total of 0 rules in 38 ms. Remains 863 /863 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
[2026-05-25 10:31:13] [INFO ] Invariant cache hit.
[2026-05-25 10:31:14] [INFO ] Implicit Places using invariants in 502 ms returned []
[2026-05-25 10:31:14] [INFO ] Invariant cache hit.
[2026-05-25 10:31:14] [INFO ] Implicit Places using invariants and state equation in 928 ms returned []
Implicit Place search using SMT with State Equation took 1447 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1485 ms. Remains : 863/863 places, 1104/1104 transitions.
Support contains 24 out of 863 places after structural reductions.
[2026-05-25 10:31:15] [INFO ] Flatten gal took : 89 ms
[2026-05-25 10:31:15] [INFO ] Flatten gal took : 48 ms
[2026-05-25 10:31:15] [INFO ] Input system was already deterministic with 1104 transitions.
RANDOM walk for 40000 steps (516 resets) in 1235 ms. (32 steps per ms) remains 4/13 properties
BEST_FIRST walk for 40003 steps (110 resets) in 121 ms. (327 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (109 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (106 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (107 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
[2026-05-25 10:31:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 649/657 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/657 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 206/863 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/863 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1104/1967 variables, 863/868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1967 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/1967 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1967/1967 variables, and 868 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 863/863 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 649/657 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/657 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/657 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 206/863 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/863 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1104/1967 variables, 863/870 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1967 variables, 4/874 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1967 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1967 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1967/1967 variables, and 874 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3212 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 863/863 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4253ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 1 properties in 673 ms.
Support contains 6 out of 863 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 863/863 places, 1104/1104 transitions.
Graph (trivial) has 848 edges and 863 vertex of which 64 / 863 are part of one of the 12 SCC in 6 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 1277 edges and 811 vertex of which 807 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 600 transitions
Trivial Post-agglo rules discarded 600 transitions
Performed 600 trivial Post agglomeration. Transition count delta: 600
Iterating post reduction 0 with 604 rules applied. Total rules applied 606 place count 807 transition count 428
Reduce places removed 600 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 614 rules applied. Total rules applied 1220 place count 207 transition count 414
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 1228 place count 201 transition count 412
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1230 place count 199 transition count 412
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1230 place count 199 transition count 365
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1324 place count 152 transition count 365
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1328 place count 148 transition count 361
Iterating global reduction 4 with 4 rules applied. Total rules applied 1332 place count 148 transition count 361
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1332 place count 148 transition count 360
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 1334 place count 147 transition count 360
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1335 place count 146 transition count 359
Iterating global reduction 4 with 1 rules applied. Total rules applied 1336 place count 146 transition count 359
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 1396 place count 116 transition count 329
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 1406 place count 116 transition count 319
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1431 place count 91 transition count 165
Iterating global reduction 5 with 25 rules applied. Total rules applied 1456 place count 91 transition count 165
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1468 place count 91 transition count 153
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1480 place count 79 transition count 141
Iterating global reduction 6 with 12 rules applied. Total rules applied 1492 place count 79 transition count 141
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1499 place count 72 transition count 134
Iterating global reduction 6 with 7 rules applied. Total rules applied 1506 place count 72 transition count 134
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1509 place count 72 transition count 131
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 1517 place count 68 transition count 127
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1523 place count 65 transition count 150
Free-agglomeration rule applied 23 times with reduction of 6 identical transitions.
Iterating global reduction 7 with 23 rules applied. Total rules applied 1546 place count 65 transition count 121
Reduce places removed 23 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 34 rules applied. Total rules applied 1580 place count 42 transition count 110
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1584 place count 38 transition count 106
Iterating global reduction 8 with 4 rules applied. Total rules applied 1588 place count 38 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1589 place count 38 transition count 105
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 9 with 32 rules applied. Total rules applied 1621 place count 38 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1623 place count 37 transition count 76
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1624 place count 37 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1625 place count 36 transition count 75
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1628 place count 36 transition count 75
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 1630 place count 36 transition count 73
Applied a total of 1630 rules in 100 ms. Remains 36 /863 variables (removed 827) and now considering 73/1104 (removed 1031) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 36/863 places, 73/1104 transitions.
RANDOM walk for 371 steps (0 resets) in 10 ms. (33 steps per ms) remains 0/3 properties
FORMULA MedleyB-PT-B02-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA MedleyB-PT-B02-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 179 stabilizing places and 187 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(p0))))'
Support contains 1 out of 863 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 863/863 places, 1104/1104 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 856 transition count 1097
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 856 transition count 1097
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 850 transition count 1091
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 850 transition count 1091
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 844 transition count 1085
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 844 transition count 1085
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 838 transition count 1079
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 838 transition count 1079
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 832 transition count 1073
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 832 transition count 1073
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 826 transition count 1067
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 826 transition count 1067
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 821 transition count 1062
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 821 transition count 1062
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 89 place count 816 transition count 1057
Iterating global reduction 0 with 5 rules applied. Total rules applied 94 place count 816 transition count 1057
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 99 place count 811 transition count 1052
Iterating global reduction 0 with 5 rules applied. Total rules applied 104 place count 811 transition count 1052
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 108 place count 807 transition count 1048
Iterating global reduction 0 with 4 rules applied. Total rules applied 112 place count 807 transition count 1048
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 113 place count 807 transition count 1047
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 116 place count 804 transition count 1044
Iterating global reduction 1 with 3 rules applied. Total rules applied 119 place count 804 transition count 1044
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 122 place count 801 transition count 1041
Iterating global reduction 1 with 3 rules applied. Total rules applied 125 place count 801 transition count 1041
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 126 place count 801 transition count 1040
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 128 place count 799 transition count 1038
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 799 transition count 1038
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 132 place count 797 transition count 1036
Iterating global reduction 2 with 2 rules applied. Total rules applied 134 place count 797 transition count 1036
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 136 place count 795 transition count 1034
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 795 transition count 1034
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 140 place count 793 transition count 1032
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 793 transition count 1032
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 144 place count 791 transition count 1030
Iterating global reduction 2 with 2 rules applied. Total rules applied 146 place count 791 transition count 1030
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 147 place count 791 transition count 1029
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 148 place count 790 transition count 1028
Iterating global reduction 3 with 1 rules applied. Total rules applied 149 place count 790 transition count 1028
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 150 place count 789 transition count 1027
Iterating global reduction 3 with 1 rules applied. Total rules applied 151 place count 789 transition count 1027
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 152 place count 788 transition count 1026
Iterating global reduction 3 with 1 rules applied. Total rules applied 153 place count 788 transition count 1026
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 154 place count 787 transition count 1025
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 787 transition count 1025
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 156 place count 786 transition count 1024
Iterating global reduction 3 with 1 rules applied. Total rules applied 157 place count 786 transition count 1024
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 158 place count 786 transition count 1023
Applied a total of 158 rules in 535 ms. Remains 786 /863 variables (removed 77) and now considering 1023/1104 (removed 81) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6055561641893401607.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10125460343244645624.kers'
[2026-05-25 10:31:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6055561641893401607.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10125460343244645624.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:21] [INFO ] Computed 5 invariants in 13 ms
Computed 5 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-10125460343244645624.kers
Total runtime 14 ms.
[2026-05-25 10:31:22] [INFO ] Implicit Places using invariants in 562 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 927 ms returned []
Implicit Place search using SMT with State Equation took 1494 ms to find 0 implicit places.
Running 1022 sub problems to find dead transitions.
[2026-05-25 10:31:23] [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 785/1809 variables, and 0 constraints, problems are : Problem set: 0 solved, 1022 unsolved in 30039 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 30044 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 60306ms problems are : Problem set: 0 solved, 1022 unsolved
Search for dead transitions found 0 dead transitions in 60312ms
Starting structural reductions in LTL mode, iteration 1 : 786/863 places, 1023/1104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62349 ms. Remains : 786/863 places, 1023/1104 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 300 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B02-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA MedleyB-PT-B02-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B02-LTLCardinality-01 finished in 62746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 863 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 863/863 places, 1104/1104 transitions.
Graph (trivial) has 854 edges and 863 vertex of which 64 / 863 are part of one of the 12 SCC in 2 ms
Free SCC test removed 52 places
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 599 transitions
Trivial Post-agglo rules discarded 599 transitions
Performed 599 trivial Post agglomeration. Transition count delta: 599
Iterating post reduction 0 with 599 rules applied. Total rules applied 600 place count 810 transition count 444
Reduce places removed 599 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 613 rules applied. Total rules applied 1213 place count 211 transition count 430
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 1220 place count 205 transition count 429
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1221 place count 204 transition count 429
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 43 Pre rules applied. Total rules applied 1221 place count 204 transition count 386
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 1307 place count 161 transition count 386
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1315 place count 153 transition count 378
Iterating global reduction 4 with 8 rules applied. Total rules applied 1323 place count 153 transition count 378
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1323 place count 153 transition count 377
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 1325 place count 152 transition count 377
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1328 place count 149 transition count 374
Iterating global reduction 4 with 3 rules applied. Total rules applied 1331 place count 149 transition count 374
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1333 place count 147 transition count 372
Iterating global reduction 4 with 2 rules applied. Total rules applied 1335 place count 147 transition count 372
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1337 place count 145 transition count 370
Iterating global reduction 4 with 2 rules applied. Total rules applied 1339 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 1340 place count 145 transition count 369
Performed 31 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 1402 place count 114 transition count 337
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 1425 place count 91 transition count 188
Iterating global reduction 5 with 23 rules applied. Total rules applied 1448 place count 91 transition count 188
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1460 place count 91 transition count 176
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 1472 place count 79 transition count 160
Iterating global reduction 6 with 12 rules applied. Total rules applied 1484 place count 79 transition count 160
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 1495 place count 68 transition count 145
Iterating global reduction 6 with 11 rules applied. Total rules applied 1506 place count 68 transition count 145
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1510 place count 68 transition count 141
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -14
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 1526 place count 60 transition count 155
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1527 place count 59 transition count 147
Iterating global reduction 7 with 1 rules applied. Total rules applied 1528 place count 59 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1529 place count 59 transition count 146
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 1533 place count 59 transition count 142
Applied a total of 1533 rules in 84 ms. Remains 59 /863 variables (removed 804) and now considering 142/1104 (removed 962) transitions.
[2026-05-25 10:32:24] [INFO ] Flow matrix only has 137 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-1540406913411316027.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10985862356369416800.kers'
[2026-05-25 10:32:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1540406913411316027.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10985862356369416800.kers]
Normalized transition count is 136 out of 137 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 136 rows 58 cols 573 entries
Finished phase 1 with 57 SingleSign rule and 0 generalized
[2026-05-25 10:32:24] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10985862356369416800.kers
Total runtime 1 ms.
[2026-05-25 10:32:24] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-25 10:32:24] [INFO ] Flow matrix only has 137 transitions (discarded 5 similar events)
[2026-05-25 10:32:24] [INFO ] Invariant cache hit.
[2026-05-25 10:32:24] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-25 10:32:24] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2026-05-25 10:32:24] [INFO ] Redundant transitions in 2 ms returned []
Running 117 sub problems to find dead transitions.
[2026-05-25 10:32:24] [INFO ] Flow matrix only has 137 transitions (discarded 5 similar events)
[2026-05-25 10:32:24] [INFO ] Invariant cache hit.
[2026-05-25 10:32:24] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 136/195 variables, 59/76 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 1/196 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 12 (OVERLAPS) 0/196 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 93 constraints, problems are : Problem set: 0 solved, 117 unsolved in 9235 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 136/195 variables, 59/78 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 14/92 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 117/209 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 1/196 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 12 (OVERLAPS) 0/196 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 211 constraints, problems are : Problem set: 0 solved, 117 unsolved in 19755 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29018ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 29018ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/863 places, 142/1104 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29280 ms. Remains : 59/863 places, 142/1104 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B02-LTLCardinality-02
Product exploration explored 100000 steps with 1361 reset in 185 ms.
Product exploration explored 100000 steps with 170 reset in 74 ms.
Computed a total of 4 stabilizing places and 27 stable transitions
Computed a total of 4 stabilizing places and 27 stable transitions
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (5550 resets) in 554 ms. (72 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (600 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 76914 steps, run visited all 1 properties in 99 ms. (steps per millisecond=776 )
Probabilistic random walk after 76914 steps, saw 17256 distinct states, run finished after 103 ms. (steps per millisecond=746 ) properties seen :1
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 559 ms.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 142/142 transitions.
Applied a total of 0 rules in 10 ms. Remains 59 /59 variables (removed 0) and now considering 142/142 (removed 0) transitions.
[2026-05-25 10:32:54] [INFO ] Flow matrix only has 137 transitions (discarded 5 similar events)
[2026-05-25 10:32:54] [INFO ] Invariant cache hit.
[2026-05-25 10:32:54] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-25 10:32:54] [INFO ] Flow matrix only has 137 transitions (discarded 5 similar events)
[2026-05-25 10:32:54] [INFO ] Invariant cache hit.
[2026-05-25 10:32:54] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-25 10:32:54] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2026-05-25 10:32:54] [INFO ] Redundant transitions in 6 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 277 ms. Remains : 59/59 places, 142/142 transitions.
Computed a total of 4 stabilizing places and 27 stable transitions
Computed a total of 4 stabilizing places and 27 stable transitions
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (5580 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (591 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 76914 steps, run visited all 1 properties in 77 ms. (steps per millisecond=998 )
Probabilistic random walk after 76914 steps, saw 17256 distinct states, run finished after 77 ms. (steps per millisecond=998 ) properties seen :1
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 444 ms.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1313 reset in 121 ms.
Product exploration explored 100000 steps with 5404 reset in 120 ms.
Built C files in :
/tmp/ltsmin13535442405514216613
[2026-05-25 10:32:55] [INFO ] Computing symmetric may disable matrix : 142 transitions.
[2026-05-25 10:32:55] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:32:55] [INFO ] Computing symmetric may enable matrix : 142 transitions.
[2026-05-25 10:32:55] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:32:55] [INFO ] Computing Do-Not-Accords matrix : 142 transitions.
[2026-05-25 10:32:55] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:32:55] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13535442405514216613
Running compilation step : cd /tmp/ltsmin13535442405514216613;'/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 489 ms.
Running link step : cd /tmp/ltsmin13535442405514216613;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin13535442405514216613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9366676347731034035.hoa' '--buchi-type=spotba'
LTSmin run took 455 ms.
FORMULA MedleyB-PT-B02-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyB-PT-B02-LTLCardinality-02 finished in 32734 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 863 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 863/863 places, 1104/1104 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 856 transition count 1097
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 856 transition count 1097
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 850 transition count 1091
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 850 transition count 1091
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 844 transition count 1085
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 844 transition count 1085
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 838 transition count 1079
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 838 transition count 1079
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 832 transition count 1073
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 832 transition count 1073
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 826 transition count 1067
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 826 transition count 1067
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 821 transition count 1062
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 821 transition count 1062
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 89 place count 816 transition count 1057
Iterating global reduction 0 with 5 rules applied. Total rules applied 94 place count 816 transition count 1057
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 99 place count 811 transition count 1052
Iterating global reduction 0 with 5 rules applied. Total rules applied 104 place count 811 transition count 1052
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 108 place count 807 transition count 1048
Iterating global reduction 0 with 4 rules applied. Total rules applied 112 place count 807 transition count 1048
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 113 place count 807 transition count 1047
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 116 place count 804 transition count 1044
Iterating global reduction 1 with 3 rules applied. Total rules applied 119 place count 804 transition count 1044
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 122 place count 801 transition count 1041
Iterating global reduction 1 with 3 rules applied. Total rules applied 125 place count 801 transition count 1041
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 126 place count 801 transition count 1040
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 128 place count 799 transition count 1038
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 799 transition count 1038
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 132 place count 797 transition count 1036
Iterating global reduction 2 with 2 rules applied. Total rules applied 134 place count 797 transition count 1036
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 136 place count 795 transition count 1034
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 795 transition count 1034
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 140 place count 793 transition count 1032
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 793 transition count 1032
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 144 place count 791 transition count 1030
Iterating global reduction 2 with 2 rules applied. Total rules applied 146 place count 791 transition count 1030
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 147 place count 791 transition count 1029
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 148 place count 790 transition count 1028
Iterating global reduction 3 with 1 rules applied. Total rules applied 149 place count 790 transition count 1028
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 150 place count 789 transition count 1027
Iterating global reduction 3 with 1 rules applied. Total rules applied 151 place count 789 transition count 1027
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 152 place count 788 transition count 1026
Iterating global reduction 3 with 1 rules applied. Total rules applied 153 place count 788 transition count 1026
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 154 place count 787 transition count 1025
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 787 transition count 1025
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 156 place count 786 transition count 1024
Iterating global reduction 3 with 1 rules applied. Total rules applied 157 place count 786 transition count 1024
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 158 place count 786 transition count 1023
Applied a total of 158 rules in 448 ms. Remains 786 /863 variables (removed 77) and now considering 1023/1104 (removed 81) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-936627960151443004.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4332599845243766816.kers'
[2026-05-25 10:32:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-936627960151443004.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4332599845243766816.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:32:57] [INFO ] Computed 5 invariants in 13 ms
Computed 5 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-4332599845243766816.kers
Total runtime 16 ms.
[2026-05-25 10:32:57] [INFO ] Implicit Places using invariants in 436 ms returned []
[2026-05-25 10:32:57] [INFO ] Invariant cache hit.
[2026-05-25 10:32:58] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1302 ms to find 0 implicit places.
Running 1022 sub problems to find dead transitions.
[2026-05-25 10:32:58] [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 30029 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 30041 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 60361ms problems are : Problem set: 0 solved, 1022 unsolved
Search for dead transitions found 0 dead transitions in 60364ms
Starting structural reductions in LTL mode, iteration 1 : 786/863 places, 1023/1104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62118 ms. Remains : 786/863 places, 1023/1104 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 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B02-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B02-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B02-LTLCardinality-07 finished in 62249 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 3 out of 863 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 863/863 places, 1104/1104 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 857 transition count 1098
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 857 transition count 1098
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 852 transition count 1093
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 852 transition count 1093
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 847 transition count 1088
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 847 transition count 1088
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 842 transition count 1083
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 842 transition count 1083
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 837 transition count 1078
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 837 transition count 1078
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 832 transition count 1073
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 832 transition count 1073
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 828 transition count 1069
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 828 transition count 1069
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 74 place count 824 transition count 1065
Iterating global reduction 0 with 4 rules applied. Total rules applied 78 place count 824 transition count 1065
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 820 transition count 1061
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 820 transition count 1061
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 89 place count 817 transition count 1058
Iterating global reduction 0 with 3 rules applied. Total rules applied 92 place count 817 transition count 1058
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 93 place count 817 transition count 1057
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 95 place count 815 transition count 1055
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 815 transition count 1055
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 813 transition count 1053
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 813 transition count 1053
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 102 place count 813 transition count 1052
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 812 transition count 1051
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 812 transition count 1051
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 811 transition count 1050
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 811 transition count 1050
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 810 transition count 1049
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 810 transition count 1049
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 809 transition count 1048
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 809 transition count 1048
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 808 transition count 1047
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 808 transition count 1047
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 807 transition count 1046
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 807 transition count 1046
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 806 transition count 1045
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 806 transition count 1045
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 805 transition count 1044
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 805 transition count 1044
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 804 transition count 1043
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 804 transition count 1043
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 803 transition count 1042
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 803 transition count 1042
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 123 place count 803 transition count 1041
Applied a total of 123 rules in 471 ms. Remains 803 /863 variables (removed 60) and now considering 1041/1104 (removed 63) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11703787397484217427.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1644960533461411745.kers'
[2026-05-25 10:33:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11703787397484217427.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1644960533461411745.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1041 rows 803 cols 3272 entries
Finished phase 1 with 798 SingleSign rule and 0 generalized
[2026-05-25 10:33:59] [INFO ] Computed 5 invariants in 5 ms
Computed 5 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-1644960533461411745.kers
Total runtime 7 ms.
[2026-05-25 10:33:59] [INFO ] Implicit Places using invariants in 389 ms returned []
[2026-05-25 10:33:59] [INFO ] Invariant cache hit.
[2026-05-25 10:34:00] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1314 ms to find 0 implicit places.
Running 1040 sub problems to find dead transitions.
[2026-05-25 10:34:00] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/802 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1040 unsolved
SMT process timed out in 30299ms, After SMT, problems are : Problem set: 0 solved, 1040 unsolved
Search for dead transitions found 0 dead transitions in 30304ms
Starting structural reductions in LTL mode, iteration 1 : 803/863 places, 1041/1104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32096 ms. Remains : 803/863 places, 1041/1104 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : MedleyB-PT-B02-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 277 ms.
Product exploration explored 100000 steps with 50000 reset in 254 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/803 stabilizing places and 172/1041 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 10 factoid took 10 ms. Proved property starting from automaton with 5 states, 9 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 21 ms.
FORMULA MedleyB-PT-B02-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyB-PT-B02-LTLCardinality-09 finished in 32935 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(F(p1)))))))'
Support contains 4 out of 863 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 863/863 places, 1104/1104 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 856 transition count 1097
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 856 transition count 1097
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 850 transition count 1091
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 850 transition count 1091
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 844 transition count 1085
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 844 transition count 1085
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 838 transition count 1079
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 838 transition count 1079
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 832 transition count 1073
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 832 transition count 1073
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 68 place count 826 transition count 1067
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 826 transition count 1067
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 79 place count 821 transition count 1062
Iterating global reduction 0 with 5 rules applied. Total rules applied 84 place count 821 transition count 1062
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 89 place count 816 transition count 1057
Iterating global reduction 0 with 5 rules applied. Total rules applied 94 place count 816 transition count 1057
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 99 place count 811 transition count 1052
Iterating global reduction 0 with 5 rules applied. Total rules applied 104 place count 811 transition count 1052
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 108 place count 807 transition count 1048
Iterating global reduction 0 with 4 rules applied. Total rules applied 112 place count 807 transition count 1048
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 113 place count 807 transition count 1047
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 116 place count 804 transition count 1044
Iterating global reduction 1 with 3 rules applied. Total rules applied 119 place count 804 transition count 1044
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 122 place count 801 transition count 1041
Iterating global reduction 1 with 3 rules applied. Total rules applied 125 place count 801 transition count 1041
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 126 place count 801 transition count 1040
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 800 transition count 1039
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 800 transition count 1039
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 799 transition count 1038
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 799 transition count 1038
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 131 place count 798 transition count 1037
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 798 transition count 1037
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 133 place count 797 transition count 1036
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 797 transition count 1036
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 135 place count 796 transition count 1035
Iterating global reduction 2 with 1 rules applied. Total rules applied 136 place count 796 transition count 1035
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 137 place count 796 transition count 1034
Applied a total of 137 rules in 324 ms. Remains 796 /863 variables (removed 67) and now considering 1034/1104 (removed 70) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18314944408281269974.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3549594602115700628.kers'
[2026-05-25 10:34:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18314944408281269974.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3549594602115700628.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1034 rows 796 cols 3256 entries
Finished phase 1 with 791 SingleSign rule and 0 generalized
[2026-05-25 10:34:32] [INFO ] Computed 5 invariants in 11 ms
Computed 5 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-3549594602115700628.kers
Total runtime 14 ms.
[2026-05-25 10:34:32] [INFO ] Implicit Places using invariants in 438 ms returned []
[2026-05-25 10:34:32] [INFO ] Invariant cache hit.
[2026-05-25 10:34:33] [INFO ] Implicit Places using invariants and state equation in 791 ms returned []
Implicit Place search using SMT with State Equation took 1245 ms to find 0 implicit places.
Running 1033 sub problems to find dead transitions.
[2026-05-25 10:34:33] [INFO ] Invariant cache hit.
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 0 (INCLUDED_ONLY) 0/795 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1033 unsolved
SMT process timed out in 30197ms, After SMT, problems are : Problem set: 0 solved, 1033 unsolved
Search for dead transitions found 0 dead transitions in 30199ms
Starting structural reductions in LTL mode, iteration 1 : 796/863 places, 1034/1104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31774 ms. Remains : 796/863 places, 1034/1104 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((X(F(p0))&&p1)))))'
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyB-PT-B02-LTLCardinality-10
Stuttering criterion allowed to conclude after 81 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B02-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B02-LTLCardinality-10 finished in 31948 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) U p1)&&X(p2)))))'
Support contains 6 out of 863 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 863/863 places, 1104/1104 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 858 transition count 1099
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 858 transition count 1099
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 854 transition count 1095
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 854 transition count 1095
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 850 transition count 1091
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 850 transition count 1091
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 846 transition count 1087
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 846 transition count 1087
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 842 transition count 1083
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 842 transition count 1083
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 838 transition count 1079
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 838 transition count 1079
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 834 transition count 1075
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 834 transition count 1075
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 831 transition count 1072
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 831 transition count 1072
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 828 transition count 1069
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 828 transition count 1069
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 826 transition count 1067
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 826 transition count 1067
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 75 place count 826 transition count 1066
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 825 transition count 1065
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 825 transition count 1065
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 824 transition count 1064
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 824 transition count 1064
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 824 transition count 1063
Applied a total of 80 rules in 241 ms. Remains 824 /863 variables (removed 39) and now considering 1063/1104 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8324638724230598221.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-680225416550068921.kers'
[2026-05-25 10:35:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8324638724230598221.kers, --Pflows, --basisKERS=/tmp/petrispot-output-680225416550068921.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1063 rows 824 cols 3320 entries
Finished phase 1 with 819 SingleSign rule and 0 generalized
[2026-05-25 10:35:04] [INFO ] Computed 5 invariants in 14 ms
Computed 5 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-680225416550068921.kers
Total runtime 16 ms.
[2026-05-25 10:35:04] [INFO ] Implicit Places using invariants in 477 ms returned []
[2026-05-25 10:35:04] [INFO ] Invariant cache hit.
[2026-05-25 10:35:05] [INFO ] Implicit Places using invariants and state equation in 812 ms returned []
Implicit Place search using SMT with State Equation took 1304 ms to find 0 implicit places.
Running 1062 sub problems to find dead transitions.
[2026-05-25 10:35:05] [INFO ] Invariant cache hit.
SMT process timed out in 30213ms, After SMT, problems are : Problem set: 0 solved, 1062 unsolved
Search for dead transitions found 0 dead transitions in 30215ms
Starting structural reductions in LTL mode, iteration 1 : 824/863 places, 1063/1104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31764 ms. Remains : 824/863 places, 1063/1104 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) U p1)&&X(p2)))))'
Stuttering acceptance computed with spot in 366 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : MedleyB-PT-B02-LTLCardinality-12
Product exploration explored 100000 steps with 25000 reset in 210 ms.
Product exploration explored 100000 steps with 25000 reset in 174 ms.
Computed a total of 170 stabilizing places and 178 stable transitions
Computed a total of 170 stabilizing places and 178 stable transitions
Knowledge based reduction with 6 factoid took 85 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 6463 steps (80 resets) in 19 ms. (323 steps per ms) remains 0/1 properties
Knowledge based reduction with 6 factoid took 43 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Knowledge-based reduction took 299 ms.
Stuttering acceptance computed with spot in 169 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Support contains 2 out of 824 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 824/824 places, 1063/1063 transitions.
Applied a total of 0 rules in 18 ms. Remains 824 /824 variables (removed 0) and now considering 1063/1063 (removed 0) transitions.
[2026-05-25 10:35:36] [INFO ] Invariant cache hit.
[2026-05-25 10:35:37] [INFO ] Implicit Places using invariants in 566 ms returned []
[2026-05-25 10:35:37] [INFO ] Invariant cache hit.
[2026-05-25 10:35:38] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 1458 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1477 ms. Remains : 824/824 places, 1063/1063 transitions.
Computed a total of 170 stabilizing places and 178 stable transitions
Computed a total of 170 stabilizing places and 178 stable transitions
Knowledge based reduction with 1 factoid took 50 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 4127 steps (50 resets) in 40 ms. (100 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 63 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Knowledge-based reduction took 307 ms.
Stuttering acceptance computed with spot in 207 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 211 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Product exploration explored 100000 steps with 25000 reset in 171 ms.
Product exploration explored 100000 steps with 25000 reset in 168 ms.
Spot run failed in 125 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/ltsmin17599348223662919888
[2026-05-25 10:35:39] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17599348223662919888
Running compilation step : cd /tmp/ltsmin17599348223662919888;'/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 1747 ms.
Running link step : cd /tmp/ltsmin17599348223662919888;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin17599348223662919888;'/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/stateBased16556656790700799567.hoa' '--buchi-type=spotba'
LTSmin run took 158 ms.
FORMULA MedleyB-PT-B02-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyB-PT-B02-LTLCardinality-12 finished in 37741 ms.
All properties solved by simple procedures.
Total runtime 332452 ms.

BK_STOP 1779705341575

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is MedleyB-PT-B02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-oct2-177969020100291"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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