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.r575-smll-171734919400028.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is MedleyA-PT-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919400028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K 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 28K 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-04-LTLFireability-00
FORMULA_NAME MedleyA-PT-04-LTLFireability-01
FORMULA_NAME MedleyA-PT-04-LTLFireability-02
FORMULA_NAME MedleyA-PT-04-LTLFireability-03
FORMULA_NAME MedleyA-PT-04-LTLFireability-04
FORMULA_NAME MedleyA-PT-04-LTLFireability-05
FORMULA_NAME MedleyA-PT-04-LTLFireability-06
FORMULA_NAME MedleyA-PT-04-LTLFireability-07
FORMULA_NAME MedleyA-PT-04-LTLFireability-08
FORMULA_NAME MedleyA-PT-04-LTLFireability-09
FORMULA_NAME MedleyA-PT-04-LTLFireability-10
FORMULA_NAME MedleyA-PT-04-LTLFireability-11
FORMULA_NAME MedleyA-PT-04-LTLFireability-12
FORMULA_NAME MedleyA-PT-04-LTLFireability-13
FORMULA_NAME MedleyA-PT-04-LTLFireability-14
FORMULA_NAME MedleyA-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717352344170

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:19:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:19:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:19:07] [INFO ] Load time of PNML (sax parser for PT used): 244 ms
[2024-06-02 18:19:07] [INFO ] Transformed 115 places.
[2024-06-02 18:19:07] [INFO ] Transformed 107 transitions.
[2024-06-02 18:19:07] [INFO ] Found NUPN structural information;
[2024-06-02 18:19:07] [INFO ] Parsed PT model containing 115 places and 107 transitions and 300 arcs in 465 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 2 formulas.
FORMULA MedleyA-PT-04-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 114 transition count 107
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 107 transition count 100
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 107 transition count 100
Applied a total of 15 rules in 74 ms. Remains 107 /115 variables (removed 8) and now considering 100/107 (removed 7) transitions.
// Phase 1: matrix 100 rows 107 cols
[2024-06-02 18:19:07] [INFO ] Computed 8 invariants in 32 ms
[2024-06-02 18:19:08] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-06-02 18:19:08] [INFO ] Invariant cache hit.
[2024-06-02 18:19:08] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
Running 99 sub problems to find dead transitions.
[2024-06-02 18:19:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:19:10] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 28 ms to minimize.
[2024-06-02 18:19:10] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 3 ms to minimize.
[2024-06-02 18:19:10] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:19:10] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:19:10] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:19:10] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 2 ms to minimize.
[2024-06-02 18:19:10] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:19:10] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 2 ms to minimize.
[2024-06-02 18:19:10] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
[2024-06-02 18:19:11] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
[2024-06-02 18:19:11] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 2 ms to minimize.
[2024-06-02 18:19:11] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:19:11] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:19:11] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:19:11] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 2 ms to minimize.
[2024-06-02 18:19:11] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:19:12] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:19:12] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 100/207 variables, 107/133 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:19:13] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 4 ms to minimize.
[2024-06-02 18:19:13] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:19:13] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:19:13] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
[2024-06-02 18:19:13] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:19:14] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 6/139 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 0/207 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 139 constraints, problems are : Problem set: 0 solved, 99 unsolved in 8074 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 100/207 variables, 107/139 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 99/238 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:19:18] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 3 ms to minimize.
[2024-06-02 18:19:18] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-06-02 18:19:19] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-06-02 18:19:20] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:19:20] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/207 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 243 constraints, problems are : Problem set: 0 solved, 99 unsolved in 9737 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 29/29 constraints]
After SMT, in 18005ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 18048ms
Starting structural reductions in LTL mode, iteration 1 : 107/115 places, 100/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18957 ms. Remains : 107/115 places, 100/107 transitions.
Support contains 35 out of 107 places after structural reductions.
[2024-06-02 18:19:26] [INFO ] Flatten gal took : 44 ms
[2024-06-02 18:19:26] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:19:26] [INFO ] Input system was already deterministic with 100 transitions.
RANDOM walk for 40000 steps (1112 resets) in 2288 ms. (17 steps per ms) remains 10/32 properties
BEST_FIRST walk for 40002 steps (337 resets) in 431 ms. (92 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (346 resets) in 183 ms. (217 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (296 resets) in 208 ms. (191 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (301 resets) in 469 ms. (85 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (343 resets) in 90 ms. (439 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (342 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (317 resets) in 190 ms. (209 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (339 resets) in 173 ms. (229 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (295 resets) in 146 ms. (272 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (305 resets) in 145 ms. (273 steps per ms) remains 10/10 properties
[2024-06-02 18:19:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 59/74 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 18:19:28] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:19:28] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 12/86 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 18:19:28] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 100/186 variables, 86/97 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 21/207 variables, 21/118 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/207 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 118 constraints, problems are : Problem set: 0 solved, 10 unsolved in 761 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 59/74 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-02 18:19:29] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 12/86 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-02 18:19:29] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:19:29] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 2/14 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 100/186 variables, 86/100 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 3/103 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-02 18:19:29] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
[2024-06-02 18:19:29] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 2/105 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-02 18:19:29] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 1/106 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/186 variables, 0/106 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 21/207 variables, 21/127 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/207 variables, 6/133 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/207 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/207 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 133 constraints, problems are : Problem set: 1 solved, 9 unsolved in 1257 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 9/10 constraints, Known Traps: 9/9 constraints]
After SMT, in 2040ms problems are : Problem set: 1 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 6892 ms.
Support contains 14 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 100/100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 107 transition count 88
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 95 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 94 transition count 87
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 26 place count 94 transition count 77
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 46 place count 84 transition count 77
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 50 place count 80 transition count 73
Iterating global reduction 3 with 4 rules applied. Total rules applied 54 place count 80 transition count 73
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 84 place count 65 transition count 58
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 65 transition count 56
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 88 place count 63 transition count 56
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 89 place count 63 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 62 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 91 place count 61 transition count 55
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 92 place count 61 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 93 place count 60 transition count 54
Applied a total of 93 rules in 61 ms. Remains 60 /107 variables (removed 47) and now considering 54/100 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 60/107 places, 54/100 transitions.
RANDOM walk for 40000 steps (2988 resets) in 341 ms. (116 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1381 resets) in 128 ms. (310 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1403 resets) in 155 ms. (256 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1330 resets) in 175 ms. (227 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1371 resets) in 111 ms. (357 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1401 resets) in 157 ms. (253 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (1390 resets) in 176 ms. (225 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1293 resets) in 192 ms. (207 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (1248 resets) in 118 ms. (336 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1390 resets) in 107 ms. (370 steps per ms) remains 9/9 properties
Finished probabilistic random walk after 169146 steps, run visited all 9 properties in 748 ms. (steps per millisecond=226 )
Probabilistic random walk after 169146 steps, saw 48804 distinct states, run finished after 754 ms. (steps per millisecond=224 ) properties seen :9
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 107 stabilizing places and 100 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 107 transition count 100
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 100 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 100 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 98 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 98 transition count 91
Applied a total of 18 rules in 30 ms. Remains 98 /107 variables (removed 9) and now considering 91/100 (removed 9) transitions.
// Phase 1: matrix 91 rows 98 cols
[2024-06-02 18:19:39] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 18:19:39] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-02 18:19:39] [INFO ] Invariant cache hit.
[2024-06-02 18:19:39] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-06-02 18:19:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:19:40] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:19:41] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
[2024-06-02 18:19:41] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-02 18:19:41] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
[2024-06-02 18:19:41] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:19:41] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:19:41] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/189 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:19:42] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-06-02 18:19:42] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:19:42] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:19:42] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:19:42] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:19:42] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:19:43] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 120 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5316 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 90/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:19:47] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:19:49] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 212 constraints, problems are : Problem set: 0 solved, 90 unsolved in 13608 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 16/16 constraints]
After SMT, in 18982ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 18987ms
Starting structural reductions in LTL mode, iteration 1 : 98/107 places, 91/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19351 ms. Remains : 98/107 places, 91/100 transitions.
Stuttering acceptance computed with spot in 392 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-00
Product exploration explored 100000 steps with 2800 reset in 583 ms.
Product exploration explored 100000 steps with 2814 reset in 345 ms.
Computed a total of 98 stabilizing places and 91 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 98 transition count 91
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0)]
[2024-06-02 18:20:00] [INFO ] Invariant cache hit.
[2024-06-02 18:20:01] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-06-02 18:20:01] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2024-06-02 18:20:01] [INFO ] Computed and/alt/rep : 88/142/88 causal constraints (skipped 2 transitions) in 21 ms.
[2024-06-02 18:20:01] [INFO ] Added : 0 causal constraints over 0 iterations in 48 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Applied a total of 0 rules in 10 ms. Remains 98 /98 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-06-02 18:20:01] [INFO ] Invariant cache hit.
[2024-06-02 18:20:01] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-02 18:20:01] [INFO ] Invariant cache hit.
[2024-06-02 18:20:01] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-06-02 18:20:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:20:02] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:20:02] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 12 ms to minimize.
[2024-06-02 18:20:02] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:20:02] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:20:02] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:20:02] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:20:03] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/189 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:20:04] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
[2024-06-02 18:20:04] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:20:04] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:20:04] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:20:04] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:20:04] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:20:05] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 120 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5381 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 90/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:20:08] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:20:10] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 212 constraints, problems are : Problem set: 0 solved, 90 unsolved in 10548 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 16/16 constraints]
After SMT, in 15972ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 15976ms
Finished structural reductions in LTL mode , in 1 iterations and 16348 ms. Remains : 98/98 places, 91/91 transitions.
Computed a total of 98 stabilizing places and 91 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 98 transition count 91
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
[2024-06-02 18:20:18] [INFO ] Invariant cache hit.
[2024-06-02 18:20:18] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:20:18] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-06-02 18:20:18] [INFO ] Computed and/alt/rep : 88/142/88 causal constraints (skipped 2 transitions) in 7 ms.
[2024-06-02 18:20:18] [INFO ] Added : 0 causal constraints over 0 iterations in 19 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2784 reset in 101 ms.
Product exploration explored 100000 steps with 2797 reset in 248 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 98 transition count 91
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 9 place count 98 transition count 98
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 21 place count 98 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 97 transition count 96
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 97 transition count 96
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 39 place count 97 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 94 transition count 93
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 94 transition count 93
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 94 transition count 117
Deduced a syphon composed of 39 places in 0 ms
Applied a total of 51 rules in 29 ms. Remains 94 /98 variables (removed 4) and now considering 117/91 (removed -26) transitions.
[2024-06-02 18:20:19] [INFO ] Redundant transitions in 3 ms returned []
Running 116 sub problems to find dead transitions.
// Phase 1: matrix 117 rows 94 cols
[2024-06-02 18:20:19] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:20:19] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-06-02 18:20:20] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-02 18:20:20] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:20:20] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-02 18:20:20] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
[2024-06-02 18:20:20] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
[2024-06-02 18:20:20] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
[2024-06-02 18:20:20] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 2 ms to minimize.
[2024-06-02 18:20:20] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
[2024-06-02 18:20:20] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
[2024-06-02 18:20:20] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 2 ms to minimize.
[2024-06-02 18:20:20] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 2 ms to minimize.
[2024-06-02 18:20:20] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 2 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
[2024-06-02 18:20:20] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 13/21 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/21 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 117/211 variables, 94/115 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 3/118 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/118 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/211 variables, 0/118 constraints. Problems are: Problem set: 69 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 118 constraints, problems are : Problem set: 69 solved, 47 unsolved in 3021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 94/94 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 69 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 40/94 variables, 8/8 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 13/21 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/21 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 117/211 variables, 94/115 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 3/118 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 47/165 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/165 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 0/211 variables, 0/165 constraints. Problems are: Problem set: 69 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 165 constraints, problems are : Problem set: 69 solved, 47 unsolved in 3003 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 94/94 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 47/116 constraints, Known Traps: 13/13 constraints]
After SMT, in 6090ms problems are : Problem set: 69 solved, 47 unsolved
Search for dead transitions found 69 dead transitions in 6092ms
Found 69 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 69 transitions
Dead transitions reduction (with SMT) removed 69 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 94/98 places, 48/91 transitions.
Graph (complete) has 152 edges and 94 vertex of which 55 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.3 ms
Discarding 39 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 55 /94 variables (removed 39) and now considering 48/48 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/98 places, 48/91 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6147 ms. Remains : 55/98 places, 48/91 transitions.
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 91/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 91/91 (removed 0) transitions.
// Phase 1: matrix 91 rows 98 cols
[2024-06-02 18:20:25] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:20:25] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 18:20:25] [INFO ] Invariant cache hit.
[2024-06-02 18:20:25] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-06-02 18:20:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:20:26] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-06-02 18:20:26] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:20:26] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:20:26] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:20:26] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:20:26] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:20:27] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/189 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:20:28] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-06-02 18:20:28] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:20:28] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
[2024-06-02 18:20:28] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:20:28] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:20:28] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:20:29] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 120 constraints, problems are : Problem set: 0 solved, 90 unsolved in 6861 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 90/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:20:33] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:20:36] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 212 constraints, problems are : Problem set: 0 solved, 90 unsolved in 13197 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 16/16 constraints]
After SMT, in 20088ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 20091ms
Finished structural reductions in LTL mode , in 1 iterations and 20335 ms. Remains : 98/98 places, 91/91 transitions.
Treatment of property MedleyA-PT-04-LTLFireability-00 finished in 66092 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(X(X(F(p1))))&&p0)))'
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 100 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 100 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 98 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 98 transition count 91
Applied a total of 18 rules in 8 ms. Remains 98 /107 variables (removed 9) and now considering 91/100 (removed 9) transitions.
[2024-06-02 18:20:45] [INFO ] Invariant cache hit.
[2024-06-02 18:20:45] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 18:20:45] [INFO ] Invariant cache hit.
[2024-06-02 18:20:45] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-06-02 18:20:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:20:46] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-06-02 18:20:47] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:20:47] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:20:47] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
[2024-06-02 18:20:47] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
[2024-06-02 18:20:47] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:20:47] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/189 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:20:48] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:20:48] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:20:48] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
[2024-06-02 18:20:48] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:20:48] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:20:48] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:20:50] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 120 constraints, problems are : Problem set: 0 solved, 90 unsolved in 6425 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 90/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:20:54] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:20:56] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 212 constraints, problems are : Problem set: 0 solved, 90 unsolved in 11662 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 16/16 constraints]
After SMT, in 18121ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 18124ms
Starting structural reductions in LTL mode, iteration 1 : 98/107 places, 91/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18389 ms. Remains : 98/107 places, 91/100 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-01
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-01 finished in 18565 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 (F(p2)&&p1)))'
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 106 transition count 84
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 91 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 90 transition count 83
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 32 place count 90 transition count 73
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 52 place count 80 transition count 73
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 55 place count 77 transition count 70
Iterating global reduction 3 with 3 rules applied. Total rules applied 58 place count 77 transition count 70
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 94 place count 59 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 58 transition count 51
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 97 place count 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 98 place count 56 transition count 50
Applied a total of 98 rules in 20 ms. Remains 56 /107 variables (removed 51) and now considering 50/100 (removed 50) transitions.
// Phase 1: matrix 50 rows 56 cols
[2024-06-02 18:21:04] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:21:04] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 18:21:04] [INFO ] Invariant cache hit.
[2024-06-02 18:21:04] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-06-02 18:21:04] [INFO ] Redundant transitions in 1 ms returned []
Running 49 sub problems to find dead transitions.
[2024-06-02 18:21:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-02 18:21:04] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-02 18:21:04] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:21:04] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-06-02 18:21:04] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-02 18:21:04] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 50/105 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 1/106 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/106 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 68 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1471 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 50/105 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 49/116 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 1/106 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/106 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 117 constraints, problems are : Problem set: 0 solved, 49 unsolved in 2617 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 5/5 constraints]
After SMT, in 4124ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 4126ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/107 places, 50/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4369 ms. Remains : 56/107 places, 50/100 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-03
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-03 finished in 4521 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 G((p1||(X(F(p2))&&G(p3))))))'
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 106 transition count 84
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 91 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 90 transition count 83
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 32 place count 90 transition count 73
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 52 place count 80 transition count 73
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 55 place count 77 transition count 70
Iterating global reduction 3 with 3 rules applied. Total rules applied 58 place count 77 transition count 70
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 90 place count 61 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 60 transition count 53
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 93 place count 59 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 94 place count 58 transition count 52
Applied a total of 94 rules in 28 ms. Remains 58 /107 variables (removed 49) and now considering 52/100 (removed 48) transitions.
// Phase 1: matrix 52 rows 58 cols
[2024-06-02 18:21:08] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:21:08] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 18:21:08] [INFO ] Invariant cache hit.
[2024-06-02 18:21:08] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2024-06-02 18:21:08] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2024-06-02 18:21:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-02 18:21:09] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-06-02 18:21:09] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-06-02 18:21:09] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-06-02 18:21:09] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-06-02 18:21:09] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 52/110 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-02 18:21:10] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/110 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 71 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1631 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 52/110 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 51/122 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (OVERLAPS) 0/110 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 122 constraints, problems are : Problem set: 0 solved, 51 unsolved in 2336 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 6/6 constraints]
After SMT, in 4005ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 4007ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/107 places, 52/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4306 ms. Remains : 58/107 places, 52/100 transitions.
Stuttering acceptance computed with spot in 522 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true, (NOT p2), (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-04
Product exploration explored 100000 steps with 12772 reset in 365 ms.
Product exploration explored 100000 steps with 12853 reset in 397 ms.
Computed a total of 58 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 58 transition count 52
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0) p3 p2), (X (NOT p3)), (X (NOT (AND (NOT p1) p3 (NOT p0)))), (X (OR (AND p1 (NOT p0)) (AND p3 (NOT p0)))), (X (NOT (AND p1 p3 (NOT p0)))), (X (AND p1 (NOT p3) (NOT p0))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 (NOT p3) p0))), (X (NOT (AND (NOT p1) p3 p0))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (OR (AND p1 p0) (AND p3 p0)))), (X (NOT (AND (NOT p1) (NOT p3) p0))), (X (OR p1 p3)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR (AND p1 (NOT p0)) (AND p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (X (X (OR p1 p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p1 p0) (AND p3 p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT p0))), (X (X p1)), (F (G p1)), (F (G (NOT p0))), (F (G p3)), (F (G p2))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND p1 p3))), (X (X (NOT (AND p1 p3)))), (X (X (AND p1 (NOT p3) (NOT p0)))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p1 p3 (NOT p0)))), (X (X (NOT (AND p1 p3 (NOT p0)))))]
Knowledge based reduction with 46 factoid took 635 ms. Reduced automaton from 9 states, 34 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p3), (AND (NOT p3) (NOT p1))]
RANDOM walk for 40000 steps (5222 resets) in 275 ms. (144 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40001 steps (2218 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
[2024-06-02 18:21:15] [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 apf1 is UNSAT
After SMT solving in domain Real declared 28/110 variables, and 6 constraints, problems are : Problem set: 1 solved, 0 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 6/7 constraints, State Equation: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 37ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p3 p2), (X (NOT p3)), (X (NOT (AND (NOT p1) p3 (NOT p0)))), (X (OR (AND p1 (NOT p0)) (AND p3 (NOT p0)))), (X (NOT (AND p1 p3 (NOT p0)))), (X (AND p1 (NOT p3) (NOT p0))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 (NOT p3) p0))), (X (NOT (AND (NOT p1) p3 p0))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (OR (AND p1 p0) (AND p3 p0)))), (X (NOT (AND (NOT p1) (NOT p3) p0))), (X (OR p1 p3)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR (AND p1 (NOT p0)) (AND p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (X (X (OR p1 p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) p3 (NOT p0))))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p1 p0) (AND p3 p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT p0))), (X (X p1)), (F (G p1)), (F (G (NOT p0))), (F (G p3)), (F (G p2)), (G (OR p1 p3))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND p1 p3))), (X (X (NOT (AND p1 p3)))), (X (X (AND p1 (NOT p3) (NOT p0)))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (AND p1 p3 (NOT p0)))), (X (X (NOT (AND p1 p3 (NOT p0))))), (F (NOT p1)), (F (NOT (OR p1 (NOT p3)))), (F (NOT p3))]
Knowledge based reduction with 47 factoid took 791 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p3), (AND (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p3), (AND (NOT p3) (NOT p1))]
Support contains 2 out of 58 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 : 58/58 places, 52/52 transitions.
Applied a total of 0 rules in 4 ms. Remains 58 /58 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-06-02 18:21:16] [INFO ] Invariant cache hit.
[2024-06-02 18:21:16] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-02 18:21:16] [INFO ] Invariant cache hit.
[2024-06-02 18:21:16] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2024-06-02 18:21:16] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2024-06-02 18:21:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-02 18:21:17] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:21:17] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:21:17] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:21:17] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:21:17] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (OVERLAPS) 52/110 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-02 18:21:17] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (OVERLAPS) 0/110 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 71 constraints, problems are : Problem set: 0 solved, 51 unsolved in 2056 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 1/58 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 52/110 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 51/122 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (OVERLAPS) 0/110 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 122 constraints, problems are : Problem set: 0 solved, 51 unsolved in 2846 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 6/6 constraints]
After SMT, in 4933ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 4935ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5230 ms. Remains : 58/58 places, 52/52 transitions.
Computed a total of 58 stabilizing places and 52 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 58 transition count 52
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p3 p1), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT p3)), (X p1), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (F (G p3)), (F (G p1))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3))]
Knowledge based reduction with 10 factoid took 320 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p3), (AND (NOT p3) (NOT p1))]
RANDOM walk for 40000 steps (5101 resets) in 97 ms. (408 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (2220 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
[2024-06-02 18:21:22] [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 apf1 is UNSAT
After SMT solving in domain Real declared 28/110 variables, and 6 constraints, problems are : Problem set: 1 solved, 0 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 6/7 constraints, State Equation: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 38ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p3 p1), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT p3)), (X p1), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (F (G p3)), (F (G p1)), (G (OR p3 p1))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (F (NOT p1)), (F (NOT (OR (NOT p3) p1))), (F (NOT p3))]
Knowledge based reduction with 11 factoid took 703 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (AND (NOT p3) (NOT p1)), (NOT p3)]
Stuttering acceptance computed with spot in 111 ms :[true, (AND (NOT p3) (NOT p1)), (NOT p3)]
Stuttering acceptance computed with spot in 194 ms :[true, (AND (NOT p3) (NOT p1)), (NOT p3)]
Product exploration explored 100000 steps with 12787 reset in 194 ms.
Product exploration explored 100000 steps with 12859 reset in 218 ms.
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 52/52 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 56 transition count 50
Applied a total of 4 rules in 7 ms. Remains 56 /58 variables (removed 2) and now considering 50/52 (removed 2) transitions.
// Phase 1: matrix 50 rows 56 cols
[2024-06-02 18:21:23] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:21:23] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-02 18:21:23] [INFO ] Invariant cache hit.
[2024-06-02 18:21:23] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2024-06-02 18:21:23] [INFO ] Redundant transitions in 0 ms returned []
Running 49 sub problems to find dead transitions.
[2024-06-02 18:21:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-02 18:21:24] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:21:24] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:21:24] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 2 ms to minimize.
[2024-06-02 18:21:24] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:21:24] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 50/106 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-02 18:21:25] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/106 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 69 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1547 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/56 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 50/106 variables, 56/69 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 49/118 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/106 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 118 constraints, problems are : Problem set: 0 solved, 49 unsolved in 2197 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 6/6 constraints]
After SMT, in 3777ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 3778ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/58 places, 50/52 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4056 ms. Remains : 56/58 places, 50/52 transitions.
Treatment of property MedleyA-PT-04-LTLFireability-04 finished in 19165 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(G(p1)||F(p2))))'
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 101 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 99 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 99 transition count 92
Applied a total of 16 rules in 3 ms. Remains 99 /107 variables (removed 8) and now considering 92/100 (removed 8) transitions.
// Phase 1: matrix 92 rows 99 cols
[2024-06-02 18:21:27] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:21:27] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 18:21:27] [INFO ] Invariant cache hit.
[2024-06-02 18:21:28] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-02 18:21:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:21:28] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 2 ms to minimize.
[2024-06-02 18:21:29] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-06-02 18:21:29] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:21:29] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:21:29] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 3 ms to minimize.
[2024-06-02 18:21:29] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 5 ms to minimize.
[2024-06-02 18:21:29] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:21:29] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:21:29] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:21:29] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/191 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:21:31] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-06-02 18:21:31] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-06-02 18:21:31] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 120 constraints, problems are : Problem set: 0 solved, 91 unsolved in 4861 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:21:33] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:21:33] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:21:33] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:21:33] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/191 variables, 99/124 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 91/215 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:21:34] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-06-02 18:21:34] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:21:36] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:21:43] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:21:43] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:21:43] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/191 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (OVERLAPS) 0/191 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 221 constraints, problems are : Problem set: 0 solved, 91 unsolved in 22426 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 23/23 constraints]
After SMT, in 27314ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 27316ms
Starting structural reductions in LTL mode, iteration 1 : 99/107 places, 92/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27575 ms. Remains : 99/107 places, 92/100 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-05 finished in 27780 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 101 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 100 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 100 transition count 93
Applied a total of 14 rules in 3 ms. Remains 100 /107 variables (removed 7) and now considering 93/100 (removed 7) transitions.
// Phase 1: matrix 93 rows 100 cols
[2024-06-02 18:21:55] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:21:55] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 18:21:55] [INFO ] Invariant cache hit.
[2024-06-02 18:21:55] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2024-06-02 18:21:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-06-02 18:21:56] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-06-02 18:21:56] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:21:57] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
[2024-06-02 18:21:57] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:21:57] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:21:57] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 2 ms to minimize.
[2024-06-02 18:21:57] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:21:57] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-06-02 18:21:57] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 93/193 variables, 100/117 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-06-02 18:21:58] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-06-02 18:21:58] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:21:58] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 0/193 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 120 constraints, problems are : Problem set: 0 solved, 92 unsolved in 5377 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 93/193 variables, 100/120 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 92/212 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-06-02 18:22:02] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-06-02 18:22:04] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-06-02 18:22:06] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-06-02 18:22:11] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/193 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-06-02 18:22:17] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:22:17] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:22:17] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/193 variables, 3/219 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-06-02 18:22:20] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/193 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/193 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-06-02 18:22:28] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 2 ms to minimize.
[2024-06-02 18:22:28] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/193 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/193 variables, and 222 constraints, problems are : Problem set: 0 solved, 92 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 22/22 constraints]
After SMT, in 35432ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 35434ms
Starting structural reductions in LTL mode, iteration 1 : 100/107 places, 93/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35690 ms. Remains : 100/107 places, 93/100 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-06 finished in 35874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((F((p1&&G(!p2))) U p3)))))'
Support contains 5 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 100 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 100 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 98 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 98 transition count 91
Applied a total of 18 rules in 3 ms. Remains 98 /107 variables (removed 9) and now considering 91/100 (removed 9) transitions.
// Phase 1: matrix 91 rows 98 cols
[2024-06-02 18:22:31] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:22:31] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-06-02 18:22:31] [INFO ] Invariant cache hit.
[2024-06-02 18:22:31] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-06-02 18:22:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:22:32] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 2 ms to minimize.
[2024-06-02 18:22:33] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:22:33] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:22:33] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
[2024-06-02 18:22:33] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 2 ms to minimize.
[2024-06-02 18:22:33] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:22:33] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/189 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:22:34] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-06-02 18:22:34] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:22:34] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:22:34] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:22:34] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:22:34] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:22:36] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 120 constraints, problems are : Problem set: 0 solved, 90 unsolved in 6434 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 90/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:22:40] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:22:42] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 212 constraints, problems are : Problem set: 0 solved, 90 unsolved in 12128 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 16/16 constraints]
After SMT, in 18597ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 18598ms
Starting structural reductions in LTL mode, iteration 1 : 98/107 places, 91/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18976 ms. Remains : 98/107 places, 91/100 transitions.
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (OR (NOT p1) p2), p2]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-07
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-07 finished in 19210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 100 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 100 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 98 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 98 transition count 91
Applied a total of 18 rules in 2 ms. Remains 98 /107 variables (removed 9) and now considering 91/100 (removed 9) transitions.
[2024-06-02 18:22:50] [INFO ] Invariant cache hit.
[2024-06-02 18:22:50] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 18:22:50] [INFO ] Invariant cache hit.
[2024-06-02 18:22:50] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-06-02 18:22:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:22:51] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 2 ms to minimize.
[2024-06-02 18:22:51] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:22:51] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
[2024-06-02 18:22:52] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:22:52] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 2 ms to minimize.
[2024-06-02 18:22:52] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:22:52] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/189 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:22:53] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 3 ms to minimize.
[2024-06-02 18:22:53] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:22:53] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:22:53] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:22:53] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:22:53] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:22:55] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 120 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5869 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 90/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:22:58] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:23:00] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 212 constraints, problems are : Problem set: 0 solved, 90 unsolved in 12068 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 16/16 constraints]
After SMT, in 17977ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 17979ms
Starting structural reductions in LTL mode, iteration 1 : 98/107 places, 91/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18245 ms. Remains : 98/107 places, 91/100 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-08
Product exploration explored 100000 steps with 2787 reset in 176 ms.
Product exploration explored 100000 steps with 2810 reset in 353 ms.
Computed a total of 98 stabilizing places and 91 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 98 transition count 91
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (1121 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (347 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3242930 steps, run timeout after 3001 ms. (steps per millisecond=1080 ) properties seen :0 out of 1
Probabilistic random walk after 3242930 steps, saw 535762 distinct states, run finished after 3008 ms. (steps per millisecond=1078 ) properties seen :0
[2024-06-02 18:23:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/73 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 91/164 variables, 73/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:23:12] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 25/189 variables, 25/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/189 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 107 constraints, problems are : Problem set: 0 solved, 1 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/73 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 91/164 variables, 73/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 25/189 variables, 25/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/189 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 108 constraints, problems are : Problem set: 0 solved, 1 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 258ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 231 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=115 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-04-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-04-LTLFireability-08 finished in 22570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 106 transition count 84
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 91 transition count 82
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 89 transition count 82
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 34 place count 89 transition count 71
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 56 place count 78 transition count 71
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 60 place count 74 transition count 67
Iterating global reduction 3 with 4 rules applied. Total rules applied 64 place count 74 transition count 67
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 100 place count 56 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 55 transition count 48
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 103 place count 54 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 104 place count 53 transition count 47
Applied a total of 104 rules in 17 ms. Remains 53 /107 variables (removed 54) and now considering 47/100 (removed 53) transitions.
// Phase 1: matrix 47 rows 53 cols
[2024-06-02 18:23:13] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 18:23:13] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 18:23:13] [INFO ] Invariant cache hit.
[2024-06-02 18:23:13] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-06-02 18:23:13] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2024-06-02 18:23:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-02 18:23:13] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-02 18:23:13] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-02 18:23:13] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-06-02 18:23:13] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-02 18:23:13] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 47/99 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 1/100 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 65 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1082 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 47/99 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 46/110 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 1/100 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/100 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 111 constraints, problems are : Problem set: 0 solved, 46 unsolved in 2252 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 5/5 constraints]
After SMT, in 3351ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 3352ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/107 places, 47/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3549 ms. Remains : 53/107 places, 47/100 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-09
Product exploration explored 100000 steps with 16923 reset in 163 ms.
Product exploration explored 100000 steps with 16734 reset in 195 ms.
Computed a total of 53 stabilizing places and 47 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 53 transition count 47
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-04-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-04-LTLFireability-09 finished in 4104 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 101 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 99 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 99 transition count 92
Applied a total of 16 rules in 5 ms. Remains 99 /107 variables (removed 8) and now considering 92/100 (removed 8) transitions.
// Phase 1: matrix 92 rows 99 cols
[2024-06-02 18:23:17] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:23:17] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 18:23:17] [INFO ] Invariant cache hit.
[2024-06-02 18:23:17] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-02 18:23:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:23:18] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:23:18] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:23:18] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:23:18] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-02 18:23:18] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:23:18] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:23:18] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:23:18] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 2 ms to minimize.
[2024-06-02 18:23:18] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/116 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:23:19] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-06-02 18:23:19] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:23:20] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:23:20] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:23:20] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:23:20] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 2 ms to minimize.
[2024-06-02 18:23:20] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:23:20] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:23:20] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:23:20] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 126 constraints, problems are : Problem set: 0 solved, 91 unsolved in 5498 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:23:24] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:23:24] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 92/191 variables, 99/128 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 91/219 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:23:25] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:23:26] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:23:27] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:23:32] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/191 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 13 (OVERLAPS) 0/191 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 223 constraints, problems are : Problem set: 0 solved, 91 unsolved in 16799 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 25/25 constraints]
After SMT, in 22327ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 22329ms
Starting structural reductions in LTL mode, iteration 1 : 99/107 places, 92/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22660 ms. Remains : 99/107 places, 92/100 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-10
Product exploration explored 100000 steps with 4832 reset in 101 ms.
Product exploration explored 100000 steps with 4792 reset in 116 ms.
Computed a total of 99 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 92
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 203 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 105 steps (0 resets) in 4 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 11 factoid took 250 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-02 18:23:41] [INFO ] Invariant cache hit.
[2024-06-02 18:23:41] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 18:23:41] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-06-02 18:23:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:23:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 18:23:41] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-06-02 18:23:41] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:23:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-06-02 18:23:41] [INFO ] Computed and/alt/rep : 89/143/89 causal constraints (skipped 2 transitions) in 9 ms.
[2024-06-02 18:23:41] [INFO ] Added : 76 causal constraints over 16 iterations in 199 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 99 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 92/92 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-06-02 18:23:41] [INFO ] Invariant cache hit.
[2024-06-02 18:23:41] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 18:23:41] [INFO ] Invariant cache hit.
[2024-06-02 18:23:41] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-02 18:23:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:23:42] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:23:42] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 3 ms to minimize.
[2024-06-02 18:23:42] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:23:42] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:23:43] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:23:43] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:23:43] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-06-02 18:23:43] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
[2024-06-02 18:23:43] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/116 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:23:44] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:23:44] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:23:44] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:23:44] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:23:44] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:23:44] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:23:44] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:23:45] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:23:45] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 2 ms to minimize.
[2024-06-02 18:23:45] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 126 constraints, problems are : Problem set: 0 solved, 91 unsolved in 5332 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:23:48] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:23:48] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 92/191 variables, 99/128 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 91/219 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:23:49] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:23:50] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:23:51] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:23:57] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/191 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 13 (OVERLAPS) 0/191 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 223 constraints, problems are : Problem set: 0 solved, 91 unsolved in 17814 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 25/25 constraints]
After SMT, in 23166ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 23167ms
Finished structural reductions in LTL mode , in 1 iterations and 23407 ms. Remains : 99/99 places, 92/92 transitions.
Computed a total of 99 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 92
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 72 steps (0 resets) in 5 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-02 18:24:06] [INFO ] Invariant cache hit.
[2024-06-02 18:24:06] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-06-02 18:24:06] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-06-02 18:24:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:24:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 18:24:06] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-06-02 18:24:06] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:24:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-06-02 18:24:06] [INFO ] Computed and/alt/rep : 89/143/89 causal constraints (skipped 2 transitions) in 7 ms.
[2024-06-02 18:24:06] [INFO ] Added : 76 causal constraints over 16 iterations in 175 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4790 reset in 118 ms.
Product exploration explored 100000 steps with 4805 reset in 132 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 92/92 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 99 transition count 92
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 9 place count 99 transition count 98
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 20 place count 99 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 98 transition count 96
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 98 transition count 96
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 38 place count 98 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 95 transition count 93
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 95 transition count 93
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 95 transition count 115
Deduced a syphon composed of 38 places in 0 ms
Applied a total of 50 rules in 17 ms. Remains 95 /99 variables (removed 4) and now considering 115/92 (removed -23) transitions.
[2024-06-02 18:24:07] [INFO ] Redundant transitions in 3 ms returned []
Running 114 sub problems to find dead transitions.
// Phase 1: matrix 115 rows 95 cols
[2024-06-02 18:24:07] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:24:07] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-02 18:24:08] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-02 18:24:08] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 2 ms to minimize.
[2024-06-02 18:24:08] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-02 18:24:08] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
[2024-06-02 18:24:08] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
[2024-06-02 18:24:08] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:24:08] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
[2024-06-02 18:24:08] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
[2024-06-02 18:24:08] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
[2024-06-02 18:24:08] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:24:08] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:24:08] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
[2024-06-02 18:24:08] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 13/21 constraints. Problems are: Problem set: 65 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/21 constraints. Problems are: Problem set: 65 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 115/210 variables, 95/116 constraints. Problems are: Problem set: 65 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 3/119 constraints. Problems are: Problem set: 65 solved, 49 unsolved
[2024-06-02 18:24:09] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 1/120 constraints. Problems are: Problem set: 65 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/120 constraints. Problems are: Problem set: 65 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/210 variables, 0/120 constraints. Problems are: Problem set: 65 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 120 constraints, problems are : Problem set: 65 solved, 49 unsolved in 2901 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 95/95 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 65 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 65 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 39/95 variables, 8/8 constraints. Problems are: Problem set: 65 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 14/22 constraints. Problems are: Problem set: 65 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/22 constraints. Problems are: Problem set: 65 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 115/210 variables, 95/117 constraints. Problems are: Problem set: 65 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 3/120 constraints. Problems are: Problem set: 65 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 49/169 constraints. Problems are: Problem set: 65 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/169 constraints. Problems are: Problem set: 65 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/210 variables, 0/169 constraints. Problems are: Problem set: 65 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 169 constraints, problems are : Problem set: 65 solved, 49 unsolved in 3743 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 95/95 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 49/114 constraints, Known Traps: 14/14 constraints]
After SMT, in 6682ms problems are : Problem set: 65 solved, 49 unsolved
Search for dead transitions found 65 dead transitions in 6685ms
Found 65 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 65 transitions
Dead transitions reduction (with SMT) removed 65 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 95/99 places, 50/92 transitions.
Graph (complete) has 154 edges and 95 vertex of which 57 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.0 ms
Discarding 38 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 57 /95 variables (removed 38) and now considering 50/50 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/99 places, 50/92 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6714 ms. Remains : 57/99 places, 50/92 transitions.
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 92/92 transitions.
Applied a total of 0 rules in 0 ms. Remains 99 /99 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 99 cols
[2024-06-02 18:24:14] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:24:14] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 18:24:14] [INFO ] Invariant cache hit.
[2024-06-02 18:24:14] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-02 18:24:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:24:14] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:24:14] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:24:14] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 2 ms to minimize.
[2024-06-02 18:24:15] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:24:15] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-02 18:24:15] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:24:15] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
[2024-06-02 18:24:15] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
[2024-06-02 18:24:15] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/116 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:24:16] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
[2024-06-02 18:24:16] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:24:16] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:24:16] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
[2024-06-02 18:24:16] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:24:16] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:24:16] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:24:17] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:24:17] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:24:17] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 126 constraints, problems are : Problem set: 0 solved, 91 unsolved in 5352 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:24:20] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:24:20] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 92/191 variables, 99/128 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 91/219 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:24:21] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 2 ms to minimize.
[2024-06-02 18:24:21] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:24:23] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:24:28] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/191 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 13 (OVERLAPS) 0/191 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 223 constraints, problems are : Problem set: 0 solved, 91 unsolved in 17381 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 25/25 constraints]
After SMT, in 22752ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 22753ms
Finished structural reductions in LTL mode , in 1 iterations and 22940 ms. Remains : 99/99 places, 92/92 transitions.
Treatment of property MedleyA-PT-04-LTLFireability-10 finished in 79640 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) U p1)&&p2) U !F((X(p1)||p1))))'
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 101 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 99 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 99 transition count 92
Applied a total of 16 rules in 4 ms. Remains 99 /107 variables (removed 8) and now considering 92/100 (removed 8) transitions.
// Phase 1: matrix 92 rows 99 cols
[2024-06-02 18:24:37] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:24:37] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 18:24:37] [INFO ] Invariant cache hit.
[2024-06-02 18:24:37] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-02 18:24:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:24:38] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:24:38] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 2 ms to minimize.
[2024-06-02 18:24:38] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 2 ms to minimize.
[2024-06-02 18:24:38] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
[2024-06-02 18:24:38] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:24:38] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
[2024-06-02 18:24:39] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 2 ms to minimize.
[2024-06-02 18:24:39] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:24:39] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/191 variables, 99/116 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:24:40] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:24:40] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:24:40] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:24:42] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/191 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 120 constraints, problems are : Problem set: 0 solved, 91 unsolved in 6985 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:24:44] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:24:44] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 2 ms to minimize.
[2024-06-02 18:24:44] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:24:44] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:24:44] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:24:45] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:24:45] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:24:45] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 92/191 variables, 99/128 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 91/219 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:24:46] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:24:47] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:24:48] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:24:52] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/191 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 13 (OVERLAPS) 0/191 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 223 constraints, problems are : Problem set: 0 solved, 91 unsolved in 18006 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 25/25 constraints]
After SMT, in 25011ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 25012ms
Starting structural reductions in LTL mode, iteration 1 : 99/107 places, 92/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25257 ms. Remains : 99/107 places, 92/100 transitions.
Stuttering acceptance computed with spot in 177 ms :[p1, true, p1, p1, (AND p1 (NOT p0))]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-12
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-12 finished in 25454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((G(p0)&&X(p1)) U p1))))'
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 100 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 100 transition count 93
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 98 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 98 transition count 91
Applied a total of 18 rules in 4 ms. Remains 98 /107 variables (removed 9) and now considering 91/100 (removed 9) transitions.
// Phase 1: matrix 91 rows 98 cols
[2024-06-02 18:25:02] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:25:02] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 18:25:02] [INFO ] Invariant cache hit.
[2024-06-02 18:25:02] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-06-02 18:25:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:25:03] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:25:03] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:25:03] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:25:03] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:25:03] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:25:03] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:25:03] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/189 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:25:04] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:25:04] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:25:04] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:25:04] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:25:04] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-02 18:25:04] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:25:05] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 120 constraints, problems are : Problem set: 0 solved, 90 unsolved in 4779 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 90/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:25:08] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:25:10] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 212 constraints, problems are : Problem set: 0 solved, 90 unsolved in 10179 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 16/16 constraints]
After SMT, in 14979ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 14980ms
Starting structural reductions in LTL mode, iteration 1 : 98/107 places, 91/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15237 ms. Remains : 98/107 places, 91/100 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLFireability-13 finished in 15441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 107 transition count 85
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 92 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 90 transition count 83
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 34 place count 90 transition count 73
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 54 place count 80 transition count 73
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 57 place count 77 transition count 70
Iterating global reduction 3 with 3 rules applied. Total rules applied 60 place count 77 transition count 70
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 98 place count 58 transition count 51
Applied a total of 98 rules in 14 ms. Remains 58 /107 variables (removed 49) and now considering 51/100 (removed 49) transitions.
// Phase 1: matrix 51 rows 58 cols
[2024-06-02 18:25:17] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:25:17] [INFO ] Implicit Places using invariants in 60 ms returned [31]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/107 places, 51/100 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 0 with 1 rules applied. Total rules applied 1 place count 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 56 transition count 50
Applied a total of 2 rules in 3 ms. Remains 56 /57 variables (removed 1) and now considering 50/51 (removed 1) transitions.
// Phase 1: matrix 50 rows 56 cols
[2024-06-02 18:25:17] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 18:25:18] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 18:25:18] [INFO ] Invariant cache hit.
[2024-06-02 18:25:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:25:18] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/107 places, 50/100 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 234 ms. Remains : 56/107 places, 50/100 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-14
Product exploration explored 100000 steps with 13575 reset in 112 ms.
Product exploration explored 100000 steps with 13635 reset in 120 ms.
Computed a total of 56 stabilizing places and 50 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 50
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 15 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-04-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-04-LTLFireability-14 finished in 601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G((F(p2)&&p1))))'
Support contains 5 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 101 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 99 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 99 transition count 92
Applied a total of 16 rules in 3 ms. Remains 99 /107 variables (removed 8) and now considering 92/100 (removed 8) transitions.
// Phase 1: matrix 92 rows 99 cols
[2024-06-02 18:25:18] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:25:18] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 18:25:18] [INFO ] Invariant cache hit.
[2024-06-02 18:25:18] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-02 18:25:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:25:19] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:25:19] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:25:19] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:25:19] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-02 18:25:19] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-02 18:25:19] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:25:19] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:25:19] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:25:19] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/191 variables, 99/116 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:25:20] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:25:20] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
[2024-06-02 18:25:20] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:25:21] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/191 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 120 constraints, problems are : Problem set: 0 solved, 91 unsolved in 4750 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:25:23] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-06-02 18:25:23] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:25:23] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:25:23] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-06-02 18:25:24] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:25:24] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:25:24] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:25:24] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (OVERLAPS) 92/191 variables, 99/128 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 91/219 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:25:25] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:25:26] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:25:27] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:25:30] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/191 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 13 (OVERLAPS) 0/191 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 223 constraints, problems are : Problem set: 0 solved, 91 unsolved in 16524 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 25/25 constraints]
After SMT, in 21299ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 21300ms
Starting structural reductions in LTL mode, iteration 1 : 99/107 places, 92/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21497 ms. Remains : 99/107 places, 92/100 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : MedleyA-PT-04-LTLFireability-15
Product exploration explored 100000 steps with 7115 reset in 117 ms.
Product exploration explored 100000 steps with 7122 reset in 128 ms.
Computed a total of 99 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 92
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT p0)), (X p2), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT p0))), (X (X p2)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (G p1)), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 196 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 115 steps (2 resets) in 5 ms. (19 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT p0)), (X p2), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT p0))), (X (X p2)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (G p1)), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT p1)), (F (NOT (AND p1 (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 18 factoid took 516 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 99 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 : 99/99 places, 92/92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 98 transition count 83
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 90 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 89 transition count 82
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 18 place count 89 transition count 70
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 42 place count 77 transition count 70
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 78 place count 59 transition count 52
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 59 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 58 transition count 51
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 83 place count 56 transition count 50
Applied a total of 83 rules in 16 ms. Remains 56 /99 variables (removed 43) and now considering 50/92 (removed 42) transitions.
// Phase 1: matrix 50 rows 56 cols
[2024-06-02 18:25:41] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:25:41] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 18:25:41] [INFO ] Invariant cache hit.
[2024-06-02 18:25:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:25:41] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-06-02 18:25:41] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2024-06-02 18:25:41] [INFO ] Invariant cache hit.
[2024-06-02 18:25:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-02 18:25:42] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-06-02 18:25:42] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-02 18:25:42] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-06-02 18:25:42] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 50/105 variables, 55/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 1/106 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-02 18:25:42] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/106 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 69 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1524 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 50/105 variables, 55/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 48/115 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 1/106 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-02 18:25:44] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/106 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/106 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 118 constraints, problems are : Problem set: 0 solved, 48 unsolved in 3734 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 6/6 constraints]
After SMT, in 5278ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 5280ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/99 places, 50/92 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5456 ms. Remains : 56/99 places, 50/92 transitions.
Computed a total of 56 stabilizing places and 50 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 50
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 879 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p0)]
Knowledge based reduction with 6 factoid took 984 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
[2024-06-02 18:25:49] [INFO ] Invariant cache hit.
[2024-06-02 18:25:49] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-02 18:25:49] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-06-02 18:25:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:25:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-02 18:25:49] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-06-02 18:25:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:25:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-02 18:25:49] [INFO ] Computed and/alt/rep : 46/98/46 causal constraints (skipped 2 transitions) in 8 ms.
[2024-06-02 18:25:49] [INFO ] Added : 29 causal constraints over 6 iterations in 88 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 34898 reset in 140 ms.
Product exploration explored 100000 steps with 34745 reset in 161 ms.
Support contains 1 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 50/50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 54 transition count 48
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 54 transition count 47
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 53 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 52 transition count 46
Applied a total of 5 rules in 7 ms. Remains 52 /56 variables (removed 4) and now considering 46/50 (removed 4) transitions.
// Phase 1: matrix 46 rows 52 cols
[2024-06-02 18:25:50] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 18:25:50] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 18:25:50] [INFO ] Invariant cache hit.
[2024-06-02 18:25:50] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2024-06-02 18:25:50] [INFO ] Redundant transitions in 0 ms returned []
Running 45 sub problems to find dead transitions.
[2024-06-02 18:25:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-02 18:25:50] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:25:50] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:25:50] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-02 18:25:50] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 46/97 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 1/98 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/98 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 63 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1343 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 46/97 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 45/107 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 1/98 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 0/98 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 108 constraints, problems are : Problem set: 0 solved, 45 unsolved in 2139 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 4/4 constraints]
After SMT, in 3514ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 3515ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/56 places, 46/50 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3774 ms. Remains : 52/56 places, 46/50 transitions.
Treatment of property MedleyA-PT-04-LTLFireability-15 finished in 35484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : MedleyA-PT-04-LTLFireability-00
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 107 transition count 83
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 90 transition count 83
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 34 place count 90 transition count 72
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 56 place count 79 transition count 72
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 75 transition count 68
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 75 transition count 68
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 104 place count 55 transition count 48
Applied a total of 104 rules in 9 ms. Remains 55 /107 variables (removed 52) and now considering 48/100 (removed 52) transitions.
// Phase 1: matrix 48 rows 55 cols
[2024-06-02 18:25:54] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:25:54] [INFO ] Implicit Places using invariants in 103 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 54/107 places, 48/100 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 0 with 1 rules applied. Total rules applied 1 place count 54 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 53 transition count 47
Applied a total of 2 rules in 2 ms. Remains 53 /54 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 53 cols
[2024-06-02 18:25:54] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:25:54] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 18:25:54] [INFO ] Invariant cache hit.
[2024-06-02 18:25:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:25:54] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 53/107 places, 47/100 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 353 ms. Remains : 53/107 places, 47/100 transitions.
Running random walk in product with property : MedleyA-PT-04-LTLFireability-00
Product exploration explored 100000 steps with 15085 reset in 250 ms.
Product exploration explored 100000 steps with 15111 reset in 212 ms.
Computed a total of 53 stabilizing places and 47 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 53 transition count 47
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0)]
[2024-06-02 18:25:55] [INFO ] Invariant cache hit.
[2024-06-02 18:25:55] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-02 18:25:55] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-06-02 18:25:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:25:55] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-02 18:25:55] [INFO ] Computed and/alt/rep : 44/174/44 causal constraints (skipped 2 transitions) in 7 ms.
[2024-06-02 18:25:56] [INFO ] Added : 0 causal constraints over 0 iterations in 18 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 47/47 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2024-06-02 18:25:56] [INFO ] Invariant cache hit.
[2024-06-02 18:25:56] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 18:25:56] [INFO ] Invariant cache hit.
[2024-06-02 18:25:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:25:56] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 46 sub problems to find dead transitions.
[2024-06-02 18:25:56] [INFO ] Invariant cache hit.
[2024-06-02 18:25:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-02 18:25:56] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:25:56] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:25:56] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:25:56] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-06-02 18:25:56] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 47/100 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 66 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1774 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 47/100 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 46/112 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/100 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 112 constraints, problems are : Problem set: 0 solved, 46 unsolved in 2528 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 5/5 constraints]
After SMT, in 4331ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 4332ms
Finished structural reductions in LTL mode , in 1 iterations and 4566 ms. Remains : 53/53 places, 47/47 transitions.
Computed a total of 53 stabilizing places and 47 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 53 transition count 47
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (NOT p0)]
[2024-06-02 18:26:01] [INFO ] Invariant cache hit.
[2024-06-02 18:26:01] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-02 18:26:01] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-06-02 18:26:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:26:01] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-02 18:26:01] [INFO ] Computed and/alt/rep : 44/174/44 causal constraints (skipped 2 transitions) in 6 ms.
[2024-06-02 18:26:01] [INFO ] Added : 0 causal constraints over 0 iterations in 18 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 15090 reset in 193 ms.
Product exploration explored 100000 steps with 15080 reset in 213 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 47/47 transitions.
Applied a total of 0 rules in 3 ms. Remains 53 /53 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2024-06-02 18:26:02] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2024-06-02 18:26:02] [INFO ] Invariant cache hit.
[2024-06-02 18:26:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-02 18:26:02] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:26:02] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:26:02] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:26:02] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:26:02] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 47/100 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 66 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1734 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 47/100 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 46/112 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/100 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 112 constraints, problems are : Problem set: 0 solved, 46 unsolved in 2417 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 5/5 constraints]
After SMT, in 4183ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 4185ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4196 ms. Remains : 53/53 places, 47/47 transitions.
Support contains 1 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 47/47 transitions.
Applied a total of 0 rules in 0 ms. Remains 53 /53 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2024-06-02 18:26:06] [INFO ] Invariant cache hit.
[2024-06-02 18:26:06] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 18:26:06] [INFO ] Invariant cache hit.
[2024-06-02 18:26:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:26:06] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 46 sub problems to find dead transitions.
[2024-06-02 18:26:06] [INFO ] Invariant cache hit.
[2024-06-02 18:26:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-02 18:26:07] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:26:07] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:26:07] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:26:07] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:26:07] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 47/100 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 66 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1650 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 47/100 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 46/112 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/100 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 112 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1953 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 5/5 constraints]
After SMT, in 3632ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 3633ms
Finished structural reductions in LTL mode , in 1 iterations and 3874 ms. Remains : 53/53 places, 47/47 transitions.
Treatment of property MedleyA-PT-04-LTLFireability-00 finished in 16428 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 G((p1||(X(F(p2))&&G(p3))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Found a Lengthening insensitive property : MedleyA-PT-04-LTLFireability-10
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 106 transition count 85
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 92 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 91 transition count 84
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 30 place count 91 transition count 74
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 50 place count 81 transition count 74
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 53 place count 78 transition count 71
Iterating global reduction 3 with 3 rules applied. Total rules applied 56 place count 78 transition count 71
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 94 place count 59 transition count 52
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 59 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 58 transition count 51
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 98 place count 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 99 place count 56 transition count 50
Applied a total of 99 rules in 18 ms. Remains 56 /107 variables (removed 51) and now considering 50/100 (removed 50) transitions.
// Phase 1: matrix 50 rows 56 cols
[2024-06-02 18:26:10] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:26:10] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-02 18:26:10] [INFO ] Invariant cache hit.
[2024-06-02 18:26:11] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-06-02 18:26:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-02 18:26:11] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:26:11] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:26:11] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 1/55 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-02 18:26:11] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-02 18:26:11] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-02 18:26:11] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 50/105 variables, 55/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 1/106 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/106 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 69 constraints, problems are : Problem set: 0 solved, 48 unsolved in 2103 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 1/55 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 50/105 variables, 55/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 48/116 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 1/106 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-02 18:26:14] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/106 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 118 constraints, problems are : Problem set: 0 solved, 48 unsolved in 3198 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 7/7 constraints]
After SMT, in 5326ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 5327ms
Starting structural reductions in LI_LTL mode, iteration 1 : 56/107 places, 50/100 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5572 ms. Remains : 56/107 places, 50/100 transitions.
Running random walk in product with property : MedleyA-PT-04-LTLFireability-10
Product exploration explored 100000 steps with 32284 reset in 159 ms.
Product exploration explored 100000 steps with 32165 reset in 181 ms.
Computed a total of 56 stabilizing places and 50 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 50
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 600 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 5 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0)]
Knowledge based reduction with 7 factoid took 663 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
[2024-06-02 18:26:18] [INFO ] Invariant cache hit.
[2024-06-02 18:26:18] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-02 18:26:18] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-06-02 18:26:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:26:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-02 18:26:18] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-06-02 18:26:18] [INFO ] Computed and/alt/rep : 46/70/46 causal constraints (skipped 2 transitions) in 7 ms.
[2024-06-02 18:26:18] [INFO ] Added : 20 causal constraints over 4 iterations in 59 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 56 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 : 56/56 places, 50/50 transitions.
Applied a total of 0 rules in 7 ms. Remains 56 /56 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-06-02 18:26:18] [INFO ] Invariant cache hit.
[2024-06-02 18:26:18] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 18:26:18] [INFO ] Invariant cache hit.
[2024-06-02 18:26:19] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2024-06-02 18:26:19] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2024-06-02 18:26:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-02 18:26:19] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-02 18:26:19] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:26:19] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 1/55 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-02 18:26:19] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:26:19] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-02 18:26:20] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 50/105 variables, 55/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 1/106 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/106 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 69 constraints, problems are : Problem set: 0 solved, 48 unsolved in 2361 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 1/55 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 50/105 variables, 55/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 48/116 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 1/106 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-02 18:26:22] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/106 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 118 constraints, problems are : Problem set: 0 solved, 48 unsolved in 3239 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 7/7 constraints]
After SMT, in 5628ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 5630ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5885 ms. Remains : 56/56 places, 50/50 transitions.
Computed a total of 56 stabilizing places and 50 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 50
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 245 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 6 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 270 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
[2024-06-02 18:26:25] [INFO ] Invariant cache hit.
[2024-06-02 18:26:25] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-02 18:26:25] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-06-02 18:26:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:26:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-02 18:26:25] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-06-02 18:26:25] [INFO ] Computed and/alt/rep : 46/70/46 causal constraints (skipped 2 transitions) in 8 ms.
[2024-06-02 18:26:25] [INFO ] Added : 20 causal constraints over 4 iterations in 64 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 32289 reset in 151 ms.
Product exploration explored 100000 steps with 32159 reset in 177 ms.
Support contains 1 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 50/50 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 0 with 1 rules applied. Total rules applied 1 place count 56 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 55 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 54 transition count 48
Applied a total of 4 rules in 8 ms. Remains 54 /56 variables (removed 2) and now considering 48/50 (removed 2) transitions.
// Phase 1: matrix 48 rows 54 cols
[2024-06-02 18:26:26] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:26:26] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 18:26:26] [INFO ] Invariant cache hit.
[2024-06-02 18:26:26] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2024-06-02 18:26:26] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2024-06-02 18:26:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-02 18:26:26] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-02 18:26:26] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-02 18:26:26] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 1/53 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-02 18:26:27] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-02 18:26:27] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 48/101 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 1/102 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 66 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1506 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 1/53 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 48/101 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 46/111 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-02 18:26:29] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 1/102 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 0/102 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 113 constraints, problems are : Problem set: 0 solved, 46 unsolved in 2936 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 6/6 constraints]
After SMT, in 4474ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 4475ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/56 places, 48/50 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4739 ms. Remains : 54/56 places, 48/50 transitions.
Treatment of property MedleyA-PT-04-LTLFireability-10 finished in 20500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G((F(p2)&&p1))))'
Found a Shortening insensitive property : MedleyA-PT-04-LTLFireability-15
Stuttering acceptance computed with spot in 224 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 5 out of 107 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 107/107 places, 100/100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 106 transition count 84
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 91 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 90 transition count 83
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 32 place count 90 transition count 73
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 52 place count 80 transition count 73
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 55 place count 77 transition count 70
Iterating global reduction 3 with 3 rules applied. Total rules applied 58 place count 77 transition count 70
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 94 place count 59 transition count 52
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 59 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 58 transition count 51
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 98 place count 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 99 place count 56 transition count 50
Applied a total of 99 rules in 22 ms. Remains 56 /107 variables (removed 51) and now considering 50/100 (removed 50) transitions.
// Phase 1: matrix 50 rows 56 cols
[2024-06-02 18:26:31] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 18:26:31] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-02 18:26:31] [INFO ] Invariant cache hit.
[2024-06-02 18:26:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:26:31] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-06-02 18:26:31] [INFO ] Invariant cache hit.
[2024-06-02 18:26:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-02 18:26:32] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:26:32] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:26:32] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:26:32] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:26:32] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 50/105 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 1/106 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-02 18:26:33] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/106 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 70 constraints, problems are : Problem set: 0 solved, 48 unsolved in 2410 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 50/105 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 48/116 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-02 18:26:35] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 1/106 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/106 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/106 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 119 constraints, problems are : Problem set: 0 solved, 48 unsolved in 3894 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 7/7 constraints]
After SMT, in 6336ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 6338ms
Starting structural reductions in LI_LTL mode, iteration 1 : 56/107 places, 50/100 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6622 ms. Remains : 56/107 places, 50/100 transitions.
Running random walk in product with property : MedleyA-PT-04-LTLFireability-15
Product exploration explored 100000 steps with 34769 reset in 181 ms.
Product exploration explored 100000 steps with 34744 reset in 200 ms.
Computed a total of 56 stabilizing places and 50 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 50
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (F (G p1)), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 2155 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 11 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (F (G p1)), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p0)]
Knowledge based reduction with 11 factoid took 2396 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
[2024-06-02 18:26:43] [INFO ] Invariant cache hit.
[2024-06-02 18:26:43] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-02 18:26:43] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-06-02 18:26:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:26:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-06-02 18:26:43] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-06-02 18:26:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:26:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-02 18:26:43] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:26:43] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-06-02 18:26:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 68 ms
[2024-06-02 18:26:43] [INFO ] Computed and/alt/rep : 46/98/46 causal constraints (skipped 2 transitions) in 7 ms.
[2024-06-02 18:26:43] [INFO ] Added : 34 causal constraints over 7 iterations in 99 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 56 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 : 56/56 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-06-02 18:26:43] [INFO ] Invariant cache hit.
[2024-06-02 18:26:44] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 18:26:44] [INFO ] Invariant cache hit.
[2024-06-02 18:26:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:26:44] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2024-06-02 18:26:44] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2024-06-02 18:26:44] [INFO ] Invariant cache hit.
[2024-06-02 18:26:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-02 18:26:44] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:26:44] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:26:44] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:26:44] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:26:44] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 50/105 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 1/106 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-02 18:26:45] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (OVERLAPS) 0/106 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 70 constraints, problems are : Problem set: 0 solved, 48 unsolved in 2306 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 50/105 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 48/116 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-02 18:26:47] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 1/106 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/106 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 13 (OVERLAPS) 0/106 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 119 constraints, problems are : Problem set: 0 solved, 48 unsolved in 3917 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 7/7 constraints]
After SMT, in 6249ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 6250ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6502 ms. Remains : 56/56 places, 50/50 transitions.
Computed a total of 56 stabilizing places and 50 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 50
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 7 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 212 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2024-06-02 18:26:51] [INFO ] Invariant cache hit.
[2024-06-02 18:26:51] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2024-06-02 18:26:51] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-06-02 18:26:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:26:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-06-02 18:26:51] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-06-02 18:26:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 18:26:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-02 18:26:51] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-02 18:26:51] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-06-02 18:26:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 62 ms
[2024-06-02 18:26:51] [INFO ] Computed and/alt/rep : 46/98/46 causal constraints (skipped 2 transitions) in 7 ms.
[2024-06-02 18:26:51] [INFO ] Added : 34 causal constraints over 7 iterations in 97 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 34871 reset in 149 ms.
Product exploration explored 100000 steps with 34841 reset in 166 ms.
Support contains 1 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 50/50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 55 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 54 transition count 48
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 54 transition count 47
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 53 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 52 transition count 46
Applied a total of 5 rules in 5 ms. Remains 52 /56 variables (removed 4) and now considering 46/50 (removed 4) transitions.
// Phase 1: matrix 46 rows 52 cols
[2024-06-02 18:26:51] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 18:26:52] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 18:26:52] [INFO ] Invariant cache hit.
[2024-06-02 18:26:52] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2024-06-02 18:26:52] [INFO ] Redundant transitions in 1 ms returned []
Running 45 sub problems to find dead transitions.
[2024-06-02 18:26:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-02 18:26:52] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:26:52] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:26:52] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:26:52] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:26:52] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 46/97 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-02 18:26:53] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 1/98 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 0/98 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 65 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1674 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 46/97 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 45/109 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-02 18:26:54] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 1/98 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 0/98 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 111 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1600 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 7/7 constraints]
After SMT, in 3300ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 3301ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/56 places, 46/50 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3567 ms. Remains : 52/56 places, 46/50 transitions.
Treatment of property MedleyA-PT-04-LTLFireability-15 finished in 24450 ms.
[2024-06-02 18:26:55] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:26:55] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-02 18:26:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 107 places, 100 transitions and 285 arcs took 6 ms.
Total runtime 469019 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MedleyA-PT-04

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/403/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 107
TRANSITIONS: 100
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.001s]


SAVING FILE /home/mcc/execution/403/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 3881
MODEL NAME: /home/mcc/execution/403/model
107 places, 100 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA MedleyA-PT-04-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-04-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-04-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-04-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717353049983

--------------------
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

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-04"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is MedleyA-PT-04, 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 r575-smll-171734919400028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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