About the Execution of ITS-Tools for GPUForwardProgress-PT-04b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 110946.00 | 0.00 | 0.00 | FTFTFFFTFFFFTTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867007800388.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 GPUForwardProgress-PT-04b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867007800388
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 10K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 27K 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 GPUForwardProgress-PT-04b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748957559247
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 13:32:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 13:32:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 13:32:41] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2025-06-03 13:32:41] [INFO ] Transformed 112 places.
[2025-06-03 13:32:41] [INFO ] Transformed 117 transitions.
[2025-06-03 13:32:41] [INFO ] Found NUPN structural information;
[2025-06-03 13:32:42] [INFO ] Parsed PT model containing 112 places and 117 transitions and 277 arcs in 363 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 117/117 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 117
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 99 transition count 105
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 99 transition count 105
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 96 transition count 102
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 96 transition count 102
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 34 place count 96 transition count 99
Applied a total of 34 rules in 81 ms. Remains 96 /112 variables (removed 16) and now considering 99/117 (removed 18) transitions.
// Phase 1: matrix 99 rows 96 cols
[2025-06-03 13:32:42] [INFO ] Computed 5 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:32:42] [INFO ] Implicit Places using invariants in 385 ms returned []
[2025-06-03 13:32:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:32:43] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2025-06-03 13:32:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 99/194 variables, 95/100 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 1/195 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 0/195 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 101 constraints, problems are : Problem set: 0 solved, 98 unsolved in 6466 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 99/194 variables, 95/100 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 98/198 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 1/195 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 199 constraints, problems are : Problem set: 0 solved, 98 unsolved in 7638 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14207ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 14225ms
Starting structural reductions in LTL mode, iteration 1 : 96/112 places, 99/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15088 ms. Remains : 96/112 places, 99/117 transitions.
Support contains 29 out of 96 places after structural reductions.
[2025-06-03 13:32:57] [INFO ] Flatten gal took : 43 ms
[2025-06-03 13:32:57] [INFO ] Flatten gal took : 17 ms
[2025-06-03 13:32:57] [INFO ] Input system was already deterministic with 99 transitions.
RANDOM walk for 40000 steps (869 resets) in 1642 ms. (24 steps per ms) remains 2/29 properties
BEST_FIRST walk for 40003 steps (255 resets) in 280 ms. (142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (199 resets) in 297 ms. (134 steps per ms) remains 2/2 properties
[2025-06-03 13:32:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 99/194 variables, 95/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/195 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 101 constraints, problems are : Problem set: 0 solved, 2 unsolved in 154 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 91/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 99/194 variables, 95/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp28 is UNSAT
After SMT solving in domain Int declared 195/195 variables, and 103 constraints, problems are : Problem set: 2 solved, 0 unsolved in 127 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 291ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 144 edges and 96 vertex of which 88 are kept as prefixes of interest. Removing 8 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(p0)&&X((F(p1)&&F(G(p2))))))'
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 99/99 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 92 transition count 95
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 92 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 92 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 90 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 90 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 89 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 89 transition count 91
Applied a total of 15 rules in 27 ms. Remains 89 /96 variables (removed 7) and now considering 91/99 (removed 8) transitions.
// Phase 1: matrix 91 rows 89 cols
[2025-06-03 13:32:59] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:32:59] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-03 13:32:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:32:59] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-03 13:32:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 91/179 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 1/180 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/180 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 94 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5073 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 91/179 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 90/183 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 1/180 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/180 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 184 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5359 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10452ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 10454ms
Starting structural reductions in LTL mode, iteration 1 : 89/96 places, 91/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10661 ms. Remains : 89/96 places, 91/99 transitions.
Stuttering acceptance computed with spot in 542 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-00
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 4 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-00 finished in 11296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 99/99 transitions.
Graph (trivial) has 83 edges and 96 vertex of which 6 / 96 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 138 edges and 91 vertex of which 83 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 82 transition count 49
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 42 transition count 47
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 41 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 40 transition count 46
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 87 place count 40 transition count 36
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 107 place count 30 transition count 36
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 111 place count 26 transition count 32
Iterating global reduction 4 with 4 rules applied. Total rules applied 115 place count 26 transition count 32
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 141 place count 13 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 142 place count 13 transition count 18
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 146 place count 9 transition count 11
Iterating global reduction 5 with 4 rules applied. Total rules applied 150 place count 9 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 152 place count 8 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 153 place count 7 transition count 9
Applied a total of 153 rules in 53 ms. Remains 7 /96 variables (removed 89) and now considering 9/99 (removed 90) transitions.
// Phase 1: matrix 9 rows 7 cols
[2025-06-03 13:33:10] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:33:10] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-03 13:33:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:33:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-03 13:33:10] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:33:10] [INFO ] Redundant transitions in 17 ms returned []
Running 7 sub problems to find dead transitions.
[2025-06-03 13:33:10] [INFO ] Invariant cache hit.
[2025-06-03 13:33:10] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1/15 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/16 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 9 constraints, problems are : Problem set: 0 solved, 7 unsolved in 174 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/15 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/16 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 224 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 419ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 420ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/96 places, 9/99 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 638 ms. Remains : 7/96 places, 9/99 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-01
Product exploration explored 100000 steps with 40017 reset in 196 ms.
Product exploration explored 100000 steps with 40009 reset in 154 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Detected a total of 5/7 stabilizing places and 5/9 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 238 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 7 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 235 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2025-06-03 13:33:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 13:33:12] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-03 13:33:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 13:33:12] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-03 13:33:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-03 13:33:12] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-06-03 13:33:12] [INFO ] Computed and/alt/rep : 7/11/7 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 13:33:12] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2025-06-03 13:33:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:33:12] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-03 13:33:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:33:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-03 13:33:12] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:33:12] [INFO ] Redundant transitions in 19 ms returned []
Running 7 sub problems to find dead transitions.
[2025-06-03 13:33:12] [INFO ] Invariant cache hit.
[2025-06-03 13:33:12] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1/15 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/16 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 9 constraints, problems are : Problem set: 0 solved, 7 unsolved in 204 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/15 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/16 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 166 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 385ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 386ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 484 ms. Remains : 7/7 places, 9/9 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Detected a total of 5/7 stabilizing places and 5/9 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 245 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 8 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 269 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2025-06-03 13:33:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 13:33:13] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-03 13:33:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 13:33:13] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-03 13:33:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-03 13:33:13] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2025-06-03 13:33:13] [INFO ] Computed and/alt/rep : 7/11/7 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 13:33:13] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 39987 reset in 87 ms.
Product exploration explored 100000 steps with 39975 reset in 112 ms.
Built C files in :
/tmp/ltsmin4268445276834691671
[2025-06-03 13:33:13] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2025-06-03 13:33:13] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 13:33:13] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2025-06-03 13:33:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 13:33:13] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2025-06-03 13:33:13] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 13:33:13] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4268445276834691671
Running compilation step : cd /tmp/ltsmin4268445276834691671;'/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 412 ms.
Running link step : cd /tmp/ltsmin4268445276834691671;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 95 ms.
Running LTSmin : cd /tmp/ltsmin4268445276834691671;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16462689366853473718.hoa' '--buchi-type=spotba'
LTSmin run took 162 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-01 finished in 4070 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)&&X(X(p1)))) U (p0 U p1)))'
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 99/99 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 91 transition count 94
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 91 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 91 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 90 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 90 transition count 92
Applied a total of 13 rules in 18 ms. Remains 90 /96 variables (removed 6) and now considering 92/99 (removed 7) transitions.
// Phase 1: matrix 92 rows 90 cols
[2025-06-03 13:33:14] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:33:14] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-03 13:33:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:33:14] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2025-06-03 13:33:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 92/181 variables, 89/94 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 1/182 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 95 constraints, problems are : Problem set: 0 solved, 91 unsolved in 4660 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 92/181 variables, 89/94 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 91/185 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 1/182 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 186 constraints, problems are : Problem set: 0 solved, 91 unsolved in 5096 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9772ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 9774ms
Starting structural reductions in LTL mode, iteration 1 : 90/96 places, 92/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9969 ms. Remains : 90/96 places, 92/99 transitions.
Stuttering acceptance computed with spot in 392 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-02
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-02 finished in 10389 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0)&&X(!p0)) U X(p1))))'
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 99/99 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 93 transition count 96
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 93 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 92 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 92 transition count 95
Applied a total of 8 rules in 8 ms. Remains 92 /96 variables (removed 4) and now considering 95/99 (removed 4) transitions.
// Phase 1: matrix 95 rows 92 cols
[2025-06-03 13:33:24] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:33:24] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-03 13:33:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:33:25] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2025-06-03 13:33:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 95/186 variables, 91/96 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 1/187 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 0/187 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 97 constraints, problems are : Problem set: 0 solved, 94 unsolved in 6008 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 95/186 variables, 91/96 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 94/190 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 1/187 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/187 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 191 constraints, problems are : Problem set: 0 solved, 94 unsolved in 6178 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12225ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 12227ms
Starting structural reductions in LTL mode, iteration 1 : 92/96 places, 95/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12462 ms. Remains : 92/96 places, 95/99 transitions.
Stuttering acceptance computed with spot in 281 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-03
Product exploration explored 100000 steps with 33333 reset in 142 ms.
Product exploration explored 100000 steps with 33333 reset in 103 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Graph (complete) has 140 edges and 92 vertex of which 84 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Computed a total of 18 stabilizing places and 18 stable transitions
Detected a total of 18/92 stabilizing places and 18/95 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 19 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-04b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-03 finished in 13043 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(G(p0)) U ((p1 U p0)&&F(p2)))))'
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 99/99 transitions.
Graph (complete) has 144 edges and 96 vertex of which 88 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 87 transition count 56
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 82 place count 48 transition count 53
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 86 place count 47 transition count 50
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 89 place count 44 transition count 50
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 89 place count 44 transition count 40
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 109 place count 34 transition count 40
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 113 place count 30 transition count 36
Iterating global reduction 4 with 4 rules applied. Total rules applied 117 place count 30 transition count 36
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 145 place count 16 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 146 place count 16 transition count 21
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 148 place count 14 transition count 18
Iterating global reduction 5 with 2 rules applied. Total rules applied 150 place count 14 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 152 place count 13 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 153 place count 12 transition count 16
Applied a total of 153 rules in 22 ms. Remains 12 /96 variables (removed 84) and now considering 16/99 (removed 83) transitions.
// Phase 1: matrix 16 rows 12 cols
[2025-06-03 13:33:37] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:33:37] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-03 13:33:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:33:38] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:33:38] [INFO ] Redundant transitions in 22 ms returned []
Running 11 sub problems to find dead transitions.
[2025-06-03 13:33:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 16/25 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 3/28 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 0/28 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/28 variables, and 12 constraints, problems are : Problem set: 0 solved, 11 unsolved in 260 ms.
Refiners :[State Equation: 12/12 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 16/25 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 3/28 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/28 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/28 variables, and 23 constraints, problems are : Problem set: 0 solved, 11 unsolved in 277 ms.
Refiners :[State Equation: 12/12 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 567ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 568ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/96 places, 16/99 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 709 ms. Remains : 12/96 places, 16/99 transitions.
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-05
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-05 finished in 1057 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 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 99/99 transitions.
Graph (trivial) has 81 edges and 96 vertex of which 6 / 96 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 138 edges and 91 vertex of which 83 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 82 transition count 50
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 43 transition count 48
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 84 place count 42 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 85 place count 41 transition count 47
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 85 place count 41 transition count 37
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 105 place count 31 transition count 37
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 109 place count 27 transition count 33
Iterating global reduction 4 with 4 rules applied. Total rules applied 113 place count 27 transition count 33
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 141 place count 13 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 142 place count 13 transition count 18
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 145 place count 10 transition count 13
Iterating global reduction 5 with 3 rules applied. Total rules applied 148 place count 10 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 150 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 151 place count 8 transition count 11
Applied a total of 151 rules in 21 ms. Remains 8 /96 variables (removed 88) and now considering 11/99 (removed 88) transitions.
// Phase 1: matrix 11 rows 8 cols
[2025-06-03 13:33:39] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:33:39] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-03 13:33:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:33:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 13:33:39] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:33:39] [INFO ] Redundant transitions in 17 ms returned []
Running 7 sub problems to find dead transitions.
[2025-06-03 13:33:39] [INFO ] Invariant cache hit.
[2025-06-03 13:33:39] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/19 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 9 constraints, problems are : Problem set: 0 solved, 7 unsolved in 167 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 197 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 368ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 369ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/96 places, 11/99 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 524 ms. Remains : 8/96 places, 11/99 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-06
Stuttering criterion allowed to conclude after 26 steps with 4 reset in 0 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-06 finished in 589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F((G(F(p1))||(p2&&F(p1)))) U X(p3))))'
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 99/99 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 92 transition count 95
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 92 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 92 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 91 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 91 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 90 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 90 transition count 92
Applied a total of 13 rules in 9 ms. Remains 90 /96 variables (removed 6) and now considering 92/99 (removed 7) transitions.
// Phase 1: matrix 92 rows 90 cols
[2025-06-03 13:33:39] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:33:39] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-03 13:33:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:33:39] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2025-06-03 13:33:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 92/181 variables, 89/94 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 1/182 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 95 constraints, problems are : Problem set: 0 solved, 91 unsolved in 5157 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 92/181 variables, 89/94 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 91/185 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 1/182 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 186 constraints, problems are : Problem set: 0 solved, 91 unsolved in 5144 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10311ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 10312ms
Starting structural reductions in LTL mode, iteration 1 : 90/96 places, 92/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10542 ms. Remains : 90/96 places, 92/99 transitions.
Stuttering acceptance computed with spot in 381 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p1), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-09
Product exploration explored 100000 steps with 5353 reset in 234 ms.
Product exploration explored 100000 steps with 5386 reset in 216 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Graph (complete) has 137 edges and 90 vertex of which 82 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 16 stable transitions
Detected a total of 16/90 stabilizing places and 16/92 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X p1), (X (X (NOT p3))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 324 ms. Reduced automaton from 7 states, 14 edges and 4 AP (stutter sensitive) to 7 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 380 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (872 resets) in 299 ms. (133 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (192 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
[2025-06-03 13:33:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 92/181 variables, 89/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/182 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 136 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/89 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 92/181 variables, 89/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/182 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/182 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 145 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 289ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 92/92 transitions.
Graph (complete) has 137 edges and 90 vertex of which 82 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 82 transition count 52
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 39 rules applied. Total rules applied 77 place count 47 transition count 48
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 80 place count 45 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 44 transition count 47
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 81 place count 44 transition count 35
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 105 place count 32 transition count 35
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 108 place count 29 transition count 32
Iterating global reduction 4 with 3 rules applied. Total rules applied 111 place count 29 transition count 32
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 141 place count 14 transition count 17
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 144 place count 11 transition count 11
Iterating global reduction 4 with 3 rules applied. Total rules applied 147 place count 11 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 149 place count 10 transition count 12
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 150 place count 10 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 151 place count 9 transition count 10
Applied a total of 151 rules in 14 ms. Remains 9 /90 variables (removed 81) and now considering 10/92 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 9/90 places, 10/92 transitions.
RANDOM walk for 40000 steps (1649 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (562 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
Probably explored full state space saw : 55 states, properties seen :0
Probabilistic random walk after 149 steps, saw 55 distinct states, run finished after 15 ms. (steps per millisecond=9 ) properties seen :0
Explored full state space saw : 55 states, properties seen :0
Exhaustive walk after 149 steps, saw 55 distinct states, run finished after 3 ms. (steps per millisecond=49 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X p1), (X (X (NOT p3))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p1 p3 (NOT p2)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p3) (NOT p2)))), (F (NOT p1)), (F p2), (F (NOT (OR p1 p3))), (F p3)]
Knowledge based reduction with 18 factoid took 706 ms. Reduced automaton from 7 states, 13 edges and 4 AP (stutter sensitive) to 6 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p1), (NOT p1)]
[2025-06-03 13:33:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 13:33:53] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 5 ms returned sat
[2025-06-03 13:33:53] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2025-06-03 13:33:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 13:33:53] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 4 ms returned sat
[2025-06-03 13:33:54] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2025-06-03 13:33:54] [INFO ] Computed and/alt/rep : 91/135/91 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-03 13:33:54] [INFO ] Added : 76 causal constraints over 16 iterations in 299 ms. Result :sat
Could not prove EG (NOT p0)
[2025-06-03 13:33:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 13:33:54] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 3 ms returned sat
[2025-06-03 13:33:54] [INFO ] [Real]Absence check using state equation in 31 ms returned unsat
Proved EG (NOT p3)
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (AND (NOT p2) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT p0)), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X p1), (X (X (NOT p3))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p1 p3 (NOT p2)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p3) (NOT p2)))), (F (NOT p1)), (F p2), (F (NOT (OR p1 p3))), (F p3), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p3))
Knowledge based reduction with 18 factoid took 832 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-04b-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-09 finished in 15746 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 U X(p2))||G(p3))))'
Support contains 5 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 99/99 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 92 transition count 95
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 92 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 92 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 90 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 90 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 89 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 89 transition count 91
Applied a total of 15 rules in 4 ms. Remains 89 /96 variables (removed 7) and now considering 91/99 (removed 8) transitions.
// Phase 1: matrix 91 rows 89 cols
[2025-06-03 13:33:55] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:33:55] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-03 13:33:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:33:55] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-03 13:33:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 91/179 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 1/180 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/180 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 94 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5313 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 91/179 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 90/183 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 1/180 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/180 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 184 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5635 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10957ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 10958ms
Starting structural reductions in LTL mode, iteration 1 : 89/96 places, 91/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11168 ms. Remains : 89/96 places, 91/99 transitions.
Stuttering acceptance computed with spot in 349 ms :[true, (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p3), (NOT p2), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-10
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-10 finished in 11545 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 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 99/99 transitions.
Graph (trivial) has 77 edges and 96 vertex of which 6 / 96 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 138 edges and 91 vertex of which 83 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 82 transition count 53
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 46 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 45 transition count 51
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 77 place count 45 transition count 39
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 101 place count 33 transition count 39
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 107 place count 27 transition count 33
Iterating global reduction 3 with 6 rules applied. Total rules applied 113 place count 27 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 114 place count 27 transition count 32
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 26 transition count 31
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 26 transition count 31
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 142 place count 13 transition count 18
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 144 place count 11 transition count 14
Iterating global reduction 4 with 2 rules applied. Total rules applied 146 place count 11 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 148 place count 10 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 9 transition count 12
Applied a total of 149 rules in 16 ms. Remains 9 /96 variables (removed 87) and now considering 12/99 (removed 87) transitions.
// Phase 1: matrix 12 rows 9 cols
[2025-06-03 13:34:06] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:34:06] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-03 13:34:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:34:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 13:34:06] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:34:06] [INFO ] Redundant transitions in 18 ms returned []
Running 9 sub problems to find dead transitions.
[2025-06-03 13:34:06] [INFO ] Invariant cache hit.
[2025-06-03 13:34:06] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/20 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/21 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 10 constraints, problems are : Problem set: 0 solved, 9 unsolved in 251 ms.
Refiners :[State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/20 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/21 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 19 constraints, problems are : Problem set: 0 solved, 9 unsolved in 240 ms.
Refiners :[State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 498ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 498ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/96 places, 12/99 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 604 ms. Remains : 9/96 places, 12/99 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-13
Product exploration explored 100000 steps with 12465 reset in 110 ms.
Product exploration explored 100000 steps with 12534 reset in 379 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 32 steps (4 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2025-06-03 13:34:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:34:08] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-03 13:34:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:34:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 13:34:08] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:34:08] [INFO ] Redundant transitions in 17 ms returned []
Running 9 sub problems to find dead transitions.
[2025-06-03 13:34:08] [INFO ] Invariant cache hit.
[2025-06-03 13:34:08] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/20 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/21 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 10 constraints, problems are : Problem set: 0 solved, 9 unsolved in 264 ms.
Refiners :[State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/20 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/21 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 19 constraints, problems are : Problem set: 0 solved, 9 unsolved in 232 ms.
Refiners :[State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 502ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 502ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 581 ms. Remains : 9/9 places, 12/12 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 17 steps (1 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12368 reset in 90 ms.
Product exploration explored 100000 steps with 12424 reset in 222 ms.
Built C files in :
/tmp/ltsmin11859818814552148290
[2025-06-03 13:34:10] [INFO ] Computing symmetric may disable matrix : 12 transitions.
[2025-06-03 13:34:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 13:34:10] [INFO ] Computing symmetric may enable matrix : 12 transitions.
[2025-06-03 13:34:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 13:34:10] [INFO ] Computing Do-Not-Accords matrix : 12 transitions.
[2025-06-03 13:34:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 13:34:10] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11859818814552148290
Running compilation step : cd /tmp/ltsmin11859818814552148290;'/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 162 ms.
Running link step : cd /tmp/ltsmin11859818814552148290;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin11859818814552148290;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14355010586676330996.hoa' '--buchi-type=spotba'
LTSmin run took 74 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-13 finished in 3563 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)))||G(p1)))'
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 99/99 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 91 transition count 94
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 91 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 91 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 89 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 89 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 88 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 88 transition count 90
Applied a total of 17 rules in 4 ms. Remains 88 /96 variables (removed 8) and now considering 90/99 (removed 9) transitions.
// Phase 1: matrix 90 rows 88 cols
[2025-06-03 13:34:10] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:34:10] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-03 13:34:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:34:10] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2025-06-03 13:34:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 90/177 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 1/178 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 0/178 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 93 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4567 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 90/177 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 89/181 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 1/178 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 0/178 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 182 constraints, problems are : Problem set: 0 solved, 89 unsolved in 5596 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10175ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 10177ms
Starting structural reductions in LTL mode, iteration 1 : 88/96 places, 90/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10346 ms. Remains : 88/96 places, 90/99 transitions.
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-14 finished in 10589 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(p0)))))'
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 99/99 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 91 transition count 94
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 91 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 91 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 89 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 89 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 88 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 88 transition count 90
Applied a total of 17 rules in 4 ms. Remains 88 /96 variables (removed 8) and now considering 90/99 (removed 9) transitions.
[2025-06-03 13:34:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:34:21] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-03 13:34:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:34:21] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2025-06-03 13:34:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 90/177 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 1/178 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 0/178 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 178/178 variables, and 93 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4822 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 90/177 variables, 87/92 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 89/181 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 1/178 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 0/178 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 178/178 variables, and 182 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3953 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8785ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 8785ms
Starting structural reductions in LTL mode, iteration 1 : 88/96 places, 90/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8980 ms. Remains : 88/96 places, 90/99 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-15 finished in 9118 ms.
All properties solved by simple procedures.
Total runtime 108548 ms.
BK_STOP 1748957670193
--------------------
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="GPUForwardProgress-PT-04b"
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 GPUForwardProgress-PT-04b, 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 r100-smll-174867007800388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-04b.tgz
mv GPUForwardProgress-PT-04b 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 '
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 ;