About the Execution of LTSMin+red for DiscoveryGPU-PT-12b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
456.831 | 82493.00 | 110989.00 | 365.60 | FFFFFFFFFTFFFTFT | 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.r488-tall-171631132700467.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 ltsminxred
Input is DiscoveryGPU-PT-12b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132700467
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K 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.6K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 01:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 01:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 01:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 01:34 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 89K 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-12b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717192990148
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-12b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:03:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:03:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:03:11] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-05-31 22:03:11] [INFO ] Transformed 352 places.
[2024-05-31 22:03:11] [INFO ] Transformed 374 transitions.
[2024-05-31 22:03:11] [INFO ] Found NUPN structural information;
[2024-05-31 22:03:11] [INFO ] Parsed PT model containing 352 places and 374 transitions and 977 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 374/374 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 329 transition count 374
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 78 place count 274 transition count 319
Iterating global reduction 1 with 55 rules applied. Total rules applied 133 place count 274 transition count 319
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 145 place count 262 transition count 307
Iterating global reduction 1 with 12 rules applied. Total rules applied 157 place count 262 transition count 307
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 166 place count 253 transition count 298
Iterating global reduction 1 with 9 rules applied. Total rules applied 175 place count 253 transition count 298
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 183 place count 245 transition count 290
Iterating global reduction 1 with 8 rules applied. Total rules applied 191 place count 245 transition count 290
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 199 place count 237 transition count 274
Iterating global reduction 1 with 8 rules applied. Total rules applied 207 place count 237 transition count 274
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 215 place count 229 transition count 266
Iterating global reduction 1 with 8 rules applied. Total rules applied 223 place count 229 transition count 266
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 231 place count 221 transition count 258
Iterating global reduction 1 with 8 rules applied. Total rules applied 239 place count 221 transition count 258
Applied a total of 239 rules in 109 ms. Remains 221 /352 variables (removed 131) and now considering 258/374 (removed 116) transitions.
// Phase 1: matrix 258 rows 221 cols
[2024-05-31 22:03:11] [INFO ] Computed 2 invariants in 20 ms
[2024-05-31 22:03:11] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-31 22:03:11] [INFO ] Invariant cache hit.
[2024-05-31 22:03:12] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-05-31 22:03:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/478 variables, 220/222 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-31 22:03:16] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 18 ms to minimize.
[2024-05-31 22:03:16] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:03:17] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 3 ms to minimize.
[2024-05-31 22:03:17] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 2 ms to minimize.
[2024-05-31 22:03:17] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:03:17] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 3 ms to minimize.
[2024-05-31 22:03:17] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 5 ms to minimize.
[2024-05-31 22:03:17] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:03:17] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:03:17] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:03:17] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:03:17] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:03:17] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:03:18] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2024-05-31 22:03:18] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
[2024-05-31 22:03:18] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:03:18] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:03:18] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:03:18] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:03:18] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-31 22:03:18] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:03:18] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2024-05-31 22:03:18] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 3/245 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 1/479 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (OVERLAPS) 0/479 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 479/479 variables, and 246 constraints, problems are : Problem set: 0 solved, 257 unsolved in 15977 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/478 variables, 220/245 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 256/501 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 1/479 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 10 (OVERLAPS) 0/479 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 479/479 variables, and 503 constraints, problems are : Problem set: 0 solved, 257 unsolved in 20438 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 23/23 constraints]
After SMT, in 36575ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 36599ms
Starting structural reductions in LTL mode, iteration 1 : 221/352 places, 258/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37166 ms. Remains : 221/352 places, 258/374 transitions.
Support contains 18 out of 221 places after structural reductions.
[2024-05-31 22:03:49] [INFO ] Flatten gal took : 51 ms
[2024-05-31 22:03:49] [INFO ] Flatten gal took : 17 ms
[2024-05-31 22:03:49] [INFO ] Input system was already deterministic with 258 transitions.
RANDOM walk for 28465 steps (73 resets) in 538 ms. (52 steps per ms) remains 0/10 properties
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 40 stabilizing places and 40 stable transitions
Graph (complete) has 437 edges and 221 vertex of which 217 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 258/258 transitions.
Graph (complete) has 437 edges and 221 vertex of which 219 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 218 transition count 224
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 187 transition count 224
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 63 place count 187 transition count 188
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 135 place count 151 transition count 188
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 138 place count 148 transition count 185
Iterating global reduction 2 with 3 rules applied. Total rules applied 141 place count 148 transition count 185
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 143 place count 146 transition count 183
Iterating global reduction 2 with 2 rules applied. Total rules applied 145 place count 146 transition count 183
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 147 place count 144 transition count 179
Iterating global reduction 2 with 2 rules applied. Total rules applied 149 place count 144 transition count 179
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 151 place count 142 transition count 177
Iterating global reduction 2 with 2 rules applied. Total rules applied 153 place count 142 transition count 177
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 261 place count 88 transition count 123
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 271 place count 78 transition count 104
Iterating global reduction 2 with 10 rules applied. Total rules applied 281 place count 78 transition count 104
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 291 place count 68 transition count 93
Iterating global reduction 2 with 10 rules applied. Total rules applied 301 place count 68 transition count 93
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 309 place count 60 transition count 77
Iterating global reduction 2 with 8 rules applied. Total rules applied 317 place count 60 transition count 77
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 325 place count 52 transition count 69
Iterating global reduction 2 with 8 rules applied. Total rules applied 333 place count 52 transition count 69
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 340 place count 45 transition count 55
Iterating global reduction 2 with 7 rules applied. Total rules applied 347 place count 45 transition count 55
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 354 place count 38 transition count 48
Iterating global reduction 2 with 7 rules applied. Total rules applied 361 place count 38 transition count 48
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 362 place count 37 transition count 46
Iterating global reduction 2 with 1 rules applied. Total rules applied 363 place count 37 transition count 46
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 364 place count 36 transition count 45
Iterating global reduction 2 with 1 rules applied. Total rules applied 365 place count 36 transition count 45
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 366 place count 36 transition count 44
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 368 place count 36 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 370 place count 34 transition count 42
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 38 edges and 32 vertex of which 29 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 377 place count 29 transition count 35
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 381 place count 25 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 381 place count 25 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 383 place count 24 transition count 34
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 391 place count 20 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 395 place count 18 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 398 place count 18 transition count 28
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 402 place count 14 transition count 24
Applied a total of 402 rules in 132 ms. Remains 14 /221 variables (removed 207) and now considering 24/258 (removed 234) transitions.
[2024-05-31 22:03:49] [INFO ] Flow matrix only has 20 transitions (discarded 4 similar events)
// Phase 1: matrix 20 rows 14 cols
[2024-05-31 22:03:49] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 22:03:49] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-31 22:03:49] [INFO ] Flow matrix only has 20 transitions (discarded 4 similar events)
[2024-05-31 22:03:49] [INFO ] Invariant cache hit.
[2024-05-31 22:03:49] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-31 22:03:49] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-31 22:03:49] [INFO ] Flow matrix only has 20 transitions (discarded 4 similar events)
[2024-05-31 22:03:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 17/25 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 8/33 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 0/33 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/34 variables, and 14 constraints, problems are : Problem set: 0 solved, 11 unsolved in 65 ms.
Refiners :[State Equation: 14/14 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 17/25 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 8/33 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/33 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/34 variables, and 25 constraints, problems are : Problem set: 0 solved, 11 unsolved in 65 ms.
Refiners :[State Equation: 14/14 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 136ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 136ms
Starting structural reductions in SI_LTL mode, iteration 1 : 14/221 places, 24/258 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 327 ms. Remains : 14/221 places, 24/258 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLCardinality-00
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLCardinality-00 finished in 552 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(G(p0))&&F((p1 U (G(p1)||(p1&&G(!p2))))))))'
Support contains 7 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 258/258 transitions.
Graph (complete) has 437 edges and 221 vertex of which 217 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 216 transition count 224
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 186 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 185 transition count 223
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 63 place count 185 transition count 189
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 131 place count 151 transition count 189
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 133 place count 149 transition count 187
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 149 transition count 187
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 136 place count 148 transition count 186
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 148 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 138 place count 147 transition count 185
Iterating global reduction 3 with 1 rules applied. Total rules applied 139 place count 147 transition count 185
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 249 place count 92 transition count 130
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 255 place count 86 transition count 119
Iterating global reduction 3 with 6 rules applied. Total rules applied 261 place count 86 transition count 119
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 267 place count 80 transition count 112
Iterating global reduction 3 with 6 rules applied. Total rules applied 273 place count 80 transition count 112
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 279 place count 74 transition count 100
Iterating global reduction 3 with 6 rules applied. Total rules applied 285 place count 74 transition count 100
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 291 place count 68 transition count 94
Iterating global reduction 3 with 6 rules applied. Total rules applied 297 place count 68 transition count 94
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 303 place count 62 transition count 82
Iterating global reduction 3 with 6 rules applied. Total rules applied 309 place count 62 transition count 82
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 315 place count 56 transition count 76
Iterating global reduction 3 with 6 rules applied. Total rules applied 321 place count 56 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 322 place count 55 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 323 place count 55 transition count 74
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 324 place count 54 transition count 73
Iterating global reduction 3 with 1 rules applied. Total rules applied 325 place count 54 transition count 73
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 326 place count 54 transition count 72
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 328 place count 54 transition count 72
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 330 place count 52 transition count 70
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 63 edges and 50 vertex of which 47 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 12 rules applied. Total rules applied 342 place count 47 transition count 58
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 11 rules applied. Total rules applied 353 place count 38 transition count 56
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 355 place count 36 transition count 56
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 369 place count 29 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 371 place count 28 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 372 place count 28 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 375 place count 28 transition count 45
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 381 place count 22 transition count 39
Applied a total of 381 rules in 59 ms. Remains 22 /221 variables (removed 199) and now considering 39/258 (removed 219) transitions.
[2024-05-31 22:03:50] [INFO ] Flow matrix only has 32 transitions (discarded 7 similar events)
// Phase 1: matrix 32 rows 22 cols
[2024-05-31 22:03:50] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 22:03:50] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-31 22:03:50] [INFO ] Flow matrix only has 32 transitions (discarded 7 similar events)
[2024-05-31 22:03:50] [INFO ] Invariant cache hit.
[2024-05-31 22:03:50] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-31 22:03:50] [INFO ] Redundant transitions in 1 ms returned []
Running 25 sub problems to find dead transitions.
[2024-05-31 22:03:50] [INFO ] Flow matrix only has 32 transitions (discarded 7 similar events)
[2024-05-31 22:03:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 28/44 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 9/53 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 0/53 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/54 variables, and 22 constraints, problems are : Problem set: 0 solved, 25 unsolved in 147 ms.
Refiners :[State Equation: 22/22 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 28/44 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 9/53 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/54 variables, and 47 constraints, problems are : Problem set: 0 solved, 25 unsolved in 135 ms.
Refiners :[State Equation: 22/22 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 286ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 288ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/221 places, 39/258 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 400 ms. Remains : 22/221 places, 39/258 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p2 (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLCardinality-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLCardinality-03 finished in 624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 258/258 transitions.
Graph (complete) has 437 edges and 221 vertex of which 217 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 216 transition count 221
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 183 transition count 221
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 67 place count 183 transition count 186
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 137 place count 148 transition count 186
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 139 place count 146 transition count 184
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 146 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 142 place count 145 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 143 place count 145 transition count 183
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 144 place count 144 transition count 181
Iterating global reduction 2 with 1 rules applied. Total rules applied 145 place count 144 transition count 181
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 146 place count 143 transition count 180
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 143 transition count 180
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 261 place count 86 transition count 123
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 271 place count 76 transition count 104
Iterating global reduction 2 with 10 rules applied. Total rules applied 281 place count 76 transition count 104
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 291 place count 66 transition count 93
Iterating global reduction 2 with 10 rules applied. Total rules applied 301 place count 66 transition count 93
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 311 place count 56 transition count 73
Iterating global reduction 2 with 10 rules applied. Total rules applied 321 place count 56 transition count 73
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 331 place count 46 transition count 63
Iterating global reduction 2 with 10 rules applied. Total rules applied 341 place count 46 transition count 63
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 351 place count 36 transition count 43
Iterating global reduction 2 with 10 rules applied. Total rules applied 361 place count 36 transition count 43
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 371 place count 26 transition count 33
Iterating global reduction 2 with 10 rules applied. Total rules applied 381 place count 26 transition count 33
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 382 place count 25 transition count 31
Iterating global reduction 2 with 1 rules applied. Total rules applied 383 place count 25 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 384 place count 24 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 385 place count 24 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 387 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 389 place count 22 transition count 26
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 22 edges and 20 vertex of which 17 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 9 rules applied. Total rules applied 398 place count 17 transition count 17
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 404 place count 11 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 408 place count 9 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 409 place count 9 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 410 place count 8 transition count 13
Applied a total of 410 rules in 41 ms. Remains 8 /221 variables (removed 213) and now considering 13/258 (removed 245) transitions.
[2024-05-31 22:03:50] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 8 cols
[2024-05-31 22:03:50] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 22:03:50] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-31 22:03:50] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2024-05-31 22:03:50] [INFO ] Invariant cache hit.
[2024-05-31 22:03:50] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2024-05-31 22:03:50] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-31 22:03:50] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2024-05-31 22:03:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 2/17 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/18 variables, and 8 constraints, problems are : Problem set: 0 solved, 10 unsolved in 78 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 2/17 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/17 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/18 variables, and 18 constraints, problems are : Problem set: 0 solved, 10 unsolved in 54 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 137ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 138ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/221 places, 13/258 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 219 ms. Remains : 8/221 places, 13/258 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLCardinality-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLCardinality-04 finished in 287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 221/221 places, 258/258 transitions.
Graph (complete) has 437 edges and 221 vertex of which 218 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 217 transition count 222
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 184 transition count 222
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 67 place count 184 transition count 186
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 139 place count 148 transition count 186
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 142 place count 145 transition count 183
Iterating global reduction 2 with 3 rules applied. Total rules applied 145 place count 145 transition count 183
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 147 place count 143 transition count 181
Iterating global reduction 2 with 2 rules applied. Total rules applied 149 place count 143 transition count 181
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 151 place count 141 transition count 177
Iterating global reduction 2 with 2 rules applied. Total rules applied 153 place count 141 transition count 177
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 155 place count 139 transition count 175
Iterating global reduction 2 with 2 rules applied. Total rules applied 157 place count 139 transition count 175
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 269 place count 83 transition count 119
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 280 place count 72 transition count 98
Iterating global reduction 2 with 11 rules applied. Total rules applied 291 place count 72 transition count 98
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 302 place count 61 transition count 86
Iterating global reduction 2 with 11 rules applied. Total rules applied 313 place count 61 transition count 86
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 323 place count 51 transition count 66
Iterating global reduction 2 with 10 rules applied. Total rules applied 333 place count 51 transition count 66
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 343 place count 41 transition count 56
Iterating global reduction 2 with 10 rules applied. Total rules applied 353 place count 41 transition count 56
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 363 place count 31 transition count 36
Iterating global reduction 2 with 10 rules applied. Total rules applied 373 place count 31 transition count 36
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 383 place count 21 transition count 26
Iterating global reduction 2 with 10 rules applied. Total rules applied 393 place count 21 transition count 26
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 394 place count 20 transition count 24
Iterating global reduction 2 with 1 rules applied. Total rules applied 395 place count 20 transition count 24
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 396 place count 19 transition count 23
Iterating global reduction 2 with 1 rules applied. Total rules applied 397 place count 19 transition count 23
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 398 place count 19 transition count 22
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 399 place count 19 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 401 place count 17 transition count 20
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 17 edges and 15 vertex of which 12 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 406 place count 12 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 408 place count 10 transition count 15
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 414 place count 7 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 415 place count 7 transition count 11
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 417 place count 5 transition count 9
Applied a total of 417 rules in 32 ms. Remains 5 /221 variables (removed 216) and now considering 9/258 (removed 249) transitions.
[2024-05-31 22:03:51] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2024-05-31 22:03:51] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 22:03:51] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-05-31 22:03:51] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
[2024-05-31 22:03:51] [INFO ] Invariant cache hit.
[2024-05-31 22:03:51] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
[2024-05-31 22:03:51] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-31 22:03:51] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
[2024-05-31 22:03:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/11 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/12 variables, and 5 constraints, problems are : Problem set: 0 solved, 4 unsolved in 35 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/11 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/11 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/12 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 27 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 63ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/221 places, 9/258 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 127 ms. Remains : 5/221 places, 9/258 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLCardinality-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLCardinality-06 finished in 214 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))||G(p1)))'
Support contains 2 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 258/258 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 258
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 210 transition count 248
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 210 transition count 248
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 208 transition count 246
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 208 transition count 246
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 206 transition count 243
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 206 transition count 243
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 204 transition count 240
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 204 transition count 240
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 202 transition count 238
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 202 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 201 transition count 237
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 201 transition count 237
Applied a total of 39 rules in 20 ms. Remains 201 /221 variables (removed 20) and now considering 237/258 (removed 21) transitions.
// Phase 1: matrix 237 rows 201 cols
[2024-05-31 22:03:51] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 22:03:51] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-31 22:03:51] [INFO ] Invariant cache hit.
[2024-05-31 22:03:51] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2024-05-31 22:03:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 237/438 variables, 201/203 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-31 22:03:55] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:03:55] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:03:55] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:03:55] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:03:55] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:03:55] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:03:55] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:03:55] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:03:55] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
[2024-05-31 22:03:55] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:03:55] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2024-05-31 22:03:55] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 5 ms to minimize.
[2024-05-31 22:03:55] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:03:55] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:03:55] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 2 ms to minimize.
[2024-05-31 22:03:55] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 2 ms to minimize.
[2024-05-31 22:03:56] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
[2024-05-31 22:03:56] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:03:56] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:03:56] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (OVERLAPS) 0/438 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 223 constraints, problems are : Problem set: 0 solved, 236 unsolved in 8834 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (OVERLAPS) 237/438 variables, 201/223 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 236/459 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 0/438 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 459 constraints, problems are : Problem set: 0 solved, 236 unsolved in 10467 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 20/20 constraints]
After SMT, in 19388ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 19390ms
Starting structural reductions in LTL mode, iteration 1 : 201/221 places, 237/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19603 ms. Remains : 201/221 places, 237/258 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLCardinality-12
Stuttering criterion allowed to conclude after 372 steps with 0 reset in 5 ms.
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLCardinality-12 finished in 19747 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(F(p0))))'
Support contains 2 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 258/258 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 258
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 211 transition count 249
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 211 transition count 249
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 208 transition count 246
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 208 transition count 246
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 205 transition count 242
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 205 transition count 242
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 202 transition count 237
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 202 transition count 237
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 199 transition count 234
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 199 transition count 234
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 197 transition count 232
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 197 transition count 232
Applied a total of 47 rules in 10 ms. Remains 197 /221 variables (removed 24) and now considering 232/258 (removed 26) transitions.
// Phase 1: matrix 232 rows 197 cols
[2024-05-31 22:04:10] [INFO ] Computed 2 invariants in 8 ms
[2024-05-31 22:04:11] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-31 22:04:11] [INFO ] Invariant cache hit.
[2024-05-31 22:04:11] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-05-31 22:04:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (OVERLAPS) 232/429 variables, 197/199 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-31 22:04:14] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:04:14] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:04:14] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:04:15] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:04:15] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:04:15] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-31 22:04:15] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:04:15] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
[2024-05-31 22:04:15] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:04:15] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:04:15] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:04:15] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:04:15] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 3 ms to minimize.
[2024-05-31 22:04:15] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:04:15] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 2 ms to minimize.
[2024-05-31 22:04:15] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:04:15] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:04:15] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:04:15] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:04:15] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-31 22:04:16] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:04:16] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:04:16] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:04:16] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:04:16] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 5/224 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 0/429 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 224 constraints, problems are : Problem set: 0 solved, 231 unsolved in 10386 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 232/429 variables, 197/224 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 231/455 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 0/429 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 455 constraints, problems are : Problem set: 0 solved, 231 unsolved in 10453 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 25/25 constraints]
After SMT, in 20927ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 20929ms
Starting structural reductions in LTL mode, iteration 1 : 197/221 places, 232/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21164 ms. Remains : 197/221 places, 232/258 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLCardinality-15
Product exploration explored 100000 steps with 33333 reset in 181 ms.
Product exploration explored 100000 steps with 33333 reset in 128 ms.
Computed a total of 38 stabilizing places and 38 stable transitions
Graph (complete) has 398 edges and 197 vertex of which 196 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 38 stabilizing places and 38 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-12b-LTLCardinality-15 finished in 21614 ms.
All properties solved by simple procedures.
Total runtime 81304 ms.
ITS solved all properties within timeout
BK_STOP 1717193072641
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
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-12b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DiscoveryGPU-PT-12b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r488-tall-171631132700467"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-12b.tgz
mv DiscoveryGPU-PT-12b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;