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-171734921400156.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-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921400156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K 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 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 130K 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-20-LTLFireability-00
FORMULA_NAME MedleyA-PT-20-LTLFireability-01
FORMULA_NAME MedleyA-PT-20-LTLFireability-02
FORMULA_NAME MedleyA-PT-20-LTLFireability-03
FORMULA_NAME MedleyA-PT-20-LTLFireability-04
FORMULA_NAME MedleyA-PT-20-LTLFireability-05
FORMULA_NAME MedleyA-PT-20-LTLFireability-06
FORMULA_NAME MedleyA-PT-20-LTLFireability-07
FORMULA_NAME MedleyA-PT-20-LTLFireability-08
FORMULA_NAME MedleyA-PT-20-LTLFireability-09
FORMULA_NAME MedleyA-PT-20-LTLFireability-10
FORMULA_NAME MedleyA-PT-20-LTLFireability-11
FORMULA_NAME MedleyA-PT-20-LTLFireability-12
FORMULA_NAME MedleyA-PT-20-LTLFireability-13
FORMULA_NAME MedleyA-PT-20-LTLFireability-14
FORMULA_NAME MedleyA-PT-20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717363180133

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 21:19:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 21:19:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:19:43] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2024-06-02 21:19:43] [INFO ] Transformed 273 places.
[2024-06-02 21:19:43] [INFO ] Transformed 518 transitions.
[2024-06-02 21:19:43] [INFO ] Found NUPN structural information;
[2024-06-02 21:19:43] [INFO ] Parsed PT model containing 273 places and 518 transitions and 1795 arcs in 476 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MedleyA-PT-20-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 518/518 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 177 transition count 422
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 177 transition count 422
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 196 place count 177 transition count 418
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 228 place count 145 transition count 326
Iterating global reduction 1 with 32 rules applied. Total rules applied 260 place count 145 transition count 326
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 265 place count 145 transition count 321
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 272 place count 138 transition count 307
Iterating global reduction 2 with 7 rules applied. Total rules applied 279 place count 138 transition count 307
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 281 place count 138 transition count 305
Applied a total of 281 rules in 132 ms. Remains 138 /273 variables (removed 135) and now considering 305/518 (removed 213) transitions.
// Phase 1: matrix 305 rows 138 cols
[2024-06-02 21:19:43] [INFO ] Computed 11 invariants in 82 ms
[2024-06-02 21:19:44] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-06-02 21:19:44] [INFO ] Invariant cache hit.
[2024-06-02 21:19:44] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 957 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2024-06-02 21:19:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 21:19:49] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 30 ms to minimize.
[2024-06-02 21:19:49] [INFO ] Deduced a trap composed of 79 places in 223 ms of which 3 ms to minimize.
[2024-06-02 21:19:49] [INFO ] Deduced a trap composed of 74 places in 168 ms of which 3 ms to minimize.
[2024-06-02 21:19:49] [INFO ] Deduced a trap composed of 80 places in 159 ms of which 3 ms to minimize.
[2024-06-02 21:19:50] [INFO ] Deduced a trap composed of 90 places in 170 ms of which 3 ms to minimize.
[2024-06-02 21:19:50] [INFO ] Deduced a trap composed of 90 places in 248 ms of which 2 ms to minimize.
[2024-06-02 21:19:50] [INFO ] Deduced a trap composed of 87 places in 185 ms of which 12 ms to minimize.
[2024-06-02 21:19:50] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 3 ms to minimize.
[2024-06-02 21:19:50] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 2 ms to minimize.
[2024-06-02 21:19:51] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
[2024-06-02 21:19:51] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 21:19:54] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 4 ms to minimize.
[2024-06-02 21:19:54] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 2 ms to minimize.
[2024-06-02 21:19:55] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 3 ms to minimize.
[2024-06-02 21:19:55] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-06-02 21:19:55] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 3 ms to minimize.
[2024-06-02 21:19:55] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-06-02 21:19:55] [INFO ] Deduced a trap composed of 78 places in 162 ms of which 3 ms to minimize.
[2024-06-02 21:19:56] [INFO ] Deduced a trap composed of 74 places in 152 ms of which 3 ms to minimize.
[2024-06-02 21:19:56] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 21:19:57] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 21:19:59] [INFO ] Deduced a trap composed of 81 places in 170 ms of which 3 ms to minimize.
[2024-06-02 21:19:59] [INFO ] Deduced a trap composed of 75 places in 155 ms of which 3 ms to minimize.
[2024-06-02 21:19:59] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 21:20:02] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 21:20:04] [INFO ] Deduced a trap composed of 85 places in 154 ms of which 3 ms to minimize.
[2024-06-02 21:20:05] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 3 ms to minimize.
[2024-06-02 21:20:05] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 2 ms to minimize.
[2024-06-02 21:20:05] [INFO ] Deduced a trap composed of 73 places in 142 ms of which 2 ms to minimize.
[2024-06-02 21:20:05] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 21:20:06] [INFO ] Deduced a trap composed of 81 places in 147 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 10 (OVERLAPS) 305/443 variables, 138/180 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 21:20:11] [INFO ] Deduced a trap composed of 85 places in 160 ms of which 3 ms to minimize.
[2024-06-02 21:20:11] [INFO ] Deduced a trap composed of 86 places in 146 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 443/443 variables, and 182 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 21:20:18] [INFO ] Deduced a trap composed of 86 places in 156 ms of which 3 ms to minimize.
[2024-06-02 21:20:19] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 21:20:20] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 3 ms to minimize.
[2024-06-02 21:20:20] [INFO ] Deduced a trap composed of 92 places in 161 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 305/443 variables, 138/186 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 304/490 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-06-02 21:20:30] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 3 ms to minimize.
[2024-06-02 21:20:31] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 2 ms to minimize.
[2024-06-02 21:20:31] [INFO ] Deduced a trap composed of 57 places in 161 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/443 variables, and 493 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 40/40 constraints]
After SMT, in 60494ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60535ms
Starting structural reductions in LTL mode, iteration 1 : 138/273 places, 305/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61670 ms. Remains : 138/273 places, 305/518 transitions.
Support contains 31 out of 138 places after structural reductions.
[2024-06-02 21:20:45] [INFO ] Flatten gal took : 105 ms
[2024-06-02 21:20:45] [INFO ] Flatten gal took : 49 ms
[2024-06-02 21:20:46] [INFO ] Input system was already deterministic with 305 transitions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40000 steps (45 resets) in 2045 ms. (19 steps per ms) remains 7/24 properties
BEST_FIRST walk for 40004 steps (28 resets) in 302 ms. (132 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (29 resets) in 207 ms. (192 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (58 resets) in 114 ms. (347 steps per ms) remains 1/2 properties
[2024-06-02 21:20:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp19 is UNSAT
After SMT solving in domain Real declared 36/443 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/10 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/138 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 48ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 11 stabilizing places and 16 stable transitions
FORMULA MedleyA-PT-20-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(p1))))'
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 305/305 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 128 transition count 285
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 128 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 128 transition count 284
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 122 transition count 270
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 122 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 122 transition count 269
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 119 transition count 261
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 119 transition count 261
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 119 transition count 259
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 118 transition count 256
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 118 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 118 transition count 255
Applied a total of 45 rules in 43 ms. Remains 118 /138 variables (removed 20) and now considering 255/305 (removed 50) transitions.
// Phase 1: matrix 255 rows 118 cols
[2024-06-02 21:20:47] [INFO ] Computed 11 invariants in 4 ms
[2024-06-02 21:20:47] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-06-02 21:20:47] [INFO ] Invariant cache hit.
[2024-06-02 21:20:47] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Running 254 sub problems to find dead transitions.
[2024-06-02 21:20:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-06-02 21:20:50] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
[2024-06-02 21:20:51] [INFO ] Deduced a trap composed of 70 places in 150 ms of which 3 ms to minimize.
[2024-06-02 21:20:51] [INFO ] Deduced a trap composed of 69 places in 143 ms of which 3 ms to minimize.
[2024-06-02 21:20:51] [INFO ] Deduced a trap composed of 73 places in 162 ms of which 2 ms to minimize.
[2024-06-02 21:20:51] [INFO ] Deduced a trap composed of 72 places in 126 ms of which 2 ms to minimize.
[2024-06-02 21:20:51] [INFO ] Deduced a trap composed of 72 places in 136 ms of which 2 ms to minimize.
[2024-06-02 21:20:51] [INFO ] Deduced a trap composed of 70 places in 128 ms of which 3 ms to minimize.
[2024-06-02 21:20:52] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 2 ms to minimize.
[2024-06-02 21:20:52] [INFO ] Deduced a trap composed of 56 places in 120 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-06-02 21:20:54] [INFO ] Deduced a trap composed of 69 places in 127 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-06-02 21:20:56] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-06-02 21:20:57] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-06-02 21:21:00] [INFO ] Deduced a trap composed of 67 places in 138 ms of which 2 ms to minimize.
[2024-06-02 21:21:00] [INFO ] Deduced a trap composed of 64 places in 126 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-06-02 21:21:01] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 10 (OVERLAPS) 255/373 variables, 118/144 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-06-02 21:21:06] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/373 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/373 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 13 (OVERLAPS) 0/373 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 373/373 variables, and 145 constraints, problems are : Problem set: 0 solved, 254 unsolved in 27287 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 16/27 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (OVERLAPS) 255/373 variables, 118/145 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 254/399 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-06-02 21:21:20] [INFO ] Deduced a trap composed of 75 places in 126 ms of which 2 ms to minimize.
[2024-06-02 21:21:20] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-06-02 21:21:21] [INFO ] Deduced a trap composed of 67 places in 109 ms of which 2 ms to minimize.
[2024-06-02 21:21:21] [INFO ] Deduced a trap composed of 63 places in 117 ms of which 2 ms to minimize.
[2024-06-02 21:21:21] [INFO ] Deduced a trap composed of 59 places in 124 ms of which 2 ms to minimize.
[2024-06-02 21:21:21] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 2 ms to minimize.
[2024-06-02 21:21:21] [INFO ] Deduced a trap composed of 60 places in 115 ms of which 2 ms to minimize.
[2024-06-02 21:21:21] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 2 ms to minimize.
[2024-06-02 21:21:21] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 9/408 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-06-02 21:21:32] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/373 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/373 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/373 variables, and 409 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 26/26 constraints]
After SMT, in 57521ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 57528ms
Starting structural reductions in LTL mode, iteration 1 : 118/138 places, 255/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58050 ms. Remains : 118/138 places, 255/305 transitions.
Stuttering acceptance computed with spot in 371 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-00
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 3 ms.
FORMULA MedleyA-PT-20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLFireability-00 finished in 58516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(((p2&&F(p3))||p1))))'
Support contains 6 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 305/305 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 129 transition count 288
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 129 transition count 288
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 125 transition count 278
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 125 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 125 transition count 277
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 124 transition count 275
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 124 transition count 275
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 123 transition count 272
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 123 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 123 transition count 271
Applied a total of 32 rules in 18 ms. Remains 123 /138 variables (removed 15) and now considering 271/305 (removed 34) transitions.
// Phase 1: matrix 271 rows 123 cols
[2024-06-02 21:21:45] [INFO ] Computed 11 invariants in 6 ms
[2024-06-02 21:21:46] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-02 21:21:46] [INFO ] Invariant cache hit.
[2024-06-02 21:21:46] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-06-02 21:21:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 21:21:51] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 2 ms to minimize.
[2024-06-02 21:21:51] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-02 21:21:51] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 2 ms to minimize.
[2024-06-02 21:21:51] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 2 ms to minimize.
[2024-06-02 21:21:51] [INFO ] Deduced a trap composed of 65 places in 157 ms of which 2 ms to minimize.
[2024-06-02 21:21:51] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 2 ms to minimize.
[2024-06-02 21:21:51] [INFO ] Deduced a trap composed of 71 places in 157 ms of which 3 ms to minimize.
[2024-06-02 21:21:52] [INFO ] Deduced a trap composed of 71 places in 125 ms of which 3 ms to minimize.
[2024-06-02 21:21:52] [INFO ] Deduced a trap composed of 74 places in 142 ms of which 3 ms to minimize.
[2024-06-02 21:21:52] [INFO ] Deduced a trap composed of 74 places in 129 ms of which 2 ms to minimize.
[2024-06-02 21:21:52] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 3 ms to minimize.
[2024-06-02 21:21:52] [INFO ] Deduced a trap composed of 77 places in 154 ms of which 2 ms to minimize.
[2024-06-02 21:21:52] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 2 ms to minimize.
[2024-06-02 21:21:52] [INFO ] Deduced a trap composed of 73 places in 136 ms of which 2 ms to minimize.
[2024-06-02 21:21:53] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 2 ms to minimize.
[2024-06-02 21:21:53] [INFO ] Deduced a trap composed of 71 places in 128 ms of which 3 ms to minimize.
[2024-06-02 21:21:53] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 21:21:55] [INFO ] Deduced a trap composed of 69 places in 115 ms of which 2 ms to minimize.
[2024-06-02 21:21:55] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 2 ms to minimize.
[2024-06-02 21:21:55] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 21:21:56] [INFO ] Deduced a trap composed of 71 places in 142 ms of which 3 ms to minimize.
[2024-06-02 21:21:57] [INFO ] Deduced a trap composed of 71 places in 156 ms of which 3 ms to minimize.
[2024-06-02 21:21:57] [INFO ] Deduced a trap composed of 85 places in 157 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 21:22:00] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 271/394 variables, 123/158 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 21:22:06] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 21:22:09] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 2 ms to minimize.
[2024-06-02 21:22:09] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 2 ms to minimize.
[2024-06-02 21:22:09] [INFO ] Deduced a trap composed of 71 places in 130 ms of which 3 ms to minimize.
[2024-06-02 21:22:10] [INFO ] Deduced a trap composed of 68 places in 115 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 21:22:13] [INFO ] Deduced a trap composed of 71 places in 125 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/394 variables, and 164 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 21:22:19] [INFO ] Deduced a trap composed of 73 places in 145 ms of which 13 ms to minimize.
[2024-06-02 21:22:19] [INFO ] Deduced a trap composed of 70 places in 117 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 21:22:21] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 271/394 variables, 123/167 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 270/437 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 21:22:27] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 3 ms to minimize.
[2024-06-02 21:22:27] [INFO ] Deduced a trap composed of 59 places in 126 ms of which 2 ms to minimize.
[2024-06-02 21:22:27] [INFO ] Deduced a trap composed of 57 places in 132 ms of which 2 ms to minimize.
[2024-06-02 21:22:27] [INFO ] Deduced a trap composed of 66 places in 114 ms of which 2 ms to minimize.
[2024-06-02 21:22:28] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 3 ms to minimize.
[2024-06-02 21:22:28] [INFO ] Deduced a trap composed of 54 places in 123 ms of which 3 ms to minimize.
[2024-06-02 21:22:28] [INFO ] Deduced a trap composed of 58 places in 118 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 7/444 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/394 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 21:22:40] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 3 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/394 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 445 constraints, problems are : Problem set: 0 solved, 270 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 41/41 constraints]
After SMT, in 60231ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 60237ms
Starting structural reductions in LTL mode, iteration 1 : 123/138 places, 271/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60749 ms. Remains : 123/138 places, 271/305 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), true]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 323 ms.
Product exploration explored 100000 steps with 50000 reset in 343 ms.
Computed a total of 10 stabilizing places and 15 stable transitions
Computed a total of 10 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p1 p2 p3 p0), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p3)))), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 30 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-20-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-20-LTLFireability-02 finished in 61767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 305/305 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 127 transition count 282
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 127 transition count 282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 127 transition count 281
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 122 transition count 269
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 122 transition count 269
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 119 transition count 261
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 119 transition count 261
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 119 transition count 259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 118 transition count 256
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 118 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 118 transition count 255
Applied a total of 44 rules in 19 ms. Remains 118 /138 variables (removed 20) and now considering 255/305 (removed 50) transitions.
// Phase 1: matrix 255 rows 118 cols
[2024-06-02 21:22:47] [INFO ] Computed 11 invariants in 3 ms
[2024-06-02 21:22:47] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-06-02 21:22:47] [INFO ] Invariant cache hit.
[2024-06-02 21:22:48] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Running 254 sub problems to find dead transitions.
[2024-06-02 21:22:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-06-02 21:22:50] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 2 ms to minimize.
[2024-06-02 21:22:50] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
[2024-06-02 21:22:50] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 1 ms to minimize.
[2024-06-02 21:22:51] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 1 ms to minimize.
[2024-06-02 21:22:51] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 1 ms to minimize.
[2024-06-02 21:22:51] [INFO ] Deduced a trap composed of 72 places in 128 ms of which 2 ms to minimize.
[2024-06-02 21:22:51] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 2 ms to minimize.
[2024-06-02 21:22:51] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 2 ms to minimize.
[2024-06-02 21:22:51] [INFO ] Deduced a trap composed of 65 places in 120 ms of which 3 ms to minimize.
[2024-06-02 21:22:51] [INFO ] Deduced a trap composed of 68 places in 128 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-06-02 21:22:54] [INFO ] Deduced a trap composed of 68 places in 111 ms of which 2 ms to minimize.
[2024-06-02 21:22:54] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (OVERLAPS) 255/373 variables, 118/141 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-06-02 21:23:00] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 2 ms to minimize.
[2024-06-02 21:23:00] [INFO ] Deduced a trap composed of 65 places in 121 ms of which 2 ms to minimize.
[2024-06-02 21:23:00] [INFO ] Deduced a trap composed of 63 places in 119 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-06-02 21:23:02] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-06-02 21:23:05] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 2 ms to minimize.
[2024-06-02 21:23:05] [INFO ] Deduced a trap composed of 72 places in 133 ms of which 3 ms to minimize.
[2024-06-02 21:23:05] [INFO ] Deduced a trap composed of 70 places in 135 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-06-02 21:23:10] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/373 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-06-02 21:23:13] [INFO ] Deduced a trap composed of 72 places in 99 ms of which 3 ms to minimize.
[2024-06-02 21:23:13] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 2 ms to minimize.
[2024-06-02 21:23:13] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 2 ms to minimize.
[2024-06-02 21:23:14] [INFO ] Deduced a trap composed of 75 places in 142 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/373 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 12 (INCLUDED_ONLY) 0/373 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 373/373 variables, and 153 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (OVERLAPS) 255/373 variables, 118/153 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 254/407 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-06-02 21:23:23] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-06-02 21:23:23] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 2 ms to minimize.
[2024-06-02 21:23:23] [INFO ] Deduced a trap composed of 88 places in 146 ms of which 3 ms to minimize.
[2024-06-02 21:23:23] [INFO ] Deduced a trap composed of 72 places in 128 ms of which 2 ms to minimize.
[2024-06-02 21:23:23] [INFO ] Deduced a trap composed of 76 places in 138 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 5/412 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 9 (OVERLAPS) 0/373 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 373/373 variables, and 412 constraints, problems are : Problem set: 0 solved, 254 unsolved in 22930 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 29/29 constraints]
After SMT, in 53072ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 53077ms
Starting structural reductions in LTL mode, iteration 1 : 118/138 places, 255/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53539 ms. Remains : 118/138 places, 255/305 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-03
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-20-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLFireability-03 finished in 53665 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 X(X(G((!p0||X(X(!p0))))))))'
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 305/305 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 126 transition count 279
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 126 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 126 transition count 278
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 120 transition count 264
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 120 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 120 transition count 263
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 41 place count 117 transition count 255
Iterating global reduction 2 with 3 rules applied. Total rules applied 44 place count 117 transition count 255
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 117 transition count 253
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 116 transition count 250
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 116 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 116 transition count 249
Applied a total of 49 rules in 14 ms. Remains 116 /138 variables (removed 22) and now considering 249/305 (removed 56) transitions.
// Phase 1: matrix 249 rows 116 cols
[2024-06-02 21:23:41] [INFO ] Computed 11 invariants in 3 ms
[2024-06-02 21:23:41] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 21:23:41] [INFO ] Invariant cache hit.
[2024-06-02 21:23:41] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2024-06-02 21:23:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-02 21:23:44] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:23:44] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 1 ms to minimize.
[2024-06-02 21:23:44] [INFO ] Deduced a trap composed of 68 places in 156 ms of which 2 ms to minimize.
[2024-06-02 21:23:44] [INFO ] Deduced a trap composed of 68 places in 101 ms of which 2 ms to minimize.
[2024-06-02 21:23:45] [INFO ] Deduced a trap composed of 55 places in 146 ms of which 3 ms to minimize.
[2024-06-02 21:23:45] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 2 ms to minimize.
[2024-06-02 21:23:45] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 3 ms to minimize.
[2024-06-02 21:23:45] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 2 ms to minimize.
[2024-06-02 21:23:45] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 1 ms to minimize.
[2024-06-02 21:23:45] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 1 ms to minimize.
[2024-06-02 21:23:45] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-02 21:23:48] [INFO ] Deduced a trap composed of 70 places in 149 ms of which 2 ms to minimize.
[2024-06-02 21:23:48] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 2 ms to minimize.
[2024-06-02 21:23:48] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 2 ms to minimize.
[2024-06-02 21:23:48] [INFO ] Deduced a trap composed of 63 places in 119 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-02 21:23:50] [INFO ] Deduced a trap composed of 71 places in 133 ms of which 2 ms to minimize.
[2024-06-02 21:23:50] [INFO ] Deduced a trap composed of 71 places in 119 ms of which 2 ms to minimize.
[2024-06-02 21:23:50] [INFO ] Deduced a trap composed of 62 places in 114 ms of which 2 ms to minimize.
[2024-06-02 21:23:50] [INFO ] Deduced a trap composed of 61 places in 106 ms of which 3 ms to minimize.
[2024-06-02 21:23:51] [INFO ] Deduced a trap composed of 67 places in 128 ms of which 2 ms to minimize.
[2024-06-02 21:23:51] [INFO ] Deduced a trap composed of 66 places in 97 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-02 21:23:52] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 2 ms to minimize.
[2024-06-02 21:23:52] [INFO ] Deduced a trap composed of 62 places in 123 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (OVERLAPS) 249/365 variables, 116/150 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-02 21:23:56] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-02 21:24:03] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/365 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 13 (OVERLAPS) 0/365 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 152 constraints, problems are : Problem set: 0 solved, 248 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (OVERLAPS) 249/365 variables, 116/152 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 248/400 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-02 21:24:16] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 2 ms to minimize.
[2024-06-02 21:24:17] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 2 ms to minimize.
[2024-06-02 21:24:17] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 2 ms to minimize.
[2024-06-02 21:24:17] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 2 ms to minimize.
[2024-06-02 21:24:17] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 2 ms to minimize.
[2024-06-02 21:24:17] [INFO ] Deduced a trap composed of 63 places in 117 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 6/406 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 406 constraints, problems are : Problem set: 0 solved, 248 unsolved in 22083 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 31/31 constraints]
After SMT, in 52241ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 52244ms
Starting structural reductions in LTL mode, iteration 1 : 116/138 places, 249/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52539 ms. Remains : 116/138 places, 249/305 transitions.
Stuttering acceptance computed with spot in 240 ms :[true, p0, p0, p0, p0, p0, p0]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-04
Entered a terminal (fully accepting) state of product in 596 steps with 15 reset in 2 ms.
FORMULA MedleyA-PT-20-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLFireability-04 finished in 52803 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((X((G((p1||G(p2))) U (!p1&&G((p1||G(p2))))))||p0))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 305/305 transitions.
Graph (trivial) has 91 edges and 138 vertex of which 11 / 138 are part of one of the 2 SCC in 7 ms
Free SCC test removed 9 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Reduce places removed 1 places and 1 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 0 with 2 rules applied. Total rules applied 3 place count 128 transition count 288
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 126 transition count 287
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 6 place count 126 transition count 280
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 20 place count 119 transition count 280
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 32 place count 107 transition count 253
Iterating global reduction 2 with 12 rules applied. Total rules applied 44 place count 107 transition count 253
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 48 place count 107 transition count 249
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 50 place count 106 transition count 248
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 50 place count 106 transition count 247
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 52 place count 105 transition count 247
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 56 place count 101 transition count 237
Iterating global reduction 4 with 4 rules applied. Total rules applied 60 place count 101 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 61 place count 101 transition count 236
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 62 place count 100 transition count 234
Iterating global reduction 5 with 1 rules applied. Total rules applied 63 place count 100 transition count 234
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 64 place count 99 transition count 231
Iterating global reduction 5 with 1 rules applied. Total rules applied 65 place count 99 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 66 place count 99 transition count 230
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 94 place count 85 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 95 place count 85 transition count 215
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 97 place count 83 transition count 209
Iterating global reduction 7 with 2 rules applied. Total rules applied 99 place count 83 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 101 place count 83 transition count 207
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 117 place count 75 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 118 place count 75 transition count 219
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 124 place count 75 transition count 213
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 126 place count 73 transition count 207
Iterating global reduction 9 with 2 rules applied. Total rules applied 128 place count 73 transition count 207
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 130 place count 73 transition count 205
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 132 place count 71 transition count 203
Applied a total of 132 rules in 180 ms. Remains 71 /138 variables (removed 67) and now considering 203/305 (removed 102) transitions.
[2024-06-02 21:24:34] [INFO ] Flow matrix only has 195 transitions (discarded 8 similar events)
// Phase 1: matrix 195 rows 71 cols
[2024-06-02 21:24:34] [INFO ] Computed 11 invariants in 3 ms
[2024-06-02 21:24:34] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-02 21:24:34] [INFO ] Flow matrix only has 195 transitions (discarded 8 similar events)
[2024-06-02 21:24:34] [INFO ] Invariant cache hit.
[2024-06-02 21:24:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 21:24:34] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2024-06-02 21:24:34] [INFO ] Redundant transitions in 16 ms returned []
Running 185 sub problems to find dead transitions.
[2024-06-02 21:24:34] [INFO ] Flow matrix only has 195 transitions (discarded 8 similar events)
[2024-06-02 21:24:34] [INFO ] Invariant cache hit.
[2024-06-02 21:24:34] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 3/70 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 1/71 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-02 21:24:37] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-06-02 21:24:37] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-02 21:24:38] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 194/265 variables, 71/85 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-02 21:24:42] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/266 variables, and 88 constraints, problems are : Problem set: 0 solved, 185 unsolved in 11809 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 3/70 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 1/71 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 194/265 variables, 71/86 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 185/273 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (OVERLAPS) 0/265 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/266 variables, and 273 constraints, problems are : Problem set: 0 solved, 185 unsolved in 10113 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 4/4 constraints]
After SMT, in 22038ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 22041ms
Starting structural reductions in SI_LTL mode, iteration 1 : 71/138 places, 203/305 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22615 ms. Remains : 71/138 places, 203/305 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-05
Product exploration explored 100000 steps with 2 reset in 422 ms.
Product exploration explored 100000 steps with 4 reset in 313 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2)))))]
Knowledge based reduction with 17 factoid took 828 ms. Reduced automaton from 5 states, 25 edges and 3 AP (stutter insensitive) to 5 states, 32 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 256 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 18 to 13
RANDOM walk for 40000 steps (18 resets) in 943 ms. (42 steps per ms) remains 7/13 properties
BEST_FIRST walk for 40002 steps (16 resets) in 553 ms. (72 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (26 resets) in 580 ms. (68 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40001 steps (45 resets) in 236 ms. (168 steps per ms) remains 3/4 properties
[2024-06-02 21:24:59] [INFO ] Flow matrix only has 195 transitions (discarded 8 similar events)
[2024-06-02 21:24:59] [INFO ] Invariant cache hit.
[2024-06-02 21:24:59] [INFO ] State equation strengthened by 2 read => feed constraints.
Problem apf2 is UNSAT
Problem apf3 is UNSAT
Problem apf4 is UNSAT
After SMT solving in domain Real declared 4/266 variables, and 0 constraints, problems are : Problem set: 3 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/71 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 31ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (G (OR p2 p0 p1)), (G (OR (NOT p2) (NOT p0) (NOT p1))), (G (OR p2 p0 p1)), (G (OR p2 (NOT p0) (NOT p1))), (G (OR (NOT p2) p0 p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (AND (OR (NOT p2) (NOT p0)) (OR (NOT p2) (NOT p1))))), (F (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F p2), (F (NOT (AND (OR (NOT p2) p0) (OR p0 (NOT p1))))), (F (NOT (AND (OR (NOT p2) (NOT p0)) (OR (NOT p0) (NOT p1))))), (F p1), (F (NOT (AND (NOT p2) p0 (NOT p1)))), (F (NOT (OR p2 p0 (NOT p1))))]
Knowledge based reduction with 23 factoid took 1545 ms. Reduced automaton from 5 states, 32 edges and 3 AP (stutter insensitive) to 5 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 298 ms :[p1, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 317 ms :[p1, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 203/203 transitions.
Applied a total of 0 rules in 26 ms. Remains 71 /71 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2024-06-02 21:25:01] [INFO ] Flow matrix only has 195 transitions (discarded 8 similar events)
[2024-06-02 21:25:01] [INFO ] Invariant cache hit.
[2024-06-02 21:25:02] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-06-02 21:25:02] [INFO ] Flow matrix only has 195 transitions (discarded 8 similar events)
[2024-06-02 21:25:02] [INFO ] Invariant cache hit.
[2024-06-02 21:25:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 21:25:02] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
[2024-06-02 21:25:02] [INFO ] Redundant transitions in 13 ms returned []
Running 185 sub problems to find dead transitions.
[2024-06-02 21:25:02] [INFO ] Flow matrix only has 195 transitions (discarded 8 similar events)
[2024-06-02 21:25:02] [INFO ] Invariant cache hit.
[2024-06-02 21:25:02] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 3/70 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 1/71 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-02 21:25:05] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
[2024-06-02 21:25:06] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-02 21:25:06] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 194/265 variables, 71/85 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-02 21:25:10] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/266 variables, and 88 constraints, problems are : Problem set: 0 solved, 185 unsolved in 12506 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 3/70 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 1/71 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 194/265 variables, 71/86 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 185/273 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (OVERLAPS) 0/265 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/266 variables, and 273 constraints, problems are : Problem set: 0 solved, 185 unsolved in 9488 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 4/4 constraints]
After SMT, in 22171ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 22176ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 22799 ms. Remains : 71/71 places, 203/203 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p1)), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 5 factoid took 557 ms. Reduced automaton from 5 states, 18 edges and 2 AP (stutter insensitive) to 5 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 271 ms :[p1, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (38 resets) in 406 ms. (98 steps per ms) remains 3/6 properties
BEST_FIRST walk for 31034 steps (13 resets) in 442 ms. (70 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p1)), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F p1), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F p2), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p1))))]
Knowledge based reduction with 5 factoid took 603 ms. Reduced automaton from 5 states, 18 edges and 2 AP (stutter insensitive) to 5 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 277 ms :[p1, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 271 ms :[p1, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 266 ms :[p1, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 8 reset in 218 ms.
Product exploration explored 100000 steps with 17 reset in 302 ms.
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 203/203 transitions.
Applied a total of 0 rules in 11 ms. Remains 71 /71 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2024-06-02 21:25:28] [INFO ] Flow matrix only has 195 transitions (discarded 8 similar events)
[2024-06-02 21:25:28] [INFO ] Invariant cache hit.
[2024-06-02 21:25:28] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-02 21:25:28] [INFO ] Flow matrix only has 195 transitions (discarded 8 similar events)
[2024-06-02 21:25:28] [INFO ] Invariant cache hit.
[2024-06-02 21:25:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 21:25:28] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-06-02 21:25:28] [INFO ] Redundant transitions in 3 ms returned []
Running 185 sub problems to find dead transitions.
[2024-06-02 21:25:28] [INFO ] Flow matrix only has 195 transitions (discarded 8 similar events)
[2024-06-02 21:25:28] [INFO ] Invariant cache hit.
[2024-06-02 21:25:28] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 3/70 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 1/71 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-02 21:25:31] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 2 ms to minimize.
[2024-06-02 21:25:31] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-02 21:25:32] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 194/265 variables, 71/85 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-06-02 21:25:36] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/266 variables, and 88 constraints, problems are : Problem set: 0 solved, 185 unsolved in 12187 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 3/70 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 1/71 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 194/265 variables, 71/86 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 185/273 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (OVERLAPS) 0/265 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/266 variables, and 273 constraints, problems are : Problem set: 0 solved, 185 unsolved in 9450 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 4/4 constraints]
After SMT, in 21732ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 21735ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 22082 ms. Remains : 71/71 places, 203/203 transitions.
Treatment of property MedleyA-PT-20-LTLFireability-05 finished in 76126 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(p0)||X((p1||F(G(p1))))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 305/305 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 127 transition count 282
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 127 transition count 282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 127 transition count 281
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 122 transition count 269
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 122 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 122 transition count 268
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 119 transition count 260
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 119 transition count 260
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 119 transition count 258
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 118 transition count 255
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 118 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 118 transition count 254
Applied a total of 45 rules in 15 ms. Remains 118 /138 variables (removed 20) and now considering 254/305 (removed 51) transitions.
// Phase 1: matrix 254 rows 118 cols
[2024-06-02 21:25:50] [INFO ] Computed 11 invariants in 3 ms
[2024-06-02 21:25:50] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-02 21:25:50] [INFO ] Invariant cache hit.
[2024-06-02 21:25:50] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2024-06-02 21:25:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-02 21:25:53] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 2 ms to minimize.
[2024-06-02 21:25:53] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 2 ms to minimize.
[2024-06-02 21:25:53] [INFO ] Deduced a trap composed of 70 places in 153 ms of which 3 ms to minimize.
[2024-06-02 21:25:53] [INFO ] Deduced a trap composed of 70 places in 153 ms of which 2 ms to minimize.
[2024-06-02 21:25:53] [INFO ] Deduced a trap composed of 73 places in 155 ms of which 3 ms to minimize.
[2024-06-02 21:25:53] [INFO ] Deduced a trap composed of 72 places in 148 ms of which 2 ms to minimize.
[2024-06-02 21:25:54] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 2 ms to minimize.
[2024-06-02 21:25:54] [INFO ] Deduced a trap composed of 68 places in 125 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-02 21:25:56] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 2 ms to minimize.
[2024-06-02 21:25:57] [INFO ] Deduced a trap composed of 65 places in 120 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 254/372 variables, 118/139 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-02 21:26:02] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-02 21:26:04] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 10 (OVERLAPS) 0/372 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 141 constraints, problems are : Problem set: 0 solved, 253 unsolved in 23010 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 254/372 variables, 118/141 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 253/394 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-06-02 21:26:19] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 2 ms to minimize.
[2024-06-02 21:26:19] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 2 ms to minimize.
[2024-06-02 21:26:19] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 2 ms to minimize.
[2024-06-02 21:26:19] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 2 ms to minimize.
[2024-06-02 21:26:19] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 5/399 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (OVERLAPS) 0/372 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 399 constraints, problems are : Problem set: 0 solved, 253 unsolved in 21244 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 17/17 constraints]
After SMT, in 44360ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 44363ms
Starting structural reductions in LTL mode, iteration 1 : 118/138 places, 254/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44780 ms. Remains : 118/138 places, 254/305 transitions.
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-07
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLFireability-07 finished in 45070 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((!p0 U p1))&&X(G(p0))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 305/305 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 128 transition count 283
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 128 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 128 transition count 282
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 124 transition count 273
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 124 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 124 transition count 272
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 33 place count 121 transition count 264
Iterating global reduction 2 with 3 rules applied. Total rules applied 36 place count 121 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 38 place count 121 transition count 262
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 120 transition count 259
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 120 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 41 place count 120 transition count 258
Applied a total of 41 rules in 18 ms. Remains 120 /138 variables (removed 18) and now considering 258/305 (removed 47) transitions.
// Phase 1: matrix 258 rows 120 cols
[2024-06-02 21:26:35] [INFO ] Computed 11 invariants in 4 ms
[2024-06-02 21:26:35] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-06-02 21:26:35] [INFO ] Invariant cache hit.
[2024-06-02 21:26:35] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-06-02 21:26:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-06-02 21:26:38] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 1 ms to minimize.
[2024-06-02 21:26:38] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 2 ms to minimize.
[2024-06-02 21:26:38] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 2 ms to minimize.
[2024-06-02 21:26:38] [INFO ] Deduced a trap composed of 64 places in 158 ms of which 3 ms to minimize.
[2024-06-02 21:26:38] [INFO ] Deduced a trap composed of 71 places in 153 ms of which 3 ms to minimize.
[2024-06-02 21:26:39] [INFO ] Deduced a trap composed of 71 places in 158 ms of which 2 ms to minimize.
[2024-06-02 21:26:39] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 2 ms to minimize.
[2024-06-02 21:26:39] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 2 ms to minimize.
[2024-06-02 21:26:39] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 2 ms to minimize.
[2024-06-02 21:26:39] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 2 ms to minimize.
[2024-06-02 21:26:39] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 1 ms to minimize.
[2024-06-02 21:26:39] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 1 ms to minimize.
[2024-06-02 21:26:39] [INFO ] Deduced a trap composed of 71 places in 111 ms of which 2 ms to minimize.
[2024-06-02 21:26:39] [INFO ] Deduced a trap composed of 78 places in 125 ms of which 2 ms to minimize.
[2024-06-02 21:26:40] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 2 ms to minimize.
[2024-06-02 21:26:40] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 16/27 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-06-02 21:26:42] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 3 ms to minimize.
[2024-06-02 21:26:43] [INFO ] Deduced a trap composed of 75 places in 149 ms of which 3 ms to minimize.
[2024-06-02 21:26:43] [INFO ] Deduced a trap composed of 77 places in 125 ms of which 3 ms to minimize.
[2024-06-02 21:26:43] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 2 ms to minimize.
[2024-06-02 21:26:43] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 3 ms to minimize.
[2024-06-02 21:26:44] [INFO ] Deduced a trap composed of 64 places in 149 ms of which 3 ms to minimize.
[2024-06-02 21:26:44] [INFO ] Deduced a trap composed of 65 places in 155 ms of which 2 ms to minimize.
[2024-06-02 21:26:44] [INFO ] Deduced a trap composed of 71 places in 150 ms of which 2 ms to minimize.
[2024-06-02 21:26:44] [INFO ] Deduced a trap composed of 65 places in 153 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 258/378 variables, 120/156 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-06-02 21:26:52] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 2 ms to minimize.
[2024-06-02 21:26:52] [INFO ] Deduced a trap composed of 77 places in 125 ms of which 2 ms to minimize.
[2024-06-02 21:26:52] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 3 ms to minimize.
[2024-06-02 21:26:52] [INFO ] Deduced a trap composed of 72 places in 129 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/378 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-06-02 21:26:55] [INFO ] Deduced a trap composed of 69 places in 105 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 11 (OVERLAPS) 0/378 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 161 constraints, problems are : Problem set: 0 solved, 257 unsolved in 28936 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/120 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 30/41 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 258/378 variables, 120/161 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 257/418 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-06-02 21:27:09] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-06-02 21:27:17] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 2 ms to minimize.
[2024-06-02 21:27:17] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 2 ms to minimize.
[2024-06-02 21:27:18] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 2 ms to minimize.
[2024-06-02 21:27:18] [INFO ] Deduced a trap composed of 59 places in 104 ms of which 2 ms to minimize.
[2024-06-02 21:27:18] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 5/424 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/378 variables, and 424 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 36/36 constraints]
After SMT, in 59090ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 59096ms
Starting structural reductions in LTL mode, iteration 1 : 120/138 places, 258/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59578 ms. Remains : 120/138 places, 258/305 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-20-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLFireability-08 finished in 59774 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)||G(p1))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 305/305 transitions.
Graph (trivial) has 108 edges and 138 vertex of which 18 / 138 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 1 places and 1 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 0 with 2 rules applied. Total rules applied 3 place count 122 transition count 278
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 120 transition count 276
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 7 place count 120 transition count 268
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 23 place count 112 transition count 268
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 34 place count 101 transition count 243
Iterating global reduction 2 with 11 rules applied. Total rules applied 45 place count 101 transition count 243
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 50 place count 101 transition count 238
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 100 transition count 237
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 52 place count 100 transition count 236
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 54 place count 99 transition count 236
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 80 place count 86 transition count 223
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 85 place count 81 transition count 208
Iterating global reduction 4 with 5 rules applied. Total rules applied 90 place count 81 transition count 208
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 93 place count 81 transition count 205
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 111 place count 72 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 120 place count 72 transition count 211
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 123 place count 69 transition count 202
Iterating global reduction 5 with 3 rules applied. Total rules applied 126 place count 69 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 129 place count 69 transition count 199
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 131 place count 67 transition count 197
Applied a total of 131 rules in 100 ms. Remains 67 /138 variables (removed 71) and now considering 197/305 (removed 108) transitions.
[2024-06-02 21:27:35] [INFO ] Flow matrix only has 189 transitions (discarded 8 similar events)
// Phase 1: matrix 189 rows 67 cols
[2024-06-02 21:27:35] [INFO ] Computed 11 invariants in 2 ms
[2024-06-02 21:27:35] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-02 21:27:35] [INFO ] Flow matrix only has 189 transitions (discarded 8 similar events)
[2024-06-02 21:27:35] [INFO ] Invariant cache hit.
[2024-06-02 21:27:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 21:27:35] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2024-06-02 21:27:35] [INFO ] Redundant transitions in 4 ms returned []
Running 172 sub problems to find dead transitions.
[2024-06-02 21:27:35] [INFO ] Flow matrix only has 189 transitions (discarded 8 similar events)
[2024-06-02 21:27:35] [INFO ] Invariant cache hit.
[2024-06-02 21:27:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-02 21:27:38] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-02 21:27:39] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 188/255 variables, 67/80 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (OVERLAPS) 0/255 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/256 variables, and 81 constraints, problems are : Problem set: 0 solved, 172 unsolved in 8503 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 188/255 variables, 67/80 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 172/253 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (OVERLAPS) 0/255 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/256 variables, and 253 constraints, problems are : Problem set: 0 solved, 172 unsolved in 7818 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 2/2 constraints]
After SMT, in 16449ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 16453ms
Starting structural reductions in SI_LTL mode, iteration 1 : 67/138 places, 197/305 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16934 ms. Remains : 67/138 places, 197/305 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-09
Product exploration explored 100000 steps with 3 reset in 240 ms.
Product exploration explored 100000 steps with 3 reset in 424 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 203 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (26 resets) in 278 ms. (143 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (248 resets) in 43 ms. (909 steps per ms) remains 1/3 properties
[2024-06-02 21:27:53] [INFO ] Flow matrix only has 189 transitions (discarded 8 similar events)
[2024-06-02 21:27:53] [INFO ] Invariant cache hit.
[2024-06-02 21:27:53] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 33/256 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 4/10 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/67 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 34ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 352 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Support contains 2 out of 67 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 197/197 transitions.
Applied a total of 0 rules in 6 ms. Remains 67 /67 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2024-06-02 21:27:53] [INFO ] Flow matrix only has 189 transitions (discarded 8 similar events)
[2024-06-02 21:27:53] [INFO ] Invariant cache hit.
[2024-06-02 21:27:53] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-02 21:27:53] [INFO ] Flow matrix only has 189 transitions (discarded 8 similar events)
[2024-06-02 21:27:53] [INFO ] Invariant cache hit.
[2024-06-02 21:27:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 21:27:53] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2024-06-02 21:27:53] [INFO ] Redundant transitions in 2 ms returned []
Running 172 sub problems to find dead transitions.
[2024-06-02 21:27:53] [INFO ] Flow matrix only has 189 transitions (discarded 8 similar events)
[2024-06-02 21:27:53] [INFO ] Invariant cache hit.
[2024-06-02 21:27:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-02 21:27:57] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-02 21:27:58] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 188/255 variables, 67/80 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (OVERLAPS) 0/255 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/256 variables, and 81 constraints, problems are : Problem set: 0 solved, 172 unsolved in 9022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 188/255 variables, 67/80 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 172/253 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (OVERLAPS) 0/255 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/256 variables, and 253 constraints, problems are : Problem set: 0 solved, 172 unsolved in 7585 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 2/2 constraints]
After SMT, in 16754ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 16758ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17172 ms. Remains : 67/67 places, 197/197 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
RANDOM walk for 40000 steps (41 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
BEST_FIRST walk for 18202 steps (28 resets) in 21 ms. (827 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
Product exploration explored 100000 steps with 8 reset in 478 ms.
Product exploration explored 100000 steps with 3 reset in 338 ms.
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 197/197 transitions.
Applied a total of 0 rules in 8 ms. Remains 67 /67 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2024-06-02 21:28:12] [INFO ] Flow matrix only has 189 transitions (discarded 8 similar events)
[2024-06-02 21:28:12] [INFO ] Invariant cache hit.
[2024-06-02 21:28:12] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-06-02 21:28:12] [INFO ] Flow matrix only has 189 transitions (discarded 8 similar events)
[2024-06-02 21:28:12] [INFO ] Invariant cache hit.
[2024-06-02 21:28:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 21:28:12] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2024-06-02 21:28:12] [INFO ] Redundant transitions in 1 ms returned []
Running 172 sub problems to find dead transitions.
[2024-06-02 21:28:12] [INFO ] Flow matrix only has 189 transitions (discarded 8 similar events)
[2024-06-02 21:28:12] [INFO ] Invariant cache hit.
[2024-06-02 21:28:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-02 21:28:15] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-02 21:28:16] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 188/255 variables, 67/80 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (OVERLAPS) 0/255 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/256 variables, and 81 constraints, problems are : Problem set: 0 solved, 172 unsolved in 8715 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 188/255 variables, 67/80 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 172/253 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (OVERLAPS) 0/255 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/256 variables, and 253 constraints, problems are : Problem set: 0 solved, 172 unsolved in 7376 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 2/2 constraints]
After SMT, in 16212ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 16220ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16632 ms. Remains : 67/67 places, 197/197 transitions.
Treatment of property MedleyA-PT-20-LTLFireability-09 finished in 53624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 305/305 transitions.
Graph (trivial) has 107 edges and 138 vertex of which 18 / 138 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 1 places and 1 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 0 with 2 rules applied. Total rules applied 3 place count 122 transition count 278
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 120 transition count 276
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 7 place count 120 transition count 267
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 25 place count 111 transition count 267
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 36 place count 100 transition count 242
Iterating global reduction 2 with 11 rules applied. Total rules applied 47 place count 100 transition count 242
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 51 place count 100 transition count 238
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 51 place count 100 transition count 237
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 99 transition count 237
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 79 place count 86 transition count 224
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 84 place count 81 transition count 209
Iterating global reduction 3 with 5 rules applied. Total rules applied 89 place count 81 transition count 209
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 92 place count 81 transition count 206
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 110 place count 72 transition count 221
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 119 place count 72 transition count 212
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 122 place count 69 transition count 203
Iterating global reduction 4 with 3 rules applied. Total rules applied 125 place count 69 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 128 place count 69 transition count 200
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 130 place count 67 transition count 198
Applied a total of 130 rules in 67 ms. Remains 67 /138 variables (removed 71) and now considering 198/305 (removed 107) transitions.
[2024-06-02 21:28:28] [INFO ] Flow matrix only has 188 transitions (discarded 10 similar events)
// Phase 1: matrix 188 rows 67 cols
[2024-06-02 21:28:28] [INFO ] Computed 11 invariants in 1 ms
[2024-06-02 21:28:28] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-02 21:28:28] [INFO ] Flow matrix only has 188 transitions (discarded 10 similar events)
[2024-06-02 21:28:28] [INFO ] Invariant cache hit.
[2024-06-02 21:28:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 21:28:29] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2024-06-02 21:28:29] [INFO ] Redundant transitions in 1 ms returned []
Running 172 sub problems to find dead transitions.
[2024-06-02 21:28:29] [INFO ] Flow matrix only has 188 transitions (discarded 10 similar events)
[2024-06-02 21:28:29] [INFO ] Invariant cache hit.
[2024-06-02 21:28:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (OVERLAPS) 1/67 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-02 21:28:32] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 187/254 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-02 21:28:36] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
[2024-06-02 21:28:36] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/254 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 13 (OVERLAPS) 0/254 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/255 variables, and 82 constraints, problems are : Problem set: 0 solved, 172 unsolved in 10548 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 2/66 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (OVERLAPS) 1/67 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 187/254 variables, 67/81 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 172/254 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (OVERLAPS) 0/254 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/255 variables, and 254 constraints, problems are : Problem set: 0 solved, 172 unsolved in 7392 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 3/3 constraints]
After SMT, in 18066ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 18070ms
Starting structural reductions in SI_LTL mode, iteration 1 : 67/138 places, 198/305 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18466 ms. Remains : 67/138 places, 198/305 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLFireability-11 finished in 18528 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(p0)||F(p1)))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 305/305 transitions.
Graph (trivial) has 109 edges and 138 vertex of which 18 / 138 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 1 places and 1 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 0 with 2 rules applied. Total rules applied 3 place count 122 transition count 278
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 120 transition count 276
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 7 place count 120 transition count 267
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 25 place count 111 transition count 267
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 36 place count 100 transition count 242
Iterating global reduction 2 with 11 rules applied. Total rules applied 47 place count 100 transition count 242
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 52 place count 100 transition count 237
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 54 place count 99 transition count 236
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 54 place count 99 transition count 235
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 56 place count 98 transition count 235
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 80 place count 86 transition count 223
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 85 place count 81 transition count 208
Iterating global reduction 4 with 5 rules applied. Total rules applied 90 place count 81 transition count 208
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 93 place count 81 transition count 205
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 109 place count 73 transition count 219
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 118 place count 73 transition count 210
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 121 place count 70 transition count 201
Iterating global reduction 5 with 3 rules applied. Total rules applied 124 place count 70 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 127 place count 70 transition count 198
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 128 place count 69 transition count 197
Applied a total of 128 rules in 43 ms. Remains 69 /138 variables (removed 69) and now considering 197/305 (removed 108) transitions.
[2024-06-02 21:28:47] [INFO ] Flow matrix only has 187 transitions (discarded 10 similar events)
// Phase 1: matrix 187 rows 69 cols
[2024-06-02 21:28:47] [INFO ] Computed 11 invariants in 2 ms
[2024-06-02 21:28:47] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 21:28:47] [INFO ] Flow matrix only has 187 transitions (discarded 10 similar events)
[2024-06-02 21:28:47] [INFO ] Invariant cache hit.
[2024-06-02 21:28:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 21:28:47] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2024-06-02 21:28:47] [INFO ] Redundant transitions in 0 ms returned []
Running 171 sub problems to find dead transitions.
[2024-06-02 21:28:47] [INFO ] Flow matrix only has 187 transitions (discarded 10 similar events)
[2024-06-02 21:28:47] [INFO ] Invariant cache hit.
[2024-06-02 21:28:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 3/68 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 1/69 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-06-02 21:28:50] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 2 ms to minimize.
[2024-06-02 21:28:50] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 186/255 variables, 69/82 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 11 (OVERLAPS) 0/255 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/256 variables, and 83 constraints, problems are : Problem set: 0 solved, 171 unsolved in 8416 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 3/68 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 1/69 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-06-02 21:28:58] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (OVERLAPS) 186/255 variables, 69/83 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/255 variables, 171/255 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/255 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 13 (OVERLAPS) 0/255 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/256 variables, and 255 constraints, problems are : Problem set: 0 solved, 171 unsolved in 8088 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 3/3 constraints]
After SMT, in 16605ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 16607ms
Starting structural reductions in SI_LTL mode, iteration 1 : 69/138 places, 197/305 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16957 ms. Remains : 69/138 places, 197/305 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-20-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLFireability-14 finished in 17051 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 305/305 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 127 transition count 280
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 127 transition count 280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 127 transition count 279
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 121 transition count 265
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 121 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 121 transition count 264
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 118 transition count 256
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 118 transition count 256
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 118 transition count 254
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 117 transition count 251
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 117 transition count 251
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 117 transition count 250
Applied a total of 47 rules in 13 ms. Remains 117 /138 variables (removed 21) and now considering 250/305 (removed 55) transitions.
// Phase 1: matrix 250 rows 117 cols
[2024-06-02 21:29:04] [INFO ] Computed 11 invariants in 2 ms
[2024-06-02 21:29:04] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-06-02 21:29:04] [INFO ] Invariant cache hit.
[2024-06-02 21:29:04] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2024-06-02 21:29:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-02 21:29:07] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 2 ms to minimize.
[2024-06-02 21:29:07] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
[2024-06-02 21:29:07] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-06-02 21:29:07] [INFO ] Deduced a trap composed of 67 places in 153 ms of which 3 ms to minimize.
[2024-06-02 21:29:08] [INFO ] Deduced a trap composed of 68 places in 151 ms of which 4 ms to minimize.
[2024-06-02 21:29:08] [INFO ] Deduced a trap composed of 68 places in 157 ms of which 2 ms to minimize.
[2024-06-02 21:29:08] [INFO ] Deduced a trap composed of 70 places in 122 ms of which 3 ms to minimize.
[2024-06-02 21:29:08] [INFO ] Deduced a trap composed of 54 places in 145 ms of which 2 ms to minimize.
[2024-06-02 21:29:08] [INFO ] Deduced a trap composed of 74 places in 143 ms of which 2 ms to minimize.
[2024-06-02 21:29:08] [INFO ] Deduced a trap composed of 71 places in 125 ms of which 3 ms to minimize.
[2024-06-02 21:29:08] [INFO ] Deduced a trap composed of 67 places in 117 ms of which 3 ms to minimize.
[2024-06-02 21:29:09] [INFO ] Deduced a trap composed of 61 places in 133 ms of which 2 ms to minimize.
[2024-06-02 21:29:09] [INFO ] Deduced a trap composed of 70 places in 122 ms of which 3 ms to minimize.
[2024-06-02 21:29:09] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 3 ms to minimize.
[2024-06-02 21:29:09] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 2 ms to minimize.
[2024-06-02 21:29:09] [INFO ] Deduced a trap composed of 70 places in 122 ms of which 2 ms to minimize.
[2024-06-02 21:29:09] [INFO ] Deduced a trap composed of 67 places in 119 ms of which 3 ms to minimize.
[2024-06-02 21:29:09] [INFO ] Deduced a trap composed of 63 places in 120 ms of which 2 ms to minimize.
[2024-06-02 21:29:10] [INFO ] Deduced a trap composed of 67 places in 125 ms of which 4 ms to minimize.
[2024-06-02 21:29:10] [INFO ] Deduced a trap composed of 61 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-02 21:29:12] [INFO ] Deduced a trap composed of 66 places in 124 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-02 21:29:13] [INFO ] Deduced a trap composed of 67 places in 125 ms of which 2 ms to minimize.
[2024-06-02 21:29:13] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (OVERLAPS) 250/367 variables, 117/151 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-02 21:29:18] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 2 ms to minimize.
[2024-06-02 21:29:18] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 10 (OVERLAPS) 0/367 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 367/367 variables, and 153 constraints, problems are : Problem set: 0 solved, 249 unsolved in 22267 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (OVERLAPS) 250/367 variables, 117/153 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 249/402 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-02 21:29:31] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
[2024-06-02 21:29:32] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 2 ms to minimize.
[2024-06-02 21:29:32] [INFO ] Deduced a trap composed of 59 places in 123 ms of which 2 ms to minimize.
[2024-06-02 21:29:32] [INFO ] Deduced a trap composed of 59 places in 120 ms of which 3 ms to minimize.
[2024-06-02 21:29:33] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 2 ms to minimize.
[2024-06-02 21:29:33] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 2 ms to minimize.
[2024-06-02 21:29:33] [INFO ] Deduced a trap composed of 64 places in 123 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 7/409 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 9 (OVERLAPS) 0/367 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Int declared 367/367 variables, and 409 constraints, problems are : Problem set: 0 solved, 249 unsolved in 24954 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 32/32 constraints]
After SMT, in 47352ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 47357ms
Starting structural reductions in LTL mode, iteration 1 : 117/138 places, 250/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47804 ms. Remains : 117/138 places, 250/305 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-15
Entered a terminal (fully accepting) state of product in 397 steps with 12 reset in 1 ms.
FORMULA MedleyA-PT-20-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLFireability-15 finished in 47987 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((X((G((p1||G(p2))) U (!p1&&G((p1||G(p2))))))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
[2024-06-02 21:29:53] [INFO ] Flatten gal took : 41 ms
[2024-06-02 21:29:53] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-02 21:29:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 138 places, 305 transitions and 1087 arcs took 13 ms.
Total runtime 610194 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA MedleyA-PT-20-LTLFireability-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MedleyA-PT-20-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717363794385

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name MedleyA-PT-20-LTLFireability-05
ltl formula formula --ltl=/tmp/2193/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 138 places, 305 transitions and 1087 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.150 real 0.010 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2193/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2193/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2193/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2193/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 139 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 139, there are 331 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): ~1084 levels ~10000 states ~43396 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~1634!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 439
pnml2lts-mc( 0/ 4): unique states count: 11474
pnml2lts-mc( 0/ 4): unique transitions count: 57509
pnml2lts-mc( 0/ 4): - self-loop count: 108
pnml2lts-mc( 0/ 4): - claim dead count: 3851
pnml2lts-mc( 0/ 4): - claim found count: 16283
pnml2lts-mc( 0/ 4): - claim success count: 11483
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7288
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 11483 states 57530 transitions, fanout: 5.010
pnml2lts-mc( 0/ 4): Total exploration time 0.320 sec (0.320 sec minimum, 0.320 sec on average)
pnml2lts-mc( 0/ 4): States per second: 35884, Transitions per second: 179781
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.4MB, 11.8 B/state, compr.: 2.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 308 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.4MB (~256.0MB paged-in)
ltl formula name MedleyA-PT-20-LTLFireability-09
ltl formula formula --ltl=/tmp/2193/ltl_1_
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 138 places, 305 transitions and 1087 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2193/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2193/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2193/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2193/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 139 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 139, there are 361 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( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~641!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 900
pnml2lts-mc( 0/ 4): unique states count: 6123
pnml2lts-mc( 0/ 4): unique transitions count: 42854
pnml2lts-mc( 0/ 4): - self-loop count: 142
pnml2lts-mc( 0/ 4): - claim dead count: 4026
pnml2lts-mc( 0/ 4): - claim found count: 11196
pnml2lts-mc( 0/ 4): - claim success count: 6136
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3513
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6136 states 42920 transitions, fanout: 6.995
pnml2lts-mc( 0/ 4): Total exploration time 0.120 sec (0.120 sec minimum, 0.120 sec on average)
pnml2lts-mc( 0/ 4): States per second: 51133, Transitions per second: 357667
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 12.6 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 308 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~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-20"
export BK_EXAMINATION="LTLFireability"
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-20, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r579-smll-171734921400156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-20.tgz
mv MedleyA-PT-20 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;