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.r579-smll-171734921300123.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 MedleyA-PT-16, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921300123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 89K Jun 2 16:33 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 MedleyA-PT-16-LTLCardinality-00
FORMULA_NAME MedleyA-PT-16-LTLCardinality-01
FORMULA_NAME MedleyA-PT-16-LTLCardinality-02
FORMULA_NAME MedleyA-PT-16-LTLCardinality-03
FORMULA_NAME MedleyA-PT-16-LTLCardinality-04
FORMULA_NAME MedleyA-PT-16-LTLCardinality-05
FORMULA_NAME MedleyA-PT-16-LTLCardinality-06
FORMULA_NAME MedleyA-PT-16-LTLCardinality-07
FORMULA_NAME MedleyA-PT-16-LTLCardinality-08
FORMULA_NAME MedleyA-PT-16-LTLCardinality-09
FORMULA_NAME MedleyA-PT-16-LTLCardinality-10
FORMULA_NAME MedleyA-PT-16-LTLCardinality-11
FORMULA_NAME MedleyA-PT-16-LTLCardinality-12
FORMULA_NAME MedleyA-PT-16-LTLCardinality-13
FORMULA_NAME MedleyA-PT-16-LTLCardinality-14
FORMULA_NAME MedleyA-PT-16-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717358322838

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:58:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 19:58:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:58:45] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2024-06-02 19:58:45] [INFO ] Transformed 196 places.
[2024-06-02 19:58:45] [INFO ] Transformed 392 transitions.
[2024-06-02 19:58:45] [INFO ] Found NUPN structural information;
[2024-06-02 19:58:45] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 418 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-16-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 390/390 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 166 transition count 341
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 166 transition count 341
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 70 place count 166 transition count 331
Applied a total of 70 rules in 88 ms. Remains 166 /196 variables (removed 30) and now considering 331/390 (removed 59) transitions.
// Phase 1: matrix 331 rows 166 cols
[2024-06-02 19:58:46] [INFO ] Computed 7 invariants in 56 ms
[2024-06-02 19:58:46] [INFO ] Implicit Places using invariants in 542 ms returned []
[2024-06-02 19:58:46] [INFO ] Invariant cache hit.
[2024-06-02 19:58:47] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 1217 ms to find 0 implicit places.
Running 330 sub problems to find dead transitions.
[2024-06-02 19:58:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 19:58:52] [INFO ] Deduced a trap composed of 26 places in 193 ms of which 33 ms to minimize.
[2024-06-02 19:58:52] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 4 ms to minimize.
[2024-06-02 19:58:53] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 3 ms to minimize.
[2024-06-02 19:58:53] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 4 ms to minimize.
[2024-06-02 19:58:53] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 3 ms to minimize.
[2024-06-02 19:58:53] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 2 ms to minimize.
[2024-06-02 19:58:53] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 3 ms to minimize.
[2024-06-02 19:58:53] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 4 ms to minimize.
[2024-06-02 19:58:54] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 3 ms to minimize.
[2024-06-02 19:58:54] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 2 ms to minimize.
[2024-06-02 19:58:54] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 3 ms to minimize.
[2024-06-02 19:58:54] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 2 ms to minimize.
[2024-06-02 19:58:55] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 3 ms to minimize.
[2024-06-02 19:58:55] [INFO ] Deduced a trap composed of 109 places in 123 ms of which 2 ms to minimize.
[2024-06-02 19:58:55] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 2 ms to minimize.
[2024-06-02 19:58:56] [INFO ] Deduced a trap composed of 123 places in 139 ms of which 2 ms to minimize.
[2024-06-02 19:58:56] [INFO ] Deduced a trap composed of 118 places in 138 ms of which 3 ms to minimize.
[2024-06-02 19:58:56] [INFO ] Deduced a trap composed of 122 places in 124 ms of which 3 ms to minimize.
[2024-06-02 19:58:56] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 3 ms to minimize.
[2024-06-02 19:58:56] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 19:58:57] [INFO ] Deduced a trap composed of 92 places in 167 ms of which 3 ms to minimize.
[2024-06-02 19:58:57] [INFO ] Deduced a trap composed of 40 places in 229 ms of which 3 ms to minimize.
[2024-06-02 19:58:58] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (OVERLAPS) 331/497 variables, 166/196 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 19:59:06] [INFO ] Deduced a trap composed of 96 places in 188 ms of which 3 ms to minimize.
[2024-06-02 19:59:07] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 330 unsolved
[2024-06-02 19:59:17] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2024-06-02 19:59:18] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 4 ms to minimize.
SMT process timed out in 30541ms, After SMT, problems are : Problem set: 0 solved, 330 unsolved
Search for dead transitions found 0 dead transitions in 30587ms
Starting structural reductions in LTL mode, iteration 1 : 166/196 places, 331/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31945 ms. Remains : 166/196 places, 331/390 transitions.
Support contains 27 out of 166 places after structural reductions.
[2024-06-02 19:59:18] [INFO ] Flatten gal took : 112 ms
[2024-06-02 19:59:18] [INFO ] Flatten gal took : 52 ms
[2024-06-02 19:59:18] [INFO ] Input system was already deterministic with 331 transitions.
Support contains 25 out of 166 places (down from 27) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40000 steps (8 resets) in 2538 ms. (15 steps per ms) remains 10/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 410 ms. (97 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 425 ms. (93 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 189 ms. (210 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 276 ms. (144 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 220 ms. (181 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 187 ms. (212 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 217 ms. (183 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 217 ms. (183 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (8 resets) in 236 ms. (168 steps per ms) remains 10/10 properties
[2024-06-02 19:59:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 131/150 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 16/166 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 331/497 variables, 166/173 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/497 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 173 constraints, problems are : Problem set: 0 solved, 10 unsolved in 624 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 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/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 131/150 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 16/166 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 19:59:21] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:59:21] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:59:21] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 331/497 variables, 166/176 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 10/186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 19:59:22] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 2 ms to minimize.
[2024-06-02 19:59:22] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-06-02 19:59:22] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 19:59:23] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
[2024-06-02 19:59:23] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/497 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 19:59:23] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 19:59:24] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-06-02 19:59:24] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 3 ms to minimize.
[2024-06-02 19:59:24] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/497 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 19:59:24] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/497 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/497 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/497 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 196 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4358 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 13/13 constraints]
After SMT, in 5011ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 5 properties in 6183 ms.
Support contains 10 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 331/331 transitions.
Graph (trivial) has 160 edges and 166 vertex of which 13 / 166 are part of one of the 3 SCC in 3 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 156 transition count 291
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 129 transition count 291
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 55 place count 129 transition count 282
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 73 place count 120 transition count 282
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 120 transition count 281
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 78 place count 116 transition count 273
Iterating global reduction 3 with 4 rules applied. Total rules applied 82 place count 116 transition count 273
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 83 place count 116 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 84 place count 115 transition count 272
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 86 place count 113 transition count 266
Iterating global reduction 5 with 2 rules applied. Total rules applied 88 place count 113 transition count 266
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 128 place count 93 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 132 place count 93 transition count 242
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 134 place count 91 transition count 237
Iterating global reduction 6 with 2 rules applied. Total rules applied 136 place count 91 transition count 237
Performed 22 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 180 place count 69 transition count 385
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 212 place count 69 transition count 353
Drop transitions (Redundant composition of simpler transitions.) removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 7 with 51 rules applied. Total rules applied 263 place count 69 transition count 302
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 267 place count 67 transition count 328
Free-agglomeration rule applied 14 times.
Iterating global reduction 7 with 14 rules applied. Total rules applied 281 place count 67 transition count 314
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 306 place count 53 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 8 with 38 rules applied. Total rules applied 344 place count 53 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 345 place count 52 transition count 264
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 24 edges and 50 vertex of which 6 / 50 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 348 place count 47 transition count 264
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 9 with 27 rules applied. Total rules applied 375 place count 47 transition count 237
Drop transitions (Redundant composition of simpler transitions.) removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 10 with 47 rules applied. Total rules applied 422 place count 47 transition count 190
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 423 place count 46 transition count 189
Iterating global reduction 10 with 1 rules applied. Total rules applied 424 place count 46 transition count 189
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 428 place count 44 transition count 187
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 429 place count 44 transition count 186
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 430 place count 44 transition count 185
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 433 place count 43 transition count 183
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 436 place count 43 transition count 180
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 437 place count 43 transition count 180
Applied a total of 437 rules in 187 ms. Remains 43 /166 variables (removed 123) and now considering 180/331 (removed 151) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 43/166 places, 180/331 transitions.
RANDOM walk for 20391 steps (61 resets) in 203 ms. (99 steps per ms) remains 0/5 properties
Computed a total of 14 stabilizing places and 14 stable transitions
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(p0)||X(X(F(!p0)))))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 156 transition count 316
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 156 transition count 316
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 25 place count 156 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 155 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 155 transition count 310
Applied a total of 27 rules in 18 ms. Remains 155 /166 variables (removed 11) and now considering 310/331 (removed 21) transitions.
// Phase 1: matrix 310 rows 155 cols
[2024-06-02 19:59:32] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:59:32] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 19:59:32] [INFO ] Invariant cache hit.
[2024-06-02 19:59:32] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2024-06-02 19:59:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 19:59:36] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 2 ms to minimize.
[2024-06-02 19:59:36] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 3 ms to minimize.
[2024-06-02 19:59:36] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:59:36] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 3 ms to minimize.
[2024-06-02 19:59:36] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 3 ms to minimize.
[2024-06-02 19:59:37] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 2 ms to minimize.
[2024-06-02 19:59:37] [INFO ] Deduced a trap composed of 31 places in 193 ms of which 3 ms to minimize.
[2024-06-02 19:59:37] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 2 ms to minimize.
[2024-06-02 19:59:37] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 2 ms to minimize.
[2024-06-02 19:59:38] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
[2024-06-02 19:59:38] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 4 ms to minimize.
[2024-06-02 19:59:39] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 3 ms to minimize.
[2024-06-02 19:59:39] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 3 ms to minimize.
[2024-06-02 19:59:39] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-06-02 19:59:39] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 2 ms to minimize.
[2024-06-02 19:59:40] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 19:59:41] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 6 ms to minimize.
[2024-06-02 19:59:42] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 3 ms to minimize.
[2024-06-02 19:59:42] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 3 ms to minimize.
[2024-06-02 19:59:42] [INFO ] Deduced a trap composed of 102 places in 134 ms of which 3 ms to minimize.
[2024-06-02 19:59:42] [INFO ] Deduced a trap composed of 114 places in 155 ms of which 3 ms to minimize.
[2024-06-02 19:59:43] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 19:59:46] [INFO ] Deduced a trap composed of 102 places in 143 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 19:59:48] [INFO ] Deduced a trap composed of 108 places in 162 ms of which 4 ms to minimize.
[2024-06-02 19:59:49] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (OVERLAPS) 310/465 variables, 155/187 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 9 (OVERLAPS) 0/465 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 465/465 variables, and 187 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 310/465 variables, 155/187 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/465 variables, 309/496 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 20:00:12] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/465 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/465 variables, and 497 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 26/26 constraints]
After SMT, in 60250ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60259ms
Starting structural reductions in LTL mode, iteration 1 : 155/166 places, 310/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60571 ms. Remains : 155/166 places, 310/331 transitions.
Stuttering acceptance computed with spot in 464 ms :[p0, false, p0, false]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 531 ms.
Product exploration explored 100000 steps with 50000 reset in 241 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-16-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-16-LTLCardinality-02 finished in 61914 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Graph (trivial) has 172 edges and 166 vertex of which 13 / 166 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 155 transition count 290
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 125 transition count 288
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 67 place count 124 transition count 285
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 72 place count 121 transition count 283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 120 transition count 283
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 73 place count 120 transition count 274
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 91 place count 111 transition count 274
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 99 place count 103 transition count 259
Iterating global reduction 5 with 8 rules applied. Total rules applied 107 place count 103 transition count 259
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 6 rules applied. Total rules applied 113 place count 103 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 114 place count 102 transition count 253
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 114 place count 102 transition count 252
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 116 place count 101 transition count 252
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 118 place count 99 transition count 246
Iterating global reduction 7 with 2 rules applied. Total rules applied 120 place count 99 transition count 246
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 162 place count 78 transition count 225
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 167 place count 78 transition count 220
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 170 place count 75 transition count 213
Iterating global reduction 8 with 3 rules applied. Total rules applied 173 place count 75 transition count 213
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -125
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 38 rules applied. Total rules applied 211 place count 56 transition count 338
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 225 place count 56 transition count 324
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 9 with 28 rules applied. Total rules applied 253 place count 56 transition count 296
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 257 place count 54 transition count 322
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 258 place count 53 transition count 321
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 49 edges and 51 vertex of which 16 / 51 are part of one of the 7 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 9 with 3 rules applied. Total rules applied 261 place count 42 transition count 321
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 10 with 37 rules applied. Total rules applied 298 place count 42 transition count 284
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 300 place count 40 transition count 260
Iterating global reduction 11 with 2 rules applied. Total rules applied 302 place count 40 transition count 260
Drop transitions (Redundant composition of simpler transitions.) removed 74 transitions
Redundant transition composition rules discarded 74 transitions
Iterating global reduction 11 with 74 rules applied. Total rules applied 376 place count 40 transition count 186
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 378 place count 38 transition count 176
Iterating global reduction 11 with 2 rules applied. Total rules applied 380 place count 38 transition count 176
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 384 place count 36 transition count 174
Applied a total of 384 rules in 93 ms. Remains 36 /166 variables (removed 130) and now considering 174/331 (removed 157) transitions.
[2024-06-02 20:00:34] [INFO ] Flow matrix only has 154 transitions (discarded 20 similar events)
// Phase 1: matrix 154 rows 36 cols
[2024-06-02 20:00:34] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 20:00:34] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 20:00:34] [INFO ] Flow matrix only has 154 transitions (discarded 20 similar events)
[2024-06-02 20:00:34] [INFO ] Invariant cache hit.
[2024-06-02 20:00:34] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 20:00:34] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-06-02 20:00:34] [INFO ] Redundant transitions in 39 ms returned [95, 123, 169, 173]
Found 4 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 4 transitions
Redundant transitions reduction (with SMT) removed 4 transitions.
Running 166 sub problems to find dead transitions.
[2024-06-02 20:00:34] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
// Phase 1: matrix 150 rows 36 cols
[2024-06-02 20:00:34] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 20:00:34] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-02 20:00:35] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-06-02 20:00:35] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2024-06-02 20:00:35] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-02 20:00:35] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 149/185 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 36/81 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-02 20:00:37] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 0/185 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/186 variables, and 82 constraints, problems are : Problem set: 0 solved, 166 unsolved in 5875 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 149/185 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 36/82 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 166/248 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-06-02 20:00:45] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:00:46] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:00:46] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/185 variables, 3/251 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (OVERLAPS) 0/185 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/186 variables, and 251 constraints, problems are : Problem set: 0 solved, 166 unsolved in 12936 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 8/8 constraints]
After SMT, in 19018ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 19021ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/166 places, 170/331 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 169
Applied a total of 2 rules in 6 ms. Remains 35 /36 variables (removed 1) and now considering 169/170 (removed 1) transitions.
[2024-06-02 20:00:53] [INFO ] Flow matrix only has 149 transitions (discarded 20 similar events)
// Phase 1: matrix 149 rows 35 cols
[2024-06-02 20:00:53] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 20:00:53] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-02 20:00:53] [INFO ] Flow matrix only has 149 transitions (discarded 20 similar events)
[2024-06-02 20:00:53] [INFO ] Invariant cache hit.
[2024-06-02 20:00:53] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 20:00:53] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/166 places, 169/331 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19512 ms. Remains : 35/166 places, 169/331 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLCardinality-03 finished in 19561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(p0)))))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 156 transition count 316
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 156 transition count 316
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 25 place count 156 transition count 311
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 154 transition count 309
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 154 transition count 309
Applied a total of 29 rules in 14 ms. Remains 154 /166 variables (removed 12) and now considering 309/331 (removed 22) transitions.
// Phase 1: matrix 309 rows 154 cols
[2024-06-02 20:00:53] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:00:53] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 20:00:53] [INFO ] Invariant cache hit.
[2024-06-02 20:00:54] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 308 sub problems to find dead transitions.
[2024-06-02 20:00:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 20:00:57] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 3 ms to minimize.
[2024-06-02 20:00:57] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 3 ms to minimize.
[2024-06-02 20:00:57] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 3 ms to minimize.
[2024-06-02 20:00:58] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 2 ms to minimize.
[2024-06-02 20:00:58] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 3 ms to minimize.
[2024-06-02 20:00:58] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 2 ms to minimize.
[2024-06-02 20:00:58] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 3 ms to minimize.
[2024-06-02 20:00:58] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 3 ms to minimize.
[2024-06-02 20:00:58] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 3 ms to minimize.
[2024-06-02 20:00:59] [INFO ] Deduced a trap composed of 88 places in 156 ms of which 3 ms to minimize.
[2024-06-02 20:00:59] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 3 ms to minimize.
[2024-06-02 20:00:59] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 3 ms to minimize.
[2024-06-02 20:00:59] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 2 ms to minimize.
[2024-06-02 20:01:00] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 2 ms to minimize.
[2024-06-02 20:01:00] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 3 ms to minimize.
[2024-06-02 20:01:00] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 2 ms to minimize.
[2024-06-02 20:01:00] [INFO ] Deduced a trap composed of 101 places in 137 ms of which 3 ms to minimize.
[2024-06-02 20:01:01] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 3 ms to minimize.
[2024-06-02 20:01:01] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 3 ms to minimize.
[2024-06-02 20:01:01] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 20:01:02] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 3 ms to minimize.
[2024-06-02 20:01:02] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 2 ms to minimize.
[2024-06-02 20:01:03] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 3 ms to minimize.
[2024-06-02 20:01:03] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 3 ms to minimize.
[2024-06-02 20:01:03] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 20:01:06] [INFO ] Deduced a trap composed of 88 places in 151 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (OVERLAPS) 309/463 variables, 154/187 constraints. Problems are: Problem set: 0 solved, 308 unsolved
[2024-06-02 20:01:14] [INFO ] Deduced a trap composed of 86 places in 133 ms of which 3 ms to minimize.
[2024-06-02 20:01:15] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 2 ms to minimize.
[2024-06-02 20:01:16] [INFO ] Deduced a trap composed of 93 places in 148 ms of which 3 ms to minimize.
[2024-06-02 20:01:16] [INFO ] Deduced a trap composed of 106 places in 154 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 308 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/463 variables, and 191 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 308 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 4 (OVERLAPS) 309/463 variables, 154/191 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 308/499 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 308 unsolved
At refinement iteration 7 (OVERLAPS) 0/463 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 308 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 499 constraints, problems are : Problem set: 0 solved, 308 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 308/308 constraints, Known Traps: 30/30 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 308 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in LTL mode, iteration 1 : 154/166 places, 309/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60409 ms. Remains : 154/166 places, 309/331 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-16-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLCardinality-04 finished in 60613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 156 transition count 317
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 156 transition count 317
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 25 place count 156 transition count 312
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 154 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 154 transition count 310
Applied a total of 29 rules in 12 ms. Remains 154 /166 variables (removed 12) and now considering 310/331 (removed 21) transitions.
// Phase 1: matrix 310 rows 154 cols
[2024-06-02 20:01:54] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:01:54] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 20:01:54] [INFO ] Invariant cache hit.
[2024-06-02 20:01:54] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2024-06-02 20:01:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 20:01:58] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 2 ms to minimize.
[2024-06-02 20:01:58] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 2 ms to minimize.
[2024-06-02 20:01:58] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 2 ms to minimize.
[2024-06-02 20:01:58] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-06-02 20:01:59] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 3 ms to minimize.
[2024-06-02 20:01:59] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 3 ms to minimize.
[2024-06-02 20:01:59] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 3 ms to minimize.
[2024-06-02 20:01:59] [INFO ] Deduced a trap composed of 87 places in 139 ms of which 3 ms to minimize.
[2024-06-02 20:01:59] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 3 ms to minimize.
[2024-06-02 20:01:59] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 3 ms to minimize.
[2024-06-02 20:02:00] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 3 ms to minimize.
[2024-06-02 20:02:00] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 2 ms to minimize.
[2024-06-02 20:02:01] [INFO ] Deduced a trap composed of 100 places in 149 ms of which 3 ms to minimize.
[2024-06-02 20:02:01] [INFO ] Deduced a trap composed of 106 places in 128 ms of which 2 ms to minimize.
[2024-06-02 20:02:01] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 3 ms to minimize.
[2024-06-02 20:02:01] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 2 ms to minimize.
[2024-06-02 20:02:01] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 3 ms to minimize.
[2024-06-02 20:02:01] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 2 ms to minimize.
[2024-06-02 20:02:02] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 20:02:03] [INFO ] Deduced a trap composed of 94 places in 165 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 20:02:08] [INFO ] Deduced a trap composed of 107 places in 157 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 20:02:10] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (OVERLAPS) 310/464 variables, 154/183 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 9 (OVERLAPS) 0/464 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 183 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 310/464 variables, 154/183 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 309/492 constraints. Problems are: Problem set: 0 solved, 309 unsolved
[2024-06-02 20:02:34] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 493 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 23/23 constraints]
After SMT, in 60179ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 60185ms
Starting structural reductions in LTL mode, iteration 1 : 154/166 places, 310/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60525 ms. Remains : 154/166 places, 310/331 transitions.
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLCardinality-06 finished in 60730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&F((G(F(p3))||p2))))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Graph (trivial) has 172 edges and 166 vertex of which 13 / 166 are part of one of the 3 SCC in 5 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 155 transition count 289
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 124 transition count 287
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 123 transition count 287
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 66 place count 123 transition count 278
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 84 place count 114 transition count 278
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 92 place count 106 transition count 263
Iterating global reduction 3 with 8 rules applied. Total rules applied 100 place count 106 transition count 263
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 106 place count 106 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 107 place count 105 transition count 257
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 107 place count 105 transition count 256
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 109 place count 104 transition count 256
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 111 place count 102 transition count 250
Iterating global reduction 5 with 2 rules applied. Total rules applied 113 place count 102 transition count 250
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 151 place count 83 transition count 231
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 156 place count 83 transition count 226
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 159 place count 80 transition count 219
Iterating global reduction 6 with 3 rules applied. Total rules applied 162 place count 80 transition count 219
Performed 18 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 198 place count 62 transition count 329
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 211 place count 62 transition count 316
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 7 with 28 rules applied. Total rules applied 239 place count 62 transition count 288
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 243 place count 60 transition count 314
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 244 place count 59 transition count 313
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 57 edges and 57 vertex of which 19 / 57 are part of one of the 8 SCC in 0 ms
Free SCC test removed 11 places
Iterating post reduction 7 with 3 rules applied. Total rules applied 247 place count 46 transition count 313
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 8 with 43 rules applied. Total rules applied 290 place count 46 transition count 270
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 292 place count 44 transition count 247
Iterating global reduction 9 with 2 rules applied. Total rules applied 294 place count 44 transition count 247
Drop transitions (Redundant composition of simpler transitions.) removed 78 transitions
Redundant transition composition rules discarded 78 transitions
Iterating global reduction 9 with 78 rules applied. Total rules applied 372 place count 44 transition count 169
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 372 place count 44 transition count 168
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 374 place count 43 transition count 168
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 376 place count 41 transition count 160
Iterating global reduction 9 with 2 rules applied. Total rules applied 378 place count 41 transition count 160
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 382 place count 39 transition count 158
Applied a total of 382 rules in 105 ms. Remains 39 /166 variables (removed 127) and now considering 158/331 (removed 173) transitions.
[2024-06-02 20:02:55] [INFO ] Flow matrix only has 146 transitions (discarded 12 similar events)
// Phase 1: matrix 146 rows 39 cols
[2024-06-02 20:02:55] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 20:02:55] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 20:02:55] [INFO ] Flow matrix only has 146 transitions (discarded 12 similar events)
[2024-06-02 20:02:55] [INFO ] Invariant cache hit.
[2024-06-02 20:02:55] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-02 20:02:55] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2024-06-02 20:02:55] [INFO ] Redundant transitions in 43 ms returned [114, 115, 157]
Found 3 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
Running 153 sub problems to find dead transitions.
[2024-06-02 20:02:55] [INFO ] Flow matrix only has 143 transitions (discarded 12 similar events)
// Phase 1: matrix 143 rows 39 cols
[2024-06-02 20:02:55] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 20:02:55] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (OVERLAPS) 1/39 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-02 20:02:56] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:02:56] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 4 ms to minimize.
[2024-06-02 20:02:56] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 2 ms to minimize.
[2024-06-02 20:02:56] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-06-02 20:02:57] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-06-02 20:02:57] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-06-02 20:02:57] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-02 20:02:58] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (OVERLAPS) 142/181 variables, 39/52 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 30/82 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 9 (OVERLAPS) 0/181 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/182 variables, and 82 constraints, problems are : Problem set: 0 solved, 153 unsolved in 7054 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (OVERLAPS) 142/181 variables, 39/52 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 30/82 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 153/235 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-02 20:03:05] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-06-02 20:03:07] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:03:07] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 11 (OVERLAPS) 0/181 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/182 variables, and 238 constraints, problems are : Problem set: 0 solved, 153 unsolved in 12374 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 39/39 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 11/11 constraints]
After SMT, in 19609ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 19612ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/166 places, 155/331 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 38 transition count 154
Applied a total of 2 rules in 5 ms. Remains 38 /39 variables (removed 1) and now considering 154/155 (removed 1) transitions.
[2024-06-02 20:03:15] [INFO ] Flow matrix only has 142 transitions (discarded 12 similar events)
// Phase 1: matrix 142 rows 38 cols
[2024-06-02 20:03:15] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 20:03:15] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 20:03:15] [INFO ] Flow matrix only has 142 transitions (discarded 12 similar events)
[2024-06-02 20:03:15] [INFO ] Invariant cache hit.
[2024-06-02 20:03:15] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-02 20:03:15] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/166 places, 154/331 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20188 ms. Remains : 38/166 places, 154/331 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLCardinality-07 finished in 20402 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((X(X(X(p0)))&&((!p1&&F(!p2)) U (G((!p1&&F(!p2)))||(!p1&&G(!p2))))))))'
Support contains 6 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 159 transition count 321
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 159 transition count 321
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 158 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 158 transition count 320
Applied a total of 16 rules in 6 ms. Remains 158 /166 variables (removed 8) and now considering 320/331 (removed 11) transitions.
// Phase 1: matrix 320 rows 158 cols
[2024-06-02 20:03:15] [INFO ] Computed 7 invariants in 12 ms
[2024-06-02 20:03:15] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-06-02 20:03:15] [INFO ] Invariant cache hit.
[2024-06-02 20:03:16] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
Running 319 sub problems to find dead transitions.
[2024-06-02 20:03:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-02 20:03:20] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 2 ms to minimize.
[2024-06-02 20:03:20] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-06-02 20:03:20] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 3 ms to minimize.
[2024-06-02 20:03:20] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 2 ms to minimize.
[2024-06-02 20:03:20] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 2 ms to minimize.
[2024-06-02 20:03:20] [INFO ] Deduced a trap composed of 95 places in 146 ms of which 3 ms to minimize.
[2024-06-02 20:03:21] [INFO ] Deduced a trap composed of 104 places in 135 ms of which 2 ms to minimize.
[2024-06-02 20:03:21] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 3 ms to minimize.
[2024-06-02 20:03:21] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-06-02 20:03:21] [INFO ] Deduced a trap composed of 88 places in 138 ms of which 3 ms to minimize.
[2024-06-02 20:03:22] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 2 ms to minimize.
[2024-06-02 20:03:22] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 3 ms to minimize.
[2024-06-02 20:03:22] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 3 ms to minimize.
[2024-06-02 20:03:22] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 3 ms to minimize.
[2024-06-02 20:03:23] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 3 ms to minimize.
[2024-06-02 20:03:23] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 3 ms to minimize.
[2024-06-02 20:03:23] [INFO ] Deduced a trap composed of 96 places in 161 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-02 20:03:25] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 3 ms to minimize.
[2024-06-02 20:03:25] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 3 ms to minimize.
[2024-06-02 20:03:25] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 3 ms to minimize.
[2024-06-02 20:03:26] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 3 ms to minimize.
[2024-06-02 20:03:26] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 3 ms to minimize.
[2024-06-02 20:03:26] [INFO ] Deduced a trap composed of 118 places in 176 ms of which 3 ms to minimize.
[2024-06-02 20:03:27] [INFO ] Deduced a trap composed of 113 places in 162 ms of which 3 ms to minimize.
[2024-06-02 20:03:27] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 2 ms to minimize.
[2024-06-02 20:03:27] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 2 ms to minimize.
[2024-06-02 20:03:27] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-02 20:03:30] [INFO ] Deduced a trap composed of 106 places in 86 ms of which 2 ms to minimize.
[2024-06-02 20:03:30] [INFO ] Deduced a trap composed of 110 places in 91 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-02 20:03:31] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 3 ms to minimize.
[2024-06-02 20:03:32] [INFO ] Deduced a trap composed of 121 places in 169 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (OVERLAPS) 320/478 variables, 158/196 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-02 20:03:37] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-02 20:03:42] [INFO ] Deduced a trap composed of 110 places in 122 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/478 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/478 variables, and 198 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (OVERLAPS) 1/158 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-02 20:03:49] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (OVERLAPS) 320/478 variables, 158/199 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 319/518 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-06-02 20:03:58] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 3 ms to minimize.
[2024-06-02 20:03:59] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 2/520 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 319 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/478 variables, and 520 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 36/36 constraints]
After SMT, in 60145ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Starting structural reductions in LTL mode, iteration 1 : 158/166 places, 320/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60729 ms. Remains : 158/166 places, 320/331 transitions.
Stuttering acceptance computed with spot in 1512 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1 p2), (NOT p0), p2, p2, p1, (NOT p0), (AND (NOT p0) p2), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p0), p2, (NOT p0), (AND (NOT p0) p2), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p0), (AND (NOT p0) p2), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (AND (NOT p0) p2), (NOT p0), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 232 ms.
Stack based approach found an accepted trace after 25 steps with 0 reset with depth 26 and stack size 26 in 1 ms.
FORMULA MedleyA-PT-16-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-16-LTLCardinality-12 finished in 62533 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 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Graph (trivial) has 176 edges and 166 vertex of which 13 / 166 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 155 transition count 286
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 38 rules applied. Total rules applied 73 place count 121 transition count 282
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 119 transition count 282
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 75 place count 119 transition count 274
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 91 place count 111 transition count 274
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 100 place count 102 transition count 257
Iterating global reduction 3 with 9 rules applied. Total rules applied 109 place count 102 transition count 257
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 115 place count 102 transition count 251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 116 place count 101 transition count 251
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 116 place count 101 transition count 250
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 118 place count 100 transition count 250
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 119 place count 99 transition count 248
Iterating global reduction 5 with 1 rules applied. Total rules applied 120 place count 99 transition count 248
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 160 place count 79 transition count 228
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 166 place count 79 transition count 222
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 169 place count 76 transition count 214
Iterating global reduction 6 with 3 rules applied. Total rules applied 172 place count 76 transition count 214
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -115
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 206 place count 59 transition count 329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 207 place count 59 transition count 328
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 7 with 30 rules applied. Total rules applied 237 place count 59 transition count 298
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 241 place count 57 transition count 324
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 242 place count 56 transition count 323
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 55 edges and 54 vertex of which 19 / 54 are part of one of the 8 SCC in 1 ms
Free SCC test removed 11 places
Iterating post reduction 7 with 3 rules applied. Total rules applied 245 place count 43 transition count 323
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 8 with 43 rules applied. Total rules applied 288 place count 43 transition count 280
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 290 place count 41 transition count 258
Iterating global reduction 9 with 2 rules applied. Total rules applied 292 place count 41 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 9 with 75 rules applied. Total rules applied 367 place count 41 transition count 183
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 367 place count 41 transition count 182
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 369 place count 40 transition count 182
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 371 place count 38 transition count 174
Iterating global reduction 9 with 2 rules applied. Total rules applied 373 place count 38 transition count 174
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 377 place count 36 transition count 172
Applied a total of 377 rules in 45 ms. Remains 36 /166 variables (removed 130) and now considering 172/331 (removed 159) transitions.
[2024-06-02 20:04:18] [INFO ] Flow matrix only has 152 transitions (discarded 20 similar events)
// Phase 1: matrix 152 rows 36 cols
[2024-06-02 20:04:18] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 20:04:18] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 20:04:18] [INFO ] Flow matrix only has 152 transitions (discarded 20 similar events)
[2024-06-02 20:04:18] [INFO ] Invariant cache hit.
[2024-06-02 20:04:18] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 20:04:18] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-06-02 20:04:18] [INFO ] Redundant transitions in 56 ms returned [129, 171]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 168 sub problems to find dead transitions.
[2024-06-02 20:04:18] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
// Phase 1: matrix 150 rows 36 cols
[2024-06-02 20:04:18] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 20:04:18] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 1/36 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-02 20:04:19] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:04:19] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 2 ms to minimize.
[2024-06-02 20:04:19] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2024-06-02 20:04:19] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-06-02 20:04:19] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-06-02 20:04:20] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2024-06-02 20:04:20] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2024-06-02 20:04:20] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 149/185 variables, 36/49 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 56/105 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 0/185 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/186 variables, and 105 constraints, problems are : Problem set: 0 solved, 168 unsolved in 5841 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 1/36 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 149/185 variables, 36/49 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 56/105 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 168/273 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (OVERLAPS) 0/185 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/186 variables, and 273 constraints, problems are : Problem set: 0 solved, 168 unsolved in 9252 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 8/8 constraints]
After SMT, in 15260ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 15262ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/166 places, 170/331 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 169
Applied a total of 2 rules in 6 ms. Remains 35 /36 variables (removed 1) and now considering 169/170 (removed 1) transitions.
[2024-06-02 20:04:33] [INFO ] Flow matrix only has 149 transitions (discarded 20 similar events)
// Phase 1: matrix 149 rows 35 cols
[2024-06-02 20:04:33] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 20:04:33] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 20:04:33] [INFO ] Flow matrix only has 149 transitions (discarded 20 similar events)
[2024-06-02 20:04:33] [INFO ] Invariant cache hit.
[2024-06-02 20:04:33] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 20:04:33] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/166 places, 169/331 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15820 ms. Remains : 35/166 places, 169/331 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLCardinality-14 finished in 15944 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&&(p1||X(p2))))))'
Support contains 5 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 158 transition count 320
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 158 transition count 320
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 21 place count 158 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 157 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 157 transition count 314
Applied a total of 23 rules in 7 ms. Remains 157 /166 variables (removed 9) and now considering 314/331 (removed 17) transitions.
// Phase 1: matrix 314 rows 157 cols
[2024-06-02 20:04:33] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:04:34] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-02 20:04:34] [INFO ] Invariant cache hit.
[2024-06-02 20:04:34] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2024-06-02 20:04:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 20:04:37] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 3 ms to minimize.
[2024-06-02 20:04:37] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 3 ms to minimize.
[2024-06-02 20:04:37] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
[2024-06-02 20:04:37] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2024-06-02 20:04:37] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2024-06-02 20:04:38] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
[2024-06-02 20:04:38] [INFO ] Deduced a trap composed of 91 places in 85 ms of which 2 ms to minimize.
[2024-06-02 20:04:38] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-06-02 20:04:38] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 2 ms to minimize.
[2024-06-02 20:04:38] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-06-02 20:04:38] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-06-02 20:04:38] [INFO ] Deduced a trap composed of 89 places in 86 ms of which 2 ms to minimize.
[2024-06-02 20:04:39] [INFO ] Deduced a trap composed of 103 places in 89 ms of which 2 ms to minimize.
[2024-06-02 20:04:39] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 3 ms to minimize.
[2024-06-02 20:04:39] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
[2024-06-02 20:04:39] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 3 ms to minimize.
[2024-06-02 20:04:39] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 4 ms to minimize.
[2024-06-02 20:04:40] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 2 ms to minimize.
[2024-06-02 20:04:40] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 3 ms to minimize.
[2024-06-02 20:04:40] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 20:04:41] [INFO ] Deduced a trap composed of 34 places in 156 ms of which 3 ms to minimize.
[2024-06-02 20:04:42] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 3 ms to minimize.
[2024-06-02 20:04:42] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 20:04:45] [INFO ] Deduced a trap composed of 95 places in 167 ms of which 3 ms to minimize.
[2024-06-02 20:04:45] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 3 ms to minimize.
[2024-06-02 20:04:46] [INFO ] Deduced a trap composed of 101 places in 161 ms of which 3 ms to minimize.
[2024-06-02 20:04:46] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 20:04:49] [INFO ] Deduced a trap composed of 109 places in 162 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 314/471 variables, 157/192 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 20:04:56] [INFO ] Deduced a trap composed of 109 places in 152 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 471/471 variables, and 193 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 20:05:06] [INFO ] Deduced a trap composed of 120 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/471 variables, 157/194 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 313/507 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 0/471 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Int declared 471/471 variables, and 507 constraints, problems are : Problem set: 0 solved, 313 unsolved in 26629 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 30/30 constraints]
After SMT, in 56717ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 56721ms
Starting structural reductions in LTL mode, iteration 1 : 157/166 places, 314/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57096 ms. Remains : 157/166 places, 314/331 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 308 ms.
Product exploration explored 100000 steps with 0 reset in 601 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0))), (X p0), (X (AND (NOT p1) p0 p2)), (X (NOT p1)), (X (NOT (AND p1 p0 p2))), (X (X p2)), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 187 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (8 resets) in 1126 ms. (35 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 231 ms. (172 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 169 ms. (235 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 377 ms. (105 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 179 ms. (222 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 376 ms. (106 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 209 ms. (190 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 176 ms. (225 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 161 ms. (246 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 46982 steps, run visited all 8 properties in 412 ms. (steps per millisecond=114 )
Probabilistic random walk after 46982 steps, saw 9914 distinct states, run finished after 419 ms. (steps per millisecond=112 ) properties seen :8
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0))), (X p0), (X (AND (NOT p1) p0 p2)), (X (NOT p1)), (X (NOT (AND p1 p0 p2))), (X (X p2)), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0 p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND p0 (OR p2 (NOT p1))))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT p2)), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 19 factoid took 723 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 5 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-06-02 20:05:35] [INFO ] Invariant cache hit.
[2024-06-02 20:05:35] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-02 20:05:35] [INFO ] Invariant cache hit.
[2024-06-02 20:05:35] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2024-06-02 20:05:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 20:05:39] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 2 ms to minimize.
[2024-06-02 20:05:39] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 3 ms to minimize.
[2024-06-02 20:05:39] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 2 ms to minimize.
[2024-06-02 20:05:39] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 2 ms to minimize.
[2024-06-02 20:05:39] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-06-02 20:05:39] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-06-02 20:05:39] [INFO ] Deduced a trap composed of 91 places in 80 ms of which 2 ms to minimize.
[2024-06-02 20:05:39] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-06-02 20:05:40] [INFO ] Deduced a trap composed of 90 places in 85 ms of which 2 ms to minimize.
[2024-06-02 20:05:40] [INFO ] Deduced a trap composed of 34 places in 161 ms of which 3 ms to minimize.
[2024-06-02 20:05:40] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 3 ms to minimize.
[2024-06-02 20:05:40] [INFO ] Deduced a trap composed of 89 places in 143 ms of which 3 ms to minimize.
[2024-06-02 20:05:41] [INFO ] Deduced a trap composed of 103 places in 88 ms of which 1 ms to minimize.
[2024-06-02 20:05:41] [INFO ] Deduced a trap composed of 103 places in 91 ms of which 2 ms to minimize.
[2024-06-02 20:05:41] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2024-06-02 20:05:41] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
[2024-06-02 20:05:41] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 1 ms to minimize.
[2024-06-02 20:05:41] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2024-06-02 20:05:42] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 3 ms to minimize.
[2024-06-02 20:05:42] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 20:05:42] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 3 ms to minimize.
[2024-06-02 20:05:43] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-06-02 20:05:43] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 20:05:46] [INFO ] Deduced a trap composed of 95 places in 88 ms of which 2 ms to minimize.
[2024-06-02 20:05:46] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 3 ms to minimize.
[2024-06-02 20:05:47] [INFO ] Deduced a trap composed of 101 places in 175 ms of which 3 ms to minimize.
[2024-06-02 20:05:47] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 20:05:49] [INFO ] Deduced a trap composed of 109 places in 135 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 314/471 variables, 157/192 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 20:05:56] [INFO ] Deduced a trap composed of 109 places in 107 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 471/471 variables, and 193 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 20:06:09] [INFO ] Deduced a trap composed of 120 places in 125 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/471 variables, 157/194 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 313/507 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 0/471 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Int declared 471/471 variables, and 507 constraints, problems are : Problem set: 0 solved, 313 unsolved in 27397 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 30/30 constraints]
After SMT, in 57544ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 57549ms
Finished structural reductions in LTL mode , in 1 iterations and 58006 ms. Remains : 157/157 places, 314/314 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND p0 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 150 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (8 resets) in 277 ms. (143 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 184 ms. (216 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 146 ms. (272 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 301 ms. (132 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 277 ms. (143 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 310 ms. (128 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 307 ms. (129 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 46982 steps, run visited all 8 properties in 456 ms. (steps per millisecond=103 )
Probabilistic random walk after 46982 steps, saw 9914 distinct states, run finished after 457 ms. (steps per millisecond=102 ) properties seen :8
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND p0 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND p0 (OR p2 (NOT p1))))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT p2)), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 19 factoid took 663 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 0 reset in 287 ms.
Product exploration explored 100000 steps with 0 reset in 278 ms.
Support contains 5 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 314/314 transitions.
Applied a total of 0 rules in 1 ms. Remains 157 /157 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-06-02 20:06:36] [INFO ] Invariant cache hit.
[2024-06-02 20:06:36] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 20:06:36] [INFO ] Invariant cache hit.
[2024-06-02 20:06:36] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2024-06-02 20:06:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 20:06:39] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-06-02 20:06:40] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-06-02 20:06:40] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-06-02 20:06:40] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-06-02 20:06:40] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2024-06-02 20:06:40] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-06-02 20:06:40] [INFO ] Deduced a trap composed of 91 places in 81 ms of which 3 ms to minimize.
[2024-06-02 20:06:40] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 3 ms to minimize.
[2024-06-02 20:06:40] [INFO ] Deduced a trap composed of 90 places in 155 ms of which 3 ms to minimize.
[2024-06-02 20:06:41] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 3 ms to minimize.
[2024-06-02 20:06:41] [INFO ] Deduced a trap composed of 89 places in 148 ms of which 3 ms to minimize.
[2024-06-02 20:06:41] [INFO ] Deduced a trap composed of 89 places in 151 ms of which 3 ms to minimize.
[2024-06-02 20:06:42] [INFO ] Deduced a trap composed of 103 places in 72 ms of which 2 ms to minimize.
[2024-06-02 20:06:42] [INFO ] Deduced a trap composed of 103 places in 76 ms of which 2 ms to minimize.
[2024-06-02 20:06:42] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
[2024-06-02 20:06:42] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 2 ms to minimize.
[2024-06-02 20:06:42] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 3 ms to minimize.
[2024-06-02 20:06:42] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 2 ms to minimize.
[2024-06-02 20:06:42] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 2 ms to minimize.
[2024-06-02 20:06:43] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 20:06:43] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 2 ms to minimize.
[2024-06-02 20:06:44] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 3 ms to minimize.
[2024-06-02 20:06:44] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 20:06:47] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 3 ms to minimize.
[2024-06-02 20:06:48] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 3 ms to minimize.
[2024-06-02 20:06:48] [INFO ] Deduced a trap composed of 101 places in 160 ms of which 3 ms to minimize.
[2024-06-02 20:06:49] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 20:06:51] [INFO ] Deduced a trap composed of 109 places in 163 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 314/471 variables, 157/192 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 20:06:59] [INFO ] Deduced a trap composed of 109 places in 127 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 471/471 variables, and 193 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-06-02 20:07:10] [INFO ] Deduced a trap composed of 120 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/471 variables, 157/194 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 313/507 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 0/471 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Int declared 471/471 variables, and 507 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 30/30 constraints]
After SMT, in 60096ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Finished structural reductions in LTL mode , in 1 iterations and 60379 ms. Remains : 157/157 places, 314/314 transitions.
Treatment of property MedleyA-PT-16-LTLCardinality-15 finished in 183251 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&&(p1||X(p2))))))'
Found a Lengthening insensitive property : MedleyA-PT-16-LTLCardinality-15
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 5 out of 166 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 166/166 places, 331/331 transitions.
Graph (trivial) has 167 edges and 166 vertex of which 13 / 166 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 155 transition count 291
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 63 place count 126 transition count 287
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 124 transition count 287
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 65 place count 124 transition count 279
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 81 place count 116 transition count 279
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 88 place count 109 transition count 266
Iterating global reduction 3 with 7 rules applied. Total rules applied 95 place count 109 transition count 266
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 100 place count 109 transition count 261
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 100 place count 109 transition count 260
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 102 place count 108 transition count 260
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 148 place count 85 transition count 237
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 153 place count 85 transition count 232
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 157 place count 81 transition count 222
Iterating global reduction 5 with 4 rules applied. Total rules applied 161 place count 81 transition count 222
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 193 place count 65 transition count 317
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 194 place count 64 transition count 316
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 64 edges and 62 vertex of which 18 / 62 are part of one of the 7 SCC in 0 ms
Free SCC test removed 11 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 197 place count 51 transition count 316
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 6 with 41 rules applied. Total rules applied 238 place count 51 transition count 275
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 240 place count 49 transition count 254
Iterating global reduction 7 with 2 rules applied. Total rules applied 242 place count 49 transition count 254
Drop transitions (Redundant composition of simpler transitions.) removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 7 with 44 rules applied. Total rules applied 286 place count 49 transition count 210
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 294 place count 45 transition count 206
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 300 place count 45 transition count 200
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 302 place count 43 transition count 192
Iterating global reduction 8 with 2 rules applied. Total rules applied 304 place count 43 transition count 192
Applied a total of 304 rules in 39 ms. Remains 43 /166 variables (removed 123) and now considering 192/331 (removed 139) transitions.
[2024-06-02 20:07:37] [INFO ] Flow matrix only has 178 transitions (discarded 14 similar events)
// Phase 1: matrix 178 rows 43 cols
[2024-06-02 20:07:37] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 20:07:37] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 20:07:37] [INFO ] Flow matrix only has 178 transitions (discarded 14 similar events)
[2024-06-02 20:07:37] [INFO ] Invariant cache hit.
[2024-06-02 20:07:37] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-06-02 20:07:37] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2024-06-02 20:07:37] [INFO ] Flow matrix only has 178 transitions (discarded 14 similar events)
[2024-06-02 20:07:37] [INFO ] Invariant cache hit.
[2024-06-02 20:07:37] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-02 20:07:38] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-06-02 20:07:38] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2024-06-02 20:07:38] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-06-02 20:07:38] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 2 ms to minimize.
[2024-06-02 20:07:38] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2024-06-02 20:07:39] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 177/220 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 34/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 0/220 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/221 variables, and 88 constraints, problems are : Problem set: 0 solved, 185 unsolved in 7138 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 177/220 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 34/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 185/273 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/221 variables, and 273 constraints, problems are : Problem set: 0 solved, 185 unsolved in 7248 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 6/6 constraints]
After SMT, in 14538ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 14540ms
Starting structural reductions in LI_LTL mode, iteration 1 : 43/166 places, 192/331 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 14776 ms. Remains : 43/166 places, 192/331 transitions.
Running random walk in product with property : MedleyA-PT-16-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 158 ms.
Product exploration explored 100000 steps with 0 reset in 155 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0))), (X p0), (X (AND (NOT p1) p0 p2)), (X (NOT p1)), (X (NOT (AND p1 p0 p2))), (X (X p2)), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 228 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 2547 steps (391 resets) in 50 ms. (49 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0))), (X p0), (X (AND (NOT p1) p0 p2)), (X (NOT p1)), (X (NOT (AND p1 p0 p2))), (X (X p2)), (X (X (NOT (OR (AND p1 (NOT p2)) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT p1))), (X (X (NOT (AND p1 p0 p2))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND p0 (OR p2 (NOT p1))))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT p2)), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 19 factoid took 490 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 192/192 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-06-02 20:07:53] [INFO ] Flow matrix only has 178 transitions (discarded 14 similar events)
[2024-06-02 20:07:53] [INFO ] Invariant cache hit.
[2024-06-02 20:07:53] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 20:07:53] [INFO ] Flow matrix only has 178 transitions (discarded 14 similar events)
[2024-06-02 20:07:53] [INFO ] Invariant cache hit.
[2024-06-02 20:07:53] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-06-02 20:07:53] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2024-06-02 20:07:54] [INFO ] Flow matrix only has 178 transitions (discarded 14 similar events)
[2024-06-02 20:07:54] [INFO ] Invariant cache hit.
[2024-06-02 20:07:54] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-02 20:07:55] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-06-02 20:07:55] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-06-02 20:07:55] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-06-02 20:07:55] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 2 ms to minimize.
[2024-06-02 20:07:55] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-06-02 20:07:55] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 177/220 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 34/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 0/220 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/221 variables, and 88 constraints, problems are : Problem set: 0 solved, 185 unsolved in 7444 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 177/220 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 34/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 185/273 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/221 variables, and 273 constraints, problems are : Problem set: 0 solved, 185 unsolved in 8406 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 6/6 constraints]
After SMT, in 16122ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 16126ms
Finished structural reductions in LTL mode , in 1 iterations and 16401 ms. Remains : 43/43 places, 192/192 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND p0 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 205 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 7533 steps (1160 resets) in 31 ms. (235 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND p0 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND p0 (OR p2 (NOT p1))))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT p2)), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 19 factoid took 634 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 0 reset in 279 ms.
Product exploration explored 100000 steps with 0 reset in 280 ms.
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 192/192 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2024-06-02 20:08:12] [INFO ] Flow matrix only has 178 transitions (discarded 14 similar events)
[2024-06-02 20:08:12] [INFO ] Invariant cache hit.
[2024-06-02 20:08:12] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 20:08:12] [INFO ] Flow matrix only has 178 transitions (discarded 14 similar events)
[2024-06-02 20:08:12] [INFO ] Invariant cache hit.
[2024-06-02 20:08:12] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-06-02 20:08:12] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2024-06-02 20:08:12] [INFO ] Flow matrix only has 178 transitions (discarded 14 similar events)
[2024-06-02 20:08:12] [INFO ] Invariant cache hit.
[2024-06-02 20:08:12] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-02 20:08:13] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-06-02 20:08:13] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2024-06-02 20:08:13] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-06-02 20:08:13] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:08:13] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
[2024-06-02 20:08:14] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 177/220 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 34/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 0/220 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/221 variables, and 88 constraints, problems are : Problem set: 0 solved, 185 unsolved in 6446 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 177/220 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 34/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 185/273 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/221 variables, and 273 constraints, problems are : Problem set: 0 solved, 185 unsolved in 7114 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 6/6 constraints]
After SMT, in 13815ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 13820ms
Finished structural reductions in LTL mode , in 1 iterations and 14080 ms. Remains : 43/43 places, 192/192 transitions.
Treatment of property MedleyA-PT-16-LTLCardinality-15 finished in 49080 ms.
[2024-06-02 20:08:26] [INFO ] Flatten gal took : 21 ms
[2024-06-02 20:08:26] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-02 20:08:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 166 places, 331 transitions and 1044 arcs took 8 ms.
Total runtime 581110 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA MedleyA-PT-16-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717358906738

--------------------
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 MedleyA-PT-16-LTLCardinality-15
ltl formula formula --ltl=/tmp/2124/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 166 places, 331 transitions and 1044 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.050 real 0.020 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2124/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2124/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2124/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2124/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 167 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 167, there are 379 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( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~105!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 935
pnml2lts-mc( 0/ 4): unique states count: 1859
pnml2lts-mc( 0/ 4): unique transitions count: 6647
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 3271
pnml2lts-mc( 0/ 4): - claim found count: 466
pnml2lts-mc( 0/ 4): - claim success count: 1896
pnml2lts-mc( 0/ 4): - cum. max stack depth: 437
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1896 states 6763 transitions, fanout: 3.567
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.050 sec minimum, 0.050 sec on average)
pnml2lts-mc( 0/ 4): States per second: 37920, Transitions per second: 135260
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 12.9 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 334 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~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="MedleyA-PT-16"
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 MedleyA-PT-16, 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 r579-smll-171734921300123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-16.tgz
mv MedleyA-PT-16 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 ;