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-177969020100323.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-B06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020100323
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 8.6K Mar 7 18:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 7 18:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 7 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 7 18:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Mar 7 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 7 18:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 7 18:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:34 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 3.4M 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-B06-LTLCardinality-00
FORMULA_NAME MedleyB-PT-B06-LTLCardinality-01
FORMULA_NAME MedleyB-PT-B06-LTLCardinality-02
FORMULA_NAME MedleyB-PT-B06-LTLCardinality-03
FORMULA_NAME MedleyB-PT-B06-LTLCardinality-04
FORMULA_NAME MedleyB-PT-B06-LTLCardinality-05
FORMULA_NAME MedleyB-PT-B06-LTLCardinality-06
FORMULA_NAME MedleyB-PT-B06-LTLCardinality-07
FORMULA_NAME MedleyB-PT-B06-LTLCardinality-08
FORMULA_NAME MedleyB-PT-B06-LTLCardinality-09
FORMULA_NAME MedleyB-PT-B06-LTLCardinality-10
FORMULA_NAME MedleyB-PT-B06-LTLCardinality-11
FORMULA_NAME MedleyB-PT-B06-LTLCardinality-12
FORMULA_NAME MedleyB-PT-B06-LTLCardinality-13
FORMULA_NAME MedleyB-PT-B06-LTLCardinality-14
FORMULA_NAME MedleyB-PT-B06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779706655310

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-B06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 10:57:36] [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:57:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 10:57:37] [INFO ] Load time of PNML (sax parser for PT used): 410 ms
[2026-05-25 10:57:37] [INFO ] Transformed 964 places.
[2026-05-25 10:57:37] [INFO ] Transformed 5535 transitions.
[2026-05-25 10:57:37] [INFO ] Found NUPN structural information;
[2026-05-25 10:57:37] [INFO ] Parsed PT model containing 964 places and 5535 transitions and 65185 arcs in 597 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyB-PT-B06-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B06-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B06-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B06-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B06-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 964 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 964/964 places, 5535/5535 transitions.
Discarding 115 places :
Symmetric choice reduction at 0 with 115 rule applications. Total rules 115 place count 849 transition count 5420
Iterating global reduction 0 with 115 rules applied. Total rules applied 230 place count 849 transition count 5420
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 285 place count 794 transition count 5365
Iterating global reduction 0 with 55 rules applied. Total rules applied 340 place count 794 transition count 5365
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 351 place count 783 transition count 5354
Iterating global reduction 0 with 11 rules applied. Total rules applied 362 place count 783 transition count 5354
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 367 place count 778 transition count 5349
Iterating global reduction 0 with 5 rules applied. Total rules applied 372 place count 778 transition count 5349
Applied a total of 372 rules in 468 ms. Remains 778 /964 variables (removed 186) and now considering 5349/5535 (removed 186) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9928077958229585500.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5855185321462024450.kers'
[2026-05-25 10:57:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9928077958229585500.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5855185321462024450.kers]
Culled 0 columns in 14 ms.
// Phase 1: matrix 5349 rows 778 cols 64813 entries
Finished phase 1 with 770 SingleSign rule and 0 generalized
[2026-05-25 10:57:38] [INFO ] Computed 8 invariants in 67 ms
Computed 8 P flows in 69 ms.
Exported basis to /tmp/petrispot-output-5855185321462024450.kers
Total runtime 76 ms.
[2026-05-25 10:57:40] [INFO ] Implicit Places using invariants in 2348 ms returned []
[2026-05-25 10:57:40] [INFO ] Invariant cache hit.
[2026-05-25 10:57:44] [INFO ] Implicit Places using invariants and state equation in 3546 ms returned []
Implicit Place search using SMT with State Equation took 5949 ms to find 0 implicit places.
Running 5348 sub problems to find dead transitions.
[2026-05-25 10:57:44] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 777/6127 variables, and 0 constraints, problems are : Problem set: 0 solved, 5348 unsolved in 30163 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/778 constraints, PredecessorRefiner: 5348/931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5348 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 777/6127 variables, and 0 constraints, problems are : Problem set: 0 solved, 5348 unsolved in 30175 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/778 constraints, PredecessorRefiner: 4417/931 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68758ms problems are : Problem set: 0 solved, 5348 unsolved
Search for dead transitions found 0 dead transitions in 68864ms
Starting structural reductions in LTL mode, iteration 1 : 778/964 places, 5349/5535 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75371 ms. Remains : 778/964 places, 5349/5535 transitions.
Starting structural reductions in LTL mode, iteration 0 : 778/778 places, 5349/5349 transitions.
Applied a total of 0 rules in 50 ms. Remains 778 /778 variables (removed 0) and now considering 5349/5349 (removed 0) transitions.
[2026-05-25 10:58:53] [INFO ] Invariant cache hit.
[2026-05-25 10:58:54] [INFO ] Implicit Places using invariants in 1457 ms returned []
[2026-05-25 10:58:54] [INFO ] Invariant cache hit.
[2026-05-25 10:58:57] [INFO ] Implicit Places using invariants and state equation in 3221 ms returned []
Implicit Place search using SMT with State Equation took 4680 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 4734 ms. Remains : 778/778 places, 5349/5349 transitions.
Support contains 36 out of 778 places after structural reductions.
[2026-05-25 10:58:58] [INFO ] Flatten gal took : 637 ms
[2026-05-25 10:58:59] [INFO ] Flatten gal took : 307 ms
[2026-05-25 10:58:59] [INFO ] Input system was already deterministic with 5349 transitions.
RANDOM walk for 40000 steps (325 resets) in 1986 ms. (20 steps per ms) remains 11/21 properties
BEST_FIRST walk for 40004 steps (46 resets) in 111 ms. (357 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (45 resets) in 185 ms. (215 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (44 resets) in 130 ms. (305 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (45 resets) in 213 ms. (186 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (45 resets) in 112 ms. (354 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (44 resets) in 95 ms. (416 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (45 resets) in 109 ms. (363 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (46 resets) in 84 ms. (470 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (45 resets) in 125 ms. (317 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (46 resets) in 125 ms. (317 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (47 resets) in 141 ms. (281 steps per ms) remains 11/11 properties
[2026-05-25 10:59:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 745/764 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/764 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 14/778 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/778 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 5349/6127 variables, 778/786 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6127 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/6127 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6127/6127 variables, and 786 constraints, problems are : Problem set: 0 solved, 11 unsolved in 3511 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 778/778 constraints, PredecessorRefiner: 11/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 745/764 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SMT process timed out in 9154ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 19 out of 778 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 778/778 places, 5349/5349 transitions.
Graph (trivial) has 759 edges and 778 vertex of which 96 / 778 are part of one of the 19 SCC in 24 ms
Free SCC test removed 77 places
Drop transitions (Empty/Sink Transition effects.) removed 103 transitions
Reduce isomorphic transitions removed 103 transitions.
Graph (complete) has 1804 edges and 701 vertex of which 694 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.27 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 466 transitions
Trivial Post-agglo rules discarded 466 transitions
Performed 466 trivial Post agglomeration. Transition count delta: 466
Iterating post reduction 0 with 473 rules applied. Total rules applied 475 place count 694 transition count 4773
Reduce places removed 466 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 478 rules applied. Total rules applied 953 place count 228 transition count 4761
Reduce places removed 6 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 12 rules applied. Total rules applied 965 place count 222 transition count 4755
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 10 rules applied. Total rules applied 975 place count 216 transition count 4751
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 977 place count 214 transition count 4751
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 35 Pre rules applied. Total rules applied 977 place count 214 transition count 4716
Deduced a syphon composed of 35 places in 3 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 1047 place count 179 transition count 4716
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 1117 place count 144 transition count 4681
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1122 place count 144 transition count 4676
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 1141 place count 125 transition count 666
Iterating global reduction 6 with 19 rules applied. Total rules applied 1160 place count 125 transition count 666
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1173 place count 125 transition count 653
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 1195 place count 114 transition count 642
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 1207 place count 108 transition count 650
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1209 place count 108 transition count 648
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 1223 place count 108 transition count 634
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1225 place count 107 transition count 640
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1233 place count 107 transition count 632
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1235 place count 106 transition count 638
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1243 place count 106 transition count 630
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1245 place count 105 transition count 636
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1253 place count 105 transition count 628
Free-agglomeration rule applied 38 times.
Iterating global reduction 8 with 38 rules applied. Total rules applied 1291 place count 105 transition count 590
Reduce places removed 38 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 40 rules applied. Total rules applied 1331 place count 67 transition count 588
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 1335 place count 63 transition count 584
Iterating global reduction 9 with 4 rules applied. Total rules applied 1339 place count 63 transition count 584
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1341 place count 63 transition count 582
Drop transitions (Redundant composition of simpler transitions.) removed 63 transitions
Redundant transition composition rules discarded 63 transitions
Iterating global reduction 10 with 63 rules applied. Total rules applied 1404 place count 63 transition count 519
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1405 place count 63 transition count 519
Applied a total of 1405 rules in 1019 ms. Remains 63 /778 variables (removed 715) and now considering 519/5349 (removed 4830) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1019 ms. Remains : 63/778 places, 519/5349 transitions.
RANDOM walk for 40000 steps (2026 resets) in 1325 ms. (30 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40003 steps (30 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13511365433738582029.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16087674712666951919.kers'
[2026-05-25 10:59:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13511365433738582029.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16087674712666951919.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 519 rows 62 cols 3396 entries
Finished phase 1 with 55 SingleSign rule and 0 generalized
[2026-05-25 10:59:11] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16087674712666951919.kers
Total runtime 3 ms.
[2026-05-25 10:59:11] [INFO ] State equation strengthened by 463 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/63 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 519/582 variables, 63/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 463/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/582 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 582/582 variables, and 534 constraints, problems are : Problem set: 0 solved, 1 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 63/63 constraints, ReadFeed: 463/463 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/29 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp20 is UNSAT
After SMT solving in domain Int declared 29/582 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 3/8 constraints, State Equation: 0/63 constraints, ReadFeed: 0/463 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 342ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA MedleyB-PT-B06-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 105 stabilizing places and 112 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (F(!p1)||X(X(!p2)))))'
Support contains 6 out of 778 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 778/778 places, 5349/5349 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 765 transition count 5336
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 765 transition count 5336
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 758 transition count 5329
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 758 transition count 5329
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 757 transition count 5328
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 757 transition count 5328
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 756 transition count 5327
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 756 transition count 5327
Applied a total of 44 rules in 273 ms. Remains 756 /778 variables (removed 22) and now considering 5327/5349 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1633415755071847366.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7084677297267919386.kers'
[2026-05-25 10:59:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1633415755071847366.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7084677297267919386.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 5327 rows 756 cols 64769 entries
Finished phase 1 with 748 SingleSign rule and 0 generalized
[2026-05-25 10:59:12] [INFO ] Computed 8 invariants in 36 ms
Computed 8 P flows in 36 ms.
Exported basis to /tmp/petrispot-output-7084677297267919386.kers
Total runtime 43 ms.
[2026-05-25 10:59:14] [INFO ] Implicit Places using invariants in 1482 ms returned []
[2026-05-25 10:59:14] [INFO ] Invariant cache hit.
[2026-05-25 10:59:17] [INFO ] Implicit Places using invariants and state equation in 2956 ms returned []
Implicit Place search using SMT with State Equation took 4460 ms to find 0 implicit places.
Running 5326 sub problems to find dead transitions.
[2026-05-25 10:59:17] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 755/6083 variables, and 0 constraints, problems are : Problem set: 0 solved, 5326 unsolved in 30114 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/756 constraints, PredecessorRefiner: 5326/910 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5326 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 755/6083 variables, and 0 constraints, problems are : Problem set: 0 solved, 5326 unsolved in 30110 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/756 constraints, PredecessorRefiner: 4416/910 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68646ms problems are : Problem set: 0 solved, 5326 unsolved
Search for dead transitions found 0 dead transitions in 68678ms
Starting structural reductions in LTL mode, iteration 1 : 756/778 places, 5327/5349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73455 ms. Remains : 756/778 places, 5327/5349 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (F(!p1)||X(X(!p2)))))'
Stuttering acceptance computed with spot in 750 ms :[(AND p1 (NOT p0)), (OR (AND (NOT p0) p1) (AND p1 p2)), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), p1]
Running random walk in product with property : MedleyB-PT-B06-LTLCardinality-00
Stuttering criterion allowed to conclude after 130 steps with 0 reset in 10 ms.
FORMULA MedleyB-PT-B06-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B06-LTLCardinality-00 finished in 74352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0||X((p1||X(p0)))))||G(p2))))'
Support contains 4 out of 778 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 778/778 places, 5349/5349 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 766 transition count 5337
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 766 transition count 5337
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 760 transition count 5331
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 760 transition count 5331
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 759 transition count 5330
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 759 transition count 5330
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 758 transition count 5329
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 758 transition count 5329
Applied a total of 40 rules in 272 ms. Remains 758 /778 variables (removed 20) and now considering 5329/5349 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16959014634631086121.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4928263955644025714.kers'
[2026-05-25 11:00:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16959014634631086121.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4928263955644025714.kers]
Culled 0 columns in 19 ms.
// Phase 1: matrix 5329 rows 758 cols 64773 entries
Finished phase 1 with 750 SingleSign rule and 0 generalized
[2026-05-25 11:00:27] [INFO ] Computed 8 invariants in 80 ms
Computed 8 P flows in 80 ms.
Exported basis to /tmp/petrispot-output-4928263955644025714.kers
Total runtime 88 ms.
[2026-05-25 11:00:28] [INFO ] Implicit Places using invariants in 1484 ms returned []
[2026-05-25 11:00:28] [INFO ] Invariant cache hit.
[2026-05-25 11:00:31] [INFO ] Implicit Places using invariants and state equation in 3399 ms returned []
Implicit Place search using SMT with State Equation took 4906 ms to find 0 implicit places.
Running 5328 sub problems to find dead transitions.
[2026-05-25 11:00:31] [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 757/6087 variables, and 0 constraints, problems are : Problem set: 0 solved, 5328 unsolved in 30083 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/758 constraints, PredecessorRefiner: 5328/912 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 757/6087 variables, and 0 constraints, problems are : Problem set: 0 solved, 5328 unsolved in 30110 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/758 constraints, PredecessorRefiner: 4416/912 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 69166ms problems are : Problem set: 0 solved, 5328 unsolved
Search for dead transitions found 0 dead transitions in 69203ms
Starting structural reductions in LTL mode, iteration 1 : 758/778 places, 5329/5349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74433 ms. Remains : 758/778 places, 5329/5349 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0||X((p1||X(p0)))))||G(p2))))'
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyB-PT-B06-LTLCardinality-01
Product exploration explored 100000 steps with 847 reset in 474 ms.
Product exploration explored 100000 steps with 841 reset in 499 ms.
Computed a total of 105 stabilizing places and 112 stable transitions
Computed a total of 105 stabilizing places and 112 stable transitions
Knowledge based reduction with 15 factoid took 96 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (328 resets) in 471 ms. (84 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (46 resets) in 289 ms. (137 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (44 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
[2026-05-25 11:01:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 320/324 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 434/758 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/758 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5329/6087 variables, 758/766 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6087 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/6087 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6087/6087 variables, and 766 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1848 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 758/758 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 320/324 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/324 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 434/758 variables, 5/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/758 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/758 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 5329/6087 variables, 758/767 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6087 variables, 1/768 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SMT process timed out in 7912ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 758 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 5329/5329 transitions.
Graph (trivial) has 774 edges and 758 vertex of which 111 / 758 are part of one of the 21 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Graph (complete) has 1763 edges and 668 vertex of which 661 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.8 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 469 transitions
Trivial Post-agglo rules discarded 469 transitions
Performed 469 trivial Post agglomeration. Transition count delta: 469
Iterating post reduction 0 with 476 rules applied. Total rules applied 478 place count 661 transition count 4729
Reduce places removed 469 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 483 rules applied. Total rules applied 961 place count 192 transition count 4715
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 969 place count 185 transition count 4714
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 970 place count 184 transition count 4714
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 970 place count 184 transition count 4678
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 1042 place count 148 transition count 4678
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1043 place count 148 transition count 4677
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 1115 place count 112 transition count 4641
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1127 place count 112 transition count 4629
Discarding 27 places :
Symmetric choice reduction at 6 with 27 rule applications. Total rules 1154 place count 85 transition count 485
Iterating global reduction 6 with 27 rules applied. Total rules applied 1181 place count 85 transition count 485
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1196 place count 85 transition count 470
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1201 place count 80 transition count 465
Iterating global reduction 7 with 5 rules applied. Total rules applied 1206 place count 80 transition count 465
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1224 place count 71 transition count 456
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1230 place count 68 transition count 464
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 1239 place count 68 transition count 455
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1241 place count 67 transition count 461
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1249 place count 67 transition count 453
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1251 place count 66 transition count 459
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1259 place count 66 transition count 451
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1261 place count 65 transition count 457
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1269 place count 65 transition count 449
Free-agglomeration rule applied 36 times.
Iterating global reduction 7 with 36 rules applied. Total rules applied 1305 place count 65 transition count 413
Reduce places removed 36 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 7 with 69 rules applied. Total rules applied 1374 place count 29 transition count 380
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 1381 place count 22 transition count 373
Iterating global reduction 8 with 7 rules applied. Total rules applied 1388 place count 22 transition count 373
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 8 with 127 rules applied. Total rules applied 1515 place count 22 transition count 246
Applied a total of 1515 rules in 464 ms. Remains 22 /758 variables (removed 736) and now considering 246/5329 (removed 5083) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 464 ms. Remains : 22/758 places, 246/5329 transitions.
RANDOM walk for 152 steps (0 resets) in 6 ms. (21 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge based reduction with 16 factoid took 200 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Knowledge-based reduction took 9176 ms.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 4 out of 758 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 758/758 places, 5329/5329 transitions.
Applied a total of 0 rules in 53 ms. Remains 758 /758 variables (removed 0) and now considering 5329/5329 (removed 0) transitions.
[2026-05-25 11:01:51] [INFO ] Invariant cache hit.
[2026-05-25 11:01:52] [INFO ] Implicit Places using invariants in 1376 ms returned []
[2026-05-25 11:01:52] [INFO ] Invariant cache hit.
[2026-05-25 11:01:56] [INFO ] Implicit Places using invariants and state equation in 3154 ms returned []
Implicit Place search using SMT with State Equation took 4552 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 4606 ms. Remains : 758/758 places, 5329/5329 transitions.
Computed a total of 105 stabilizing places and 112 stable transitions
Computed a total of 105 stabilizing places and 112 stable transitions
Knowledge based reduction with 11 factoid took 87 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (328 resets) in 349 ms. (114 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (46 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
[2026-05-25 11:01:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 217/219 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 539/758 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5868ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 758 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 5329/5329 transitions.
Graph (trivial) has 774 edges and 758 vertex of which 111 / 758 are part of one of the 21 SCC in 3 ms
Free SCC test removed 90 places
Drop transitions (Empty/Sink Transition effects.) removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Graph (complete) has 1763 edges and 668 vertex of which 661 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 469 transitions
Trivial Post-agglo rules discarded 469 transitions
Performed 469 trivial Post agglomeration. Transition count delta: 469
Iterating post reduction 0 with 476 rules applied. Total rules applied 478 place count 661 transition count 4729
Reduce places removed 469 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 483 rules applied. Total rules applied 961 place count 192 transition count 4715
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 969 place count 185 transition count 4714
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 970 place count 184 transition count 4714
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 970 place count 184 transition count 4678
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 1042 place count 148 transition count 4678
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1043 place count 148 transition count 4677
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 1115 place count 112 transition count 4641
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1127 place count 112 transition count 4629
Discarding 27 places :
Symmetric choice reduction at 6 with 27 rule applications. Total rules 1154 place count 85 transition count 485
Iterating global reduction 6 with 27 rules applied. Total rules applied 1181 place count 85 transition count 485
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1196 place count 85 transition count 470
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1201 place count 80 transition count 465
Iterating global reduction 7 with 5 rules applied. Total rules applied 1206 place count 80 transition count 465
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1224 place count 71 transition count 456
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1230 place count 68 transition count 464
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 1239 place count 68 transition count 455
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1241 place count 67 transition count 461
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1249 place count 67 transition count 453
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1251 place count 66 transition count 459
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1259 place count 66 transition count 451
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1261 place count 65 transition count 457
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1269 place count 65 transition count 449
Free-agglomeration rule applied 36 times.
Iterating global reduction 7 with 36 rules applied. Total rules applied 1305 place count 65 transition count 413
Reduce places removed 36 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 7 with 69 rules applied. Total rules applied 1374 place count 29 transition count 380
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 1381 place count 22 transition count 373
Iterating global reduction 8 with 7 rules applied. Total rules applied 1388 place count 22 transition count 373
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 8 with 127 rules applied. Total rules applied 1515 place count 22 transition count 246
Applied a total of 1515 rules in 498 ms. Remains 22 /758 variables (removed 736) and now considering 246/5329 (removed 5083) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 498 ms. Remains : 22/758 places, 246/5329 transitions.
RANDOM walk for 238 steps (0 resets) in 8 ms. (26 steps per ms) remains 0/1 properties
Knowledge based reduction with 11 factoid took 216 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Knowledge-based reduction took 7118 ms.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 838 reset in 536 ms.
Product exploration explored 100000 steps with 847 reset in 559 ms.
Spot run failed in 156 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/ltsmin11940310407725741641
[2026-05-25 11:02:05] [INFO ] Built C files in 180ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11940310407725741641
Running compilation step : cd /tmp/ltsmin11940310407725741641;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11940310407725741641;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11940310407725741641;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 4 out of 758 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 758/758 places, 5329/5329 transitions.
Applied a total of 0 rules in 46 ms. Remains 758 /758 variables (removed 0) and now considering 5329/5329 (removed 0) transitions.
[2026-05-25 11:02:08] [INFO ] Invariant cache hit.
[2026-05-25 11:02:09] [INFO ] Implicit Places using invariants in 1517 ms returned []
[2026-05-25 11:02:09] [INFO ] Invariant cache hit.
[2026-05-25 11:02:13] [INFO ] Implicit Places using invariants and state equation in 3694 ms returned []
Implicit Place search using SMT with State Equation took 5235 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 5282 ms. Remains : 758/758 places, 5329/5329 transitions.
Built C files in :
/tmp/ltsmin12947234487487194027
[2026-05-25 11:02:13] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12947234487487194027
Running compilation step : cd /tmp/ltsmin12947234487487194027;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12947234487487194027;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12947234487487194027;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-25 11:02:17] [INFO ] Flatten gal took : 277 ms
[2026-05-25 11:02:17] [INFO ] Flatten gal took : 222 ms
[2026-05-25 11:02:17] [INFO ] Time to serialize gal into /tmp/LTL11394893452811610422.gal : 105 ms
[2026-05-25 11:02:17] [INFO ] Time to serialize properties into /tmp/LTL13529211780872158489.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11394893452811610422.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5818462292156107355.hoa' '-atoms' '/tmp/LTL13529211780872158489.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13529211780872158489.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5818462292156107355.hoa
Detected timeout of ITS tools.
[2026-05-25 11:02:33] [INFO ] Flatten gal took : 291 ms
[2026-05-25 11:02:33] [INFO ] Flatten gal took : 236 ms
[2026-05-25 11:02:33] [INFO ] Time to serialize gal into /tmp/LTL12845404389939556111.gal : 52 ms
[2026-05-25 11:02:33] [INFO ] Time to serialize properties into /tmp/LTL14443748163860556395.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12845404389939556111.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14443748163860556395.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G(("((p19==0)&&(p290==1))")||(X(("((p37==0)&&(p889==1))")||(X("((p19==0)&&(p290==1))"))))))||(G("((p889==0)||(p37==1))")))))
Formula 0 simplified : G(F(!"((p19==0)&&(p290==1))" & X(!"((p37==0)&&(p889==1))" & X!"((p19==0)&&(p290==1))")) & F!"((p889==0)||(p37==1))")
Detected timeout of ITS tools.
[2026-05-25 11:02:48] [INFO ] Flatten gal took : 201 ms
[2026-05-25 11:02:48] [INFO ] Applying decomposition
[2026-05-25 11:02:49] [INFO ] Flatten gal took : 236 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13115171873120788358.txt' '-o' '/tmp/graph13115171873120788358.bin' '-w' '/tmp/graph13115171873120788358.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13115171873120788358.bin' '-l' '-1' '-v' '-w' '/tmp/graph13115171873120788358.weights' '-q' '0' '-e' '0.001'
[2026-05-25 11:02:50] [INFO ] Decomposing Gal with order
[2026-05-25 11:02:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 11:02:51] [INFO ] Removed a total of 31622 redundant transitions.
[2026-05-25 11:02:51] [INFO ] Flatten gal took : 853 ms
[2026-05-25 11:02:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 242 ms.
[2026-05-25 11:02:52] [INFO ] Time to serialize gal into /tmp/LTL10055886444417768671.gal : 34 ms
[2026-05-25 11:02:52] [INFO ] Time to serialize properties into /tmp/LTL4713473595803967894.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10055886444417768671.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4713473595803967894.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(("((i5.u6.p19==0)&&(i22.u97.p290==1))")||(X(("((i1.u12.p37==0)&&(i44.u296.p889==1))")||(X("((i5.u6.p19==0)&&(i22.u97.p290==1))...211
Formula 0 simplified : G(F(!"((i5.u6.p19==0)&&(i22.u97.p290==1))" & X(!"((i1.u12.p37==0)&&(i44.u296.p889==1))" & X!"((i5.u6.p19==0)&&(i22.u97.p290==1))")) ...199
Detected timeout of ITS tools.
Treatment of property MedleyB-PT-B06-LTLCardinality-01 finished in 160462 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(G(p0))&&F(p1))))'
Support contains 4 out of 778 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 778/778 places, 5349/5349 transitions.
Graph (trivial) has 790 edges and 778 vertex of which 115 / 778 are part of one of the 21 SCC in 2 ms
Free SCC test removed 94 places
Ensure Unique test removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 469 transitions
Trivial Post-agglo rules discarded 469 transitions
Performed 469 trivial Post agglomeration. Transition count delta: 469
Iterating post reduction 0 with 469 rules applied. Total rules applied 470 place count 683 transition count 4772
Reduce places removed 469 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 483 rules applied. Total rules applied 953 place count 214 transition count 4758
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 962 place count 207 transition count 4756
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 964 place count 205 transition count 4756
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 964 place count 205 transition count 4729
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 1018 place count 178 transition count 4729
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1027 place count 169 transition count 4719
Iterating global reduction 4 with 9 rules applied. Total rules applied 1036 place count 169 transition count 4719
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1036 place count 169 transition count 4718
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1038 place count 168 transition count 4718
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1040 place count 166 transition count 3987
Iterating global reduction 4 with 2 rules applied. Total rules applied 1042 place count 166 transition count 3987
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1043 place count 166 transition count 3986
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1044 place count 165 transition count 3984
Iterating global reduction 5 with 1 rules applied. Total rules applied 1045 place count 165 transition count 3984
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
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 1107 place count 134 transition count 3953
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 1132 place count 109 transition count 547
Iterating global reduction 5 with 25 rules applied. Total rules applied 1157 place count 109 transition count 547
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1169 place count 109 transition count 535
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1174 place count 104 transition count 525
Iterating global reduction 6 with 5 rules applied. Total rules applied 1179 place count 104 transition count 525
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1184 place count 99 transition count 515
Iterating global reduction 6 with 5 rules applied. Total rules applied 1189 place count 99 transition count 515
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 1213 place count 87 transition count 522
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1214 place count 86 transition count 506
Iterating global reduction 6 with 1 rules applied. Total rules applied 1215 place count 86 transition count 506
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1216 place count 86 transition count 505
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1224 place count 86 transition count 497
Applied a total of 1224 rules in 623 ms. Remains 86 /778 variables (removed 692) and now considering 497/5349 (removed 4852) transitions.
[2026-05-25 11:03:07] [INFO ] Flow matrix only has 488 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6294247197817034953.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14630559914224056419.kers'
[2026-05-25 11:03:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6294247197817034953.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14630559914224056419.kers]
Normalized transition count is 487 out of 488 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 487 rows 85 cols 4791 entries
Finished phase 1 with 84 SingleSign rule and 0 generalized
[2026-05-25 11:03:07] [INFO ] Computed 2 invariants in 2 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14630559914224056419.kers
Total runtime 4 ms.
[2026-05-25 11:03:08] [INFO ] Implicit Places using invariants in 314 ms returned []
[2026-05-25 11:03:08] [INFO ] Flow matrix only has 488 transitions (discarded 9 similar events)
[2026-05-25 11:03:08] [INFO ] Invariant cache hit.
[2026-05-25 11:03:08] [INFO ] State equation strengthened by 127 read => feed constraints.
[2026-05-25 11:03:08] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
[2026-05-25 11:03:08] [INFO ] Redundant transitions in 22 ms returned []
Running 480 sub problems to find dead transitions.
[2026-05-25 11:03:08] [INFO ] Flow matrix only has 488 transitions (discarded 9 similar events)
[2026-05-25 11:03:08] [INFO ] Invariant cache hit.
[2026-05-25 11:03:08] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (OVERLAPS) 1/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 7 (OVERLAPS) 487/573 variables, 86/124 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 126/250 constraints. Problems are: Problem set: 0 solved, 480 unsolved
SMT process timed out in 30920ms, After SMT, problems are : Problem set: 0 solved, 480 unsolved
Search for dead transitions found 0 dead transitions in 30923ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/778 places, 497/5349 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32467 ms. Remains : 86/778 places, 497/5349 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(G(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyB-PT-B06-LTLCardinality-02
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B06-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B06-LTLCardinality-02 finished in 32652 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' '!(((p0&&G(F(p1))) U (p2&&(p3 U !p1)&&F(p4))))'
Support contains 8 out of 778 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 778/778 places, 5349/5349 transitions.
Graph (trivial) has 784 edges and 778 vertex of which 112 / 778 are part of one of the 21 SCC in 3 ms
Free SCC test removed 91 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 470 transitions
Trivial Post-agglo rules discarded 470 transitions
Performed 470 trivial Post agglomeration. Transition count delta: 470
Iterating post reduction 0 with 470 rules applied. Total rules applied 471 place count 686 transition count 4776
Reduce places removed 470 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 482 rules applied. Total rules applied 953 place count 216 transition count 4764
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 959 place count 210 transition count 4764
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 959 place count 210 transition count 4737
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 1013 place count 183 transition count 4737
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1021 place count 175 transition count 4728
Iterating global reduction 3 with 8 rules applied. Total rules applied 1029 place count 175 transition count 4728
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1030 place count 174 transition count 4726
Iterating global reduction 3 with 1 rules applied. Total rules applied 1031 place count 174 transition count 4726
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1032 place count 173 transition count 4724
Iterating global reduction 3 with 1 rules applied. Total rules applied 1033 place count 173 transition count 4724
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 1097 place count 141 transition count 4692
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 1119 place count 119 transition count 627
Iterating global reduction 3 with 22 rules applied. Total rules applied 1141 place count 119 transition count 627
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 1154 place count 119 transition count 614
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1156 place count 117 transition count 610
Iterating global reduction 4 with 2 rules applied. Total rules applied 1158 place count 117 transition count 610
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1159 place count 116 transition count 608
Iterating global reduction 4 with 1 rules applied. Total rules applied 1160 place count 116 transition count 608
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 1190 place count 101 transition count 617
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1191 place count 100 transition count 594
Iterating global reduction 4 with 1 rules applied. Total rules applied 1192 place count 100 transition count 594
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1193 place count 100 transition count 593
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 1205 place count 100 transition count 581
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1206 place count 100 transition count 581
Applied a total of 1206 rules in 566 ms. Remains 100 /778 variables (removed 678) and now considering 581/5349 (removed 4768) transitions.
[2026-05-25 11:03:40] [INFO ] Flow matrix only has 569 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4679562361180330026.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2057415616196023196.kers'
[2026-05-25 11:03:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4679562361180330026.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2057415616196023196.kers]
Normalized transition count is 568 out of 569 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 568 rows 99 cols 5699 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-25 11:03:40] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2057415616196023196.kers
Total runtime 4 ms.
[2026-05-25 11:03:40] [INFO ] Implicit Places using invariants in 308 ms returned []
[2026-05-25 11:03:40] [INFO ] Flow matrix only has 569 transitions (discarded 12 similar events)
[2026-05-25 11:03:40] [INFO ] Invariant cache hit.
[2026-05-25 11:03:40] [INFO ] State equation strengthened by 127 read => feed constraints.
[2026-05-25 11:03:41] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 934 ms to find 0 implicit places.
[2026-05-25 11:03:41] [INFO ] Redundant transitions in 11 ms returned []
Running 578 sub problems to find dead transitions.
[2026-05-25 11:03:41] [INFO ] Flow matrix only has 569 transitions (discarded 12 similar events)
[2026-05-25 11:03:41] [INFO ] Invariant cache hit.
[2026-05-25 11:03:41] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 100/669 variables, and 53 constraints, problems are : Problem set: 0 solved, 578 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/100 constraints, ReadFeed: 0/127 constraints, PredecessorRefiner: 578/259 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 578 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 9 (OVERLAPS) 568/668 variables, 100/162 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/668 variables, 126/288 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/668 variables, 259/547 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 668/669 variables, and 547 constraints, problems are : Problem set: 0 solved, 578 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 578/259 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60859ms problems are : Problem set: 0 solved, 578 unsolved
Search for dead transitions found 0 dead transitions in 60863ms
Starting structural reductions in SI_LTL mode, iteration 1 : 100/778 places, 581/5349 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62389 ms. Remains : 100/778 places, 581/5349 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))&&p1) U (p2&&(p3 U !p0)&&F(p4))))'
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p2) (NOT p4) p0), true, (NOT p0), (NOT p0), p0, (NOT p4), p0]
Running random walk in product with property : MedleyB-PT-B06-LTLCardinality-03
Stuttering criterion allowed to conclude after 19 steps with 1 reset in 1 ms.
FORMULA MedleyB-PT-B06-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B06-LTLCardinality-03 finished in 62758 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 778 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 778/778 places, 5349/5349 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 765 transition count 5336
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 765 transition count 5336
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 758 transition count 5329
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 758 transition count 5329
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 757 transition count 5328
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 757 transition count 5328
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 756 transition count 5327
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 756 transition count 5327
Applied a total of 44 rules in 235 ms. Remains 756 /778 variables (removed 22) and now considering 5327/5349 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-692913661954738134.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10795294792801472590.kers'
[2026-05-25 11:04:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-692913661954738134.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10795294792801472590.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 5327 rows 756 cols 64769 entries
Finished phase 1 with 748 SingleSign rule and 0 generalized
[2026-05-25 11:04:42] [INFO ] Computed 8 invariants in 53 ms
Computed 8 P flows in 54 ms.
Exported basis to /tmp/petrispot-output-10795294792801472590.kers
Total runtime 61 ms.
[2026-05-25 11:04:44] [INFO ] Implicit Places using invariants in 1408 ms returned []
[2026-05-25 11:04:44] [INFO ] Invariant cache hit.
[2026-05-25 11:04:47] [INFO ] Implicit Places using invariants and state equation in 3127 ms returned []
Implicit Place search using SMT with State Equation took 4561 ms to find 0 implicit places.
Running 5326 sub problems to find dead transitions.
[2026-05-25 11:04:47] [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 755/6083 variables, and 0 constraints, problems are : Problem set: 0 solved, 5326 unsolved in 30116 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/756 constraints, PredecessorRefiner: 5326/910 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5326 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 755/6083 variables, and 0 constraints, problems are : Problem set: 0 solved, 5326 unsolved in 30099 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/756 constraints, PredecessorRefiner: 4416/910 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68808ms problems are : Problem set: 0 solved, 5326 unsolved
Search for dead transitions found 0 dead transitions in 68822ms
Starting structural reductions in LTL mode, iteration 1 : 756/778 places, 5327/5349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73633 ms. Remains : 756/778 places, 5327/5349 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B06-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 476 ms.
Product exploration explored 100000 steps with 50000 reset in 498 ms.
Computed a total of 105 stabilizing places and 112 stable transitions
Computed a total of 105 stabilizing places and 112 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 24 ms. Proved property starting from automaton with 2 states, 2 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 68 ms.
FORMULA MedleyB-PT-B06-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyB-PT-B06-LTLCardinality-04 finished in 74848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 778 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 778/778 places, 5349/5349 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 765 transition count 5336
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 765 transition count 5336
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 758 transition count 5329
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 758 transition count 5329
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 757 transition count 5328
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 757 transition count 5328
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 756 transition count 5327
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 756 transition count 5327
Applied a total of 44 rules in 206 ms. Remains 756 /778 variables (removed 22) and now considering 5327/5349 (removed 22) transitions.
[2026-05-25 11:05:57] [INFO ] Invariant cache hit.
[2026-05-25 11:05:59] [INFO ] Implicit Places using invariants in 1538 ms returned []
[2026-05-25 11:05:59] [INFO ] Invariant cache hit.
[2026-05-25 11:06:02] [INFO ] Implicit Places using invariants and state equation in 3146 ms returned []
Implicit Place search using SMT with State Equation took 4699 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 756/778 places, 5327/5349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4906 ms. Remains : 756/778 places, 5327/5349 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B06-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B06-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B06-LTLCardinality-06 finished in 5041 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 778 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 778/778 places, 5349/5349 transitions.
Graph (trivial) has 794 edges and 778 vertex of which 118 / 778 are part of one of the 21 SCC in 1 ms
Free SCC test removed 97 places
Ensure Unique test removed 111 transitions
Reduce isomorphic transitions removed 111 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 470 transitions
Trivial Post-agglo rules discarded 470 transitions
Performed 470 trivial Post agglomeration. Transition count delta: 470
Iterating post reduction 0 with 470 rules applied. Total rules applied 471 place count 680 transition count 4767
Reduce places removed 470 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 484 rules applied. Total rules applied 955 place count 210 transition count 4753
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 963 place count 203 transition count 4752
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 964 place count 202 transition count 4752
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 964 place count 202 transition count 4724
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 1020 place count 174 transition count 4724
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1028 place count 166 transition count 4715
Iterating global reduction 4 with 8 rules applied. Total rules applied 1036 place count 166 transition count 4715
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 1037 place count 166 transition count 4714
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1038 place count 165 transition count 4714
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1038 place count 165 transition count 4713
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1040 place count 164 transition count 4713
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1042 place count 162 transition count 3982
Iterating global reduction 6 with 2 rules applied. Total rules applied 1044 place count 162 transition count 3982
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1045 place count 162 transition count 3981
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1046 place count 161 transition count 3979
Iterating global reduction 7 with 1 rules applied. Total rules applied 1047 place count 161 transition count 3979
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 1107 place count 131 transition count 3949
Discarding 25 places :
Symmetric choice reduction at 7 with 25 rule applications. Total rules 1132 place count 106 transition count 542
Iterating global reduction 7 with 25 rules applied. Total rules applied 1157 place count 106 transition count 542
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 1170 place count 106 transition count 529
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1176 place count 100 transition count 517
Iterating global reduction 8 with 6 rules applied. Total rules applied 1182 place count 100 transition count 517
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1188 place count 94 transition count 505
Iterating global reduction 8 with 6 rules applied. Total rules applied 1194 place count 94 transition count 505
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 1216 place count 83 transition count 512
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1217 place count 82 transition count 498
Iterating global reduction 8 with 1 rules applied. Total rules applied 1218 place count 82 transition count 498
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1219 place count 82 transition count 497
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 1226 place count 82 transition count 490
Applied a total of 1226 rules in 456 ms. Remains 82 /778 variables (removed 696) and now considering 490/5349 (removed 4859) transitions.
[2026-05-25 11:06:02] [INFO ] Flow matrix only has 482 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6424689399880045765.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8330300548402821184.kers'
[2026-05-25 11:06:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6424689399880045765.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8330300548402821184.kers]
Normalized transition count is 481 out of 482 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 481 rows 81 cols 4778 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-25 11:06:02] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8330300548402821184.kers
Total runtime 4 ms.
[2026-05-25 11:06:03] [INFO ] Implicit Places using invariants in 177 ms returned []
[2026-05-25 11:06:03] [INFO ] Flow matrix only has 482 transitions (discarded 8 similar events)
[2026-05-25 11:06:03] [INFO ] Invariant cache hit.
[2026-05-25 11:06:03] [INFO ] State equation strengthened by 127 read => feed constraints.
[2026-05-25 11:06:03] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2026-05-25 11:06:03] [INFO ] Redundant transitions in 20 ms returned []
Running 473 sub problems to find dead transitions.
[2026-05-25 11:06:03] [INFO ] Flow matrix only has 482 transitions (discarded 8 similar events)
[2026-05-25 11:06:03] [INFO ] Invariant cache hit.
[2026-05-25 11:06:03] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (OVERLAPS) 481/563 variables, 82/111 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 126/237 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 563/564 variables, and 241 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 473/346 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (OVERLAPS) 481/563 variables, 82/116 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 126/242 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 346/588 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/564 variables, and 588 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 473/346 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60633ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60634ms
Starting structural reductions in SI_LTL mode, iteration 1 : 82/778 places, 490/5349 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61763 ms. Remains : 82/778 places, 490/5349 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 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B06-LTLCardinality-07
Product exploration explored 100000 steps with 7894 reset in 446 ms.
Product exploration explored 100000 steps with 7924 reset in 477 ms.
Computed a total of 5 stabilizing places and 23 stable transitions
Computed a total of 5 stabilizing places and 23 stable transitions
Knowledge based reduction with 3 factoid took 88 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 (3164 resets) in 2003 ms. (19 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (263 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1447638 steps, run timeout after 3001 ms. (steps per millisecond=482 ) properties seen :0 out of 1
Probabilistic random walk after 1447638 steps, saw 274155 distinct states, run finished after 3009 ms. (steps per millisecond=481 ) properties seen :0
[2026-05-25 11:07:08] [INFO ] Flow matrix only has 482 transitions (discarded 8 similar events)
[2026-05-25 11:07:08] [INFO ] Invariant cache hit.
[2026-05-25 11:07:08] [INFO ] State equation strengthened by 127 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 480/560 variables, 80/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/560 variables, 126/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/560 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/563 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/564 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/564 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/564 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 211 constraints, problems are : Problem set: 0 solved, 1 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 480/560 variables, 80/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/560 variables, 126/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/560 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/560 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/563 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/563 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/564 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/564 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 214 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1071 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1424ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 586 steps, including 39 resets, run visited all 1 properties in 7 ms. (steps per millisecond=83 )
Parikh walk visited 1 properties in 19 ms.
Knowledge based reduction with 3 factoid took 118 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 131 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 5336 ms.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 490/490 transitions.
Applied a total of 0 rules in 46 ms. Remains 82 /82 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2026-05-25 11:07:10] [INFO ] Flow matrix only has 482 transitions (discarded 8 similar events)
[2026-05-25 11:07:10] [INFO ] Invariant cache hit.
[2026-05-25 11:07:11] [INFO ] Implicit Places using invariants in 273 ms returned []
[2026-05-25 11:07:11] [INFO ] Flow matrix only has 482 transitions (discarded 8 similar events)
[2026-05-25 11:07:11] [INFO ] Invariant cache hit.
[2026-05-25 11:07:11] [INFO ] State equation strengthened by 127 read => feed constraints.
[2026-05-25 11:07:11] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
[2026-05-25 11:07:11] [INFO ] Redundant transitions in 6 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 855 ms. Remains : 82/82 places, 490/490 transitions.
Computed a total of 5 stabilizing places and 23 stable transitions
Computed a total of 5 stabilizing places and 23 stable transitions
Knowledge based reduction with 3 factoid took 56 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 (3155 resets) in 213 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (264 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1474296 steps, run timeout after 3001 ms. (steps per millisecond=491 ) properties seen :0 out of 1
Probabilistic random walk after 1474296 steps, saw 279209 distinct states, run finished after 3001 ms. (steps per millisecond=491 ) properties seen :0
[2026-05-25 11:07:14] [INFO ] Flow matrix only has 482 transitions (discarded 8 similar events)
[2026-05-25 11:07:14] [INFO ] Invariant cache hit.
[2026-05-25 11:07:14] [INFO ] State equation strengthened by 127 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 480/560 variables, 80/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/560 variables, 126/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/560 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/563 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/564 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/564 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/564 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 211 constraints, problems are : Problem set: 0 solved, 1 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 480/560 variables, 80/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/560 variables, 126/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/560 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/560 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/563 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/563 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/564 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/564 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 214 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1114 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1445ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 358 steps, including 24 resets, run visited all 1 properties in 4 ms. (steps per millisecond=89 )
Parikh walk visited 1 properties in 5 ms.
Knowledge based reduction with 3 factoid took 98 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 139 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 4819 ms.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7921 reset in 251 ms.
Product exploration explored 100000 steps with 7916 reset in 317 ms.
Built C files in :
/tmp/ltsmin911868718527035926
[2026-05-25 11:07:17] [INFO ] Computing symmetric may disable matrix : 490 transitions.
[2026-05-25 11:07:17] [INFO ] Computation of Complete disable matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 11:07:17] [INFO ] Computing symmetric may enable matrix : 490 transitions.
[2026-05-25 11:07:17] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 11:07:17] [INFO ] Computing Do-Not-Accords matrix : 490 transitions.
[2026-05-25 11:07:17] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 11:07:17] [INFO ] Built C files in 150ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin911868718527035926
Running compilation step : cd /tmp/ltsmin911868718527035926;'/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 1971 ms.
Running link step : cd /tmp/ltsmin911868718527035926;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 103 ms.
Running LTSmin : cd /tmp/ltsmin911868718527035926;'/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/stateBased11832980866207546077.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 490/490 transitions.
Applied a total of 0 rules in 40 ms. Remains 82 /82 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2026-05-25 11:07:32] [INFO ] Flow matrix only has 482 transitions (discarded 8 similar events)
[2026-05-25 11:07:32] [INFO ] Invariant cache hit.
[2026-05-25 11:07:32] [INFO ] Implicit Places using invariants in 327 ms returned []
[2026-05-25 11:07:32] [INFO ] Flow matrix only has 482 transitions (discarded 8 similar events)
[2026-05-25 11:07:32] [INFO ] Invariant cache hit.
[2026-05-25 11:07:32] [INFO ] State equation strengthened by 127 read => feed constraints.
[2026-05-25 11:07:33] [INFO ] Implicit Places using invariants and state equation in 581 ms returned []
Implicit Place search using SMT with State Equation took 924 ms to find 0 implicit places.
[2026-05-25 11:07:33] [INFO ] Redundant transitions in 7 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 979 ms. Remains : 82/82 places, 490/490 transitions.
Built C files in :
/tmp/ltsmin17514504484312310539
[2026-05-25 11:07:33] [INFO ] Computing symmetric may disable matrix : 490 transitions.
[2026-05-25 11:07:33] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 11:07:33] [INFO ] Computing symmetric may enable matrix : 490 transitions.
[2026-05-25 11:07:33] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 11:07:33] [INFO ] Computing Do-Not-Accords matrix : 490 transitions.
[2026-05-25 11:07:33] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 11:07:33] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17514504484312310539
Running compilation step : cd /tmp/ltsmin17514504484312310539;'/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 1905 ms.
Running link step : cd /tmp/ltsmin17514504484312310539;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin17514504484312310539;'/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/stateBased13695510580842251950.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 11:07:48] [INFO ] Flatten gal took : 33 ms
[2026-05-25 11:07:48] [INFO ] Flatten gal took : 27 ms
[2026-05-25 11:07:48] [INFO ] Time to serialize gal into /tmp/LTL3183933375987880775.gal : 5 ms
[2026-05-25 11:07:48] [INFO ] Time to serialize properties into /tmp/LTL2128452767753793040.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3183933375987880775.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5860899523019000100.hoa' '-atoms' '/tmp/LTL2128452767753793040.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2128452767753793040.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5860899523019000100.hoa
Detected timeout of ITS tools.
[2026-05-25 11:08:03] [INFO ] Flatten gal took : 28 ms
[2026-05-25 11:08:03] [INFO ] Flatten gal took : 25 ms
[2026-05-25 11:08:03] [INFO ] Time to serialize gal into /tmp/LTL9898333581024757541.gal : 4 ms
[2026-05-25 11:08:03] [INFO ] Time to serialize properties into /tmp/LTL10064409137896717673.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9898333581024757541.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10064409137896717673.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p914==0)||(p305==1))"))))
Formula 0 simplified : FG!"((p914==0)||(p305==1))"
Detected timeout of ITS tools.
[2026-05-25 11:08:18] [INFO ] Flatten gal took : 37 ms
[2026-05-25 11:08:18] [INFO ] Applying decomposition
[2026-05-25 11:08:18] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17864739818753442277.txt' '-o' '/tmp/graph17864739818753442277.bin' '-w' '/tmp/graph17864739818753442277.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17864739818753442277.bin' '-l' '-1' '-v' '-w' '/tmp/graph17864739818753442277.weights' '-q' '0' '-e' '0.001'
[2026-05-25 11:08:18] [INFO ] Decomposing Gal with order
[2026-05-25 11:08:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 11:08:19] [INFO ] Removed a total of 2719 redundant transitions.
[2026-05-25 11:08:19] [INFO ] Flatten gal took : 46 ms
[2026-05-25 11:08:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 9 ms.
[2026-05-25 11:08:19] [INFO ] Time to serialize gal into /tmp/LTL5484609351295102931.gal : 3 ms
[2026-05-25 11:08:19] [INFO ] Time to serialize properties into /tmp/LTL9909371807450163655.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5484609351295102931.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9909371807450163655.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i6.u22.p914==0)||(i3.u9.p305==1))"))))
Formula 0 simplified : FG!"((i6.u22.p914==0)||(i3.u9.p305==1))"
Detected timeout of ITS tools.
Treatment of property MedleyB-PT-B06-LTLCardinality-07 finished in 151722 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))))'
Support contains 2 out of 778 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 778/778 places, 5349/5349 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 767 transition count 5338
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 767 transition count 5338
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 760 transition count 5331
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 760 transition count 5331
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 759 transition count 5330
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 759 transition count 5330
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 758 transition count 5329
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 758 transition count 5329
Applied a total of 40 rules in 264 ms. Remains 758 /778 variables (removed 20) and now considering 5329/5349 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5839378564573235126.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10106521404545229213.kers'
[2026-05-25 11:08:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5839378564573235126.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10106521404545229213.kers]
Culled 0 columns in 16 ms.
// Phase 1: matrix 5329 rows 758 cols 64773 entries
Finished phase 1 with 750 SingleSign rule and 0 generalized
[2026-05-25 11:08:34] [INFO ] Computed 8 invariants in 80 ms
Computed 8 P flows in 81 ms.
Exported basis to /tmp/petrispot-output-10106521404545229213.kers
Total runtime 92 ms.
[2026-05-25 11:08:35] [INFO ] Implicit Places using invariants in 1584 ms returned []
[2026-05-25 11:08:35] [INFO ] Invariant cache hit.
[2026-05-25 11:08:38] [INFO ] Implicit Places using invariants and state equation in 2991 ms returned []
Implicit Place search using SMT with State Equation took 4581 ms to find 0 implicit places.
Running 5328 sub problems to find dead transitions.
[2026-05-25 11:08:39] [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 757/6087 variables, and 0 constraints, problems are : Problem set: 0 solved, 5328 unsolved in 30079 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/758 constraints, PredecessorRefiner: 5328/912 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5328 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 757/6087 variables, and 0 constraints, problems are : Problem set: 0 solved, 5328 unsolved in 30099 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/758 constraints, PredecessorRefiner: 4416/912 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68919ms problems are : Problem set: 0 solved, 5328 unsolved
Search for dead transitions found 0 dead transitions in 68944ms
Starting structural reductions in LTL mode, iteration 1 : 758/778 places, 5329/5349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73842 ms. Remains : 758/778 places, 5329/5349 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B06-LTLCardinality-11
Stuttering criterion allowed to conclude after 109 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B06-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B06-LTLCardinality-11 finished in 74029 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(p0)||(F(!p0)&&X(G(!p1))))))'
Support contains 4 out of 778 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 778/778 places, 5349/5349 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 767 transition count 5338
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 767 transition count 5338
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 762 transition count 5333
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 762 transition count 5333
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 761 transition count 5332
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 761 transition count 5332
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 760 transition count 5331
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 760 transition count 5331
Applied a total of 36 rules in 268 ms. Remains 760 /778 variables (removed 18) and now considering 5331/5349 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15952874509269201820.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15715848575496717979.kers'
[2026-05-25 11:09:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15952874509269201820.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15715848575496717979.kers]
Culled 0 columns in 6 ms.
// Phase 1: matrix 5331 rows 760 cols 64777 entries
Finished phase 1 with 752 SingleSign rule and 0 generalized
[2026-05-25 11:09:48] [INFO ] Computed 8 invariants in 36 ms
Computed 8 P flows in 37 ms.
Exported basis to /tmp/petrispot-output-15715848575496717979.kers
Total runtime 44 ms.
[2026-05-25 11:09:50] [INFO ] Implicit Places using invariants in 1620 ms returned []
[2026-05-25 11:09:50] [INFO ] Invariant cache hit.
[2026-05-25 11:09:53] [INFO ] Implicit Places using invariants and state equation in 3111 ms returned []
Implicit Place search using SMT with State Equation took 4742 ms to find 0 implicit places.
Running 5330 sub problems to find dead transitions.
[2026-05-25 11:09:53] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 759/6091 variables, and 0 constraints, problems are : Problem set: 0 solved, 5330 unsolved in 30103 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/760 constraints, PredecessorRefiner: 5330/914 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5330 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 759/6091 variables, and 0 constraints, problems are : Problem set: 0 solved, 5330 unsolved in 30089 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/760 constraints, PredecessorRefiner: 4416/914 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67722ms problems are : Problem set: 0 solved, 5330 unsolved
Search for dead transitions found 0 dead transitions in 67739ms
Starting structural reductions in LTL mode, iteration 1 : 760/778 places, 5331/5349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72783 ms. Remains : 760/778 places, 5331/5349 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(p0)||(F(!p0)&&X(G(p1))))))'
Stuttering acceptance computed with spot in 253 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyB-PT-B06-LTLCardinality-15
Product exploration explored 100000 steps with 33333 reset in 362 ms.
Product exploration explored 100000 steps with 33333 reset in 359 ms.
Computed a total of 105 stabilizing places and 112 stable transitions
Computed a total of 105 stabilizing places and 112 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 5 factoid took 31 ms. Proved property starting from automaton with 5 states, 7 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 68 ms.
FORMULA MedleyB-PT-B06-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyB-PT-B06-LTLCardinality-15 finished in 73896 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0||X((p1||X(p0)))))||G(p2))))'
Spot run failed in 75 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Spot run failed in 84 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-25 11:11:02] [INFO ] Flatten gal took : 219 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1115180620713825973
[2026-05-25 11:11:02] [INFO ] Too many transitions (5349) to apply POR reductions. Disabling POR matrices.
[2026-05-25 11:11:02] [INFO ] Built C files in 110ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1115180620713825973
Running compilation step : cd /tmp/ltsmin1115180620713825973;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-25 11:11:02] [INFO ] Applying decomposition
[2026-05-25 11:11:03] [INFO ] Flatten gal took : 253 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4132091276679645692.txt' '-o' '/tmp/graph4132091276679645692.bin' '-w' '/tmp/graph4132091276679645692.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4132091276679645692.bin' '-l' '-1' '-v' '-w' '/tmp/graph4132091276679645692.weights' '-q' '0' '-e' '0.001'
[2026-05-25 11:11:03] [INFO ] Decomposing Gal with order
[2026-05-25 11:11:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 11:11:04] [INFO ] Removed a total of 31632 redundant transitions.
[2026-05-25 11:11:04] [INFO ] Flatten gal took : 378 ms
[2026-05-25 11:11:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 148 ms.
[2026-05-25 11:11:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality9901531354850646915.gal : 21 ms
[2026-05-25 11:11:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality4238207719470729488.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9901531354850646915.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4238207719470729488.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((F((G(("((i1.u6.p19==0)&&(i17.i0.i1.u103.p290==1))")||(X(("((i3.u14.p37==0)&&(i45.u306.p889==1))")||(X("((i1.u6.p19==0)&&(i17.i0.i1....225
Formula 0 simplified : G(F(!"((i1.u6.p19==0)&&(i17.i0.i1.u103.p290==1))" & X(!"((i3.u14.p37==0)&&(i45.u306.p889==1))" & X!"((i1.u6.p19==0)&&(i17.i0.i1.u103...213
Compilation finished in 29416 ms.
Running link step : cd /tmp/ltsmin1115180620713825973;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin1115180620713825973;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '<>(([](((LTLAPp0==true)||X(((LTLAPp1==true)||X((LTLAPp0==true))))))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t83, t128, t162, t164, t181, t225, t226, t231, t265, t282, t326, t360, t362, t379, t458, t460...686
Computing Next relation with stutter on 6.73277e+06 deadlock states
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin1115180620713825973;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '<>(([](((LTLAPp0==true)||X(((LTLAPp1==true)||X((LTLAPp0==true))))))||[]((LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1115180620713825973;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-25 11:35:36] [INFO ] Applying decomposition
[2026-05-25 11:35:44] [INFO ] Flatten gal took : 7779 ms
[2026-05-25 11:35:44] [INFO ] Decomposing Gal with order
[2026-05-25 11:35:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 11:35:49] [INFO ] Removed a total of 31511 redundant transitions.
[2026-05-25 11:35:49] [INFO ] Flatten gal took : 1079 ms
[2026-05-25 11:35:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 354 labels/synchronizations in 100 ms.
[2026-05-25 11:35:49] [INFO ] Time to serialize gal into /tmp/LTLCardinality2190265033397821830.gal : 36 ms
[2026-05-25 11:35:49] [INFO ] Time to serialize properties into /tmp/LTLCardinality14403775187283096406.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2190265033397821830.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14403775187283096406.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((F((G(("((i0.i0.i0.i0.i0.i0.u7.p19==0)&&(i0.i0.i0.i0.i0.u9.p290==1))")||(X(("((i0.i0.i0.i0.i0.i0.u7.p37==0)&&(i0.u13.p889==1))")||(X...285
Formula 0 simplified : G(F(!"((i0.i0.i0.i0.i0.i0.u7.p19==0)&&(i0.i0.i0.i0.i0.u9.p290==1))" & X(!"((i0.i0.i0.i0.i0.i0.u7.p37==0)&&(i0.u13.p889==1))" & X!"((...273
Reverse transition relation is NOT exact ! Due to transitions t798, i0.u13.t83, i0.u13.t127, i0.u13.t128, i0.u13.t161, i0.u13.t162, i0.u13.t164, i0.u13.t53...1312
Computing Next relation with stutter on 6.73277e+06 deadlock states
370 unique states visited
204 strongly connected components in search stack
374 transitions explored
370 items max in DFS search stack
27365 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,273.729,2216148,1,0,1.0719e+06,4.91348e+06,716,3.24991e+06,4510,2.404e+07,203801
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA MedleyB-PT-B06-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F("((i0.u13.p914==0)||(i0.i0.i0.i0.i0.u9.p305==1))"))))
Formula 1 simplified : FG!"((i0.u13.p914==0)||(i0.i0.i0.i0.i0.u9.p305==1))"
Computing Next relation with stutter on 6.73277e+06 deadlock states
205 unique states visited
205 strongly connected components in search stack
206 transitions explored
205 items max in DFS search stack
5467 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,328.404,2312152,1,0,1.0719e+06,6.39749e+06,773,3.24991e+06,5369,2.65564e+07,273270
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA MedleyB-PT-B06-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin1115180620713825973;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2635980 ms.

BK_STOP 1779709294324

--------------------
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-B06"
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-B06, 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-177969020100323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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