About the Execution of GreatSPN+red for DiscoveryGPU-PT-15b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10214.571 | 2454301.00 | 5800861.00 | 4457.20 | F?FTTTFFFFFFFFFF | normal |
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.r135-tall-171631131300516.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 DiscoveryGPU-PT-15b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131300516
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 02:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 12 02:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 02:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 02:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 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 111K 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 DiscoveryGPU-PT-15b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-15b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716375082003
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-15b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 10:51:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 10:51:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 10:51:23] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-05-22 10:51:23] [INFO ] Transformed 436 places.
[2024-05-22 10:51:23] [INFO ] Transformed 464 transitions.
[2024-05-22 10:51:23] [INFO ] Found NUPN structural information;
[2024-05-22 10:51:23] [INFO ] Parsed PT model containing 436 places and 464 transitions and 1214 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 464/464 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 406 transition count 464
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 104 place count 332 transition count 390
Iterating global reduction 1 with 74 rules applied. Total rules applied 178 place count 332 transition count 390
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 194 place count 316 transition count 374
Iterating global reduction 1 with 16 rules applied. Total rules applied 210 place count 316 transition count 374
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 223 place count 303 transition count 361
Iterating global reduction 1 with 13 rules applied. Total rules applied 236 place count 303 transition count 361
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 245 place count 294 transition count 352
Iterating global reduction 1 with 9 rules applied. Total rules applied 254 place count 294 transition count 352
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 262 place count 286 transition count 336
Iterating global reduction 1 with 8 rules applied. Total rules applied 270 place count 286 transition count 336
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 277 place count 279 transition count 329
Iterating global reduction 1 with 7 rules applied. Total rules applied 284 place count 279 transition count 329
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 290 place count 273 transition count 323
Iterating global reduction 1 with 6 rules applied. Total rules applied 296 place count 273 transition count 323
Applied a total of 296 rules in 132 ms. Remains 273 /436 variables (removed 163) and now considering 323/464 (removed 141) transitions.
// Phase 1: matrix 323 rows 273 cols
[2024-05-22 10:51:23] [INFO ] Computed 2 invariants in 20 ms
[2024-05-22 10:51:24] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-05-22 10:51:24] [INFO ] Invariant cache hit.
[2024-05-22 10:51:24] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2024-05-22 10:51:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (OVERLAPS) 323/596 variables, 273/275 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-22 10:51:31] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 20 ms to minimize.
[2024-05-22 10:51:31] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 3 ms to minimize.
[2024-05-22 10:51:31] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-22 10:51:31] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 2 ms to minimize.
[2024-05-22 10:51:31] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2024-05-22 10:51:32] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
[2024-05-22 10:51:32] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-22 10:51:32] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-05-22 10:51:32] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-22 10:51:32] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 2 ms to minimize.
[2024-05-22 10:51:32] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-22 10:51:32] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2024-05-22 10:51:32] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-22 10:51:32] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
[2024-05-22 10:51:32] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-05-22 10:51:32] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-05-22 10:51:32] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-22 10:51:33] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-22 10:51:33] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 2 ms to minimize.
[2024-05-22 10:51:33] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/596 variables, 20/295 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-22 10:51:33] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-05-22 10:51:33] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-22 10:51:33] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-05-22 10:51:33] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-05-22 10:51:33] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-05-22 10:51:33] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-05-22 10:51:33] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-22 10:51:34] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-22 10:51:34] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/596 variables, 9/304 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/596 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (OVERLAPS) 0/596 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Real declared 596/596 variables, and 304 constraints, problems are : Problem set: 0 solved, 322 unsolved in 20489 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/273 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/273 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 323/596 variables, 273/304 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/596 variables, 322/626 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/596 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (OVERLAPS) 0/596 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Int declared 596/596 variables, and 626 constraints, problems are : Problem set: 0 solved, 322 unsolved in 20733 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 29/29 constraints]
After SMT, in 41472ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 41491ms
Starting structural reductions in LTL mode, iteration 1 : 273/436 places, 323/464 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42111 ms. Remains : 273/436 places, 323/464 transitions.
Support contains 34 out of 273 places after structural reductions.
[2024-05-22 10:52:06] [INFO ] Flatten gal took : 71 ms
[2024-05-22 10:52:06] [INFO ] Flatten gal took : 27 ms
[2024-05-22 10:52:06] [INFO ] Input system was already deterministic with 323 transitions.
Support contains 33 out of 273 places (down from 34) after GAL structural reductions.
RANDOM walk for 40000 steps (81 resets) in 1217 ms. (32 steps per ms) remains 1/31 properties
BEST_FIRST walk for 22108 steps (3 resets) in 51 ms. (425 steps per ms) remains 0/1 properties
Computed a total of 47 stabilizing places and 47 stable transitions
Graph (complete) has 550 edges and 273 vertex of which 271 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 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(X((X((p1 U (p2||G(p1))))&&p0))))'
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 323/323 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 264 transition count 313
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 264 transition count 313
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 258 transition count 306
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 258 transition count 306
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 253 transition count 299
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 253 transition count 299
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 249 transition count 294
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 249 transition count 294
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 246 transition count 291
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 246 transition count 291
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 245 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 245 transition count 290
Applied a total of 56 rules in 54 ms. Remains 245 /273 variables (removed 28) and now considering 290/323 (removed 33) transitions.
// Phase 1: matrix 290 rows 245 cols
[2024-05-22 10:52:07] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:52:07] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-22 10:52:07] [INFO ] Invariant cache hit.
[2024-05-22 10:52:07] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2024-05-22 10:52:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (OVERLAPS) 290/535 variables, 245/247 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-22 10:52:13] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
[2024-05-22 10:52:13] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 1 ms to minimize.
[2024-05-22 10:52:13] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-05-22 10:52:13] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-05-22 10:52:13] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
[2024-05-22 10:52:13] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 6 ms to minimize.
[2024-05-22 10:52:13] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 1 ms to minimize.
[2024-05-22 10:52:13] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-05-22 10:52:13] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
[2024-05-22 10:52:14] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 3 ms to minimize.
[2024-05-22 10:52:14] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 2 ms to minimize.
[2024-05-22 10:52:14] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2024-05-22 10:52:14] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2024-05-22 10:52:14] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-05-22 10:52:14] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-22 10:52:14] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-22 10:52:14] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-22 10:52:14] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 3 ms to minimize.
[2024-05-22 10:52:14] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-05-22 10:52:14] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-22 10:52:15] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-22 10:52:15] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 3 ms to minimize.
[2024-05-22 10:52:15] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-22 10:52:15] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-22 10:52:15] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-22 10:52:15] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-05-22 10:52:15] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 9 ms to minimize.
[2024-05-22 10:52:15] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2024-05-22 10:52:15] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 9/276 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 0/535 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 276 constraints, problems are : Problem set: 0 solved, 289 unsolved in 16102 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 290/535 variables, 245/276 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 289/565 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 0/535 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 565 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17186 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 29/29 constraints]
After SMT, in 33543ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 33547ms
Starting structural reductions in LTL mode, iteration 1 : 245/273 places, 290/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34046 ms. Remains : 245/273 places, 290/323 transitions.
Stuttering acceptance computed with spot in 354 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-01
Product exploration explored 100000 steps with 25000 reset in 202 ms.
Product exploration explored 100000 steps with 25000 reset in 145 ms.
Computed a total of 47 stabilizing places and 47 stable transitions
Graph (complete) has 499 edges and 245 vertex of which 244 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 47 stabilizing places and 47 stable transitions
Detected a total of 47/245 stabilizing places and 47/290 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 31987 steps (64 resets) in 216 ms. (147 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p2 p1), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 3 factoid took 225 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 148 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 245 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 290/290 transitions.
Applied a total of 0 rules in 4 ms. Remains 245 /245 variables (removed 0) and now considering 290/290 (removed 0) transitions.
[2024-05-22 10:52:42] [INFO ] Invariant cache hit.
[2024-05-22 10:52:42] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-22 10:52:43] [INFO ] Invariant cache hit.
[2024-05-22 10:52:43] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2024-05-22 10:52:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (OVERLAPS) 290/535 variables, 245/247 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-22 10:52:48] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-05-22 10:52:48] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-05-22 10:52:49] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2024-05-22 10:52:49] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-22 10:52:49] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2024-05-22 10:52:49] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-05-22 10:52:49] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
[2024-05-22 10:52:49] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-22 10:52:49] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 2 ms to minimize.
[2024-05-22 10:52:49] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
[2024-05-22 10:52:49] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2024-05-22 10:52:49] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2024-05-22 10:52:50] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-22 10:52:50] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
[2024-05-22 10:52:50] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-05-22 10:52:50] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2024-05-22 10:52:50] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-22 10:52:50] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2024-05-22 10:52:50] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-05-22 10:52:50] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-22 10:52:50] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-22 10:52:51] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 3 ms to minimize.
[2024-05-22 10:52:51] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-05-22 10:52:51] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 2 ms to minimize.
[2024-05-22 10:52:51] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-22 10:52:51] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-22 10:52:51] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2024-05-22 10:52:51] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-22 10:52:51] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 9/276 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 0/535 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 276 constraints, problems are : Problem set: 0 solved, 289 unsolved in 16588 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 290/535 variables, 245/276 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 289/565 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 0/535 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 565 constraints, problems are : Problem set: 0 solved, 289 unsolved in 16931 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 29/29 constraints]
After SMT, in 33667ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 33672ms
Finished structural reductions in LTL mode , in 1 iterations and 34097 ms. Remains : 245/245 places, 290/290 transitions.
Computed a total of 47 stabilizing places and 47 stable transitions
Graph (complete) has 499 edges and 245 vertex of which 244 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 47 stabilizing places and 47 stable transitions
Detected a total of 47/245 stabilizing places and 47/290 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p2), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (80 resets) in 151 ms. (263 steps per ms) remains 1/4 properties
BEST_FIRST walk for 4689 steps (0 resets) in 10 ms. (426 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p2), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 2 factoid took 229 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 176 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 156 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 132 ms.
Product exploration explored 100000 steps with 25000 reset in 107 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 163 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 245 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 245/245 places, 290/290 transitions.
Graph (complete) has 499 edges and 245 vertex of which 244 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 244 transition count 289
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 46 Pre rules applied. Total rules applied 32 place count 244 transition count 289
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 78 place count 244 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 243 transition count 288
Deduced a syphon composed of 77 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 243 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 242 transition count 287
Deduced a syphon composed of 77 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 242 transition count 287
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 241 transition count 285
Deduced a syphon composed of 77 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 241 transition count 285
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 240 transition count 284
Deduced a syphon composed of 77 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 240 transition count 284
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 110 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 119 place count 240 transition count 298
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 122 place count 237 transition count 295
Deduced a syphon composed of 107 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 125 place count 237 transition count 295
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -62
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 156 place count 237 transition count 357
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 170 place count 223 transition count 329
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 184 place count 223 transition count 329
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 226 place count 181 transition count 259
Deduced a syphon composed of 110 places in 0 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 268 place count 181 transition count 259
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 308 place count 141 transition count 193
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 348 place count 141 transition count 193
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 361 place count 128 transition count 180
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 374 place count 128 transition count 180
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 400 place count 102 transition count 141
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 426 place count 102 transition count 141
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 477 place count 51 transition count 64
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 1 with 51 rules applied. Total rules applied 528 place count 51 transition count 64
Deduced a syphon composed of 32 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 533 place count 51 transition count 59
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 535 place count 49 transition count 57
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 537 place count 49 transition count 57
Deduced a syphon composed of 30 places in 0 ms
Applied a total of 537 rules in 114 ms. Remains 49 /245 variables (removed 196) and now considering 57/290 (removed 233) transitions.
[2024-05-22 10:53:18] [INFO ] Redundant transitions in 1 ms returned []
Running 56 sub problems to find dead transitions.
[2024-05-22 10:53:18] [INFO ] Flow matrix only has 55 transitions (discarded 2 similar events)
// Phase 1: matrix 55 rows 49 cols
[2024-05-22 10:53:18] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:53:18] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-22 10:53:19] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 0 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-05-22 10:53:19] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 53 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 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 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 TDEAD34 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
At refinement iteration 4 (OVERLAPS) 54/103 variables, 49/53 constraints. Problems are: Problem set: 35 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 19/72 constraints. Problems are: Problem set: 35 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/72 constraints. Problems are: Problem set: 35 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 1/104 variables, 1/73 constraints. Problems are: Problem set: 35 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/73 constraints. Problems are: Problem set: 35 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/73 constraints. Problems are: Problem set: 35 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 73 constraints, problems are : Problem set: 35 solved, 21 unsolved in 1146 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 35 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 35 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 4/22 variables, 2/2 constraints. Problems are: Problem set: 35 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 2/4 constraints. Problems are: Problem set: 35 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 35 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 52/74 variables, 22/26 constraints. Problems are: Problem set: 35 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 18/44 constraints. Problems are: Problem set: 35 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 21/65 constraints. Problems are: Problem set: 35 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/65 constraints. Problems are: Problem set: 35 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 27/101 variables, 26/91 constraints. Problems are: Problem set: 35 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/91 constraints. Problems are: Problem set: 35 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 2/103 variables, 2/93 constraints. Problems are: Problem set: 35 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/103 variables, 0/93 constraints. Problems are: Problem set: 35 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 1/104 variables, 1/94 constraints. Problems are: Problem set: 35 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/104 variables, 0/94 constraints. Problems are: Problem set: 35 solved, 21 unsolved
At refinement iteration 14 (OVERLAPS) 0/104 variables, 0/94 constraints. Problems are: Problem set: 35 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 94 constraints, problems are : Problem set: 35 solved, 21 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 21/56 constraints, Known Traps: 2/2 constraints]
After SMT, in 1563ms problems are : Problem set: 35 solved, 21 unsolved
Search for dead transitions found 35 dead transitions in 1564ms
Found 35 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 35 transitions
Dead transitions reduction (with SMT) removed 35 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 49/245 places, 22/290 transitions.
Graph (complete) has 51 edges and 49 vertex of which 19 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.2 ms
Discarding 30 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 19 /49 variables (removed 30) and now considering 22/22 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/245 places, 22/290 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1700 ms. Remains : 19/245 places, 22/290 transitions.
Support contains 2 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 290/290 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 244 transition count 289
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 243 transition count 288
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 243 transition count 288
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 242 transition count 286
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 242 transition count 286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 241 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 241 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 240 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 240 transition count 284
Applied a total of 10 rules in 27 ms. Remains 240 /245 variables (removed 5) and now considering 284/290 (removed 6) transitions.
// Phase 1: matrix 284 rows 240 cols
[2024-05-22 10:53:20] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:53:20] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-22 10:53:20] [INFO ] Invariant cache hit.
[2024-05-22 10:53:20] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-05-22 10:53:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 284/524 variables, 240/242 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-22 10:53:25] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2024-05-22 10:53:26] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-22 10:53:26] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 1 ms to minimize.
[2024-05-22 10:53:26] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2024-05-22 10:53:26] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-05-22 10:53:26] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2024-05-22 10:53:26] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-05-22 10:53:26] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-22 10:53:26] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
[2024-05-22 10:53:26] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2024-05-22 10:53:26] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-05-22 10:53:27] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
[2024-05-22 10:53:27] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-22 10:53:27] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-05-22 10:53:27] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-05-22 10:53:27] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-22 10:53:27] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2024-05-22 10:53:27] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2024-05-22 10:53:27] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-22 10:53:27] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-22 10:53:28] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-22 10:53:28] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2024-05-22 10:53:28] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-05-22 10:53:28] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 0/524 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 524/524 variables, and 266 constraints, problems are : Problem set: 0 solved, 283 unsolved in 15589 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 284/524 variables, 240/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 283/549 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 0/524 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 524/524 variables, and 549 constraints, problems are : Problem set: 0 solved, 283 unsolved in 17922 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 24/24 constraints]
After SMT, in 33660ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 33664ms
Starting structural reductions in LTL mode, iteration 1 : 240/245 places, 284/290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33995 ms. Remains : 240/245 places, 284/290 transitions.
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-01 finished in 107331 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)))'
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 323/323 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 263 transition count 312
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 263 transition count 312
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 256 transition count 304
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 256 transition count 304
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 250 transition count 295
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 250 transition count 295
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 245 transition count 289
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 245 transition count 289
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 241 transition count 285
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 241 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 240 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 240 transition count 284
Applied a total of 66 rules in 36 ms. Remains 240 /273 variables (removed 33) and now considering 284/323 (removed 39) transitions.
[2024-05-22 10:53:54] [INFO ] Invariant cache hit.
[2024-05-22 10:53:54] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-22 10:53:54] [INFO ] Invariant cache hit.
[2024-05-22 10:53:54] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-05-22 10:53:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 284/524 variables, 240/242 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-22 10:54:00] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
[2024-05-22 10:54:00] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-22 10:54:00] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2024-05-22 10:54:00] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2024-05-22 10:54:00] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-22 10:54:00] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-22 10:54:00] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-22 10:54:00] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-22 10:54:00] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-22 10:54:00] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-22 10:54:00] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-22 10:54:00] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-22 10:54:01] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-22 10:54:01] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2024-05-22 10:54:01] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-22 10:54:01] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-22 10:54:01] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-05-22 10:54:01] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-22 10:54:01] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-05-22 10:54:01] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-22 10:54:01] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-22 10:54:01] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-22 10:54:01] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-22 10:54:02] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 0/524 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 524/524 variables, and 266 constraints, problems are : Problem set: 0 solved, 283 unsolved in 14711 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 284/524 variables, 240/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 283/549 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 0/524 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 524/524 variables, and 549 constraints, problems are : Problem set: 0 solved, 283 unsolved in 17596 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 24/24 constraints]
After SMT, in 32423ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 32427ms
Starting structural reductions in LTL mode, iteration 1 : 240/273 places, 284/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32967 ms. Remains : 240/273 places, 284/323 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-02
Product exploration explored 100000 steps with 546 reset in 178 ms.
Stack based approach found an accepted trace after 111 steps with 0 reset with depth 112 and stack size 112 in 1 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-02 finished in 33317 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((p0||X((p1||X(X(X(F(p0)))))))))'
Support contains 1 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 323/323 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 263 transition count 312
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 263 transition count 312
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 256 transition count 304
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 256 transition count 304
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 251 transition count 297
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 251 transition count 297
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 247 transition count 292
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 247 transition count 292
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 244 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 244 transition count 289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 243 transition count 288
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 243 transition count 288
Applied a total of 60 rules in 15 ms. Remains 243 /273 variables (removed 30) and now considering 288/323 (removed 35) transitions.
// Phase 1: matrix 288 rows 243 cols
[2024-05-22 10:54:27] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:54:27] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-22 10:54:27] [INFO ] Invariant cache hit.
[2024-05-22 10:54:28] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2024-05-22 10:54:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (OVERLAPS) 288/531 variables, 243/245 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-05-22 10:54:33] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
[2024-05-22 10:54:33] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-05-22 10:54:33] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-22 10:54:33] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 2 ms to minimize.
[2024-05-22 10:54:33] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 7 ms to minimize.
[2024-05-22 10:54:33] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 3 ms to minimize.
[2024-05-22 10:54:33] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-05-22 10:54:33] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
[2024-05-22 10:54:34] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2024-05-22 10:54:34] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 2 ms to minimize.
[2024-05-22 10:54:34] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
[2024-05-22 10:54:34] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2024-05-22 10:54:34] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
[2024-05-22 10:54:34] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
[2024-05-22 10:54:34] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-22 10:54:34] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-22 10:54:34] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2024-05-22 10:54:34] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-05-22 10:54:35] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-05-22 10:54:35] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-05-22 10:54:35] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2024-05-22 10:54:35] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-05-22 10:54:35] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2024-05-22 10:54:35] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2024-05-22 10:54:35] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-05-22 10:54:35] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-05-22 10:54:35] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 7/272 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 272 constraints, problems are : Problem set: 0 solved, 287 unsolved in 15996 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 288/531 variables, 243/272 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 287/559 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 559 constraints, problems are : Problem set: 0 solved, 287 unsolved in 18959 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 27/27 constraints]
After SMT, in 35052ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 35056ms
Starting structural reductions in LTL mode, iteration 1 : 243/273 places, 288/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35324 ms. Remains : 243/273 places, 288/323 transitions.
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-03
Product exploration explored 100000 steps with 33333 reset in 92 ms.
Product exploration explored 100000 steps with 33333 reset in 88 ms.
Computed a total of 47 stabilizing places and 47 stable transitions
Graph (complete) has 495 edges and 243 vertex of which 242 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 47 stabilizing places and 47 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-15b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-03 finished in 35777 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 3 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 323/323 transitions.
Graph (complete) has 550 edges and 273 vertex of which 271 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 270 transition count 282
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 232 transition count 282
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 77 place count 232 transition count 236
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 169 place count 186 transition count 236
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 176 place count 179 transition count 228
Iterating global reduction 2 with 7 rules applied. Total rules applied 183 place count 179 transition count 228
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 189 place count 173 transition count 221
Iterating global reduction 2 with 6 rules applied. Total rules applied 195 place count 173 transition count 221
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 200 place count 168 transition count 212
Iterating global reduction 2 with 5 rules applied. Total rules applied 205 place count 168 transition count 212
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 209 place count 164 transition count 208
Iterating global reduction 2 with 4 rules applied. Total rules applied 213 place count 164 transition count 208
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 339 place count 101 transition count 145
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 352 place count 88 transition count 119
Iterating global reduction 2 with 13 rules applied. Total rules applied 365 place count 88 transition count 119
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 378 place count 75 transition count 106
Iterating global reduction 2 with 13 rules applied. Total rules applied 391 place count 75 transition count 106
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 404 place count 62 transition count 80
Iterating global reduction 2 with 13 rules applied. Total rules applied 417 place count 62 transition count 80
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 430 place count 49 transition count 67
Iterating global reduction 2 with 13 rules applied. Total rules applied 443 place count 49 transition count 67
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 456 place count 36 transition count 41
Iterating global reduction 2 with 13 rules applied. Total rules applied 469 place count 36 transition count 41
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 481 place count 24 transition count 29
Iterating global reduction 2 with 12 rules applied. Total rules applied 493 place count 24 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 494 place count 24 transition count 28
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 495 place count 24 transition count 28
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 497 place count 22 transition count 26
Reduce places removed 1 places and 0 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 2 with 2 rules applied. Total rules applied 499 place count 21 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 500 place count 20 transition count 25
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 500 place count 20 transition count 22
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 506 place count 17 transition count 22
Applied a total of 506 rules in 119 ms. Remains 17 /273 variables (removed 256) and now considering 22/323 (removed 301) transitions.
[2024-05-22 10:55:03] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 17 cols
[2024-05-22 10:55:03] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 10:55:03] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 10:55:03] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2024-05-22 10:55:03] [INFO ] Invariant cache hit.
[2024-05-22 10:55:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 10:55:03] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-22 10:55:03] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-22 10:55:03] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2024-05-22 10:55:03] [INFO ] Invariant cache hit.
[2024-05-22 10:55:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 19/35 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 1/36 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 19 constraints, problems are : Problem set: 0 solved, 20 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 19/35 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 1/36 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 39 constraints, problems are : Problem set: 0 solved, 20 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 730ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 731ms
Starting structural reductions in SI_LTL mode, iteration 1 : 17/273 places, 22/323 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 959 ms. Remains : 17/273 places, 22/323 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-04
Product exploration explored 100000 steps with 577 reset in 251 ms.
Product exploration explored 100000 steps with 578 reset in 193 ms.
Computed a total of 15 stabilizing places and 17 stable transitions
Computed a total of 15 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 134 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 57 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 19031 steps (110 resets) in 37 ms. (500 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 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-22 10:55:05] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2024-05-22 10:55:05] [INFO ] Invariant cache hit.
[2024-05-22 10:55:05] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-22 10:55:05] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2024-05-22 10:55:05] [INFO ] Invariant cache hit.
[2024-05-22 10:55:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 10:55:05] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-22 10:55:05] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-22 10:55:05] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2024-05-22 10:55:05] [INFO ] Invariant cache hit.
[2024-05-22 10:55:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 19/35 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 1/36 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 19 constraints, problems are : Problem set: 0 solved, 20 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 19/35 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 1/36 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 39 constraints, problems are : Problem set: 0 solved, 20 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 446ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 447ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 518 ms. Remains : 17/17 places, 22/22 transitions.
Computed a total of 15 stabilizing places and 17 stable transitions
Computed a total of 15 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 167 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 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 21581 steps (123 resets) in 69 ms. (308 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 93 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 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 579 reset in 120 ms.
Product exploration explored 100000 steps with 578 reset in 124 ms.
Support contains 3 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 10 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-22 10:55:06] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2024-05-22 10:55:06] [INFO ] Invariant cache hit.
[2024-05-22 10:55:06] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-22 10:55:06] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2024-05-22 10:55:06] [INFO ] Invariant cache hit.
[2024-05-22 10:55:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 10:55:06] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2024-05-22 10:55:06] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-22 10:55:06] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2024-05-22 10:55:06] [INFO ] Invariant cache hit.
[2024-05-22 10:55:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 19/35 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 1/36 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 19 constraints, problems are : Problem set: 0 solved, 20 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 19/35 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 1/36 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 39 constraints, problems are : Problem set: 0 solved, 20 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 517ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 517ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 690 ms. Remains : 17/17 places, 22/22 transitions.
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-04 finished in 4021 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(X(G((p0||X(G(p1)))))))'
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 323/323 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 264 transition count 313
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 264 transition count 313
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 258 transition count 306
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 258 transition count 306
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 253 transition count 299
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 253 transition count 299
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 249 transition count 294
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 249 transition count 294
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 246 transition count 291
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 246 transition count 291
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 245 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 245 transition count 290
Applied a total of 56 rules in 20 ms. Remains 245 /273 variables (removed 28) and now considering 290/323 (removed 33) transitions.
// Phase 1: matrix 290 rows 245 cols
[2024-05-22 10:55:07] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:55:07] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-22 10:55:07] [INFO ] Invariant cache hit.
[2024-05-22 10:55:07] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2024-05-22 10:55:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (OVERLAPS) 290/535 variables, 245/247 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-22 10:55:13] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2024-05-22 10:55:13] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-05-22 10:55:13] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-05-22 10:55:13] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2024-05-22 10:55:13] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-05-22 10:55:14] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-22 10:55:14] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-05-22 10:55:14] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2024-05-22 10:55:14] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-22 10:55:14] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 2 ms to minimize.
[2024-05-22 10:55:14] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2024-05-22 10:55:14] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
[2024-05-22 10:55:14] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-22 10:55:14] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-22 10:55:14] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 1 ms to minimize.
[2024-05-22 10:55:15] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-05-22 10:55:15] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-05-22 10:55:15] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-22 10:55:15] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2024-05-22 10:55:15] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-22 10:55:15] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-22 10:55:15] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 2 ms to minimize.
[2024-05-22 10:55:15] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-05-22 10:55:15] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-22 10:55:16] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 5/272 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 0/535 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 272 constraints, problems are : Problem set: 0 solved, 289 unsolved in 15999 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 290/535 variables, 245/272 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 289/561 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 0/535 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 561 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17309 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 25/25 constraints]
After SMT, in 33430ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 33432ms
Starting structural reductions in LTL mode, iteration 1 : 245/273 places, 290/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33778 ms. Remains : 245/273 places, 290/323 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 5714 steps with 11 reset in 14 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-06 finished in 33948 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)&&(p1 U p2))))'
Support contains 3 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 323/323 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 264 transition count 313
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 264 transition count 313
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 258 transition count 306
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 258 transition count 306
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 253 transition count 299
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 253 transition count 299
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 249 transition count 294
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 249 transition count 294
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 246 transition count 291
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 246 transition count 291
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 245 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 245 transition count 290
Applied a total of 56 rules in 33 ms. Remains 245 /273 variables (removed 28) and now considering 290/323 (removed 33) transitions.
// Phase 1: matrix 290 rows 245 cols
[2024-05-22 10:55:41] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:55:41] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-22 10:55:41] [INFO ] Invariant cache hit.
[2024-05-22 10:55:41] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2024-05-22 10:55:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (OVERLAPS) 290/535 variables, 245/247 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-22 10:55:47] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-05-22 10:55:47] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-22 10:55:47] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2024-05-22 10:55:47] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 2 ms to minimize.
[2024-05-22 10:55:47] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2024-05-22 10:55:47] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-05-22 10:55:47] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-05-22 10:55:47] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 1 ms to minimize.
[2024-05-22 10:55:48] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-05-22 10:55:48] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-05-22 10:55:48] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-22 10:55:48] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 1 ms to minimize.
[2024-05-22 10:55:48] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-05-22 10:55:48] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-22 10:55:48] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2024-05-22 10:55:48] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-22 10:55:48] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 1 ms to minimize.
[2024-05-22 10:55:48] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-05-22 10:55:48] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-22 10:55:49] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/535 variables, 20/267 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-22 10:55:49] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-22 10:55:49] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-05-22 10:55:49] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-05-22 10:55:49] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-05-22 10:55:49] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-05-22 10:55:49] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2024-05-22 10:55:49] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-22 10:55:49] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 8/275 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 0/535 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 275 constraints, problems are : Problem set: 0 solved, 289 unsolved in 16128 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 290/535 variables, 245/275 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/535 variables, 289/564 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (OVERLAPS) 0/535 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Int declared 535/535 variables, and 564 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17048 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 28/28 constraints]
After SMT, in 33307ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 33310ms
Starting structural reductions in LTL mode, iteration 1 : 245/273 places, 290/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33665 ms. Remains : 245/273 places, 290/323 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (OR (NOT p2) (NOT p0)), true, (OR (NOT p2) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-07 finished in 33801 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||(p1&&G(p2))))))'
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 323/323 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 263 transition count 312
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 263 transition count 312
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 256 transition count 304
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 256 transition count 304
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 250 transition count 295
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 250 transition count 295
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 245 transition count 289
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 245 transition count 289
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 241 transition count 285
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 241 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 240 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 240 transition count 284
Applied a total of 66 rules in 25 ms. Remains 240 /273 variables (removed 33) and now considering 284/323 (removed 39) transitions.
// Phase 1: matrix 284 rows 240 cols
[2024-05-22 10:56:15] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:56:15] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-22 10:56:15] [INFO ] Invariant cache hit.
[2024-05-22 10:56:15] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-05-22 10:56:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 284/524 variables, 240/242 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-22 10:56:21] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-05-22 10:56:21] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2024-05-22 10:56:21] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2024-05-22 10:56:21] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 2 ms to minimize.
[2024-05-22 10:56:21] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 2 ms to minimize.
[2024-05-22 10:56:21] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-22 10:56:21] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-22 10:56:21] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2024-05-22 10:56:21] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2024-05-22 10:56:21] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-05-22 10:56:22] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-05-22 10:56:22] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-05-22 10:56:22] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2024-05-22 10:56:22] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-05-22 10:56:22] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2024-05-22 10:56:22] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2024-05-22 10:56:22] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-05-22 10:56:22] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2024-05-22 10:56:22] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-22 10:56:22] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-22 10:56:23] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-22 10:56:23] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-05-22 10:56:23] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-22 10:56:23] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 0/524 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 524/524 variables, and 266 constraints, problems are : Problem set: 0 solved, 283 unsolved in 15553 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 284/524 variables, 240/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 283/549 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 0/524 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 524/524 variables, and 549 constraints, problems are : Problem set: 0 solved, 283 unsolved in 16916 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 24/24 constraints]
After SMT, in 32594ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 32603ms
Starting structural reductions in LTL mode, iteration 1 : 240/273 places, 284/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32962 ms. Remains : 240/273 places, 284/323 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-08
Product exploration explored 100000 steps with 259 reset in 238 ms.
Stack based approach found an accepted trace after 72538 steps with 176 reset with depth 228 and stack size 223 in 183 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-08 finished in 33556 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&&X((G(p1)&&(p0 U (p2||G(p0)))))))))'
Support contains 3 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 323/323 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 264 transition count 313
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 264 transition count 313
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 257 transition count 305
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 257 transition count 305
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 251 transition count 296
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 251 transition count 296
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 246 transition count 290
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 246 transition count 290
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 242 transition count 286
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 242 transition count 286
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 241 transition count 285
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 241 transition count 285
Applied a total of 64 rules in 38 ms. Remains 241 /273 variables (removed 32) and now considering 285/323 (removed 38) transitions.
// Phase 1: matrix 285 rows 241 cols
[2024-05-22 10:56:48] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:56:49] [INFO ] Implicit Places using invariants in 631 ms returned []
[2024-05-22 10:56:49] [INFO ] Invariant cache hit.
[2024-05-22 10:56:49] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 815 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-05-22 10:56:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 285/526 variables, 241/243 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-22 10:56:55] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2024-05-22 10:56:55] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2024-05-22 10:56:55] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
[2024-05-22 10:56:55] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2024-05-22 10:56:55] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 2 ms to minimize.
[2024-05-22 10:56:55] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-22 10:56:55] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-05-22 10:56:55] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-05-22 10:56:56] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
[2024-05-22 10:56:56] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-05-22 10:56:56] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 2 ms to minimize.
[2024-05-22 10:56:56] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-22 10:56:56] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-05-22 10:56:56] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
[2024-05-22 10:56:56] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 18 ms to minimize.
[2024-05-22 10:56:56] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-05-22 10:56:56] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2024-05-22 10:56:56] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-05-22 10:56:56] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2024-05-22 10:56:57] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 20/263 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-22 10:56:57] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-05-22 10:56:57] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 1 ms to minimize.
[2024-05-22 10:56:57] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-22 10:56:57] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-05-22 10:56:57] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2024-05-22 10:56:57] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-05-22 10:56:57] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 7/270 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 0/526 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/526 variables, and 270 constraints, problems are : Problem set: 0 solved, 284 unsolved in 15801 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 285/526 variables, 241/270 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 284/554 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 0/526 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 526/526 variables, and 554 constraints, problems are : Problem set: 0 solved, 284 unsolved in 16731 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 27/27 constraints]
After SMT, in 32635ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 32637ms
Starting structural reductions in LTL mode, iteration 1 : 241/273 places, 285/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33491 ms. Remains : 241/273 places, 285/323 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-09
Product exploration explored 100000 steps with 206 reset in 205 ms.
Product exploration explored 100000 steps with 208 reset in 391 ms.
Computed a total of 47 stabilizing places and 47 stable transitions
Graph (complete) has 490 edges and 241 vertex of which 240 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 47 stabilizing places and 47 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X p2), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (OR (AND p0 p1) (AND p1 p2))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND p0 p1) (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 264 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 376 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (81 resets) in 363 ms. (109 steps per ms) remains 3/10 properties
BEST_FIRST walk for 38170 steps (11 resets) in 46 ms. (812 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X p2), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (OR (AND p0 p1) (AND p1 p2))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND p0 p1) (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (AND (OR p1 p0) (OR p2 p0)))), (F (NOT p2)), (F (NOT (OR (AND p1 p2) (AND p1 p0)))), (F (NOT p0)), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR p2 p0))), (F (NOT p1))]
Knowledge based reduction with 18 factoid took 422 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 285/285 transitions.
Applied a total of 0 rules in 6 ms. Remains 241 /241 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2024-05-22 10:57:24] [INFO ] Invariant cache hit.
[2024-05-22 10:57:25] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-22 10:57:25] [INFO ] Invariant cache hit.
[2024-05-22 10:57:25] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-05-22 10:57:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 285/526 variables, 241/243 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-22 10:57:30] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 2 ms to minimize.
[2024-05-22 10:57:30] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2024-05-22 10:57:30] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 1 ms to minimize.
[2024-05-22 10:57:31] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 2 ms to minimize.
[2024-05-22 10:57:31] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-22 10:57:31] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2024-05-22 10:57:31] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-22 10:57:31] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-05-22 10:57:31] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-22 10:57:31] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-05-22 10:57:31] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-22 10:57:31] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2024-05-22 10:57:31] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-22 10:57:32] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
[2024-05-22 10:57:32] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2024-05-22 10:57:32] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-05-22 10:57:32] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-05-22 10:57:32] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-05-22 10:57:32] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-05-22 10:57:32] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 20/263 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-22 10:57:32] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-22 10:57:32] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 1 ms to minimize.
[2024-05-22 10:57:33] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-22 10:57:33] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2024-05-22 10:57:33] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-05-22 10:57:33] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 2 ms to minimize.
[2024-05-22 10:57:33] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 7/270 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 0/526 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/526 variables, and 270 constraints, problems are : Problem set: 0 solved, 284 unsolved in 16022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 285/526 variables, 241/270 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/526 variables, 284/554 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 0/526 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 526/526 variables, and 554 constraints, problems are : Problem set: 0 solved, 284 unsolved in 17193 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 27/27 constraints]
After SMT, in 33317ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 33319ms
Finished structural reductions in LTL mode , in 1 iterations and 33698 ms. Remains : 241/241 places, 285/285 transitions.
Computed a total of 47 stabilizing places and 47 stable transitions
Graph (complete) has 490 edges and 241 vertex of which 240 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Computed a total of 47 stabilizing places and 47 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X p0), (X (OR (AND p1 p2) (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (NOT (AND p1 (NOT p2) p0))), (X p1), (X (X p2)), (X (X p0)), (X (X (OR (AND p1 p2) (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 161 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (80 resets) in 263 ms. (151 steps per ms) remains 1/10 properties
BEST_FIRST walk for 23989 steps (6 resets) in 28 ms. (827 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X p0), (X (OR (AND p1 p2) (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (NOT (AND p1 (NOT p2) p0))), (X p1), (X (X p2)), (X (X p0)), (X (X (OR (AND p1 p2) (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (AND (OR p1 p0) (OR p2 p0)))), (F (NOT p2)), (F (NOT (OR (AND p1 p2) (AND p1 p0)))), (F (NOT p0)), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR p2 p0))), (F (NOT p1))]
Knowledge based reduction with 18 factoid took 386 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 207 reset in 200 ms.
Stack based approach found an accepted trace after 31369 steps with 63 reset with depth 386 and stack size 381 in 62 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-09 finished in 71655 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||G(F(p1))))))'
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 323/323 transitions.
Graph (complete) has 550 edges and 273 vertex of which 271 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 270 transition count 281
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 231 transition count 281
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 79 place count 231 transition count 236
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 169 place count 186 transition count 236
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 174 place count 181 transition count 230
Iterating global reduction 2 with 5 rules applied. Total rules applied 179 place count 181 transition count 230
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 183 place count 177 transition count 226
Iterating global reduction 2 with 4 rules applied. Total rules applied 187 place count 177 transition count 226
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 190 place count 174 transition count 220
Iterating global reduction 2 with 3 rules applied. Total rules applied 193 place count 174 transition count 220
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 196 place count 171 transition count 217
Iterating global reduction 2 with 3 rules applied. Total rules applied 199 place count 171 transition count 217
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 329 place count 106 transition count 152
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 341 place count 94 transition count 128
Iterating global reduction 2 with 12 rules applied. Total rules applied 353 place count 94 transition count 128
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 365 place count 82 transition count 116
Iterating global reduction 2 with 12 rules applied. Total rules applied 377 place count 82 transition count 116
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 389 place count 70 transition count 92
Iterating global reduction 2 with 12 rules applied. Total rules applied 401 place count 70 transition count 92
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 413 place count 58 transition count 80
Iterating global reduction 2 with 12 rules applied. Total rules applied 425 place count 58 transition count 80
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 437 place count 46 transition count 56
Iterating global reduction 2 with 12 rules applied. Total rules applied 449 place count 46 transition count 56
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 461 place count 34 transition count 44
Iterating global reduction 2 with 12 rules applied. Total rules applied 473 place count 34 transition count 44
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 474 place count 34 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 476 place count 32 transition count 42
Applied a total of 476 rules in 36 ms. Remains 32 /273 variables (removed 241) and now considering 42/323 (removed 281) transitions.
[2024-05-22 10:58:00] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
// Phase 1: matrix 37 rows 32 cols
[2024-05-22 10:58:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:58:00] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 10:58:00] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
[2024-05-22 10:58:00] [INFO ] Invariant cache hit.
[2024-05-22 10:58:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 10:58:00] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-22 10:58:00] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2024-05-22 10:58:00] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
[2024-05-22 10:58:00] [INFO ] Invariant cache hit.
[2024-05-22 10:58:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 2/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 37/69 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/69 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 35 constraints, problems are : Problem set: 0 solved, 40 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 32/32 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 2/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 37/69 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 40/75 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/69 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 75 constraints, problems are : Problem set: 0 solved, 40 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 32/32 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 844ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 845ms
Starting structural reductions in SI_LTL mode, iteration 1 : 32/273 places, 42/323 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1015 ms. Remains : 32/273 places, 42/323 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-10
Stuttering criterion allowed to conclude after 274 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-10 finished in 1089 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(F((G(p1)&&X(p2))))))'
Support contains 3 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 323/323 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 264 transition count 314
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 264 transition count 314
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 258 transition count 307
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 258 transition count 307
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 253 transition count 299
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 253 transition count 299
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 248 transition count 293
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 248 transition count 293
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 244 transition count 289
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 244 transition count 289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 243 transition count 288
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 243 transition count 288
Applied a total of 60 rules in 16 ms. Remains 243 /273 variables (removed 30) and now considering 288/323 (removed 35) transitions.
// Phase 1: matrix 288 rows 243 cols
[2024-05-22 10:58:01] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 10:58:01] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-22 10:58:01] [INFO ] Invariant cache hit.
[2024-05-22 10:58:01] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2024-05-22 10:58:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (OVERLAPS) 288/531 variables, 243/245 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-05-22 10:58:07] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
[2024-05-22 10:58:07] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-22 10:58:07] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2024-05-22 10:58:07] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2024-05-22 10:58:07] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2024-05-22 10:58:07] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2024-05-22 10:58:07] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-05-22 10:58:07] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-05-22 10:58:07] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2024-05-22 10:58:08] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-22 10:58:08] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-05-22 10:58:08] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-22 10:58:08] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 1 ms to minimize.
[2024-05-22 10:58:08] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 2 ms to minimize.
[2024-05-22 10:58:08] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-05-22 10:58:08] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-05-22 10:58:08] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-22 10:58:08] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-22 10:58:08] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2024-05-22 10:58:08] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-05-22 10:58:09] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-05-22 10:58:09] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-22 10:58:09] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-22 10:58:09] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-05-22 10:58:09] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 5/270 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 270 constraints, problems are : Problem set: 0 solved, 287 unsolved in 15655 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (OVERLAPS) 288/531 variables, 243/270 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 287/557 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (OVERLAPS) 0/531 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 557 constraints, problems are : Problem set: 0 solved, 287 unsolved in 18695 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 25/25 constraints]
After SMT, in 34479ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 34483ms
Starting structural reductions in LTL mode, iteration 1 : 243/273 places, 288/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34743 ms. Remains : 243/273 places, 288/323 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-11
Product exploration explored 100000 steps with 486 reset in 224 ms.
Stack based approach found an accepted trace after 452 steps with 3 reset with depth 87 and stack size 87 in 2 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-11 finished in 35164 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)) U p2))'
Support contains 4 out of 273 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 273/273 places, 323/323 transitions.
Graph (complete) has 550 edges and 273 vertex of which 271 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 270 transition count 283
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 233 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 232 transition count 282
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 77 place count 232 transition count 236
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 169 place count 186 transition count 236
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 176 place count 179 transition count 228
Iterating global reduction 3 with 7 rules applied. Total rules applied 183 place count 179 transition count 228
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 189 place count 173 transition count 221
Iterating global reduction 3 with 6 rules applied. Total rules applied 195 place count 173 transition count 221
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 200 place count 168 transition count 212
Iterating global reduction 3 with 5 rules applied. Total rules applied 205 place count 168 transition count 212
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 209 place count 164 transition count 208
Iterating global reduction 3 with 4 rules applied. Total rules applied 213 place count 164 transition count 208
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 337 place count 102 transition count 146
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 349 place count 90 transition count 122
Iterating global reduction 3 with 12 rules applied. Total rules applied 361 place count 90 transition count 122
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 373 place count 78 transition count 110
Iterating global reduction 3 with 12 rules applied. Total rules applied 385 place count 78 transition count 110
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 397 place count 66 transition count 86
Iterating global reduction 3 with 12 rules applied. Total rules applied 409 place count 66 transition count 86
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 421 place count 54 transition count 74
Iterating global reduction 3 with 12 rules applied. Total rules applied 433 place count 54 transition count 74
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 444 place count 43 transition count 52
Iterating global reduction 3 with 11 rules applied. Total rules applied 455 place count 43 transition count 52
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 466 place count 32 transition count 41
Iterating global reduction 3 with 11 rules applied. Total rules applied 477 place count 32 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 478 place count 32 transition count 40
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 479 place count 32 transition count 40
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 481 place count 30 transition count 38
Reduce places removed 1 places and 0 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 3 with 2 rules applied. Total rules applied 483 place count 29 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 484 place count 28 transition count 37
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 484 place count 28 transition count 33
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 492 place count 24 transition count 33
Applied a total of 492 rules in 33 ms. Remains 24 /273 variables (removed 249) and now considering 33/323 (removed 290) transitions.
[2024-05-22 10:58:36] [INFO ] Flow matrix only has 30 transitions (discarded 3 similar events)
// Phase 1: matrix 30 rows 24 cols
[2024-05-22 10:58:36] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 10:58:36] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 10:58:36] [INFO ] Flow matrix only has 30 transitions (discarded 3 similar events)
[2024-05-22 10:58:36] [INFO ] Invariant cache hit.
[2024-05-22 10:58:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 10:58:36] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-22 10:58:36] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-05-22 10:58:36] [INFO ] Flow matrix only has 30 transitions (discarded 3 similar events)
[2024-05-22 10:58:36] [INFO ] Invariant cache hit.
[2024-05-22 10:58:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 30/54 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 0/54 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 26 constraints, problems are : Problem set: 0 solved, 32 unsolved in 493 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 30/54 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 32/58 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 0/54 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 58 constraints, problems are : Problem set: 0 solved, 32 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
After SMT, in 836ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 836ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/273 places, 33/323 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 974 ms. Remains : 24/273 places, 33/323 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-12
Stuttering criterion allowed to conclude after 158 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-12 finished in 1110 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(G(p0))||G((p1 U X(X(p0)))))))'
Support contains 3 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 323/323 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 265 transition count 314
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 265 transition count 314
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 259 transition count 307
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 259 transition count 307
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 253 transition count 298
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 253 transition count 298
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 248 transition count 292
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 248 transition count 292
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 244 transition count 288
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 244 transition count 288
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 243 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 243 transition count 287
Applied a total of 60 rules in 15 ms. Remains 243 /273 variables (removed 30) and now considering 287/323 (removed 36) transitions.
// Phase 1: matrix 287 rows 243 cols
[2024-05-22 10:58:37] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:58:38] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-22 10:58:38] [INFO ] Invariant cache hit.
[2024-05-22 10:58:38] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
Running 286 sub problems to find dead transitions.
[2024-05-22 10:58:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (OVERLAPS) 287/530 variables, 243/245 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-22 10:58:43] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
[2024-05-22 10:58:43] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-22 10:58:43] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2024-05-22 10:58:43] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-05-22 10:58:43] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-05-22 10:58:43] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-05-22 10:58:44] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 2 ms to minimize.
[2024-05-22 10:58:44] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-22 10:58:44] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-22 10:58:44] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-22 10:58:44] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2024-05-22 10:58:44] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-05-22 10:58:44] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-05-22 10:58:44] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2024-05-22 10:58:44] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
[2024-05-22 10:58:44] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-05-22 10:58:45] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 1 ms to minimize.
[2024-05-22 10:58:45] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-22 10:58:45] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-05-22 10:58:45] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 286 unsolved
[2024-05-22 10:58:45] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
[2024-05-22 10:58:45] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-22 10:58:45] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-22 10:58:45] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-22 10:58:45] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-05-22 10:58:45] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2024-05-22 10:58:45] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-05-22 10:58:46] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2024-05-22 10:58:46] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 9/274 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 0/530 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/530 variables, and 274 constraints, problems are : Problem set: 0 solved, 286 unsolved in 16275 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 286 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 4 (OVERLAPS) 287/530 variables, 243/274 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 286/560 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 286 unsolved
At refinement iteration 7 (OVERLAPS) 0/530 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 286 unsolved
No progress, stopping.
After SMT solving in domain Int declared 530/530 variables, and 560 constraints, problems are : Problem set: 0 solved, 286 unsolved in 19378 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 286/286 constraints, Known Traps: 29/29 constraints]
After SMT, in 35783ms problems are : Problem set: 0 solved, 286 unsolved
Search for dead transitions found 0 dead transitions in 35790ms
Starting structural reductions in LTL mode, iteration 1 : 243/273 places, 287/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36191 ms. Remains : 243/273 places, 287/323 transitions.
Stuttering acceptance computed with spot in 276 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-13
Stuttering criterion allowed to conclude after 440 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-13 finished in 36490 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(p1)&&p0)))'
Support contains 3 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 323/323 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 263 transition count 312
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 263 transition count 312
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 256 transition count 304
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 256 transition count 304
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 250 transition count 295
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 250 transition count 295
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 245 transition count 289
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 245 transition count 289
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 241 transition count 285
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 241 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 240 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 240 transition count 284
Applied a total of 66 rules in 16 ms. Remains 240 /273 variables (removed 33) and now considering 284/323 (removed 39) transitions.
// Phase 1: matrix 284 rows 240 cols
[2024-05-22 10:59:14] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:59:14] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-22 10:59:14] [INFO ] Invariant cache hit.
[2024-05-22 10:59:14] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-05-22 10:59:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 284/524 variables, 240/242 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-22 10:59:19] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-05-22 10:59:19] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 2 ms to minimize.
[2024-05-22 10:59:19] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-05-22 10:59:20] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
[2024-05-22 10:59:20] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 2 ms to minimize.
[2024-05-22 10:59:20] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-22 10:59:20] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-05-22 10:59:20] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-22 10:59:20] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-05-22 10:59:20] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-05-22 10:59:20] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-05-22 10:59:20] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-05-22 10:59:20] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-22 10:59:20] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-05-22 10:59:21] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-05-22 10:59:21] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-22 10:59:21] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-05-22 10:59:21] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-05-22 10:59:21] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-22 10:59:21] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-22 10:59:21] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-05-22 10:59:21] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
[2024-05-22 10:59:21] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2024-05-22 10:59:21] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 0/524 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 524/524 variables, and 266 constraints, problems are : Problem set: 0 solved, 283 unsolved in 14979 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 284/524 variables, 240/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 283/549 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 0/524 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 524/524 variables, and 549 constraints, problems are : Problem set: 0 solved, 283 unsolved in 16839 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 24/24 constraints]
After SMT, in 31966ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 31969ms
Starting structural reductions in LTL mode, iteration 1 : 240/273 places, 284/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32231 ms. Remains : 240/273 places, 284/323 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-14 finished in 32432 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)))'
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 323/323 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 263 transition count 312
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 263 transition count 312
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 256 transition count 304
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 256 transition count 304
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 250 transition count 295
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 250 transition count 295
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 245 transition count 289
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 245 transition count 289
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 241 transition count 285
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 241 transition count 285
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 240 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 240 transition count 284
Applied a total of 66 rules in 15 ms. Remains 240 /273 variables (removed 33) and now considering 284/323 (removed 39) transitions.
[2024-05-22 10:59:46] [INFO ] Invariant cache hit.
[2024-05-22 10:59:46] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-22 10:59:46] [INFO ] Invariant cache hit.
[2024-05-22 10:59:47] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-05-22 10:59:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 284/524 variables, 240/242 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-22 10:59:52] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2024-05-22 10:59:52] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-22 10:59:52] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2024-05-22 10:59:52] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 13 ms to minimize.
[2024-05-22 10:59:52] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
[2024-05-22 10:59:52] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-22 10:59:52] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 2 ms to minimize.
[2024-05-22 10:59:52] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-05-22 10:59:53] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-05-22 10:59:53] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-22 10:59:53] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2024-05-22 10:59:53] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 2 ms to minimize.
[2024-05-22 10:59:53] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-05-22 10:59:53] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-05-22 10:59:53] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-22 10:59:53] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-05-22 10:59:53] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-05-22 10:59:53] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-05-22 10:59:53] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-05-22 10:59:54] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-22 10:59:54] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-22 10:59:54] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-05-22 10:59:54] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-05-22 10:59:54] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 0/524 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 524/524 variables, and 266 constraints, problems are : Problem set: 0 solved, 283 unsolved in 15094 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 284/524 variables, 240/266 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 283/549 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (OVERLAPS) 0/524 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 524/524 variables, and 549 constraints, problems are : Problem set: 0 solved, 283 unsolved in 16550 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 24/24 constraints]
After SMT, in 31738ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 31746ms
Starting structural reductions in LTL mode, iteration 1 : 240/273 places, 284/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32195 ms. Remains : 240/273 places, 284/323 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15b-LTLFireability-15
Stuttering criterion allowed to conclude after 667 steps with 1 reset in 2 ms.
FORMULA DiscoveryGPU-PT-15b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15b-LTLFireability-15 finished in 32286 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(X((X((p1 U (p2||G(p1))))&&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' '!(G(F(p0)))'
[2024-05-22 11:00:19] [INFO ] Flatten gal took : 56 ms
[2024-05-22 11:00:19] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-22 11:00:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 273 places, 323 transitions and 872 arcs took 10 ms.
Total runtime 536292 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DiscoveryGPU-PT-15b
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 273
TRANSITIONS: 323
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.005s, Sys 0.000s]
SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]
----------------------------------------------------------------------
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: 2814
MODEL NAME: /home/mcc/execution/410/model
273 places, 323 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 DiscoveryGPU-PT-15b-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-15b-LTLFireability-01 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716377536304
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="DiscoveryGPU-PT-15b"
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 DiscoveryGPU-PT-15b, 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 r135-tall-171631131300516"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-15b.tgz
mv DiscoveryGPU-PT-15b 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 '
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 ;