fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r058-smll-174854064700756
Last Updated
June 24, 2025

About the Execution of ITS-Tools for DiscoveryGPU-PT-15a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 186028.00 0.00 0.00 TTFFTTFFFFFFFFFF normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 53K May 29 14:32 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 DiscoveryGPU-PT-15a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748956227197

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-15a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 13:10:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 13:10:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 13:10:30] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2025-06-03 13:10:30] [INFO ] Transformed 153 places.
[2025-06-03 13:10:30] [INFO ] Transformed 211 transitions.
[2025-06-03 13:10:30] [INFO ] Found NUPN structural information;
[2025-06-03 13:10:30] [INFO ] Parsed PT model containing 153 places and 211 transitions and 678 arcs in 416 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 211/211 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 140 transition count 198
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 140 transition count 198
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 38 place count 128 transition count 186
Iterating global reduction 0 with 12 rules applied. Total rules applied 50 place count 128 transition count 186
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 119 transition count 168
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 119 transition count 168
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 74 place count 119 transition count 162
Applied a total of 74 rules in 129 ms. Remains 119 /153 variables (removed 34) and now considering 162/211 (removed 49) transitions.
// Phase 1: matrix 162 rows 119 cols
[2025-06-03 13:10:30] [INFO ] Computed 2 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:10:31] [INFO ] Implicit Places using invariants in 408 ms returned []
[2025-06-03 13:10:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:10:31] [INFO ] State equation strengthened by 108 read => feed constraints.
[2025-06-03 13:10:31] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 920 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2025-06-03 13:10:31] [INFO ] Invariant cache hit.
[2025-06-03 13:10:31] [INFO ] State equation strengthened by 108 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 162/281 variables, 119/121 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 108/229 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/281 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 229 constraints, problems are : Problem set: 0 solved, 161 unsolved in 10124 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 119/119 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 162/281 variables, 119/121 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 108/229 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 161/390 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 0/281 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 390 constraints, problems are : Problem set: 0 solved, 161 unsolved in 11478 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 119/119 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21715ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 21741ms
Starting structural reductions in LTL mode, iteration 1 : 119/153 places, 162/211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22830 ms. Remains : 119/153 places, 162/211 transitions.
Support contains 33 out of 119 places after structural reductions.
[2025-06-03 13:10:53] [INFO ] Flatten gal took : 46 ms
[2025-06-03 13:10:53] [INFO ] Flatten gal took : 39 ms
[2025-06-03 13:10:53] [INFO ] Input system was already deterministic with 162 transitions.
RANDOM walk for 17540 steps (107 resets) in 445 ms. (39 steps per ms) remains 0/33 properties
FORMULA DiscoveryGPU-PT-15a-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 18 stabilizing places and 16 stable transitions
Graph (complete) has 369 edges and 119 vertex of which 117 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U ((p1&&X(!p0))||X(G(!p0)))))'
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 162/162 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 115 transition count 158
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 115 transition count 158
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 113 transition count 156
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 113 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 112 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 112 transition count 155
Applied a total of 14 rules in 31 ms. Remains 112 /119 variables (removed 7) and now considering 155/162 (removed 7) transitions.
// Phase 1: matrix 155 rows 112 cols
[2025-06-03 13:10:54] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:10:54] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-06-03 13:10:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:10:55] [INFO ] State equation strengthened by 106 read => feed constraints.
[2025-06-03 13:10:55] [INFO ] Implicit Places using invariants and state equation in 405 ms returned [111]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 552 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 111/119 places, 155/162 transitions.
Applied a total of 0 rules in 9 ms. Remains 111 /111 variables (removed 0) and now considering 155/155 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 592 ms. Remains : 111/119 places, 155/162 transitions.
Stuttering acceptance computed with spot in 394 ms :[p0, p0, true]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 968 ms.
Product exploration explored 100000 steps with 50000 reset in 347 ms.
Computed a total of 17 stabilizing places and 16 stable transitions
Graph (complete) has 307 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 24 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-15a-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-01 finished in 2443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1)&&F((F(p3)&&p2))&&F(p4))))'
Support contains 4 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 162/162 transitions.
Graph (complete) has 369 edges and 119 vertex of which 117 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 117 transition count 158
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 115 transition count 158
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 9 place count 111 transition count 154
Iterating global reduction 0 with 4 rules applied. Total rules applied 13 place count 111 transition count 154
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 15 place count 110 transition count 153
Applied a total of 15 rules in 35 ms. Remains 110 /119 variables (removed 9) and now considering 153/162 (removed 9) transitions.
// Phase 1: matrix 153 rows 110 cols
[2025-06-03 13:10:57] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:10:57] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-06-03 13:10:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:10:57] [INFO ] State equation strengthened by 106 read => feed constraints.
[2025-06-03 13:10:57] [INFO ] Implicit Places using invariants and state equation in 458 ms returned [109]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 622 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/119 places, 153/162 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 58 place count 80 transition count 124
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 71 place count 67 transition count 98
Iterating global reduction 0 with 13 rules applied. Total rules applied 84 place count 67 transition count 98
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 96 place count 55 transition count 74
Iterating global reduction 0 with 12 rules applied. Total rules applied 108 place count 55 transition count 74
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 120 place count 43 transition count 62
Iterating global reduction 0 with 12 rules applied. Total rules applied 132 place count 43 transition count 62
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 144 place count 31 transition count 38
Iterating global reduction 0 with 12 rules applied. Total rules applied 156 place count 31 transition count 38
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 168 place count 19 transition count 26
Iterating global reduction 0 with 12 rules applied. Total rules applied 180 place count 19 transition count 26
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 181 place count 19 transition count 26
Applied a total of 181 rules in 20 ms. Remains 19 /109 variables (removed 90) and now considering 26/153 (removed 127) transitions.
[2025-06-03 13:10:57] [INFO ] Flow matrix only has 22 transitions (discarded 4 similar events)
// Phase 1: matrix 22 rows 19 cols
[2025-06-03 13:10:57] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:10:57] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-03 13:10:57] [INFO ] Flow matrix only has 22 transitions (discarded 4 similar events)
[2025-06-03 13:10:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:10:57] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-03 13:10:57] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/119 places, 26/162 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 773 ms. Remains : 19/119 places, 26/162 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p2) (NOT p1) (NOT p4) (NOT p0) (NOT p3)), (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p4), (NOT p3)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-02
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-02 finished in 1038 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(p1))))'
Support contains 4 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 162/162 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 114 transition count 157
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 114 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 113 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 113 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 112 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 112 transition count 155
Applied a total of 14 rules in 18 ms. Remains 112 /119 variables (removed 7) and now considering 155/162 (removed 7) transitions.
// Phase 1: matrix 155 rows 112 cols
[2025-06-03 13:10:58] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:10:58] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-03 13:10:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:10:58] [INFO ] State equation strengthened by 106 read => feed constraints.
[2025-06-03 13:10:58] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2025-06-03 13:10:58] [INFO ] Invariant cache hit.
[2025-06-03 13:10:58] [INFO ] State equation strengthened by 106 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 155/267 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 106/220 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 154 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/267 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 220 constraints, problems are : Problem set: 0 solved, 154 unsolved in 10796 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 155/267 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 106/220 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 154/374 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 0/267 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 374 constraints, problems are : Problem set: 0 solved, 154 unsolved in 11460 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22285ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 22288ms
Starting structural reductions in LTL mode, iteration 1 : 112/119 places, 155/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22628 ms. Remains : 112/119 places, 155/162 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-03 finished in 22852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U X((X(p1)&&G(p2)))) U X(p3)))'
Support contains 5 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 162/162 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 114 transition count 157
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 114 transition count 157
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 112 transition count 155
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 112 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 111 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 111 transition count 154
Applied a total of 16 rules in 8 ms. Remains 111 /119 variables (removed 8) and now considering 154/162 (removed 8) transitions.
// Phase 1: matrix 154 rows 111 cols
[2025-06-03 13:11:21] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:11:21] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-06-03 13:11:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:11:21] [INFO ] State equation strengthened by 106 read => feed constraints.
[2025-06-03 13:11:21] [INFO ] Implicit Places using invariants and state equation in 489 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 608 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/119 places, 154/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 110 /110 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 619 ms. Remains : 110/119 places, 154/162 transitions.
Stuttering acceptance computed with spot in 589 ms :[(NOT p3), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p3), (NOT p0), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 537 ms.
Product exploration explored 100000 steps with 50000 reset in 526 ms.
Computed a total of 17 stabilizing places and 16 stable transitions
Graph (complete) has 306 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 17 stabilizing places and 16 stable transitions
Detected a total of 17/110 stabilizing places and 16/154 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p2)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 27 ms. Reduced automaton from 11 states, 34 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-15a-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-05 finished in 2355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 7 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 162/162 transitions.
Graph (complete) has 369 edges and 119 vertex of which 117 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 117 transition count 159
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 116 transition count 159
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 6 place count 113 transition count 156
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 113 transition count 156
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 112 transition count 155
Applied a total of 11 rules in 32 ms. Remains 112 /119 variables (removed 7) and now considering 155/162 (removed 7) transitions.
// Phase 1: matrix 155 rows 112 cols
[2025-06-03 13:11:23] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:11:23] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-03 13:11:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:11:23] [INFO ] State equation strengthened by 107 read => feed constraints.
[2025-06-03 13:11:23] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:11:23] [INFO ] Redundant transitions in 9 ms returned []
Running 154 sub problems to find dead transitions.
[2025-06-03 13:11:23] [INFO ] Invariant cache hit.
[2025-06-03 13:11:23] [INFO ] State equation strengthened by 107 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 155/267 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 107/221 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (OVERLAPS) 0/267 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 221 constraints, problems are : Problem set: 0 solved, 154 unsolved in 11903 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 155/267 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 107/221 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 154/375 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 0/267 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 375 constraints, problems are : Problem set: 0 solved, 154 unsolved in 8881 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20816ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 20819ms
Starting structural reductions in SI_LTL mode, iteration 1 : 112/119 places, 155/162 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21265 ms. Remains : 112/119 places, 155/162 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-06
Stuttering criterion allowed to conclude after 111 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-06 finished in 21395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U X(X(X(X(p1))))) U p2))))'
Support contains 5 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 162/162 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 115 transition count 158
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 115 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 114 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 114 transition count 157
Applied a total of 10 rules in 9 ms. Remains 114 /119 variables (removed 5) and now considering 157/162 (removed 5) transitions.
// Phase 1: matrix 157 rows 114 cols
[2025-06-03 13:11:44] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:11:44] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-03 13:11:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:11:45] [INFO ] State equation strengthened by 107 read => feed constraints.
[2025-06-03 13:11:45] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2025-06-03 13:11:45] [INFO ] Invariant cache hit.
[2025-06-03 13:11:45] [INFO ] State equation strengthened by 107 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 157/271 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 107/223 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 156 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/271 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 223 constraints, problems are : Problem set: 0 solved, 156 unsolved in 9815 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 157/271 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 107/223 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 156/379 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 0/271 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 379 constraints, problems are : Problem set: 0 solved, 156 unsolved in 10695 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20543ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 20545ms
Starting structural reductions in LTL mode, iteration 1 : 114/119 places, 157/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20906 ms. Remains : 114/119 places, 157/162 transitions.
Stuttering acceptance computed with spot in 1933 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-07
Stuttering criterion allowed to conclude after 159 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-07 finished in 22973 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0||G(F(p1)))) U X(X(p2)))))'
Support contains 5 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 162/162 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 114 transition count 157
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 114 transition count 157
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 112 transition count 155
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 112 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 111 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 111 transition count 154
Applied a total of 16 rules in 9 ms. Remains 111 /119 variables (removed 8) and now considering 154/162 (removed 8) transitions.
// Phase 1: matrix 154 rows 111 cols
[2025-06-03 13:12:07] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:12:07] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-03 13:12:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:12:07] [INFO ] State equation strengthened by 106 read => feed constraints.
[2025-06-03 13:12:08] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2025-06-03 13:12:08] [INFO ] Invariant cache hit.
[2025-06-03 13:12:08] [INFO ] State equation strengthened by 106 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 154/265 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 106/219 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 153 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/265 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 219 constraints, problems are : Problem set: 0 solved, 153 unsolved in 8002 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 154/265 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 106/219 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 153/372 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 0/265 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 372 constraints, problems are : Problem set: 0 solved, 153 unsolved in 8913 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16945ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 16947ms
Starting structural reductions in LTL mode, iteration 1 : 111/119 places, 154/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17298 ms. Remains : 111/119 places, 154/162 transitions.
Stuttering acceptance computed with spot in 465 ms :[(NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-08
Stuttering criterion allowed to conclude after 44217 steps with 1925 reset in 177 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-08 finished in 17968 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0)&&X(X(G(p1))))))))'
Support contains 4 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 162/162 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 114 transition count 157
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 114 transition count 157
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 112 transition count 155
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 112 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 111 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 111 transition count 154
Applied a total of 16 rules in 10 ms. Remains 111 /119 variables (removed 8) and now considering 154/162 (removed 8) transitions.
[2025-06-03 13:12:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:12:25] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-06-03 13:12:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:12:25] [INFO ] State equation strengthened by 106 read => feed constraints.
[2025-06-03 13:12:26] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2025-06-03 13:12:26] [INFO ] Invariant cache hit.
[2025-06-03 13:12:26] [INFO ] State equation strengthened by 106 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 154/265 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 106/219 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 153 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/265 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 219 constraints, problems are : Problem set: 0 solved, 153 unsolved in 10572 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 154/265 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 106/219 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 153/372 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 0/265 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 372 constraints, problems are : Problem set: 0 solved, 153 unsolved in 11782 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22381ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 22383ms
Starting structural reductions in LTL mode, iteration 1 : 111/119 places, 154/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22865 ms. Remains : 111/119 places, 154/162 transitions.
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-09
Entered a terminal (fully accepting) state of product in 71 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-09 finished in 23253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(X((G(X(p0)) U X(p1)))))&&X(X(p1)))))'
Support contains 3 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 162/162 transitions.
Graph (complete) has 369 edges and 119 vertex of which 117 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 117 transition count 157
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 114 transition count 157
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 12 place count 109 transition count 152
Iterating global reduction 0 with 5 rules applied. Total rules applied 17 place count 109 transition count 152
Applied a total of 17 rules in 27 ms. Remains 109 /119 variables (removed 10) and now considering 152/162 (removed 10) transitions.
// Phase 1: matrix 152 rows 109 cols
[2025-06-03 13:12:48] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:12:49] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-03 13:12:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:12:49] [INFO ] State equation strengthened by 106 read => feed constraints.
[2025-06-03 13:12:49] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:12:49] [INFO ] Redundant transitions in 7 ms returned []
Running 151 sub problems to find dead transitions.
[2025-06-03 13:12:49] [INFO ] Invariant cache hit.
[2025-06-03 13:12:49] [INFO ] State equation strengthened by 106 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 152/261 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 106/217 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (OVERLAPS) 0/261 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/261 variables, and 217 constraints, problems are : Problem set: 0 solved, 151 unsolved in 11823 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (OVERLAPS) 152/261 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 106/217 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 151/368 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (OVERLAPS) 0/261 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 261/261 variables, and 368 constraints, problems are : Problem set: 0 solved, 151 unsolved in 10508 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22349ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 22351ms
Starting structural reductions in SI_LTL mode, iteration 1 : 109/119 places, 152/162 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22843 ms. Remains : 109/119 places, 152/162 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-12
Stuttering criterion allowed to conclude after 152 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-12 finished in 22987 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&G((p1||X(p2)))))'
Support contains 4 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 162/162 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 114 transition count 157
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 114 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 113 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 113 transition count 156
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 112 transition count 155
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 112 transition count 155
Applied a total of 14 rules in 5 ms. Remains 112 /119 variables (removed 7) and now considering 155/162 (removed 7) transitions.
// Phase 1: matrix 155 rows 112 cols
[2025-06-03 13:13:11] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:13:11] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-03 13:13:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:13:12] [INFO ] State equation strengthened by 106 read => feed constraints.
[2025-06-03 13:13:12] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2025-06-03 13:13:12] [INFO ] Invariant cache hit.
[2025-06-03 13:13:12] [INFO ] State equation strengthened by 106 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 155/267 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 106/220 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 154 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/267 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 220 constraints, problems are : Problem set: 0 solved, 154 unsolved in 10513 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 155/267 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 106/220 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 154/374 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 0/267 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 374 constraints, problems are : Problem set: 0 solved, 154 unsolved in 8719 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19254ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 19255ms
Starting structural reductions in LTL mode, iteration 1 : 112/119 places, 155/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19555 ms. Remains : 112/119 places, 155/162 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-13
Entered a terminal (fully accepting) state of product in 55 steps with 1 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-13 finished in 19745 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||G(p1))))'
Support contains 3 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 162/162 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 114 transition count 157
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 114 transition count 157
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 112 transition count 155
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 112 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 111 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 111 transition count 154
Applied a total of 16 rules in 4 ms. Remains 111 /119 variables (removed 8) and now considering 154/162 (removed 8) transitions.
// Phase 1: matrix 154 rows 111 cols
[2025-06-03 13:13:31] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:13:31] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-03 13:13:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:13:31] [INFO ] State equation strengthened by 106 read => feed constraints.
[2025-06-03 13:13:32] [INFO ] Implicit Places using invariants and state equation in 353 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 480 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/119 places, 154/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 110 /110 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 485 ms. Remains : 110/119 places, 154/162 transitions.
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-14 finished in 730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(X(G(p0))))))))'
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 162/162 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 114 transition count 157
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 114 transition count 157
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 112 transition count 155
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 112 transition count 155
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 111 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 111 transition count 154
Applied a total of 16 rules in 3 ms. Remains 111 /119 variables (removed 8) and now considering 154/162 (removed 8) transitions.
[2025-06-03 13:13:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:13:32] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-03 13:13:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:13:32] [INFO ] State equation strengthened by 106 read => feed constraints.
[2025-06-03 13:13:32] [INFO ] Implicit Places using invariants and state equation in 380 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 472 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/119 places, 154/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 110 /110 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 476 ms. Remains : 110/119 places, 154/162 transitions.
Stuttering acceptance computed with spot in 309 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-15
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-15 finished in 802 ms.
All properties solved by simple procedures.
Total runtime 183370 ms.

BK_STOP 1748956413225

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-15a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r058-smll-174854064700756"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-15a.tgz
mv DiscoveryGPU-PT-15a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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