Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854064500612.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-06a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854064500612
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K 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 65K 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.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 194K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 22K 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-06a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748910360634

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-06a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 00:26:02] [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 00:26:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 00:26:02] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2025-06-03 00:26:02] [INFO ] Transformed 63 places.
[2025-06-03 00:26:02] [INFO ] Transformed 85 transitions.
[2025-06-03 00:26:02] [INFO ] Found NUPN structural information;
[2025-06-03 00:26:02] [INFO ] Parsed PT model containing 63 places and 85 transitions and 273 arcs in 224 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 85/85 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 83
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 83
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 10 place count 61 transition count 77
Applied a total of 10 rules in 50 ms. Remains 61 /63 variables (removed 2) and now considering 77/85 (removed 8) transitions.
// Phase 1: matrix 77 rows 61 cols
[2025-06-03 00:26:03] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:03] [INFO ] Implicit Places using invariants in 248 ms returned []
[2025-06-03 00:26:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:03] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-03 00:26:03] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2025-06-03 00:26:03] [INFO ] Invariant cache hit.
[2025-06-03 00:26:03] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 77/138 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 48/111 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 0/138 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 111 constraints, problems are : Problem set: 0 solved, 76 unsolved in 3496 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 77/138 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 48/111 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 76/187 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/138 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 187 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2918 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6577ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 6593ms
Starting structural reductions in LTL mode, iteration 1 : 61/63 places, 77/85 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7117 ms. Remains : 61/63 places, 77/85 transitions.
Support contains 33 out of 61 places after structural reductions.
[2025-06-03 00:26:10] [INFO ] Flatten gal took : 33 ms
[2025-06-03 00:26:10] [INFO ] Flatten gal took : 14 ms
[2025-06-03 00:26:10] [INFO ] Input system was already deterministic with 77 transitions.
RANDOM walk for 7730 steps (114 resets) in 321 ms. (24 steps per ms) remains 0/34 properties
FORMULA DiscoveryGPU-PT-06a-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DiscoveryGPU-PT-06a-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 9 stabilizing places and 7 stable transitions
Graph (complete) has 170 edges and 61 vertex of which 57 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 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)))'
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 77/77 transitions.
Graph (complete) has 170 edges and 61 vertex of which 58 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 58 transition count 68
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 52 transition count 68
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 17 place count 48 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 21 place count 48 transition count 64
Applied a total of 21 rules in 34 ms. Remains 48 /61 variables (removed 13) and now considering 64/77 (removed 13) transitions.
// Phase 1: matrix 64 rows 48 cols
[2025-06-03 00:26:11] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:11] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-03 00:26:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:11] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-03 00:26:11] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 178 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/61 places, 64/77 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 35 transition count 52
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 31 transition count 44
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 31 transition count 44
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 28 transition count 38
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 28 transition count 38
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 25 transition count 35
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 25 transition count 35
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 22 transition count 29
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 22 transition count 29
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 19 transition count 26
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 19 transition count 26
Applied a total of 56 rules in 13 ms. Remains 19 /47 variables (removed 28) and now considering 26/64 (removed 38) transitions.
[2025-06-03 00:26:11] [INFO ] Flow matrix only has 22 transitions (discarded 4 similar events)
// Phase 1: matrix 22 rows 19 cols
[2025-06-03 00:26:11] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:11] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-03 00:26:11] [INFO ] Flow matrix only has 22 transitions (discarded 4 similar events)
[2025-06-03 00:26:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:11] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-03 00:26:11] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/61 places, 26/77 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 329 ms. Remains : 19/61 places, 26/77 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-00 finished in 664 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)&&F(G(p1)))))'
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 77/77 transitions.
Graph (complete) has 170 edges and 61 vertex of which 57 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 57 transition count 67
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 51 transition count 67
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 18 place count 46 transition count 62
Iterating global reduction 0 with 5 rules applied. Total rules applied 23 place count 46 transition count 62
Applied a total of 23 rules in 13 ms. Remains 46 /61 variables (removed 15) and now considering 62/77 (removed 15) transitions.
// Phase 1: matrix 62 rows 46 cols
[2025-06-03 00:26:11] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:11] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-03 00:26:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:12] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 00:26:12] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 170 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/61 places, 62/77 transitions.
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 0 with 22 rules applied. Total rules applied 22 place count 34 transition count 51
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 29 transition count 41
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 29 transition count 41
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 25 transition count 33
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 25 transition count 33
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 21 transition count 29
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 21 transition count 29
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 18 transition count 23
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 18 transition count 23
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 15 transition count 20
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 15 transition count 20
Applied a total of 60 rules in 9 ms. Remains 15 /45 variables (removed 30) and now considering 20/62 (removed 42) transitions.
[2025-06-03 00:26:12] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
// Phase 1: matrix 18 rows 15 cols
[2025-06-03 00:26:12] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:12] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-03 00:26:12] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2025-06-03 00:26:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:12] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-03 00:26:12] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/61 places, 20/77 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 263 ms. Remains : 15/61 places, 20/77 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-01
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-01 finished in 434 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(p0) U ((p1 U X(p2))&&X(p3))))'
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 77/77 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 56 transition count 72
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 56 transition count 72
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 52 transition count 68
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 52 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 51 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 51 transition count 67
Applied a total of 20 rules in 7 ms. Remains 51 /61 variables (removed 10) and now considering 67/77 (removed 10) transitions.
// Phase 1: matrix 67 rows 51 cols
[2025-06-03 00:26:12] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:12] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-03 00:26:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:12] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-03 00:26:12] [INFO ] Implicit Places using invariants and state equation in 111 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 157 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/61 places, 67/77 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 165 ms. Remains : 50/61 places, 67/77 transitions.
Stuttering acceptance computed with spot in 404 ms :[(OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), (NOT p2), (NOT p3), (NOT p2), (NOT p2), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-03
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-03 finished in 598 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((p0 U !p1)) U X(X(X((p2||F(p3)))))))'
Support contains 6 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 77/77 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 57 transition count 73
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 57 transition count 73
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 53 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 53 transition count 69
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 50 transition count 66
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 50 transition count 66
Applied a total of 22 rules in 6 ms. Remains 50 /61 variables (removed 11) and now considering 66/77 (removed 11) transitions.
// Phase 1: matrix 66 rows 50 cols
[2025-06-03 00:26:12] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:13] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-03 00:26:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:13] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-03 00:26:13] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2025-06-03 00:26:13] [INFO ] Invariant cache hit.
[2025-06-03 00:26:13] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 66/116 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 44/96 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 0/116 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 96 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2821 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 66/116 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 44/96 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 65/161 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/116 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 161 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2202 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5041ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 5043ms
Starting structural reductions in LTL mode, iteration 1 : 50/61 places, 66/77 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5228 ms. Remains : 50/61 places, 66/77 transitions.
Stuttering acceptance computed with spot in 539 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-04
Product exploration explored 100000 steps with 25000 reset in 633 ms.
Product exploration explored 100000 steps with 25000 reset in 377 ms.
Computed a total of 9 stabilizing places and 7 stable transitions
Graph (complete) has 151 edges and 50 vertex of which 49 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 9 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) p3), (X (OR (NOT p1) p0)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (OR (NOT p1) p0))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 120 ms. Reduced automaton from 10 states, 19 edges and 4 AP (stutter sensitive) to 7 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
RANDOM walk for 6699 steps (95 resets) in 120 ms. (55 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) p3), (X (OR (NOT p1) p0)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (OR (NOT p1) p0))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (OR p1 p3) (OR (NOT p0) p3)))), (F (NOT (AND (OR p1 p2 p3) (OR p2 (NOT p0) p3)))), (F p0), (F (NOT (OR (NOT p1) (NOT p0) p3))), (F p2), (F (NOT (OR (NOT p1) p2 (NOT p0) p3))), (F (NOT (OR (NOT p1) p0 p3))), (F (NOT (OR (NOT p1) p2 p0 p3))), (F (NOT p3)), (F p1)]
Knowledge based reduction with 9 factoid took 602 ms. Reduced automaton from 7 states, 13 edges and 4 AP (stutter sensitive) to 7 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 445 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Stuttering acceptance computed with spot in 430 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 66/66 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2025-06-03 00:26:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:21] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-03 00:26:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:21] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-03 00:26:22] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2025-06-03 00:26:22] [INFO ] Invariant cache hit.
[2025-06-03 00:26:22] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 66/116 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 44/96 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 0/116 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 96 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2751 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 66/116 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 44/96 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 65/161 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/116 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 161 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2911 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5679ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 5680ms
Finished structural reductions in LTL mode , in 1 iterations and 5898 ms. Remains : 50/50 places, 66/66 transitions.
Computed a total of 9 stabilizing places and 7 stable transitions
Graph (complete) has 151 edges and 50 vertex of which 49 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 9 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p3 (NOT p1) (NOT p2) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 140 ms. Reduced automaton from 7 states, 13 edges and 4 AP (stutter sensitive) to 7 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 462 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
RANDOM walk for 21363 steps (322 resets) in 121 ms. (175 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p3 (NOT p1) (NOT p2) (NOT p0))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1) p2 p3))), (F (NOT (AND (OR (NOT p0) p3) (OR p1 p3)))), (F (NOT (OR (NOT p0) (NOT p1) p3))), (F (NOT (OR (NOT p0) (NOT p1) p2 p3))), (F p2), (F (NOT (OR p0 (NOT p1) p3))), (F (NOT (AND (OR (NOT p0) p2 p3) (OR p1 p2 p3)))), (F (NOT p3)), (F p0), (F p1)]
Knowledge based reduction with 1 factoid took 486 ms. Reduced automaton from 7 states, 13 edges and 4 AP (stutter sensitive) to 7 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 407 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Stuttering acceptance computed with spot in 428 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Stuttering acceptance computed with spot in 428 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Product exploration explored 100000 steps with 25000 reset in 235 ms.
Product exploration explored 100000 steps with 25000 reset in 243 ms.
Applying partial POR strategy [false, false, true, false, true, true, true]
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 66/66 transitions.
Graph (complete) has 151 edges and 50 vertex of which 49 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 49 transition count 65
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 49 transition count 65
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 9 ms. Remains 49 /50 variables (removed 1) and now considering 65/66 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:26:31] [INFO ] Redundant transitions in 2 ms returned []
Running 64 sub problems to find dead transitions.
// Phase 1: matrix 65 rows 49 cols
[2025-06-03 00:26:31] [INFO ] Computed 2 invariants in 1 ms
[2025-06-03 00:26:31] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Problem TDEAD55 is UNSAT
At refinement iteration 3 (OVERLAPS) 65/114 variables, 49/51 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 45/96 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 0/114 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 96 constraints, problems are : Problem set: 1 solved, 63 unsolved in 2872 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 63 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 64/112 variables, 48/50 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 44/94 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 63/157 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 1/113 variables, 1/158 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 1/114 variables, 1/159 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/114 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 11 (OVERLAPS) 0/114 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 159 constraints, problems are : Problem set: 1 solved, 63 unsolved in 4406 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 63/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7297ms problems are : Problem set: 1 solved, 63 unsolved
Search for dead transitions found 1 dead transitions in 7299ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 49/50 places, 64/66 transitions.
Graph (complete) has 147 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 48 /49 variables (removed 1) and now considering 64/64 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/50 places, 64/66 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7327 ms. Remains : 48/50 places, 64/66 transitions.
Built C files in :
/tmp/ltsmin3370801933032745317
[2025-06-03 00:26:38] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3370801933032745317
Running compilation step : cd /tmp/ltsmin3370801933032745317;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 581 ms.
Running link step : cd /tmp/ltsmin3370801933032745317;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 82 ms.
Running LTSmin : cd /tmp/ltsmin3370801933032745317;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3334666381904518594.hoa' '--buchi-type=spotba'
LTSmin run took 233 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-04 finished in 26613 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&&((!p1||F(p2)) U (X(p2)||G((!p1||F(p2))))))))'
Support contains 6 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 77/77 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 57 transition count 73
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 57 transition count 73
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 53 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 53 transition count 69
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 51 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 51 transition count 67
Applied a total of 20 rules in 6 ms. Remains 51 /61 variables (removed 10) and now considering 67/77 (removed 10) transitions.
// Phase 1: matrix 67 rows 51 cols
[2025-06-03 00:26:39] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:39] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-03 00:26:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:39] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-03 00:26:39] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2025-06-03 00:26:39] [INFO ] Invariant cache hit.
[2025-06-03 00:26:39] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 67/118 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 44/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/118 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 97 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2313 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 67/118 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 44/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 66/163 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/118 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 163 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2358 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4687ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 4689ms
Starting structural reductions in LTL mode, iteration 1 : 51/61 places, 67/77 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4882 ms. Remains : 51/61 places, 67/77 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p2), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND (NOT p2) p1)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-05
Product exploration explored 100000 steps with 33333 reset in 136 ms.
Product exploration explored 100000 steps with 33333 reset in 144 ms.
Computed a total of 9 stabilizing places and 7 stable transitions
Graph (complete) has 152 edges and 51 vertex of which 49 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 9 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (OR (AND p0 (NOT p1)) (AND p0 p2))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 15 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-06a-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-05 finished in 5408 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)&&F(G((p1||X(X((G(p2) U p3)))))))))'
Support contains 6 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 77/77 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 57 transition count 73
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 57 transition count 73
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 53 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 53 transition count 69
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 51 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 51 transition count 67
Applied a total of 20 rules in 6 ms. Remains 51 /61 variables (removed 10) and now considering 67/77 (removed 10) transitions.
// Phase 1: matrix 67 rows 51 cols
[2025-06-03 00:26:45] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:45] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-03 00:26:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:45] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-06-03 00:26:45] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2025-06-03 00:26:45] [INFO ] Invariant cache hit.
[2025-06-03 00:26:45] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 67/118 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 44/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/118 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 97 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2634 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 67/118 variables, 51/53 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 44/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 66/163 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/118 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 163 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2688 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5332ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 5333ms
Starting structural reductions in LTL mode, iteration 1 : 51/61 places, 67/77 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5475 ms. Remains : 51/61 places, 67/77 transitions.
Stuttering acceptance computed with spot in 459 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-06
Stuttering criterion allowed to conclude after 160 steps with 2 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-06 finished in 5966 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)||(F((!p1&&X((!p1 U (!p2||G(!p1)))))) U X(X(p1)))))'
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 77/77 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 56 transition count 72
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 56 transition count 72
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 51 transition count 67
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 51 transition count 67
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 48 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 48 transition count 64
Applied a total of 26 rules in 5 ms. Remains 48 /61 variables (removed 13) and now considering 64/77 (removed 13) transitions.
// Phase 1: matrix 64 rows 48 cols
[2025-06-03 00:26:50] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:51] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-03 00:26:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:51] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 00:26:51] [INFO ] Implicit Places using invariants and state equation in 139 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 181 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/61 places, 64/77 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 189 ms. Remains : 47/61 places, 64/77 transitions.
Stuttering acceptance computed with spot in 467 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false, false, false, false, (NOT p1), false, (AND p1 p2), p1]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 122 ms.
Product exploration explored 100000 steps with 50000 reset in 177 ms.
Computed a total of 8 stabilizing places and 7 stable transitions
Graph (complete) has 126 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 15 ms. Reduced automaton from 11 states, 20 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-06a-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-07 finished in 998 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)))'
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 77/77 transitions.
Graph (complete) has 170 edges and 61 vertex of which 57 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 60 edges and 54 vertex of which 43 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Graph (trivial) has 48 edges and 43 vertex of which 24 / 43 are part of one of the 12 SCC in 3 ms
Free SCC test removed 12 places
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 0 with 10 rules applied. Total rules applied 11 place count 31 transition count 55
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 29 place count 25 transition count 43
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 33 place count 21 transition count 35
Iterating global reduction 2 with 4 rules applied. Total rules applied 37 place count 21 transition count 35
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 41 place count 17 transition count 27
Iterating global reduction 2 with 4 rules applied. Total rules applied 45 place count 17 transition count 27
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 49 place count 13 transition count 19
Iterating global reduction 2 with 4 rules applied. Total rules applied 53 place count 13 transition count 19
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 57 place count 9 transition count 15
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 9 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 7 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 7 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 5 transition count 10
Applied a total of 68 rules in 22 ms. Remains 5 /61 variables (removed 56) and now considering 10/77 (removed 67) transitions.
[2025-06-03 00:26:51] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 5 cols
[2025-06-03 00:26:51] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:51] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-03 00:26:51] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
[2025-06-03 00:26:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:52] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:26:52] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-03 00:26:52] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
[2025-06-03 00:26:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/11 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/12 variables, and 5 constraints, problems are : Problem set: 0 solved, 5 unsolved in 91 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/11 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/12 variables, and 10 constraints, problems are : Problem set: 0 solved, 5 unsolved in 83 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 179ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 179ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/61 places, 10/77 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 249 ms. Remains : 5/61 places, 10/77 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-08
Stuttering criterion allowed to conclude after 56 steps with 2 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-08 finished in 340 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((G(p0)||X(p1)))&&(G(p2)||G(p3))))'
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 77/77 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 58 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 58 transition count 74
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 55 transition count 71
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 55 transition count 71
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 53 transition count 69
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 53 transition count 69
Applied a total of 16 rules in 5 ms. Remains 53 /61 variables (removed 8) and now considering 69/77 (removed 8) transitions.
// Phase 1: matrix 69 rows 53 cols
[2025-06-03 00:26:52] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:52] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-03 00:26:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:52] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-03 00:26:52] [INFO ] Implicit Places using invariants and state equation in 109 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 170 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/61 places, 69/77 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 176 ms. Remains : 52/61 places, 69/77 transitions.
Stuttering acceptance computed with spot in 338 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p1) (NOT p0)), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-10
Entered a terminal (fully accepting) state of product in 57 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-10 finished in 544 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||X(G(p1)))))'
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 77/77 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 56 transition count 72
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 56 transition count 72
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 51 transition count 67
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 51 transition count 67
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 48 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 48 transition count 64
Applied a total of 26 rules in 4 ms. Remains 48 /61 variables (removed 13) and now considering 64/77 (removed 13) transitions.
// Phase 1: matrix 64 rows 48 cols
[2025-06-03 00:26:52] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:52] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-03 00:26:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:52] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 00:26:52] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2025-06-03 00:26:52] [INFO ] Invariant cache hit.
[2025-06-03 00:26:52] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 64/112 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 43/93 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 0/112 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 93 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1597 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 64/112 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 43/93 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 63/156 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/112 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 156 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2497 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4104ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 4105ms
Starting structural reductions in LTL mode, iteration 1 : 48/61 places, 64/77 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4228 ms. Remains : 48/61 places, 64/77 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-11
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-11 finished in 4379 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)))'
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 77/77 transitions.
Graph (complete) has 170 edges and 61 vertex of which 58 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 58 transition count 69
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 53 transition count 69
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 14 place count 50 transition count 66
Iterating global reduction 0 with 3 rules applied. Total rules applied 17 place count 50 transition count 66
Applied a total of 17 rules in 6 ms. Remains 50 /61 variables (removed 11) and now considering 66/77 (removed 11) transitions.
// Phase 1: matrix 66 rows 50 cols
[2025-06-03 00:26:57] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:57] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-06-03 00:26:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:57] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-03 00:26:57] [INFO ] Implicit Places using invariants and state equation in 91 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 139 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/61 places, 66/77 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 37 transition count 54
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 34 transition count 48
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 34 transition count 48
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 31 transition count 42
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 31 transition count 42
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 28 transition count 39
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 28 transition count 39
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 25 transition count 33
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 25 transition count 33
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 22 transition count 30
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 22 transition count 30
Applied a total of 54 rules in 8 ms. Remains 22 /49 variables (removed 27) and now considering 30/66 (removed 36) transitions.
[2025-06-03 00:26:57] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
// Phase 1: matrix 25 rows 22 cols
[2025-06-03 00:26:57] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:57] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-03 00:26:57] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
[2025-06-03 00:26:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:57] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-06-03 00:26:57] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/61 places, 30/77 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 249 ms. Remains : 22/61 places, 30/77 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-13
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-13 finished in 339 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))||G(p1)))'
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 77/77 transitions.
Graph (complete) has 170 edges and 61 vertex of which 57 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 57 transition count 67
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 51 transition count 67
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 18 place count 46 transition count 62
Iterating global reduction 0 with 5 rules applied. Total rules applied 23 place count 46 transition count 62
Applied a total of 23 rules in 5 ms. Remains 46 /61 variables (removed 15) and now considering 62/77 (removed 15) transitions.
// Phase 1: matrix 62 rows 46 cols
[2025-06-03 00:26:57] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:57] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-03 00:26:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:26:57] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 00:26:57] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 00:26:57] [INFO ] Redundant transitions in 2 ms returned []
Running 61 sub problems to find dead transitions.
[2025-06-03 00:26:57] [INFO ] Invariant cache hit.
[2025-06-03 00:26:57] [INFO ] State equation strengthened by 43 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 62/108 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 43/91 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 0/108 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 91 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2413 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 62/108 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 43/91 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 61/152 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 0/108 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 152 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1753 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4178ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 4179ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/61 places, 62/77 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4359 ms. Remains : 46/61 places, 62/77 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-14
Product exploration explored 100000 steps with 1696 reset in 202 ms.
Stack based approach found an accepted trace after 82 steps with 1 reset with depth 43 and stack size 40 in 1 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-14 finished in 4647 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(p0) U X(X(p1))))'
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 77/77 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 56 transition count 72
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 56 transition count 72
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 51 transition count 67
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 51 transition count 67
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 48 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 48 transition count 64
Applied a total of 26 rules in 2 ms. Remains 48 /61 variables (removed 13) and now considering 64/77 (removed 13) transitions.
// Phase 1: matrix 64 rows 48 cols
[2025-06-03 00:27:02] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:27:02] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-03 00:27:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 00:27:02] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 00:27:02] [INFO ] Implicit Places using invariants and state equation in 117 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 173 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/61 places, 64/77 transitions.
Applied a total of 0 rules in 0 ms. Remains 47 /47 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 176 ms. Remains : 47/61 places, 64/77 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-15 finished in 422 ms.
All properties solved by simple procedures.
Total runtime 60011 ms.

BK_STOP 1748910422731

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

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