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-171631132800483.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-13b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132800483
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K 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.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 02:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 12 02:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 12 02:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 12 02:03 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 97K 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-13b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-13b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717193128184

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-13b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:05:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:05:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:05:29] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-05-31 22:05:29] [INFO ] Transformed 380 places.
[2024-05-31 22:05:29] [INFO ] Transformed 404 transitions.
[2024-05-31 22:05:29] [INFO ] Found NUPN structural information;
[2024-05-31 22:05:29] [INFO ] Parsed PT model containing 380 places and 404 transitions and 1056 arcs in 204 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 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 404/404 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 355 transition count 404
Discarding 64 places :
Symmetric choice reduction at 1 with 64 rule applications. Total rules 89 place count 291 transition count 340
Iterating global reduction 1 with 64 rules applied. Total rules applied 153 place count 291 transition count 340
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 166 place count 278 transition count 327
Iterating global reduction 1 with 13 rules applied. Total rules applied 179 place count 278 transition count 327
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 189 place count 268 transition count 317
Iterating global reduction 1 with 10 rules applied. Total rules applied 199 place count 268 transition count 317
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 207 place count 260 transition count 309
Iterating global reduction 1 with 8 rules applied. Total rules applied 215 place count 260 transition count 309
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 223 place count 252 transition count 293
Iterating global reduction 1 with 8 rules applied. Total rules applied 231 place count 252 transition count 293
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 239 place count 244 transition count 285
Iterating global reduction 1 with 8 rules applied. Total rules applied 247 place count 244 transition count 285
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 253 place count 238 transition count 279
Iterating global reduction 1 with 6 rules applied. Total rules applied 259 place count 238 transition count 279
Applied a total of 259 rules in 111 ms. Remains 238 /380 variables (removed 142) and now considering 279/404 (removed 125) transitions.
// Phase 1: matrix 279 rows 238 cols
[2024-05-31 22:05:29] [INFO ] Computed 2 invariants in 19 ms
[2024-05-31 22:05:30] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-31 22:05:30] [INFO ] Invariant cache hit.
[2024-05-31 22:05:30] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2024-05-31 22:05:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 279/516 variables, 237/239 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-05-31 22:05:35] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 19 ms to minimize.
[2024-05-31 22:05:36] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:05:36] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
[2024-05-31 22:05:36] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:05:36] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:05:36] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-05-31 22:05:36] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:05:36] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 2 ms to minimize.
[2024-05-31 22:05:36] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:05:36] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:05:36] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:05:36] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:05:36] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:05:37] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:05:37] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:05:37] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:05:37] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2024-05-31 22:05:37] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:05:37] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:05:37] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (OVERLAPS) 1/517 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 8 (OVERLAPS) 0/517 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 517/517 variables, and 260 constraints, problems are : Problem set: 0 solved, 278 unsolved in 14729 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (OVERLAPS) 279/516 variables, 237/259 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 277/536 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-05-31 22:05:49] [INFO ] Deduced a trap composed of 151 places in 73 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 1/537 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 8 (OVERLAPS) 1/517 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/517 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/517 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 11 (OVERLAPS) 0/517 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Int declared 517/517 variables, and 539 constraints, problems are : Problem set: 0 solved, 278 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 21/21 constraints]
After SMT, in 44967ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 44983ms
Starting structural reductions in LTL mode, iteration 1 : 238/380 places, 279/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45593 ms. Remains : 238/380 places, 279/404 transitions.
Support contains 27 out of 238 places after structural reductions.
[2024-05-31 22:06:15] [INFO ] Flatten gal took : 94 ms
[2024-05-31 22:06:15] [INFO ] Flatten gal took : 30 ms
[2024-05-31 22:06:15] [INFO ] Input system was already deterministic with 279 transitions.
RANDOM walk for 37325 steps (87 resets) in 915 ms. (40 steps per ms) remains 0/16 properties
Computed a total of 42 stabilizing places and 42 stable transitions
Graph (complete) has 473 edges and 238 vertex of which 234 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 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((X(p0)&&(p1 U (p2&&F(G(p3)))))))'
Support contains 7 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 279/279 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 237 transition count 279
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 230 transition count 272
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 230 transition count 272
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 227 transition count 267
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 227 transition count 267
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 224 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 224 transition count 264
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 221 transition count 260
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 221 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 220 transition count 259
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 220 transition count 259
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 219 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 219 transition count 258
Applied a total of 37 rules in 47 ms. Remains 219 /238 variables (removed 19) and now considering 258/279 (removed 21) transitions.
// Phase 1: matrix 258 rows 219 cols
[2024-05-31 22:06:16] [INFO ] Computed 2 invariants in 4 ms
[2024-05-31 22:06:17] [INFO ] Implicit Places using invariants in 632 ms returned []
[2024-05-31 22:06:17] [INFO ] Invariant cache hit.
[2024-05-31 22:06:17] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-05-31 22:06:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/219 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/477 variables, 219/221 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-31 22:06:21] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-05-31 22:06:21] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:06:21] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:06:21] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2024-05-31 22:06:22] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-05-31 22:06:22] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:06:22] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:06:22] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:06:22] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 3 ms to minimize.
[2024-05-31 22:06:22] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:06:22] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:06:22] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:06:22] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:06:22] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2024-05-31 22:06:22] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:06:22] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:06:22] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:06:23] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 18/239 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 0/477 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 239 constraints, problems are : Problem set: 0 solved, 257 unsolved in 12150 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/219 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/477 variables, 219/239 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 257/496 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 0/477 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 477/477 variables, and 496 constraints, problems are : Problem set: 0 solved, 257 unsolved in 12597 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 18/18 constraints]
After SMT, in 24849ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 24852ms
Starting structural reductions in LTL mode, iteration 1 : 219/238 places, 258/279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25681 ms. Remains : 219/238 places, 258/279 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p2) (NOT p0) (NOT p3)), (NOT p0), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-01
Product exploration explored 100000 steps with 457 reset in 367 ms.
Stack based approach found an accepted trace after 202 steps with 0 reset with depth 203 and stack size 203 in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-01 finished in 26457 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(X(G((X(p0)&&p1))))||F((X(p2) U p3))))'
Support contains 3 out of 238 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 279/279 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 237 transition count 279
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 227 transition count 269
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 227 transition count 269
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 223 transition count 263
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 223 transition count 263
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 219 transition count 259
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 219 transition count 259
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 215 transition count 253
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 215 transition count 253
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 213 transition count 251
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 213 transition count 251
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 211 transition count 249
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 211 transition count 249
Applied a total of 53 rules in 21 ms. Remains 211 /238 variables (removed 27) and now considering 249/279 (removed 30) transitions.
// Phase 1: matrix 249 rows 211 cols
[2024-05-31 22:06:42] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 22:06:43] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-31 22:06:43] [INFO ] Invariant cache hit.
[2024-05-31 22:06:43] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2024-05-31 22:06:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/211 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (OVERLAPS) 249/460 variables, 211/213 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-31 22:06:47] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:06:47] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:06:47] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-05-31 22:06:47] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:06:47] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:06:47] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:06:47] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:06:47] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:06:47] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:06:47] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 2 ms to minimize.
[2024-05-31 22:06:47] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:06:47] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:06:48] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:06:48] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:06:48] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
[2024-05-31 22:06:48] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:06:48] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:06:48] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 3 ms to minimize.
[2024-05-31 22:06:48] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:06:48] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 20/233 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-31 22:06:48] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:06:48] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 0/460 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 235 constraints, problems are : Problem set: 0 solved, 248 unsolved in 11562 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/211 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 249/460 variables, 211/235 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 248/483 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 0/460 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 483 constraints, problems are : Problem set: 0 solved, 248 unsolved in 12574 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 22/22 constraints]
After SMT, in 24226ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 24230ms
Starting structural reductions in LTL mode, iteration 1 : 211/238 places, 249/279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24525 ms. Remains : 211/238 places, 249/279 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-02
Stuttering criterion allowed to conclude after 672 steps with 1 reset in 6 ms.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-02 finished in 24737 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)))'
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 279/279 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 237 transition count 279
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 227 transition count 269
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 227 transition count 269
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 223 transition count 263
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 223 transition count 263
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 219 transition count 259
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 219 transition count 259
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 216 transition count 255
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 216 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 215 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 215 transition count 254
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 214 transition count 253
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 214 transition count 253
Applied a total of 47 rules in 16 ms. Remains 214 /238 variables (removed 24) and now considering 253/279 (removed 26) transitions.
// Phase 1: matrix 253 rows 214 cols
[2024-05-31 22:07:07] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 22:07:07] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-31 22:07:07] [INFO ] Invariant cache hit.
[2024-05-31 22:07:07] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2024-05-31 22:07:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 253/467 variables, 214/216 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-31 22:07:11] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:07:12] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:07:12] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
[2024-05-31 22:07:12] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:07:12] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:07:12] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:07:12] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 2 ms to minimize.
[2024-05-31 22:07:12] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-05-31 22:07:12] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
[2024-05-31 22:07:12] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:07:12] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:07:12] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:07:12] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:07:12] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:07:12] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:07:12] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:07:13] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:07:13] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:07:13] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:07:13] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 20/236 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-05-31 22:07:13] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:07:13] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:07:13] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:07:13] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 4/240 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 0/467 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 240 constraints, problems are : Problem set: 0 solved, 252 unsolved in 12097 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 253/467 variables, 214/240 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 252/492 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 0/467 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 467/467 variables, and 492 constraints, problems are : Problem set: 0 solved, 252 unsolved in 12417 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 24/24 constraints]
After SMT, in 24601ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 24606ms
Starting structural reductions in LTL mode, iteration 1 : 214/238 places, 253/279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24834 ms. Remains : 214/238 places, 253/279 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-05 finished in 24956 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((X(X(p1))||p0)))'
Support contains 4 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 279/279 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 237 transition count 279
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 228 transition count 270
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 228 transition count 270
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 226 transition count 268
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 226 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 224 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 224 transition count 266
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 222 transition count 262
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 222 transition count 262
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 220 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 220 transition count 260
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 218 transition count 258
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 218 transition count 258
Applied a total of 39 rules in 17 ms. Remains 218 /238 variables (removed 20) and now considering 258/279 (removed 21) transitions.
// Phase 1: matrix 258 rows 218 cols
[2024-05-31 22:07:32] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 22:07:32] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-31 22:07:32] [INFO ] Invariant cache hit.
[2024-05-31 22:07:32] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-05-31 22:07:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/476 variables, 218/220 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-31 22:07:37] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:07:37] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:07:37] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:07:37] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 3 ms to minimize.
[2024-05-31 22:07:37] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:07:37] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:07:37] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:07:37] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:07:37] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:07:37] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:07:37] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:07:37] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2024-05-31 22:07:37] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
[2024-05-31 22:07:37] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 2 ms to minimize.
[2024-05-31 22:07:37] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:07:38] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:07:38] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:07:38] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:07:38] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:07:38] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-31 22:07:38] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 0/476 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 241 constraints, problems are : Problem set: 0 solved, 257 unsolved in 11795 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/476 variables, 218/241 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 257/498 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 0/476 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 476/476 variables, and 498 constraints, problems are : Problem set: 0 solved, 257 unsolved in 12775 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 21/21 constraints]
After SMT, in 24654ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 24659ms
Starting structural reductions in LTL mode, iteration 1 : 218/238 places, 258/279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24879 ms. Remains : 218/238 places, 258/279 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-06
Product exploration explored 100000 steps with 293 reset in 202 ms.
Product exploration explored 100000 steps with 280 reset in 223 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 443 edges and 218 vertex of which 217 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
RANDOM walk for 8789 steps (17 resets) in 75 ms. (115 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 4 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 258/258 transitions.
Applied a total of 0 rules in 4 ms. Remains 218 /218 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-05-31 22:07:58] [INFO ] Invariant cache hit.
[2024-05-31 22:07:58] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-31 22:07:58] [INFO ] Invariant cache hit.
[2024-05-31 22:07:58] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-05-31 22:07:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/476 variables, 218/220 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-31 22:08:03] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:08:03] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 2 ms to minimize.
[2024-05-31 22:08:03] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:08:03] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:08:03] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:08:03] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:08:03] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:08:03] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:08:03] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:08:04] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:08:04] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-05-31 22:08:04] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:08:04] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:08:04] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:08:04] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2024-05-31 22:08:04] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:08:04] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:08:04] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:08:04] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:08:04] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-31 22:08:04] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 0/476 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 241 constraints, problems are : Problem set: 0 solved, 257 unsolved in 12004 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/476 variables, 218/241 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 257/498 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 0/476 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 476/476 variables, and 498 constraints, problems are : Problem set: 0 solved, 257 unsolved in 12512 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 21/21 constraints]
After SMT, in 24619ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 24622ms
Finished structural reductions in LTL mode , in 1 iterations and 24824 ms. Remains : 218/218 places, 258/258 transitions.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 443 edges and 218 vertex of which 217 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
RANDOM walk for 12258 steps (26 resets) in 48 ms. (250 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 293 reset in 175 ms.
Product exploration explored 100000 steps with 296 reset in 183 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 4 out of 218 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 218/218 places, 258/258 transitions.
Graph (complete) has 443 edges and 218 vertex of which 217 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 217 transition count 257
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 40 Pre rules applied. Total rules applied 29 place count 217 transition count 257
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 69 place count 217 transition count 257
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 99 places in 1 ms
Iterating global reduction 1 with 31 rules applied. Total rules applied 100 place count 217 transition count 271
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 102 place count 215 transition count 269
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 104 place count 215 transition count 269
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 123 places in 0 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 130 place count 215 transition count 321
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 139 place count 206 transition count 303
Deduced a syphon composed of 123 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 148 place count 206 transition count 303
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 175 place count 179 transition count 258
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 202 place count 179 transition count 258
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 229 place count 152 transition count 213
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 256 place count 152 transition count 213
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 265 place count 143 transition count 204
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 274 place count 143 transition count 204
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 292 place count 125 transition count 177
Deduced a syphon composed of 78 places in 1 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 310 place count 125 transition count 177
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 346 place count 89 transition count 123
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 382 place count 89 transition count 123
Deduced a syphon composed of 51 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 384 place count 89 transition count 121
Deduced a syphon composed of 51 places in 0 ms
Applied a total of 384 rules in 78 ms. Remains 89 /218 variables (removed 129) and now considering 121/258 (removed 137) transitions.
[2024-05-31 22:08:25] [INFO ] Redundant transitions in 4 ms returned []
Running 120 sub problems to find dead transitions.
[2024-05-31 22:08:25] [INFO ] Flow matrix only has 115 transitions (discarded 6 similar events)
// Phase 1: matrix 115 rows 89 cols
[2024-05-31 22:08:25] [INFO ] Computed 2 invariants in 0 ms
[2024-05-31 22:08:25] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-31 22:08:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-31 22:08:25] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
Problem TDEAD89 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 117 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 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 TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
At refinement iteration 4 (OVERLAPS) 115/204 variables, 89/93 constraints. Problems are: Problem set: 71 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 12/105 constraints. Problems are: Problem set: 71 solved, 49 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/105 constraints. Problems are: Problem set: 71 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/105 constraints. Problems are: Problem set: 71 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 105 constraints, problems are : Problem set: 71 solved, 49 unsolved in 1471 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 71 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 71 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 4/41 variables, 2/2 constraints. Problems are: Problem set: 71 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 2/4 constraints. Problems are: Problem set: 71 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 71 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 111/152 variables, 41/45 constraints. Problems are: Problem set: 71 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 12/57 constraints. Problems are: Problem set: 71 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 49/106 constraints. Problems are: Problem set: 71 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/106 constraints. Problems are: Problem set: 71 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 52/204 variables, 48/154 constraints. Problems are: Problem set: 71 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/154 constraints. Problems are: Problem set: 71 solved, 49 unsolved
At refinement iteration 10 (OVERLAPS) 0/204 variables, 0/154 constraints. Problems are: Problem set: 71 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 154 constraints, problems are : Problem set: 71 solved, 49 unsolved in 1303 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 49/120 constraints, Known Traps: 2/2 constraints]
After SMT, in 2824ms problems are : Problem set: 71 solved, 49 unsolved
Search for dead transitions found 71 dead transitions in 2827ms
Found 71 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 71 transitions
Dead transitions reduction (with SMT) removed 71 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 89/218 places, 50/258 transitions.
Graph (complete) has 110 edges and 89 vertex of which 38 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.0 ms
Discarding 51 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 38 /89 variables (removed 51) and now considering 50/50 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/218 places, 50/258 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2919 ms. Remains : 38/218 places, 50/258 transitions.
Support contains 4 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 258/258 transitions.
Applied a total of 0 rules in 6 ms. Remains 218 /218 variables (removed 0) and now considering 258/258 (removed 0) transitions.
// Phase 1: matrix 258 rows 218 cols
[2024-05-31 22:08:28] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 22:08:28] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-31 22:08:28] [INFO ] Invariant cache hit.
[2024-05-31 22:08:28] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-05-31 22:08:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 258/476 variables, 218/220 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-31 22:08:32] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:08:32] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:08:32] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:08:32] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-05-31 22:08:32] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:08:33] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:08:33] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:08:33] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:08:33] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:08:33] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:08:33] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:08:33] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:08:33] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
[2024-05-31 22:08:33] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:08:33] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:08:33] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2024-05-31 22:08:33] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:08:33] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2024-05-31 22:08:33] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:08:33] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-31 22:08:34] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 0/476 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 241 constraints, problems are : Problem set: 0 solved, 257 unsolved in 11921 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/476 variables, 218/241 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 257/498 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 0/476 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 476/476 variables, and 498 constraints, problems are : Problem set: 0 solved, 257 unsolved in 12868 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 21/21 constraints]
After SMT, in 24898ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 24901ms
Finished structural reductions in LTL mode , in 1 iterations and 25112 ms. Remains : 218/218 places, 258/258 transitions.
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-06 finished in 80765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(G(p1)))))'
Support contains 4 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 279/279 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 229 transition count 270
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 229 transition count 270
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 225 transition count 264
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 225 transition count 264
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 221 transition count 260
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 221 transition count 260
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 217 transition count 254
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 217 transition count 254
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 215 transition count 252
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 215 transition count 252
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 213 transition count 250
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 213 transition count 250
Applied a total of 50 rules in 36 ms. Remains 213 /238 variables (removed 25) and now considering 250/279 (removed 29) transitions.
// Phase 1: matrix 250 rows 213 cols
[2024-05-31 22:08:53] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 22:08:53] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-05-31 22:08:53] [INFO ] Invariant cache hit.
[2024-05-31 22:08:54] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2024-05-31 22:08:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (OVERLAPS) 250/462 variables, 212/214 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-05-31 22:08:58] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:08:58] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:08:58] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:08:58] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
[2024-05-31 22:08:58] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:08:58] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:08:58] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:08:58] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:08:58] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:08:58] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-05-31 22:08:58] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:08:58] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-05-31 22:08:59] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-31 22:08:59] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-05-31 22:08:59] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:08:59] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:08:59] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 17/231 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (OVERLAPS) 1/463 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 8 (OVERLAPS) 0/463 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 232 constraints, problems are : Problem set: 0 solved, 249 unsolved in 13029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 250/462 variables, 212/231 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 248/479 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-05-31 22:09:10] [INFO ] Deduced a trap composed of 129 places in 72 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 8 (OVERLAPS) 1/463 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 11 (OVERLAPS) 0/463 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 482 constraints, problems are : Problem set: 0 solved, 249 unsolved in 27622 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 18/18 constraints]
After SMT, in 40753ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 40756ms
Starting structural reductions in LTL mode, iteration 1 : 213/238 places, 250/279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41363 ms. Remains : 213/238 places, 250/279 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 201 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-07 finished in 41558 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 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 279/279 transitions.
Graph (complete) has 473 edges and 238 vertex of which 234 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 233 transition count 242
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 200 transition count 242
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 67 place count 200 transition count 202
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 147 place count 160 transition count 202
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 151 place count 156 transition count 198
Iterating global reduction 2 with 4 rules applied. Total rules applied 155 place count 156 transition count 198
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 155 place count 156 transition count 197
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 157 place count 155 transition count 197
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 160 place count 152 transition count 192
Iterating global reduction 2 with 3 rules applied. Total rules applied 163 place count 152 transition count 192
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 166 place count 149 transition count 188
Iterating global reduction 2 with 3 rules applied. Total rules applied 169 place count 149 transition count 188
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 170 place count 148 transition count 187
Iterating global reduction 2 with 1 rules applied. Total rules applied 171 place count 148 transition count 187
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 283 place count 92 transition count 131
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 294 place count 81 transition count 109
Iterating global reduction 2 with 11 rules applied. Total rules applied 305 place count 81 transition count 109
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 316 place count 70 transition count 98
Iterating global reduction 2 with 11 rules applied. Total rules applied 327 place count 70 transition count 98
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 338 place count 59 transition count 76
Iterating global reduction 2 with 11 rules applied. Total rules applied 349 place count 59 transition count 76
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 359 place count 49 transition count 66
Iterating global reduction 2 with 10 rules applied. Total rules applied 369 place count 49 transition count 66
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 379 place count 39 transition count 46
Iterating global reduction 2 with 10 rules applied. Total rules applied 389 place count 39 transition count 46
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 399 place count 29 transition count 36
Iterating global reduction 2 with 10 rules applied. Total rules applied 409 place count 29 transition count 36
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 411 place count 29 transition count 34
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 412 place count 29 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 414 place count 27 transition count 32
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 28 edges and 25 vertex of which 22 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 8 rules applied. Total rules applied 422 place count 22 transition count 24
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 428 place count 17 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 429 place count 16 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 431 place count 15 transition count 22
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 5 with 2 rules applied. Total rules applied 433 place count 14 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 435 place count 14 transition count 20
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 438 place count 11 transition count 17
Applied a total of 438 rules in 47 ms. Remains 11 /238 variables (removed 227) and now considering 17/279 (removed 262) transitions.
[2024-05-31 22:09:34] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
// Phase 1: matrix 13 rows 11 cols
[2024-05-31 22:09:34] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 22:09:34] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-31 22:09:34] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
[2024-05-31 22:09:34] [INFO ] Invariant cache hit.
[2024-05-31 22:09:35] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-31 22:09:35] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-31 22:09:35] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
[2024-05-31 22:09:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 11/19 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/23 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/24 variables, and 11 constraints, problems are : Problem set: 0 solved, 10 unsolved in 55 ms.
Refiners :[State Equation: 11/11 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 11/19 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 4/23 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/24 variables, and 21 constraints, problems are : Problem set: 0 solved, 10 unsolved in 57 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 115ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 115ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/238 places, 17/279 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 203 ms. Remains : 11/238 places, 17/279 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-11
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-11 finished in 297 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 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 279/279 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 237 transition count 279
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 227 transition count 269
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 227 transition count 269
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 223 transition count 263
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 223 transition count 263
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 219 transition count 259
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 219 transition count 259
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 215 transition count 253
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 215 transition count 253
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 213 transition count 251
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 213 transition count 251
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 211 transition count 249
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 211 transition count 249
Applied a total of 53 rules in 28 ms. Remains 211 /238 variables (removed 27) and now considering 249/279 (removed 30) transitions.
// Phase 1: matrix 249 rows 211 cols
[2024-05-31 22:09:35] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 22:09:35] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-31 22:09:35] [INFO ] Invariant cache hit.
[2024-05-31 22:09:35] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2024-05-31 22:09:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/211 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (OVERLAPS) 249/460 variables, 211/213 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-05-31 22:09:39] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:09:39] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-05-31 22:09:39] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:09:39] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-05-31 22:09:39] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:09:39] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:09:40] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 2 ms to minimize.
[2024-05-31 22:09:40] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-31 22:09:40] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:09:40] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
[2024-05-31 22:09:40] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:09:40] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:09:40] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:09:40] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-05-31 22:09:40] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
[2024-05-31 22:09:40] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 16/229 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 0/460 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 229 constraints, problems are : Problem set: 0 solved, 248 unsolved in 11070 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/211 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 249/460 variables, 211/229 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 248/477 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 0/460 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 477 constraints, problems are : Problem set: 0 solved, 248 unsolved in 11297 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 16/16 constraints]
After SMT, in 22474ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 22479ms
Starting structural reductions in LTL mode, iteration 1 : 211/238 places, 249/279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22734 ms. Remains : 211/238 places, 249/279 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-12
Stuttering criterion allowed to conclude after 364 steps with 0 reset in 5 ms.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-12 finished in 22849 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 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 279/279 transitions.
Graph (complete) has 473 edges and 238 vertex of which 234 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 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 233 transition count 241
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 199 transition count 241
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 69 place count 199 transition count 200
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 151 place count 158 transition count 200
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 156 place count 153 transition count 195
Iterating global reduction 2 with 5 rules applied. Total rules applied 161 place count 153 transition count 195
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 161 place count 153 transition count 194
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 152 transition count 194
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 167 place count 148 transition count 188
Iterating global reduction 2 with 4 rules applied. Total rules applied 171 place count 148 transition count 188
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 175 place count 144 transition count 182
Iterating global reduction 2 with 4 rules applied. Total rules applied 179 place count 144 transition count 182
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 181 place count 142 transition count 180
Iterating global reduction 2 with 2 rules applied. Total rules applied 183 place count 142 transition count 180
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 289 place count 89 transition count 127
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 300 place count 78 transition count 105
Iterating global reduction 2 with 11 rules applied. Total rules applied 311 place count 78 transition count 105
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 322 place count 67 transition count 94
Iterating global reduction 2 with 11 rules applied. Total rules applied 333 place count 67 transition count 94
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 344 place count 56 transition count 72
Iterating global reduction 2 with 11 rules applied. Total rules applied 355 place count 56 transition count 72
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 366 place count 45 transition count 61
Iterating global reduction 2 with 11 rules applied. Total rules applied 377 place count 45 transition count 61
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 388 place count 34 transition count 39
Iterating global reduction 2 with 11 rules applied. Total rules applied 399 place count 34 transition count 39
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 410 place count 23 transition count 28
Iterating global reduction 2 with 11 rules applied. Total rules applied 421 place count 23 transition count 28
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 422 place count 23 transition count 27
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 423 place count 23 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 425 place count 21 transition count 25
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 23 edges and 19 vertex of which 16 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 432 place count 16 transition count 18
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 436 place count 12 transition count 18
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 442 place count 9 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 444 place count 8 transition count 14
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 445 place count 8 transition count 13
Applied a total of 445 rules in 36 ms. Remains 8 /238 variables (removed 230) and now considering 13/279 (removed 266) transitions.
[2024-05-31 22:09:58] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 8 cols
[2024-05-31 22:09:58] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 22:09:58] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-31 22:09:58] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2024-05-31 22:09:58] [INFO ] Invariant cache hit.
[2024-05-31 22:09:58] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-31 22:09:58] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-31 22:09:58] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2024-05-31 22:09:58] [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 55 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, 9/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 2/17 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (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 59 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 117ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/238 places, 13/279 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 200 ms. Remains : 8/238 places, 13/279 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLCardinality-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLCardinality-13 finished in 259 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((X(X(p1))||p0)))'
[2024-05-31 22:09:58] [INFO ] Flatten gal took : 14 ms
[2024-05-31 22:09:58] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 8 ms.
[2024-05-31 22:09:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 238 places, 279 transitions and 752 arcs took 7 ms.
Total runtime 269103 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA DiscoveryGPU-PT-13b-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717193548210

--------------------
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
mcc2024
ltl formula name DiscoveryGPU-PT-13b-LTLCardinality-06
ltl formula formula --ltl=/tmp/1489/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 238 places, 279 transitions and 752 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1489/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1489/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1489/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1489/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 239 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 239, there are 324 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~893 levels ~10000 states ~37284 transitions
pnml2lts-mc( 2/ 4): ~893 levels ~20000 states ~72348 transitions
pnml2lts-mc( 2/ 4): ~1008 levels ~40000 states ~148332 transitions
pnml2lts-mc( 2/ 4): ~1009 levels ~80000 states ~309132 transitions
pnml2lts-mc( 2/ 4): ~1009 levels ~160000 states ~631160 transitions
pnml2lts-mc( 2/ 4): ~1009 levels ~320000 states ~1393628 transitions
pnml2lts-mc( 2/ 4): ~1009 levels ~640000 states ~2865636 transitions
pnml2lts-mc( 2/ 4): ~1009 levels ~1280000 states ~6117452 transitions
pnml2lts-mc( 2/ 4): ~1009 levels ~2560000 states ~13007544 transitions
pnml2lts-mc( 3/ 4): ~1101 levels ~5120000 states ~26735896 transitions
pnml2lts-mc( 1/ 4): ~4267 levels ~10240000 states ~54779652 transitions
pnml2lts-mc( 1/ 4): ~4632 levels ~20480000 states ~112757200 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 20487478
pnml2lts-mc( 0/ 4): unique states count: 33515127
pnml2lts-mc( 0/ 4): unique transitions count: 197171079
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 147936113
pnml2lts-mc( 0/ 4): - claim found count: 15671258
pnml2lts-mc( 0/ 4): - claim success count: 33515137
pnml2lts-mc( 0/ 4): - cum. max stack depth: 10626
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33515137 states 197171102 transitions, fanout: 5.883
pnml2lts-mc( 0/ 4): Total exploration time 149.000 sec (149.000 sec minimum, 149.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: 224934, Transitions per second: 1323296
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 263.5MB, 8.2 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/11.0%
pnml2lts-mc( 0/ 4): Stored 282 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 263.5MB (~256.0MB paged-in)

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-13b"
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-13b, 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-171631132800483"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-13b.tgz
mv DiscoveryGPU-PT-13b 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;