Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r179-tall-171640601800572.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is GPUForwardProgress-PT-28b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601800572
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 22:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 22:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 22:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 22:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 141K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716480497105

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-28b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 16:08:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 16:08:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 16:08:18] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2024-05-23 16:08:18] [INFO ] Transformed 568 places.
[2024-05-23 16:08:18] [INFO ] Transformed 597 transitions.
[2024-05-23 16:08:18] [INFO ] Found NUPN structural information;
[2024-05-23 16:08:18] [INFO ] Parsed PT model containing 568 places and 597 transitions and 1477 arcs in 218 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-28b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-28b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-28b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 568 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 568/568 places, 597/597 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 567 transition count 597
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 57 place count 511 transition count 541
Iterating global reduction 1 with 56 rules applied. Total rules applied 113 place count 511 transition count 541
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 138 place count 486 transition count 516
Iterating global reduction 1 with 25 rules applied. Total rules applied 163 place count 486 transition count 516
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 186 place count 486 transition count 493
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 187 place count 485 transition count 492
Iterating global reduction 2 with 1 rules applied. Total rules applied 188 place count 485 transition count 492
Applied a total of 188 rules in 151 ms. Remains 485 /568 variables (removed 83) and now considering 492/597 (removed 105) transitions.
// Phase 1: matrix 492 rows 485 cols
[2024-05-23 16:08:18] [INFO ] Computed 29 invariants in 23 ms
[2024-05-23 16:08:19] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-23 16:08:19] [INFO ] Invariant cache hit.
[2024-05-23 16:08:19] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
Running 491 sub problems to find dead transitions.
[2024-05-23 16:08:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/484 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/484 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 2 (OVERLAPS) 492/976 variables, 484/513 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/976 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 4 (OVERLAPS) 1/977 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/977 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 491 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 977/977 variables, and 514 constraints, problems are : Problem set: 0 solved, 491 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 485/485 constraints, PredecessorRefiner: 491/491 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 491 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/484 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/484 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 2 (OVERLAPS) 492/976 variables, 484/513 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/976 variables, 491/1004 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/976 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 5 (OVERLAPS) 1/977 variables, 1/1005 constraints. Problems are: Problem set: 0 solved, 491 unsolved
(s301 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 1)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 1)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 1)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 1)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 1)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 1)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 0)
(s301 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 977/977 variables, and 1005 constraints, problems are : Problem set: 0 solved, 491 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 485/485 constraints, PredecessorRefiner: 491/491 constraints, Known Traps: 0/0 constraints]
After SMT, in 60248ms problems are : Problem set: 0 solved, 491 unsolved
Search for dead transitions found 0 dead transitions in 60266ms
Starting structural reductions in LTL mode, iteration 1 : 485/568 places, 492/597 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61143 ms. Remains : 485/568 places, 492/597 transitions.
Support contains 27 out of 485 places after structural reductions.
[2024-05-23 16:09:20] [INFO ] Flatten gal took : 71 ms
[2024-05-23 16:09:20] [INFO ] Flatten gal took : 29 ms
[2024-05-23 16:09:20] [INFO ] Input system was already deterministic with 492 transitions.
RANDOM walk for 40000 steps (168 resets) in 1797 ms. (22 steps per ms) remains 10/25 properties
BEST_FIRST walk for 40004 steps (19 resets) in 211 ms. (188 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (16 resets) in 146 ms. (272 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (17 resets) in 171 ms. (232 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 197 ms. (202 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 142 ms. (279 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (18 resets) in 159 ms. (250 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (14 resets) in 76 ms. (519 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (19 resets) in 59 ms. (666 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (18 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
[2024-05-23 16:09:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 471/484 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/484 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 492/976 variables, 484/513 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/976 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1/977 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/977 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/977 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 977/977 variables, and 514 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1524 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 485/485 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 471/484 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/484 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 492/976 variables, 484/513 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/976 variables, 10/523 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/976 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 1/977 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/977 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/977 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 977/977 variables, and 524 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1038 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 485/485 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 2576ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 4 different solutions.
Finished Parikh walk after 376 steps, including 0 resets, run visited all 10 properties in 11 ms. (steps per millisecond=34 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 18 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 89 stabilizing places and 89 stable transitions
Graph (complete) has 753 edges and 485 vertex of which 453 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.18 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((((p0||G(!p0)) U p1) U X(p2))&&F(p1)))'
Support contains 3 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 478 transition count 485
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 478 transition count 485
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 478 transition count 484
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 474 transition count 480
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 474 transition count 480
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 26 place count 474 transition count 477
Applied a total of 26 rules in 49 ms. Remains 474 /485 variables (removed 11) and now considering 477/492 (removed 15) transitions.
// Phase 1: matrix 477 rows 474 cols
[2024-05-23 16:09:24] [INFO ] Computed 29 invariants in 3 ms
[2024-05-23 16:09:24] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-23 16:09:24] [INFO ] Invariant cache hit.
[2024-05-23 16:09:24] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Running 476 sub problems to find dead transitions.
[2024-05-23 16:09:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 477/950 variables, 473/502 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/950 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 4 (OVERLAPS) 1/951 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/951 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 951/951 variables, and 503 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 476/476 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 476 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 477/950 variables, 473/502 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/950 variables, 476/978 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/950 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 5 (OVERLAPS) 1/951 variables, 1/979 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/951 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 951/951 variables, and 979 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 476/476 constraints, Known Traps: 0/0 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 476 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Starting structural reductions in LTL mode, iteration 1 : 474/485 places, 477/492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60754 ms. Remains : 474/485 places, 477/492 transitions.
Stuttering acceptance computed with spot in 418 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, p0, (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 76467 steps with 683 reset in 214 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-01 finished in 61461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(G(p1)))))'
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 477 transition count 484
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 477 transition count 484
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 477 transition count 483
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 472 transition count 478
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 472 transition count 478
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 31 place count 472 transition count 474
Applied a total of 31 rules in 63 ms. Remains 472 /485 variables (removed 13) and now considering 474/492 (removed 18) transitions.
// Phase 1: matrix 474 rows 472 cols
[2024-05-23 16:10:25] [INFO ] Computed 29 invariants in 8 ms
[2024-05-23 16:10:26] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-23 16:10:26] [INFO ] Invariant cache hit.
[2024-05-23 16:10:26] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-05-23 16:10:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 1/946 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/946 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 946/946 variables, and 501 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 473/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/945 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (OVERLAPS) 1/946 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 946/946 variables, and 974 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
After SMT, in 60142ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Starting structural reductions in LTL mode, iteration 1 : 472/485 places, 474/492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60783 ms. Remains : 472/485 places, 474/492 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-03
Product exploration explored 100000 steps with 1051 reset in 154 ms.
Product exploration explored 100000 steps with 1045 reset in 261 ms.
Computed a total of 87 stabilizing places and 87 stable transitions
Graph (complete) has 735 edges and 472 vertex of which 440 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.5 ms
Computed a total of 87 stabilizing places and 87 stable transitions
Detected a total of 87/472 stabilizing places and 87/474 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 128 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
RANDOM walk for 393 steps (0 resets) in 21 ms. (17 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 209 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
[2024-05-23 16:11:28] [INFO ] Invariant cache hit.
[2024-05-23 16:11:28] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 9 ms returned sat
[2024-05-23 16:11:28] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2024-05-23 16:11:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:11:28] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 9 ms returned sat
[2024-05-23 16:11:28] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2024-05-23 16:11:28] [INFO ] Computed and/alt/rep : 468/614/468 causal constraints (skipped 5 transitions) in 25 ms.
[2024-05-23 16:11:29] [INFO ] Added : 77 causal constraints over 16 iterations in 520 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 474/474 transitions.
Applied a total of 0 rules in 8 ms. Remains 472 /472 variables (removed 0) and now considering 474/474 (removed 0) transitions.
[2024-05-23 16:11:29] [INFO ] Invariant cache hit.
[2024-05-23 16:11:29] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-23 16:11:29] [INFO ] Invariant cache hit.
[2024-05-23 16:11:29] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-05-23 16:11:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 1/946 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/946 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 946/946 variables, and 501 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 473/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/945 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (OVERLAPS) 1/946 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 946/946 variables, and 974 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
After SMT, in 60118ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Finished structural reductions in LTL mode , in 1 iterations and 60544 ms. Remains : 472/472 places, 474/474 transitions.
Computed a total of 87 stabilizing places and 87 stable transitions
Graph (complete) has 735 edges and 472 vertex of which 440 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.6 ms
Computed a total of 87 stabilizing places and 87 stable transitions
Detected a total of 87/472 stabilizing places and 87/474 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 100 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
RANDOM walk for 286 steps (0 resets) in 6 ms. (40 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 209 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
[2024-05-23 16:12:30] [INFO ] Invariant cache hit.
[2024-05-23 16:12:30] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 9 ms returned sat
[2024-05-23 16:12:31] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2024-05-23 16:12:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:12:31] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 8 ms returned sat
[2024-05-23 16:12:31] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2024-05-23 16:12:31] [INFO ] Computed and/alt/rep : 468/614/468 causal constraints (skipped 5 transitions) in 26 ms.
[2024-05-23 16:12:31] [INFO ] Added : 77 causal constraints over 16 iterations in 487 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 1036 reset in 137 ms.
Product exploration explored 100000 steps with 1046 reset in 236 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 2 out of 472 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 472/472 places, 474/474 transitions.
Graph (trivial) has 385 edges and 472 vertex of which 6 / 472 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 729 edges and 467 vertex of which 435 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 224 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 224 rules applied. Total rules applied 226 place count 435 transition count 465
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 30 Pre rules applied. Total rules applied 226 place count 435 transition count 467
Deduced a syphon composed of 254 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 256 place count 435 transition count 467
Discarding 165 places :
Symmetric choice reduction at 1 with 165 rule applications. Total rules 421 place count 270 transition count 302
Deduced a syphon composed of 116 places in 0 ms
Iterating global reduction 1 with 165 rules applied. Total rules applied 586 place count 270 transition count 302
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 613 place count 243 transition count 275
Deduced a syphon composed of 89 places in 1 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 640 place count 243 transition count 275
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 177 places in 0 ms
Iterating global reduction 1 with 88 rules applied. Total rules applied 728 place count 243 transition count 276
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 730 place count 243 transition count 274
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 793 place count 180 transition count 210
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 2 with 63 rules applied. Total rules applied 856 place count 180 transition count 210
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 857 place count 180 transition count 210
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 858 place count 179 transition count 209
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 859 place count 179 transition count 209
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -83
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 887 place count 179 transition count 292
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 941 place count 125 transition count 184
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 2 with 54 rules applied. Total rules applied 995 place count 125 transition count 184
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1073 place count 47 transition count 54
Deduced a syphon composed of 36 places in 1 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1151 place count 47 transition count 54
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 1151 rules in 200 ms. Remains 47 /472 variables (removed 425) and now considering 54/474 (removed 420) transitions.
[2024-05-23 16:12:33] [INFO ] Redundant transitions in 15 ms returned []
Running 53 sub problems to find dead transitions.
// Phase 1: matrix 54 rows 47 cols
[2024-05-23 16:12:33] [INFO ] Computed 0 invariants in 1 ms
[2024-05-23 16:12:33] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
At refinement iteration 1 (OVERLAPS) 53/99 variables, 46/46 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 8/54 constraints. Problems are: Problem set: 40 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/54 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 1/100 variables, 1/55 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/55 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/101 variables, 1/56 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/56 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/101 variables, 0/56 constraints. Problems are: Problem set: 40 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 56 constraints, problems are : Problem set: 40 solved, 13 unsolved in 278 ms.
Refiners :[State Equation: 47/47 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 40 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 52/62 variables, 10/10 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 8/18 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 13/31 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/31 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 38/100 variables, 37/68 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/68 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/101 variables, 1/69 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/69 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/101 variables, 0/69 constraints. Problems are: Problem set: 40 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 69 constraints, problems are : Problem set: 40 solved, 13 unsolved in 243 ms.
Refiners :[State Equation: 47/47 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 13/53 constraints, Known Traps: 0/0 constraints]
After SMT, in 535ms problems are : Problem set: 40 solved, 13 unsolved
Search for dead transitions found 40 dead transitions in 536ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 47/472 places, 14/474 transitions.
Graph (complete) has 34 edges and 47 vertex of which 11 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.0 ms
Discarding 36 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 11 /47 variables (removed 36) and now considering 14/14 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/472 places, 14/474 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 763 ms. Remains : 11/472 places, 14/474 transitions.
Support contains 2 out of 472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 474/474 transitions.
Applied a total of 0 rules in 19 ms. Remains 472 /472 variables (removed 0) and now considering 474/474 (removed 0) transitions.
// Phase 1: matrix 474 rows 472 cols
[2024-05-23 16:12:33] [INFO ] Computed 29 invariants in 4 ms
[2024-05-23 16:12:33] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-23 16:12:33] [INFO ] Invariant cache hit.
[2024-05-23 16:12:33] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-05-23 16:12:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 1/946 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/946 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 946/946 variables, and 501 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 473/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/945 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (OVERLAPS) 1/946 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 946/946 variables, and 974 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60154ms
Finished structural reductions in LTL mode , in 1 iterations and 60602 ms. Remains : 472/472 places, 474/474 transitions.
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-03 finished in 188425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(X(F(p1))))))'
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 477 transition count 484
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 477 transition count 484
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 477 transition count 483
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 472 transition count 478
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 472 transition count 478
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 31 place count 472 transition count 474
Applied a total of 31 rules in 48 ms. Remains 472 /485 variables (removed 13) and now considering 474/492 (removed 18) transitions.
[2024-05-23 16:13:34] [INFO ] Invariant cache hit.
[2024-05-23 16:13:34] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-23 16:13:34] [INFO ] Invariant cache hit.
[2024-05-23 16:13:34] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-05-23 16:13:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 1/946 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/946 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 946/946 variables, and 501 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 473/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/945 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (OVERLAPS) 1/946 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 946/946 variables, and 974 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Starting structural reductions in LTL mode, iteration 1 : 472/485 places, 474/492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60591 ms. Remains : 472/485 places, 474/492 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-07
Product exploration explored 100000 steps with 1116 reset in 139 ms.
Stack based approach found an accepted trace after 2845 steps with 32 reset with depth 56 and stack size 56 in 4 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-07 finished in 60892 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(X(F(p1)))))))'
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 478 transition count 485
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 478 transition count 485
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 478 transition count 484
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 474 transition count 480
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 474 transition count 480
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 26 place count 474 transition count 477
Applied a total of 26 rules in 34 ms. Remains 474 /485 variables (removed 11) and now considering 477/492 (removed 15) transitions.
// Phase 1: matrix 477 rows 474 cols
[2024-05-23 16:14:35] [INFO ] Computed 29 invariants in 9 ms
[2024-05-23 16:14:35] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-23 16:14:35] [INFO ] Invariant cache hit.
[2024-05-23 16:14:35] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Running 476 sub problems to find dead transitions.
[2024-05-23 16:14:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 477/950 variables, 473/502 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/950 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 4 (OVERLAPS) 1/951 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/951 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 951/951 variables, and 503 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 476/476 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 476 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 477/950 variables, 473/502 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/950 variables, 476/978 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/950 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 5 (OVERLAPS) 1/951 variables, 1/979 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/951 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 951/951 variables, and 979 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 476/476 constraints, Known Traps: 0/0 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 476 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Starting structural reductions in LTL mode, iteration 1 : 474/485 places, 477/492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60691 ms. Remains : 474/485 places, 477/492 transitions.
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-08
Product exploration explored 100000 steps with 1219 reset in 126 ms.
Stack based approach found an accepted trace after 90207 steps with 1091 reset with depth 57 and stack size 57 in 121 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-08 finished in 61174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Graph (trivial) has 403 edges and 485 vertex of which 6 / 485 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 747 edges and 480 vertex of which 448 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.6 ms
Discarding 32 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 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 237 place count 447 transition count 247
Reduce places removed 235 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 241 rules applied. Total rules applied 478 place count 212 transition count 241
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 480 place count 211 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 481 place count 210 transition count 240
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 59 Pre rules applied. Total rules applied 481 place count 210 transition count 181
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 599 place count 151 transition count 181
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 626 place count 124 transition count 154
Iterating global reduction 4 with 27 rules applied. Total rules applied 653 place count 124 transition count 154
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 827 place count 37 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 828 place count 37 transition count 66
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 855 place count 10 transition count 13
Iterating global reduction 5 with 27 rules applied. Total rules applied 882 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 884 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 885 place count 8 transition count 11
Applied a total of 885 rules in 35 ms. Remains 8 /485 variables (removed 477) and now considering 11/492 (removed 481) transitions.
// Phase 1: matrix 11 rows 8 cols
[2024-05-23 16:15:36] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 16:15:36] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-23 16:15:36] [INFO ] Invariant cache hit.
[2024-05-23 16:15:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 16:15:36] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-23 16:15:36] [INFO ] Redundant transitions in 11 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-23 16:15:36] [INFO ] Invariant cache hit.
[2024-05-23 16:15:36] [INFO ] State equation strengthened by 1 read => feed constraints.
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 73 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
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 68 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 144ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 144ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/485 places, 11/492 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 239 ms. Remains : 8/485 places, 11/492 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-09
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-09 finished in 283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(((p1&&X(!p2))||G(!p2))))))'
Support contains 5 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 477 transition count 484
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 477 transition count 484
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 477 transition count 483
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 472 transition count 478
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 472 transition count 478
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 31 place count 472 transition count 474
Applied a total of 31 rules in 25 ms. Remains 472 /485 variables (removed 13) and now considering 474/492 (removed 18) transitions.
// Phase 1: matrix 474 rows 472 cols
[2024-05-23 16:15:36] [INFO ] Computed 29 invariants in 3 ms
[2024-05-23 16:15:36] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-23 16:15:36] [INFO ] Invariant cache hit.
[2024-05-23 16:15:37] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-05-23 16:15:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 1/946 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/946 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 946/946 variables, and 501 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 473/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/945 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (OVERLAPS) 1/946 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 946/946 variables, and 974 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
After SMT, in 60112ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Starting structural reductions in LTL mode, iteration 1 : 472/485 places, 474/492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60565 ms. Remains : 472/485 places, 474/492 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2, p2]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-10
Product exploration explored 100000 steps with 416 reset in 145 ms.
Product exploration explored 100000 steps with 416 reset in 153 ms.
Computed a total of 87 stabilizing places and 87 stable transitions
Graph (complete) has 735 edges and 472 vertex of which 440 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.11 ms
Computed a total of 87 stabilizing places and 87 stable transitions
Detected a total of 87/472 stabilizing places and 87/474 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X p1), (X (NOT (AND p2 p1))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p2 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 141 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[p2, p2, p2, p2]
RANDOM walk for 40000 steps (166 resets) in 701 ms. (56 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
[2024-05-23 16:16:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 467/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/945 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/946 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/946 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 946/946 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 410 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 467/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/945 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/945 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/946 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/946 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/946 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 946/946 variables, and 502 constraints, problems are : Problem set: 0 solved, 1 unsolved in 287 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 711ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 90 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=90 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X p1), (X (NOT (AND p2 p1))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p2 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p1 p2))), (F (NOT p1)), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 16 factoid took 385 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[p2, p2, p2, p2]
Stuttering acceptance computed with spot in 152 ms :[p2, p2, p2, p2]
Support contains 4 out of 472 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 474/474 transitions.
Applied a total of 0 rules in 10 ms. Remains 472 /472 variables (removed 0) and now considering 474/474 (removed 0) transitions.
[2024-05-23 16:16:39] [INFO ] Invariant cache hit.
[2024-05-23 16:16:39] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-23 16:16:39] [INFO ] Invariant cache hit.
[2024-05-23 16:16:40] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-05-23 16:16:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 1/946 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/946 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 946/946 variables, and 501 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 473/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/945 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (OVERLAPS) 1/946 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 946/946 variables, and 974 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60120ms
Finished structural reductions in LTL mode , in 1 iterations and 60565 ms. Remains : 472/472 places, 474/474 transitions.
Computed a total of 87 stabilizing places and 87 stable transitions
Graph (complete) has 735 edges and 472 vertex of which 440 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Computed a total of 87 stabilizing places and 87 stable transitions
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X p1), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 112 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[p2, p2, p2, p2]
RANDOM walk for 40000 steps (163 resets) in 408 ms. (97 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
[2024-05-23 16:17:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 467/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/945 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/946 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/946 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 946/946 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 261 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 467/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/945 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/945 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/946 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/946 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/946 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 946/946 variables, and 502 constraints, problems are : Problem set: 0 solved, 1 unsolved in 291 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 562ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 83 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X p1), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p2) (NOT p1)))), (F p2), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 11 factoid took 346 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[p2, p2, p2, p2]
Stuttering acceptance computed with spot in 163 ms :[p2, p2, p2, p2]
Stuttering acceptance computed with spot in 153 ms :[p2, p2, p2, p2]
Product exploration explored 100000 steps with 409 reset in 143 ms.
Product exploration explored 100000 steps with 417 reset in 153 ms.
Support contains 4 out of 472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 474/474 transitions.
Applied a total of 0 rules in 13 ms. Remains 472 /472 variables (removed 0) and now considering 474/474 (removed 0) transitions.
[2024-05-23 16:17:42] [INFO ] Invariant cache hit.
[2024-05-23 16:17:42] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-23 16:17:42] [INFO ] Invariant cache hit.
[2024-05-23 16:17:42] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-05-23 16:17:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 1/946 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/946 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 946/946 variables, and 501 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 473/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/945 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (OVERLAPS) 1/946 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 946/946 variables, and 974 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60125ms
Finished structural reductions in LTL mode , in 1 iterations and 60551 ms. Remains : 472/472 places, 474/474 transitions.
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-10 finished in 186571 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p1)&&p0) U X(G((p2 U p3)))))'
Support contains 6 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 477 transition count 484
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 477 transition count 484
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 477 transition count 483
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 472 transition count 478
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 472 transition count 478
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 31 place count 472 transition count 474
Applied a total of 31 rules in 22 ms. Remains 472 /485 variables (removed 13) and now considering 474/492 (removed 18) transitions.
[2024-05-23 16:18:43] [INFO ] Invariant cache hit.
[2024-05-23 16:18:43] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-23 16:18:43] [INFO ] Invariant cache hit.
[2024-05-23 16:18:43] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-05-23 16:18:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 1/946 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/946 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 946/946 variables, and 501 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 473/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/945 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (OVERLAPS) 1/946 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 946/946 variables, and 974 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Starting structural reductions in LTL mode, iteration 1 : 472/485 places, 474/492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60548 ms. Remains : 472/485 places, 474/492 transitions.
Stuttering acceptance computed with spot in 342 ms :[(NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (NOT p3), true, (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (NOT p3)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-11 finished in 60911 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Graph (trivial) has 403 edges and 485 vertex of which 6 / 485 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 747 edges and 480 vertex of which 448 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.4 ms
Discarding 32 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 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 237 place count 447 transition count 247
Reduce places removed 235 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 241 rules applied. Total rules applied 478 place count 212 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 479 place count 211 transition count 241
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 479 place count 211 transition count 180
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 601 place count 150 transition count 180
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 628 place count 123 transition count 153
Iterating global reduction 3 with 27 rules applied. Total rules applied 655 place count 123 transition count 153
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 827 place count 37 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 828 place count 37 transition count 66
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 856 place count 9 transition count 11
Iterating global reduction 4 with 28 rules applied. Total rules applied 884 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 4 with 2 rules applied. Total rules applied 886 place count 8 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 887 place count 7 transition count 9
Applied a total of 887 rules in 27 ms. Remains 7 /485 variables (removed 478) and now considering 9/492 (removed 483) transitions.
// Phase 1: matrix 9 rows 7 cols
[2024-05-23 16:19:44] [INFO ] Computed 0 invariants in 1 ms
[2024-05-23 16:19:44] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-23 16:19:44] [INFO ] Invariant cache hit.
[2024-05-23 16:19:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 16:19:44] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2024-05-23 16:19:44] [INFO ] Redundant transitions in 9 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-23 16:19:44] [INFO ] Invariant cache hit.
[2024-05-23 16:19:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 8 constraints, problems are : Problem set: 0 solved, 5 unsolved in 58 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 13 constraints, problems are : Problem set: 0 solved, 5 unsolved in 49 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 109ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 109ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/485 places, 9/492 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 183 ms. Remains : 7/485 places, 9/492 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-12
Stuttering criterion allowed to conclude after 10 steps with 1 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-12 finished in 282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Graph (trivial) has 399 edges and 485 vertex of which 6 / 485 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 747 edges and 480 vertex of which 448 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 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 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 237 place count 447 transition count 247
Reduce places removed 235 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 476 place count 212 transition count 243
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 58 Pre rules applied. Total rules applied 476 place count 212 transition count 185
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 592 place count 154 transition count 185
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 618 place count 128 transition count 159
Iterating global reduction 2 with 26 rules applied. Total rules applied 644 place count 128 transition count 159
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 814 place count 43 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 815 place count 43 transition count 73
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 841 place count 17 transition count 22
Iterating global reduction 3 with 26 rules applied. Total rules applied 867 place count 17 transition count 22
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 873 place count 14 transition count 21
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 875 place count 14 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 876 place count 13 transition count 20
Applied a total of 876 rules in 26 ms. Remains 13 /485 variables (removed 472) and now considering 20/492 (removed 472) transitions.
[2024-05-23 16:19:44] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
// Phase 1: matrix 18 rows 13 cols
[2024-05-23 16:19:44] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 16:19:44] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-23 16:19:44] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-23 16:19:44] [INFO ] Invariant cache hit.
[2024-05-23 16:19:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 16:19:44] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-23 16:19:44] [INFO ] Redundant transitions in 12 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-23 16:19:44] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-23 16:19:44] [INFO ] Invariant cache hit.
[2024-05-23 16:19:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 1/31 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 14 constraints, problems are : Problem set: 0 solved, 18 unsolved in 120 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/31 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/31 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 32 constraints, problems are : Problem set: 0 solved, 18 unsolved in 176 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 302ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 302ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/485 places, 20/492 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 385 ms. Remains : 13/485 places, 20/492 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-13
Product exploration explored 100000 steps with 7999 reset in 175 ms.
Product exploration explored 100000 steps with 7872 reset in 128 ms.
Computed a total of 4 stabilizing places and 8 stable transitions
Computed a total of 4 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 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 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 6608 steps (578 resets) in 43 ms. (150 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 86 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 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-23 16:19:45] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-23 16:19:45] [INFO ] Invariant cache hit.
[2024-05-23 16:19:45] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-23 16:19:45] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-23 16:19:45] [INFO ] Invariant cache hit.
[2024-05-23 16:19:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 16:19:45] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-23 16:19:45] [INFO ] Redundant transitions in 14 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-23 16:19:45] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-23 16:19:45] [INFO ] Invariant cache hit.
[2024-05-23 16:19:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 1/31 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 14 constraints, problems are : Problem set: 0 solved, 18 unsolved in 137 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/31 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/31 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 32 constraints, problems are : Problem set: 0 solved, 18 unsolved in 166 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 310ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 310ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 376 ms. Remains : 13/13 places, 20/20 transitions.
Computed a total of 4 stabilizing places and 8 stable transitions
Computed a total of 4 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 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 76 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 9153 steps (845 resets) in 23 ms. (381 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 127 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 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7940 reset in 100 ms.
Product exploration explored 100000 steps with 7881 reset in 102 ms.
Support contains 4 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-23 16:19:46] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-23 16:19:46] [INFO ] Invariant cache hit.
[2024-05-23 16:19:46] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-23 16:19:46] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-23 16:19:46] [INFO ] Invariant cache hit.
[2024-05-23 16:19:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 16:19:46] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-23 16:19:46] [INFO ] Redundant transitions in 10 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-23 16:19:46] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-23 16:19:46] [INFO ] Invariant cache hit.
[2024-05-23 16:19:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 1/31 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 14 constraints, problems are : Problem set: 0 solved, 18 unsolved in 134 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/31 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/31 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 32 constraints, problems are : Problem set: 0 solved, 18 unsolved in 156 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 296ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 296ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 360 ms. Remains : 13/13 places, 20/20 transitions.
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-13 finished in 2747 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1))))'
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Graph (trivial) has 402 edges and 485 vertex of which 6 / 485 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 747 edges and 480 vertex of which 448 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 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 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 234 rules applied. Total rules applied 236 place count 447 transition count 248
Reduce places removed 234 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 239 rules applied. Total rules applied 475 place count 213 transition count 243
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 477 place count 212 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 478 place count 211 transition count 242
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 478 place count 211 transition count 184
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 594 place count 153 transition count 184
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 621 place count 126 transition count 157
Iterating global reduction 4 with 27 rules applied. Total rules applied 648 place count 126 transition count 157
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 822 place count 39 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 823 place count 39 transition count 69
Discarding 26 places :
Symmetric choice reduction at 5 with 26 rule applications. Total rules 849 place count 13 transition count 18
Iterating global reduction 5 with 26 rules applied. Total rules applied 875 place count 13 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 879 place count 11 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 880 place count 10 transition count 16
Applied a total of 880 rules in 19 ms. Remains 10 /485 variables (removed 475) and now considering 16/492 (removed 476) transitions.
[2024-05-23 16:19:47] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
// Phase 1: matrix 15 rows 10 cols
[2024-05-23 16:19:47] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 16:19:47] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-23 16:19:47] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2024-05-23 16:19:47] [INFO ] Invariant cache hit.
[2024-05-23 16:19:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 16:19:47] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-23 16:19:47] [INFO ] Redundant transitions in 14 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-23 16:19:47] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2024-05-23 16:19:47] [INFO ] Invariant cache hit.
[2024-05-23 16:19:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 14/21 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/24 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/25 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 11 constraints, problems are : Problem set: 0 solved, 9 unsolved in 70 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 14/21 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 3/24 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/25 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/25 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 20 constraints, problems are : Problem set: 0 solved, 9 unsolved in 76 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 153ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 153ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/485 places, 16/492 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 239 ms. Remains : 10/485 places, 16/492 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-14
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-14 finished in 343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X(G(p1)))) U p2)))'
Support contains 3 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 479 transition count 486
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 479 transition count 486
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 479 transition count 485
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 475 transition count 481
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 475 transition count 481
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 24 place count 475 transition count 478
Applied a total of 24 rules in 26 ms. Remains 475 /485 variables (removed 10) and now considering 478/492 (removed 14) transitions.
// Phase 1: matrix 478 rows 475 cols
[2024-05-23 16:19:47] [INFO ] Computed 29 invariants in 4 ms
[2024-05-23 16:19:47] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-23 16:19:47] [INFO ] Invariant cache hit.
[2024-05-23 16:19:47] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Running 477 sub problems to find dead transitions.
[2024-05-23 16:19:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/952 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (OVERLAPS) 1/953 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/953 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 1.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(timeout
s356 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 953/953 variables, and 504 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 477 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/952 variables, 477/980 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/952 variables, 0/980 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (OVERLAPS) 1/953 variables, 1/981 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/953 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 953/953 variables, and 981 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 477 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Starting structural reductions in LTL mode, iteration 1 : 475/485 places, 478/492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60538 ms. Remains : 475/485 places, 478/492 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-15
Product exploration explored 100000 steps with 446 reset in 217 ms.
Product exploration explored 100000 steps with 452 reset in 265 ms.
Computed a total of 88 stabilizing places and 88 stable transitions
Graph (complete) has 739 edges and 475 vertex of which 443 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.6 ms
Computed a total of 88 stabilizing places and 88 stable transitions
Detected a total of 88/475 stabilizing places and 88/478 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p2)), (X (AND (NOT p2) p0)), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 139 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
RANDOM walk for 40000 steps (166 resets) in 121 ms. (327 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40003 steps (19 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (17 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
[2024-05-23 16:20:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 404/474 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/953 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/953 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/953 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 953/953 variables, and 504 constraints, problems are : Problem set: 0 solved, 2 unsolved in 263 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 404/474 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 2/505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/953 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/953 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/953 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 953/953 variables, and 506 constraints, problems are : Problem set: 0 solved, 2 unsolved in 276 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 545ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 118 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=59 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p2)), (X (AND (NOT p2) p0)), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 11 factoid took 367 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
[2024-05-23 16:20:50] [INFO ] Invariant cache hit.
[2024-05-23 16:20:50] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 9 ms returned sat
[2024-05-23 16:20:50] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2024-05-23 16:20:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:20:51] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 9 ms returned sat
[2024-05-23 16:20:51] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-23 16:20:51] [INFO ] Computed and/alt/rep : 472/620/472 causal constraints (skipped 5 transitions) in 25 ms.
[2024-05-23 16:20:53] [INFO ] Added : 300 causal constraints over 62 iterations in 2542 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 478/478 transitions.
Applied a total of 0 rules in 7 ms. Remains 475 /475 variables (removed 0) and now considering 478/478 (removed 0) transitions.
[2024-05-23 16:20:53] [INFO ] Invariant cache hit.
[2024-05-23 16:20:53] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-23 16:20:53] [INFO ] Invariant cache hit.
[2024-05-23 16:20:54] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 477 sub problems to find dead transitions.
[2024-05-23 16:20:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/952 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (OVERLAPS) 1/953 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/953 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 953/953 variables, and 504 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 477 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/952 variables, 477/980 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/952 variables, 0/980 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (OVERLAPS) 1/953 variables, 1/981 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/953 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 953/953 variables, and 981 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 477 unsolved
Search for dead transitions found 0 dead transitions in 60120ms
Finished structural reductions in LTL mode , in 1 iterations and 60516 ms. Remains : 475/475 places, 478/478 transitions.
Computed a total of 88 stabilizing places and 88 stable transitions
Graph (complete) has 739 edges and 475 vertex of which 443 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Computed a total of 88 stabilizing places and 88 stable transitions
Detected a total of 88/475 stabilizing places and 88/478 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 146 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
RANDOM walk for 40000 steps (165 resets) in 238 ms. (167 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (18 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (17 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
[2024-05-23 16:21:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 404/474 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/953 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/953 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/953 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 953/953 variables, and 504 constraints, problems are : Problem set: 0 solved, 2 unsolved in 259 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 404/474 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 2/505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/953 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/953 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/953 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 953/953 variables, and 506 constraints, problems are : Problem set: 0 solved, 2 unsolved in 306 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 582ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 112 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=22 )
Parikh walk visited 2 properties in 6 ms.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 11 factoid took 384 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 168 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
[2024-05-23 16:21:56] [INFO ] Invariant cache hit.
[2024-05-23 16:21:56] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 22 ms returned sat
[2024-05-23 16:21:56] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2024-05-23 16:21:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 16:21:56] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 9 ms returned sat
[2024-05-23 16:21:57] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2024-05-23 16:21:57] [INFO ] Computed and/alt/rep : 472/620/472 causal constraints (skipped 5 transitions) in 27 ms.
[2024-05-23 16:21:59] [INFO ] Added : 300 causal constraints over 62 iterations in 2559 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 177 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Product exploration explored 100000 steps with 441 reset in 142 ms.
Product exploration explored 100000 steps with 459 reset in 158 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Support contains 3 out of 475 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 475/475 places, 478/478 transitions.
Graph (trivial) has 386 edges and 475 vertex of which 6 / 475 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 733 edges and 470 vertex of which 438 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 226 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 226 rules applied. Total rules applied 228 place count 438 transition count 469
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 30 Pre rules applied. Total rules applied 228 place count 438 transition count 471
Deduced a syphon composed of 256 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 258 place count 438 transition count 471
Discarding 167 places :
Symmetric choice reduction at 1 with 167 rule applications. Total rules 425 place count 271 transition count 304
Deduced a syphon composed of 116 places in 1 ms
Iterating global reduction 1 with 167 rules applied. Total rules applied 592 place count 271 transition count 304
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 619 place count 244 transition count 277
Deduced a syphon composed of 89 places in 1 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 646 place count 244 transition count 277
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 176 places in 0 ms
Iterating global reduction 1 with 87 rules applied. Total rules applied 733 place count 244 transition count 278
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 735 place count 244 transition count 276
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 796 place count 183 transition count 214
Deduced a syphon composed of 115 places in 1 ms
Iterating global reduction 2 with 61 rules applied. Total rules applied 857 place count 183 transition count 214
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 116 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 858 place count 183 transition count 214
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 859 place count 182 transition count 213
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 860 place count 182 transition count 213
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 888 place count 182 transition count 298
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 940 place count 130 transition count 194
Deduced a syphon composed of 116 places in 0 ms
Iterating global reduction 2 with 52 rules applied. Total rules applied 992 place count 130 transition count 194
Discarding 75 places :
Symmetric choice reduction at 2 with 75 rule applications. Total rules 1067 place count 55 transition count 69
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 2 with 75 rules applied. Total rules applied 1142 place count 55 transition count 69
Deduced a syphon composed of 41 places in 0 ms
Applied a total of 1142 rules in 50 ms. Remains 55 /475 variables (removed 420) and now considering 69/478 (removed 409) transitions.
[2024-05-23 16:22:00] [INFO ] Redundant transitions in 14 ms returned []
Running 68 sub problems to find dead transitions.
[2024-05-23 16:22:00] [INFO ] Flow matrix only has 68 transitions (discarded 1 similar events)
// Phase 1: matrix 68 rows 55 cols
[2024-05-23 16:22:00] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 16:22:00] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 1 (OVERLAPS) 67/121 variables, 54/54 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 13/67 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/67 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 1/122 variables, 1/68 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/68 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 1/123 variables, 1/69 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/69 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 0/123 variables, 0/69 constraints. Problems are: Problem set: 49 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 69 constraints, problems are : Problem set: 49 solved, 19 unsolved in 840 ms.
Refiners :[State Equation: 55/55 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 49 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 66/79 variables, 13/13 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 13/26 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 19/45 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/45 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 43/122 variables, 42/87 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/87 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/123 variables, 1/88 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/88 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/123 variables, 0/88 constraints. Problems are: Problem set: 49 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 88 constraints, problems are : Problem set: 49 solved, 19 unsolved in 419 ms.
Refiners :[State Equation: 55/55 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 19/68 constraints, Known Traps: 0/0 constraints]
After SMT, in 1272ms problems are : Problem set: 49 solved, 19 unsolved
Search for dead transitions found 49 dead transitions in 1272ms
Found 49 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 49 transitions
Dead transitions reduction (with SMT) removed 49 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 55/475 places, 20/478 transitions.
Graph (complete) has 46 edges and 55 vertex of which 14 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.0 ms
Discarding 41 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 14 /55 variables (removed 41) and now considering 20/20 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/475 places, 20/478 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1349 ms. Remains : 14/475 places, 20/478 transitions.
Support contains 3 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 478/478 transitions.
Applied a total of 0 rules in 8 ms. Remains 475 /475 variables (removed 0) and now considering 478/478 (removed 0) transitions.
// Phase 1: matrix 478 rows 475 cols
[2024-05-23 16:22:01] [INFO ] Computed 29 invariants in 2 ms
[2024-05-23 16:22:01] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-23 16:22:01] [INFO ] Invariant cache hit.
[2024-05-23 16:22:02] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 477 sub problems to find dead transitions.
[2024-05-23 16:22:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/952 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (OVERLAPS) 1/953 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/953 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 953/953 variables, and 504 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 477 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/952 variables, 477/980 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/952 variables, 0/980 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (OVERLAPS) 1/953 variables, 1/981 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/953 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 953/953 variables, and 981 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 477 unsolved
Search for dead transitions found 0 dead transitions in 60125ms
Finished structural reductions in LTL mode , in 1 iterations and 60549 ms. Remains : 475/475 places, 478/478 transitions.
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-15 finished in 195026 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(G(p1)))))'
Found a Lengthening insensitive property : GPUForwardProgress-PT-28b-LTLFireability-03
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Graph (trivial) has 403 edges and 485 vertex of which 6 / 485 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 747 edges and 480 vertex of which 448 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Discarding 32 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 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 237 place count 447 transition count 247
Reduce places removed 235 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 241 rules applied. Total rules applied 478 place count 212 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 479 place count 211 transition count 241
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 479 place count 211 transition count 181
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 599 place count 151 transition count 181
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 626 place count 124 transition count 154
Iterating global reduction 3 with 27 rules applied. Total rules applied 653 place count 124 transition count 154
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 823 place count 39 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 824 place count 39 transition count 68
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 851 place count 12 transition count 15
Iterating global reduction 4 with 27 rules applied. Total rules applied 878 place count 12 transition count 15
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 880 place count 11 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 881 place count 10 transition count 13
Applied a total of 881 rules in 21 ms. Remains 10 /485 variables (removed 475) and now considering 13/492 (removed 479) transitions.
// Phase 1: matrix 13 rows 10 cols
[2024-05-23 16:23:02] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 16:23:02] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-23 16:23:02] [INFO ] Invariant cache hit.
[2024-05-23 16:23:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 16:23:02] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-23 16:23:02] [INFO ] Invariant cache hit.
[2024-05-23 16:23:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/20 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2/22 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/23 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 11 constraints, problems are : Problem set: 0 solved, 9 unsolved in 62 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/20 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/22 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/23 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/23 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 20 constraints, problems are : Problem set: 0 solved, 9 unsolved in 67 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 154ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 154ms
Starting structural reductions in LI_LTL mode, iteration 1 : 10/485 places, 13/492 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 211 ms. Remains : 10/485 places, 13/492 transitions.
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-03 finished in 463 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-03 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(((p1&&X(!p2))||G(!p2))))))'
Found a Shortening insensitive property : GPUForwardProgress-PT-28b-LTLFireability-10
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2, p2]
Support contains 5 out of 485 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Graph (trivial) has 397 edges and 485 vertex of which 6 / 485 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 747 edges and 480 vertex of which 448 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Discarding 32 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 233 transitions
Trivial Post-agglo rules discarded 233 transitions
Performed 233 trivial Post agglomeration. Transition count delta: 233
Iterating post reduction 0 with 233 rules applied. Total rules applied 235 place count 447 transition count 249
Reduce places removed 233 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 239 rules applied. Total rules applied 474 place count 214 transition count 243
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 477 place count 213 transition count 241
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 479 place count 211 transition count 241
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 479 place count 211 transition count 183
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 595 place count 153 transition count 183
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 621 place count 127 transition count 157
Iterating global reduction 4 with 26 rules applied. Total rules applied 647 place count 127 transition count 157
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 813 place count 44 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 814 place count 44 transition count 73
Discarding 26 places :
Symmetric choice reduction at 5 with 26 rule applications. Total rules 840 place count 18 transition count 22
Iterating global reduction 5 with 26 rules applied. Total rules applied 866 place count 18 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 870 place count 16 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 871 place count 15 transition count 20
Applied a total of 871 rules in 21 ms. Remains 15 /485 variables (removed 470) and now considering 20/492 (removed 472) transitions.
[2024-05-23 16:23:03] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 15 cols
[2024-05-23 16:23:03] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 16:23:03] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-23 16:23:03] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-23 16:23:03] [INFO ] Invariant cache hit.
[2024-05-23 16:23:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 16:23:03] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-23 16:23:03] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-23 16:23:03] [INFO ] Invariant cache hit.
[2024-05-23 16:23:03] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 18/30 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 3/33 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/34 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/34 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 17 constraints, problems are : Problem set: 0 solved, 17 unsolved in 135 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 18/30 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 3/33 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/34 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/34 variables, and 34 constraints, problems are : Problem set: 0 solved, 17 unsolved in 180 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 320ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 320ms
Starting structural reductions in LI_LTL mode, iteration 1 : 15/485 places, 20/492 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 396 ms. Remains : 15/485 places, 20/492 transitions.
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-10
Product exploration explored 100000 steps with 8234 reset in 86 ms.
Product exploration explored 100000 steps with 8175 reset in 89 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/15 stabilizing places and 7/20 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (NOT (AND p2 p1))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 p1)))), (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 14 factoid took 333 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[p2, p2, p2, p2]
RANDOM walk for 3216 steps (276 resets) in 8 ms. (357 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (NOT (AND p2 p1))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p1 p2))), (F (NOT p1)), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 14 factoid took 551 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[p2, p2, p2, p2]
Stuttering acceptance computed with spot in 143 ms :[p2, p2, p2, p2]
Support contains 4 out of 15 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-23 16:23:05] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-23 16:23:05] [INFO ] Invariant cache hit.
[2024-05-23 16:23:05] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-23 16:23:05] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-23 16:23:05] [INFO ] Invariant cache hit.
[2024-05-23 16:23:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 16:23:05] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-23 16:23:05] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-23 16:23:05] [INFO ] Invariant cache hit.
[2024-05-23 16:23:05] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 18/30 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 3/33 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/34 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/34 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 17 constraints, problems are : Problem set: 0 solved, 17 unsolved in 138 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 18/30 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 3/33 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/34 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/34 variables, and 34 constraints, problems are : Problem set: 0 solved, 17 unsolved in 165 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 310ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 310ms
Finished structural reductions in LTL mode , in 1 iterations and 350 ms. Remains : 15/15 places, 20/20 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X p1), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 119 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[p2, p2, p2, p2]
RANDOM walk for 2549 steps (208 resets) in 9 ms. (254 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X p1), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p2) (NOT p1)))), (F p2), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 11 factoid took 317 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[p2, p2, p2, p2]
Stuttering acceptance computed with spot in 161 ms :[p2, p2, p2, p2]
Stuttering acceptance computed with spot in 158 ms :[p2, p2, p2, p2]
Product exploration explored 100000 steps with 8270 reset in 82 ms.
Product exploration explored 100000 steps with 8408 reset in 86 ms.
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-23 16:23:06] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-23 16:23:06] [INFO ] Invariant cache hit.
[2024-05-23 16:23:06] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-23 16:23:06] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-23 16:23:06] [INFO ] Invariant cache hit.
[2024-05-23 16:23:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 16:23:06] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-23 16:23:06] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-23 16:23:06] [INFO ] Invariant cache hit.
[2024-05-23 16:23:06] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 18/30 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 3/33 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/34 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/34 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 17 constraints, problems are : Problem set: 0 solved, 17 unsolved in 166 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 18/30 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 3/33 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/34 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/34 variables, and 34 constraints, problems are : Problem set: 0 solved, 17 unsolved in 166 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 338ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 338ms
Finished structural reductions in LTL mode , in 1 iterations and 378 ms. Remains : 15/15 places, 20/20 transitions.
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-10 finished in 4381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X(G(p1)))) U p2)))'
[2024-05-23 16:23:07] [INFO ] Flatten gal took : 21 ms
[2024-05-23 16:23:07] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-23 16:23:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 485 places, 492 transitions and 1265 arcs took 7 ms.
Total runtime 889276 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running GPUForwardProgress-PT-28b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/402/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 485
TRANSITIONS: 492
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.008s, Sys 0.000s]


SAVING FILE /home/mcc/execution/402/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.001s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2121
MODEL NAME: /home/mcc/execution/402/model
485 places, 492 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA GPUForwardProgress-PT-28b-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-28b-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-28b-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA GPUForwardProgress-PT-28b-LTLFireability-10 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716481951209

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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-28b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is GPUForwardProgress-PT-28b, 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 r179-tall-171640601800572"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-28b.tgz
mv GPUForwardProgress-PT-28b 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;