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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 6.6K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 90K 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-08-LTLFireability-00
FORMULA_NAME MedleyA-PT-08-LTLFireability-01
FORMULA_NAME MedleyA-PT-08-LTLFireability-02
FORMULA_NAME MedleyA-PT-08-LTLFireability-03
FORMULA_NAME MedleyA-PT-08-LTLFireability-04
FORMULA_NAME MedleyA-PT-08-LTLFireability-05
FORMULA_NAME MedleyA-PT-08-LTLFireability-06
FORMULA_NAME MedleyA-PT-08-LTLFireability-07
FORMULA_NAME MedleyA-PT-08-LTLFireability-08
FORMULA_NAME MedleyA-PT-08-LTLFireability-09
FORMULA_NAME MedleyA-PT-08-LTLFireability-10
FORMULA_NAME MedleyA-PT-08-LTLFireability-11
FORMULA_NAME MedleyA-PT-08-LTLFireability-12
FORMULA_NAME MedleyA-PT-08-LTLFireability-13
FORMULA_NAME MedleyA-PT-08-LTLFireability-14
FORMULA_NAME MedleyA-PT-08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717355510007

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-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 19:11:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 19:11:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:11:52] [INFO ] Load time of PNML (sax parser for PT used): 165 ms
[2024-06-02 19:11:52] [INFO ] Transformed 147 places.
[2024-06-02 19:11:52] [INFO ] Transformed 312 transitions.
[2024-06-02 19:11:52] [INFO ] Found NUPN structural information;
[2024-06-02 19:11:52] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 413 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-08-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 312/312 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 145 transition count 312
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 38 place count 109 transition count 268
Iterating global reduction 1 with 36 rules applied. Total rules applied 74 place count 109 transition count 268
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 77 place count 109 transition count 265
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 80 place count 106 transition count 262
Iterating global reduction 2 with 3 rules applied. Total rules applied 83 place count 106 transition count 262
Applied a total of 83 rules in 107 ms. Remains 106 /147 variables (removed 41) and now considering 262/312 (removed 50) transitions.
// Phase 1: matrix 262 rows 106 cols
[2024-06-02 19:11:53] [INFO ] Computed 10 invariants in 30 ms
[2024-06-02 19:11:53] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-06-02 19:11:53] [INFO ] Invariant cache hit.
[2024-06-02 19:11:53] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2024-06-02 19:11:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD224 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 48 solved, 213 unsolved
[2024-06-02 19:11:57] [INFO ] Deduced a trap composed of 40 places in 194 ms of which 24 ms to minimize.
[2024-06-02 19:11:57] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 2 ms to minimize.
[2024-06-02 19:11:58] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:11:58] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-06-02 19:11:58] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-06-02 19:11:58] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:11:58] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:11:58] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 8/18 constraints. Problems are: Problem set: 48 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 48 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 262/368 variables, 106/124 constraints. Problems are: Problem set: 48 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/124 constraints. Problems are: Problem set: 48 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/368 variables, 0/124 constraints. Problems are: Problem set: 48 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 124 constraints, problems are : Problem set: 48 solved, 213 unsolved in 11106 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 48 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 48 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 48 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 48 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 8/18 constraints. Problems are: Problem set: 48 solved, 213 unsolved
[2024-06-02 19:12:07] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-06-02 19:12:07] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 2/20 constraints. Problems are: Problem set: 48 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/20 constraints. Problems are: Problem set: 48 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 262/368 variables, 106/126 constraints. Problems are: Problem set: 48 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 213/339 constraints. Problems are: Problem set: 48 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/339 constraints. Problems are: Problem set: 48 solved, 213 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/339 constraints. Problems are: Problem set: 48 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 339 constraints, problems are : Problem set: 48 solved, 213 unsolved in 16412 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 213/261 constraints, Known Traps: 10/10 constraints]
After SMT, in 28491ms problems are : Problem set: 48 solved, 213 unsolved
Search for dead transitions found 48 dead transitions in 28542ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in LTL mode, iteration 1 : 106/147 places, 214/312 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29516 ms. Remains : 106/147 places, 214/312 transitions.
Support contains 40 out of 106 places after structural reductions.
[2024-06-02 19:12:22] [INFO ] Flatten gal took : 63 ms
[2024-06-02 19:12:22] [INFO ] Flatten gal took : 28 ms
[2024-06-02 19:12:23] [INFO ] Input system was already deterministic with 214 transitions.
Support contains 39 out of 106 places (down from 40) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 33 to 32
RANDOM walk for 40000 steps (1987 resets) in 2379 ms. (16 steps per ms) remains 25/32 properties
BEST_FIRST walk for 4003 steps (61 resets) in 61 ms. (64 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (52 resets) in 53 ms. (74 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (51 resets) in 41 ms. (95 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (55 resets) in 42 ms. (93 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (57 resets) in 55 ms. (71 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (51 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (48 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (62 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (51 resets) in 36 ms. (108 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (57 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (53 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (54 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (59 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (59 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (54 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (50 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (53 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (54 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (61 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (66 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (51 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (52 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (53 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (49 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (61 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
// Phase 1: matrix 214 rows 106 cols
[2024-06-02 19:12:24] [INFO ] Computed 10 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 33/64 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 23 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 3 (OVERLAPS) 28/92 variables, 5/9 constraints. Problems are: Problem set: 3 solved, 22 unsolved
[2024-06-02 19:12:24] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 1/10 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 199/291 variables, 92/102 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/102 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 20/311 variables, 8/110 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 0/110 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 2/313 variables, 1/111 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/313 variables, 2/113 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/113 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 6/319 variables, 3/116 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 0/116 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 1/320 variables, 1/117 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/320 variables, 0/117 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 0/320 variables, 0/117 constraints. Problems are: Problem set: 3 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 117 constraints, problems are : Problem set: 3 solved, 22 unsolved in 1442 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 34/62 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 22 unsolved
[2024-06-02 19:12:25] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 22 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 4 (OVERLAPS) 30/92 variables, 5/10 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 1/11 constraints. Problems are: Problem set: 4 solved, 21 unsolved
[2024-06-02 19:12:26] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:12:26] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 2/13 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/13 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 199/291 variables, 92/105 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 8/113 constraints. Problems are: Problem set: 4 solved, 21 unsolved
[2024-06-02 19:12:26] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 1/114 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 0/114 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 20/311 variables, 8/122 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/311 variables, 13/135 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/311 variables, 0/135 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 15 (OVERLAPS) 2/313 variables, 1/136 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/313 variables, 2/138 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/313 variables, 0/138 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 18 (OVERLAPS) 6/319 variables, 3/141 constraints. Problems are: Problem set: 4 solved, 21 unsolved
[2024-06-02 19:12:28] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:12:28] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/319 variables, 2/143 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/319 variables, 0/143 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 21 (OVERLAPS) 1/320 variables, 1/144 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/320 variables, 0/144 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 23 (OVERLAPS) 0/320 variables, 0/144 constraints. Problems are: Problem set: 4 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 144 constraints, problems are : Problem set: 4 solved, 21 unsolved in 4346 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 21/25 constraints, Known Traps: 7/7 constraints]
After SMT, in 5847ms problems are : Problem set: 4 solved, 21 unsolved
Fused 21 Parikh solutions to 20 different solutions.
Parikh walk visited 18 properties in 9850 ms.
Support contains 8 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 214/214 transitions.
Graph (complete) has 390 edges and 106 vertex of which 101 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 101 transition count 188
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 39 place count 88 transition count 186
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 39 place count 88 transition count 184
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 86 transition count 184
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 49 place count 80 transition count 168
Iterating global reduction 2 with 6 rules applied. Total rules applied 55 place count 80 transition count 168
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 78 transition count 163
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 78 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 77 transition count 160
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 77 transition count 160
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 88 place count 63 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 90 place count 63 transition count 145
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 61 transition count 141
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 61 transition count 141
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 108 place count 54 transition count 179
Drop transitions (Redundant composition of simpler transitions.) removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 3 with 44 rules applied. Total rules applied 152 place count 54 transition count 135
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 158 place count 51 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 160 place count 51 transition count 164
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 51 transition count 161
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 166 place count 48 transition count 161
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 168 place count 48 transition count 159
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 170 place count 46 transition count 159
Applied a total of 170 rules in 101 ms. Remains 46 /106 variables (removed 60) and now considering 159/214 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 46/106 places, 159/214 transitions.
RANDOM walk for 40000 steps (267 resets) in 247 ms. (161 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40001 steps (84 resets) in 198 ms. (201 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (132 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
// Phase 1: matrix 159 rows 46 cols
[2024-06-02 19:12:40] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 19:12:40] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/36 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/46 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 159/205 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 43/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/205 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 99 constraints, problems are : Problem set: 0 solved, 2 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 46/46 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 23/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/36 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/46 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 159/205 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 43/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/205 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 101 constraints, problems are : Problem set: 0 solved, 2 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 46/46 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 557ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 154 ms.
Support contains 7 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 159/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 45 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 44 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 44 transition count 157
Applied a total of 4 rules in 24 ms. Remains 44 /46 variables (removed 2) and now considering 157/159 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 44/46 places, 157/159 transitions.
RANDOM walk for 40000 steps (77 resets) in 170 ms. (233 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (107 resets) in 145 ms. (273 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (40 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 58027 steps, run visited all 2 properties in 193 ms. (steps per millisecond=300 )
Probabilistic random walk after 58027 steps, saw 16470 distinct states, run finished after 200 ms. (steps per millisecond=290 ) properties seen :2
FORMULA MedleyA-PT-08-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
FORMULA MedleyA-PT-08-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-08-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 390 edges and 106 vertex of which 101 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
FORMULA MedleyA-PT-08-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 96 transition count 193
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 96 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 96 transition count 192
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 91 transition count 178
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 91 transition count 178
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 89 transition count 173
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 89 transition count 173
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 88 transition count 170
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 88 transition count 170
Applied a total of 37 rules in 22 ms. Remains 88 /106 variables (removed 18) and now considering 170/214 (removed 44) transitions.
// Phase 1: matrix 170 rows 88 cols
[2024-06-02 19:12:42] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:12:42] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 19:12:42] [INFO ] Invariant cache hit.
[2024-06-02 19:12:42] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-06-02 19:12:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-06-02 19:12:44] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-06-02 19:12:44] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/258 variables, 88/100 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 0/258 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 100 constraints, problems are : Problem set: 0 solved, 169 unsolved in 7446 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/258 variables, 88/100 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 169/269 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-06-02 19:12:56] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/258 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (OVERLAPS) 0/258 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 270 constraints, problems are : Problem set: 0 solved, 169 unsolved in 14854 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 3/3 constraints]
After SMT, in 22508ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 22512ms
Starting structural reductions in LTL mode, iteration 1 : 88/106 places, 170/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22838 ms. Remains : 88/106 places, 170/214 transitions.
Stuttering acceptance computed with spot in 463 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 417 ms.
Product exploration explored 100000 steps with 33333 reset in 316 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 314 edges and 88 vertex of which 83 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Detected a total of 8/88 stabilizing places and 8/170 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 29 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-08-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-08-LTLFireability-00 finished in 24198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(((!p0&&X(F(!p1)))||G(F(!p1)))))||(X((p1||X(p2)))&&F(((!p0&&X(F(!p1)))||G(F(!p1))))))))'
Support contains 9 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 97 transition count 197
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 97 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 97 transition count 196
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 94 transition count 190
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 94 transition count 190
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 93 transition count 187
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 93 transition count 187
Applied a total of 27 rules in 18 ms. Remains 93 /106 variables (removed 13) and now considering 187/214 (removed 27) transitions.
// Phase 1: matrix 187 rows 93 cols
[2024-06-02 19:13:06] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:13:06] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 19:13:06] [INFO ] Invariant cache hit.
[2024-06-02 19:13:06] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2024-06-02 19:13:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-06-02 19:13:08] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 3 ms to minimize.
[2024-06-02 19:13:08] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-06-02 19:13:08] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 2 ms to minimize.
[2024-06-02 19:13:08] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 187/280 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 107 constraints, problems are : Problem set: 0 solved, 186 unsolved in 7615 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 187/280 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 186/293 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 0/280 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 293 constraints, problems are : Problem set: 0 solved, 186 unsolved in 9058 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 4/4 constraints]
After SMT, in 16812ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 16815ms
Starting structural reductions in LTL mode, iteration 1 : 93/106 places, 187/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17124 ms. Remains : 93/106 places, 187/214 transitions.
Stuttering acceptance computed with spot in 393 ms :[p1, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-01
Product exploration explored 100000 steps with 33218 reset in 407 ms.
Product exploration explored 100000 steps with 33422 reset in 166 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 339 edges and 93 vertex of which 88 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (OR p1 (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (OR p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 218 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 378 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (1978 resets) in 641 ms. (62 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40003 steps (541 resets) in 203 ms. (196 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (557 resets) in 395 ms. (101 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (560 resets) in 164 ms. (242 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (551 resets) in 500 ms. (79 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (564 resets) in 145 ms. (274 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (547 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
[2024-06-02 19:13:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 37/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 27/73 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 165/238 variables, 73/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 23/261 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 4/265 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 12/277 variables, 9/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 3/280 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/280 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 103 constraints, problems are : Problem set: 0 solved, 6 unsolved in 639 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 37/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 27/73 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 165/238 variables, 73/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 23/261 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 4/265 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 12/277 variables, 9/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/277 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 3/280 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/280 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/280 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 109 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1094 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1766ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 5 properties in 177 ms.
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 187/187 transitions.
Graph (complete) has 339 edges and 93 vertex of which 88 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 88 transition count 163
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 35 place count 77 transition count 161
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 35 place count 77 transition count 158
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 41 place count 74 transition count 158
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 43 place count 72 transition count 149
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 72 transition count 149
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 70 transition count 144
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 70 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 69 transition count 141
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 69 transition count 141
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 80 place count 54 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 54 transition count 125
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 53 transition count 124
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 53 transition count 124
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 96 place count 47 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 106 place count 47 transition count 138
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 45 transition count 161
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 114 place count 45 transition count 157
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 118 place count 41 transition count 157
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 120 place count 41 transition count 156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 122 place count 39 transition count 156
Applied a total of 122 rules in 77 ms. Remains 39 /93 variables (removed 54) and now considering 156/187 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 39/93 places, 156/187 transitions.
RANDOM walk for 40000 steps (70 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (141 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1642 steps, run visited all 1 properties in 10 ms. (steps per millisecond=164 )
Probabilistic random walk after 1642 steps, saw 593 distinct states, run finished after 11 ms. (steps per millisecond=149 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (OR p1 (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (OR p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (F p2), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR (NOT p1) p2))), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 16 factoid took 759 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 384 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 383 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Support contains 9 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 187/187 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2024-06-02 19:13:29] [INFO ] Invariant cache hit.
[2024-06-02 19:13:29] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 19:13:29] [INFO ] Invariant cache hit.
[2024-06-02 19:13:29] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2024-06-02 19:13:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-06-02 19:13:31] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
[2024-06-02 19:13:31] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:13:32] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 1 ms to minimize.
[2024-06-02 19:13:32] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 187/280 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 107 constraints, problems are : Problem set: 0 solved, 186 unsolved in 8668 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 187/280 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 186/293 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 0/280 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 293 constraints, problems are : Problem set: 0 solved, 186 unsolved in 10153 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 4/4 constraints]
After SMT, in 19056ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 19060ms
Finished structural reductions in LTL mode , in 1 iterations and 19371 ms. Remains : 93/93 places, 187/187 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 339 edges and 93 vertex of which 88 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 115 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (1981 resets) in 339 ms. (117 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40002 steps (540 resets) in 100 ms. (396 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (547 resets) in 152 ms. (261 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (568 resets) in 73 ms. (540 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (562 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (558 resets) in 65 ms. (606 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (547 resets) in 75 ms. (526 steps per ms) remains 6/6 properties
[2024-06-02 19:13:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 37/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 27/73 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 165/238 variables, 73/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 23/261 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 4/265 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 12/277 variables, 9/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 3/280 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/280 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 103 constraints, problems are : Problem set: 0 solved, 6 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 37/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 27/73 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 165/238 variables, 73/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 23/261 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 4/265 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 12/277 variables, 9/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/277 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 3/280 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/280 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/280 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 109 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1244 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1806ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1564 ms.
Support contains 9 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 187/187 transitions.
Graph (complete) has 339 edges and 93 vertex of which 88 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 88 transition count 164
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 32 place count 78 transition count 163
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 32 place count 78 transition count 161
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 76 transition count 161
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 59 place count 64 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 64 transition count 149
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 63 transition count 148
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 63 transition count 148
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 72 place count 58 transition count 187
Drop transitions (Redundant composition of simpler transitions.) removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 3 with 49 rules applied. Total rules applied 121 place count 58 transition count 138
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 121 place count 58 transition count 136
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 125 place count 56 transition count 136
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 129 place count 54 transition count 155
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 54 transition count 151
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 137 place count 50 transition count 151
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 139 place count 50 transition count 198
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 141 place count 48 transition count 198
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 144 place count 48 transition count 198
Applied a total of 144 rules in 55 ms. Remains 48 /93 variables (removed 45) and now considering 198/187 (removed -11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 48/93 places, 198/187 transitions.
RANDOM walk for 40000 steps (68 resets) in 942 ms. (42 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (201 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (68 resets) in 129 ms. (307 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (59 resets) in 108 ms. (366 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (39 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (88 resets) in 123 ms. (322 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (146 resets) in 178 ms. (223 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 10963 steps, run visited all 6 properties in 224 ms. (steps per millisecond=48 )
Probabilistic random walk after 10963 steps, saw 3165 distinct states, run finished after 225 ms. (steps per millisecond=48 ) properties seen :6
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0))))), (F p1), (F p0), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 7 factoid took 569 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 372 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 384 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 414 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 20068 reset in 156 ms.
Product exploration explored 100000 steps with 19997 reset in 176 ms.
Applying partial POR strategy [false, true, false, false, true, false, false]
Stuttering acceptance computed with spot in 251 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Support contains 9 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 187/187 transitions.
Graph (complete) has 339 edges and 93 vertex of which 88 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 88 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 88 transition count 183
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 11 place count 88 transition count 185
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 88 transition count 185
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 16 place count 85 transition count 182
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 85 transition count 182
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 30 place count 85 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 85 transition count 182
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 36 place count 81 transition count 177
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 81 transition count 177
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 46 place count 81 transition count 231
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 80 transition count 229
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 80 transition count 229
Deduced a syphon composed of 21 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 3 with 49 rules applied. Total rules applied 97 place count 80 transition count 180
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 97 place count 80 transition count 181
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 80 transition count 181
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 80 transition count 191
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 79 transition count 189
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 79 transition count 189
Deduced a syphon composed of 23 places in 0 ms
Applied a total of 102 rules in 35 ms. Remains 79 /93 variables (removed 14) and now considering 189/187 (removed -2) transitions.
[2024-06-02 19:13:56] [INFO ] Redundant transitions in 64 ms returned [162]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 186 sub problems to find dead transitions.
// Phase 1: matrix 188 rows 79 cols
[2024-06-02 19:13:56] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 19:13:56] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-06-02 19:13:58] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:13:58] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
[2024-06-02 19:13:58] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 2 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
[2024-06-02 19:13:58] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
[2024-06-02 19:13:58] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD123 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 5/13 constraints. Problems are: Problem set: 30 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/13 constraints. Problems are: Problem set: 30 solved, 156 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
At refinement iteration 5 (OVERLAPS) 188/267 variables, 79/92 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 8/100 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/100 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 0/267 variables, 0/100 constraints. Problems are: Problem set: 34 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 100 constraints, problems are : Problem set: 34 solved, 152 unsolved in 5518 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 34 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 14/69 variables, 4/4 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 2/6 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 5/11 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 5 (OVERLAPS) 7/76 variables, 2/13 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/13 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 187/263 variables, 76/89 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 8/97 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 152/249 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/249 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 11 (OVERLAPS) 4/267 variables, 3/252 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 0/252 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 13 (OVERLAPS) 0/267 variables, 0/252 constraints. Problems are: Problem set: 34 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 252 constraints, problems are : Problem set: 34 solved, 152 unsolved in 11737 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 152/186 constraints, Known Traps: 5/5 constraints]
After SMT, in 17558ms problems are : Problem set: 34 solved, 152 unsolved
Search for dead transitions found 34 dead transitions in 17560ms
Found 34 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 34 transitions
Dead transitions reduction (with SMT) removed 34 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 79/93 places, 154/187 transitions.
Graph (complete) has 288 edges and 79 vertex of which 56 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.0 ms
Discarding 23 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 55 transition count 168
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 13 ms. Remains 55 /79 variables (removed 24) and now considering 168/154 (removed -14) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/93 places, 168/187 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17688 ms. Remains : 55/93 places, 168/187 transitions.
Support contains 9 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 187/187 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 187/187 (removed 0) transitions.
// Phase 1: matrix 187 rows 93 cols
[2024-06-02 19:14:14] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:14:14] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 19:14:14] [INFO ] Invariant cache hit.
[2024-06-02 19:14:14] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2024-06-02 19:14:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-06-02 19:14:15] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-06-02 19:14:16] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 10 ms to minimize.
[2024-06-02 19:14:16] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 2 ms to minimize.
[2024-06-02 19:14:16] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 187/280 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 107 constraints, problems are : Problem set: 0 solved, 186 unsolved in 8556 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 187/280 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 186/293 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 0/280 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 293 constraints, problems are : Problem set: 0 solved, 186 unsolved in 10595 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 4/4 constraints]
After SMT, in 19302ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 19305ms
Finished structural reductions in LTL mode , in 1 iterations and 19515 ms. Remains : 93/93 places, 187/187 transitions.
Treatment of property MedleyA-PT-08-LTLFireability-01 finished in 87598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(((p2||G(p3))&&p1))))'
Support contains 7 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 98 transition count 198
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 98 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 98 transition count 197
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 94 transition count 186
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 94 transition count 186
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 92 transition count 181
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 92 transition count 181
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 91 transition count 178
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 91 transition count 178
Applied a total of 31 rules in 7 ms. Remains 91 /106 variables (removed 15) and now considering 178/214 (removed 36) transitions.
// Phase 1: matrix 178 rows 91 cols
[2024-06-02 19:14:33] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:14:33] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 19:14:33] [INFO ] Invariant cache hit.
[2024-06-02 19:14:33] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2024-06-02 19:14:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-02 19:14:35] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
[2024-06-02 19:14:35] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:14:35] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/269 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/269 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 104 constraints, problems are : Problem set: 0 solved, 177 unsolved in 7205 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/269 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 177/281 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/269 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 281 constraints, problems are : Problem set: 0 solved, 177 unsolved in 10970 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 3/3 constraints]
After SMT, in 18316ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 18318ms
Starting structural reductions in LTL mode, iteration 1 : 91/106 places, 178/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18531 ms. Remains : 91/106 places, 178/214 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-06
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLFireability-06 finished in 18803 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)&&F(G(p1)))))'
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Graph (complete) has 390 edges and 106 vertex of which 101 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 100 transition count 199
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 89 transition count 198
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 24 place count 89 transition count 195
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 86 transition count 195
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 37 place count 79 transition count 181
Iterating global reduction 2 with 7 rules applied. Total rules applied 44 place count 79 transition count 181
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 76 transition count 175
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 76 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 75 transition count 172
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 75 transition count 172
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 80 place count 60 transition count 159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 83 place count 60 transition count 156
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 85 place count 58 transition count 154
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 58 transition count 154
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 101 place count 51 transition count 197
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 3 with 48 rules applied. Total rules applied 149 place count 51 transition count 149
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 149 place count 51 transition count 147
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 153 place count 49 transition count 147
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 157 place count 47 transition count 170
Applied a total of 157 rules in 34 ms. Remains 47 /106 variables (removed 59) and now considering 170/214 (removed 44) transitions.
// Phase 1: matrix 170 rows 47 cols
[2024-06-02 19:14:52] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 19:14:52] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 19:14:52] [INFO ] Invariant cache hit.
[2024-06-02 19:14:52] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-02 19:14:52] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-06-02 19:14:52] [INFO ] Redundant transitions in 29 ms returned []
Running 164 sub problems to find dead transitions.
[2024-06-02 19:14:52] [INFO ] Invariant cache hit.
[2024-06-02 19:14:52] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-02 19:14:53] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 169/215 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 53/106 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 2/217 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (OVERLAPS) 0/217 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 107 constraints, problems are : Problem set: 0 solved, 164 unsolved in 8376 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 47/47 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 169/215 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 53/106 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 161/267 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 2/217 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (OVERLAPS) 0/217 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 271 constraints, problems are : Problem set: 0 solved, 164 unsolved in 11909 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 47/47 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 1/1 constraints]
After SMT, in 20522ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 20524ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/106 places, 170/214 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20782 ms. Remains : 47/106 places, 170/214 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-07
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLFireability-07 finished in 20917 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U p1))'
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Graph (complete) has 390 edges and 106 vertex of which 101 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 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 13 place count 101 transition count 199
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 89 transition count 197
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 27 place count 89 transition count 193
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 35 place count 85 transition count 193
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 44 place count 76 transition count 173
Iterating global reduction 2 with 9 rules applied. Total rules applied 53 place count 76 transition count 173
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 73 transition count 165
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 73 transition count 165
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 71 transition count 160
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 71 transition count 160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 70 transition count 157
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 70 transition count 157
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 97 place count 53 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 101 place count 53 transition count 138
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 104 place count 50 transition count 133
Iterating global reduction 3 with 3 rules applied. Total rules applied 107 place count 50 transition count 133
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 121 place count 43 transition count 162
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 147 place count 43 transition count 136
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 153 place count 40 transition count 167
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 40 transition count 165
Applied a total of 155 rules in 35 ms. Remains 40 /106 variables (removed 66) and now considering 165/214 (removed 49) transitions.
// Phase 1: matrix 165 rows 40 cols
[2024-06-02 19:15:13] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 19:15:13] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 19:15:13] [INFO ] Invariant cache hit.
[2024-06-02 19:15:13] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-06-02 19:15:13] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2024-06-02 19:15:13] [INFO ] Redundant transitions in 54 ms returned [93]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 162 sub problems to find dead transitions.
// Phase 1: matrix 164 rows 40 cols
[2024-06-02 19:15:13] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 19:15:13] [INFO ] State equation strengthened by 82 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (OVERLAPS) 164/204 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 82/128 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/204 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 128 constraints, problems are : Problem set: 0 solved, 162 unsolved in 5644 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 40/40 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (OVERLAPS) 164/204 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 82/128 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 162/290 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 290 constraints, problems are : Problem set: 0 solved, 162 unsolved in 10043 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 40/40 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints]
After SMT, in 16016ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 16020ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/106 places, 164/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 40 /40 variables (removed 0) and now considering 164/164 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16368 ms. Remains : 40/106 places, 164/214 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-08
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLFireability-08 finished in 16481 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((G(p0)||X((p1||X((p2||F(p3))))))))'
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 98 transition count 195
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 98 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 98 transition count 194
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 94 transition count 183
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 94 transition count 183
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 92 transition count 178
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 92 transition count 178
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 91 transition count 175
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 91 transition count 175
Applied a total of 31 rules in 7 ms. Remains 91 /106 variables (removed 15) and now considering 175/214 (removed 39) transitions.
// Phase 1: matrix 175 rows 91 cols
[2024-06-02 19:15:29] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:15:30] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 19:15:30] [INFO ] Invariant cache hit.
[2024-06-02 19:15:30] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2024-06-02 19:15:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-02 19:15:32] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-06-02 19:15:32] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2024-06-02 19:15:32] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:15:32] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:15:32] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/266 variables, 91/106 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/266 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 106 constraints, problems are : Problem set: 0 solved, 174 unsolved in 7630 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/266 variables, 91/106 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 174/280 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/266 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 280 constraints, problems are : Problem set: 0 solved, 174 unsolved in 7659 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 5/5 constraints]
After SMT, in 15467ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 15472ms
Starting structural reductions in LTL mode, iteration 1 : 91/106 places, 175/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15789 ms. Remains : 91/106 places, 175/214 transitions.
Stuttering acceptance computed with spot in 385 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-09
Product exploration explored 100000 steps with 25039 reset in 134 ms.
Product exploration explored 100000 steps with 24990 reset in 180 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 325 edges and 91 vertex of which 86 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 172 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 7 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 373 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0))]
RANDOM walk for 40000 steps (1970 resets) in 607 ms. (65 steps per ms) remains 8/11 properties
BEST_FIRST walk for 40003 steps (538 resets) in 244 ms. (163 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (519 resets) in 309 ms. (129 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40004 steps (526 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (524 resets) in 81 ms. (487 steps per ms) remains 3/3 properties
[2024-06-02 19:15:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:15:47] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 17/39 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 32/71 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 153/224 variables, 71/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 23/247 variables, 9/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 4/251 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 12/263 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/263 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 3/266 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/266 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/266 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 102 constraints, problems are : Problem set: 0 solved, 3 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf7 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 1 (OVERLAPS) 19/22 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 17/39 variables, 2/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 32/71 variables, 4/9 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 153/224 variables, 71/80 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 1/81 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/81 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 23/247 variables, 9/90 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 0/90 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/251 variables, 2/92 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 0/92 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/263 variables, 9/101 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/263 variables, 0/101 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/266 variables, 2/103 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/266 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/266 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 103 constraints, problems are : Problem set: 2 solved, 1 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 549ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 175/175 transitions.
Graph (complete) has 325 edges and 91 vertex of which 86 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 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 22 rules applied. Total rules applied 23 place count 86 transition count 150
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 37 place count 74 transition count 148
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 37 place count 74 transition count 144
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 45 place count 70 transition count 144
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 68 transition count 140
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 68 transition count 140
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 33 rules applied. Total rules applied 82 place count 51 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 84 place count 51 transition count 122
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 86 place count 49 transition count 120
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 49 transition count 120
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 100 place count 43 transition count 144
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 110 place count 43 transition count 134
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 114 place count 41 transition count 157
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 118 place count 41 transition count 153
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 122 place count 37 transition count 153
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 124 place count 37 transition count 151
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 126 place count 35 transition count 151
Applied a total of 126 rules in 30 ms. Remains 35 /91 variables (removed 56) and now considering 151/175 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 35/91 places, 151/175 transitions.
RANDOM walk for 30282 steps (126 resets) in 73 ms. (409 steps per ms) remains 0/1 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X p0)), (G (OR p0 p3)), (G (OR p0 p2 p3))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 p3))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p3))), (F (NOT (OR p2 p3))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p3)), (F p2), (F p1), (F (NOT p0))]
Knowledge based reduction with 13 factoid took 614 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 175/175 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-06-02 19:15:49] [INFO ] Invariant cache hit.
[2024-06-02 19:15:49] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 19:15:49] [INFO ] Invariant cache hit.
[2024-06-02 19:15:49] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2024-06-02 19:15:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-02 19:15:51] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-06-02 19:15:51] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 2 ms to minimize.
[2024-06-02 19:15:51] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
[2024-06-02 19:15:52] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:15:52] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/266 variables, 91/106 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/266 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 106 constraints, problems are : Problem set: 0 solved, 174 unsolved in 8373 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/266 variables, 91/106 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 174/280 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/266 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 280 constraints, problems are : Problem set: 0 solved, 174 unsolved in 8855 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 5/5 constraints]
After SMT, in 17403ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 17407ms
Finished structural reductions in LTL mode , in 1 iterations and 17708 ms. Remains : 91/91 places, 175/175 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 325 edges and 91 vertex of which 86 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 89 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p3)]
RANDOM walk for 40000 steps (1977 resets) in 205 ms. (194 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40001 steps (538 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
[2024-06-02 19:16:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/39 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/71 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 153/224 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/247 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/251 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/263 variables, 9/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/266 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/266 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 101 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/39 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/71 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 153/224 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/247 variables, 9/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/251 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/263 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/263 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/266 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/266 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/266 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 102 constraints, problems are : Problem set: 0 solved, 1 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 411ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 39 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=39 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [(AND p0 (NOT p1) p3 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X p3))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 p3))), (F p1), (F p2), (F (NOT (OR p0 p1))), (F (NOT p3))]
Knowledge based reduction with 7 factoid took 292 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Product exploration explored 100000 steps with 33186 reset in 71 ms.
Product exploration explored 100000 steps with 33356 reset in 88 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 175/175 transitions.
Graph (complete) has 325 edges and 91 vertex of which 86 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 86 transition count 172
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 86 transition count 170
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 86 transition count 172
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 86 transition count 172
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 83 transition count 169
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 83 transition count 169
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 40 place count 83 transition count 172
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 43 place count 83 transition count 169
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 49 place count 77 transition count 161
Deduced a syphon composed of 24 places in 1 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 55 place count 77 transition count 161
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 3 with 7 rules applied. Total rules applied 62 place count 77 transition count 199
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 65 place count 74 transition count 193
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 74 transition count 193
Deduced a syphon composed of 28 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 80 place count 74 transition count 181
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 80 rules in 36 ms. Remains 74 /91 variables (removed 17) and now considering 181/175 (removed -6) transitions.
[2024-06-02 19:16:09] [INFO ] Redundant transitions in 26 ms returned [177]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 178 sub problems to find dead transitions.
// Phase 1: matrix 180 rows 74 cols
[2024-06-02 19:16:09] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 19:16:09] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-06-02 19:16:10] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD20 is UNSAT
[2024-06-02 19:16:10] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-06-02 19:16:10] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-06-02 19:16:10] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
[2024-06-02 19:16:10] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 3 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-02 19:16:11] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-06-02 19:16:11] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-02 19:16:11] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
[2024-06-02 19:16:11] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 9/17 constraints. Problems are: Problem set: 29 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/17 constraints. Problems are: Problem set: 29 solved, 149 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
At refinement iteration 5 (OVERLAPS) 180/254 variables, 74/91 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 72/163 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/163 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 0/254 variables, 0/163 constraints. Problems are: Problem set: 33 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 163 constraints, problems are : Problem set: 33 solved, 145 unsolved in 6509 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 74/74 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 33 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 14/59 variables, 4/4 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 9/13 constraints. Problems are: Problem set: 33 solved, 145 unsolved
[2024-06-02 19:16:16] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:16:16] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 2/15 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/15 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 12/71 variables, 4/19 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/19 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 179/250 variables, 71/90 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 72/162 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 145/307 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/307 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 11 (OVERLAPS) 4/254 variables, 3/310 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 0/310 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 13 (OVERLAPS) 0/254 variables, 0/310 constraints. Problems are: Problem set: 33 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 310 constraints, problems are : Problem set: 33 solved, 145 unsolved in 12801 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 74/74 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 145/178 constraints, Known Traps: 11/11 constraints]
After SMT, in 19548ms problems are : Problem set: 33 solved, 145 unsolved
Search for dead transitions found 33 dead transitions in 19552ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 74/91 places, 147/175 transitions.
Graph (complete) has 267 edges and 74 vertex of which 46 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 161
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 6 ms. Remains 45 /74 variables (removed 29) and now considering 161/147 (removed -14) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/91 places, 161/175 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19642 ms. Remains : 45/91 places, 161/175 transitions.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 175/175 transitions.
Applied a total of 0 rules in 0 ms. Remains 91 /91 variables (removed 0) and now considering 175/175 (removed 0) transitions.
// Phase 1: matrix 175 rows 91 cols
[2024-06-02 19:16:28] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:16:28] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 19:16:28] [INFO ] Invariant cache hit.
[2024-06-02 19:16:29] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2024-06-02 19:16:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-02 19:16:30] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 3 ms to minimize.
[2024-06-02 19:16:30] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:16:31] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
[2024-06-02 19:16:31] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2024-06-02 19:16:31] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/266 variables, 91/106 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/266 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 106 constraints, problems are : Problem set: 0 solved, 174 unsolved in 7829 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/266 variables, 91/106 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 174/280 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/266 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 280 constraints, problems are : Problem set: 0 solved, 174 unsolved in 7243 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 5/5 constraints]
After SMT, in 15180ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 15183ms
Finished structural reductions in LTL mode , in 1 iterations and 15433 ms. Remains : 91/91 places, 175/175 transitions.
Treatment of property MedleyA-PT-08-LTLFireability-09 finished in 74457 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 98 transition count 196
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 98 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 98 transition count 195
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 94 transition count 186
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 94 transition count 186
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 93 transition count 183
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 93 transition count 183
Applied a total of 27 rules in 3 ms. Remains 93 /106 variables (removed 13) and now considering 183/214 (removed 31) transitions.
// Phase 1: matrix 183 rows 93 cols
[2024-06-02 19:16:44] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 19:16:44] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 19:16:44] [INFO ] Invariant cache hit.
[2024-06-02 19:16:44] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2024-06-02 19:16:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-06-02 19:16:46] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:16:46] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:16:46] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:16:46] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 183/276 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 0/276 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 107 constraints, problems are : Problem set: 0 solved, 182 unsolved in 5933 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 183/276 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 182/289 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 0/276 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 289 constraints, problems are : Problem set: 0 solved, 182 unsolved in 7183 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 4/4 constraints]
After SMT, in 13240ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 13242ms
Starting structural reductions in LTL mode, iteration 1 : 93/106 places, 183/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13464 ms. Remains : 93/106 places, 183/214 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLFireability-11 finished in 13597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)&&F((p1&&G(p0))))||X(G(p0))))'
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 97 transition count 197
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 97 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 97 transition count 196
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 93 transition count 185
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 93 transition count 185
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 91 transition count 180
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 91 transition count 180
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 90 transition count 177
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 90 transition count 177
Applied a total of 33 rules in 8 ms. Remains 90 /106 variables (removed 16) and now considering 177/214 (removed 37) transitions.
// Phase 1: matrix 177 rows 90 cols
[2024-06-02 19:16:58] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:16:58] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 19:16:58] [INFO ] Invariant cache hit.
[2024-06-02 19:16:58] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-06-02 19:16:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-02 19:16:59] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:16:59] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:16:59] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:16:59] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 177/267 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/267 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 104 constraints, problems are : Problem set: 0 solved, 176 unsolved in 5580 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 177/267 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 176/280 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 0/267 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 280 constraints, problems are : Problem set: 0 solved, 176 unsolved in 7354 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 4/4 constraints]
After SMT, in 13055ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 13056ms
Starting structural reductions in LTL mode, iteration 1 : 90/106 places, 177/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13297 ms. Remains : 90/106 places, 177/214 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLFireability-12 finished in 13558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(G(p1) U G(p2))&&X(G(p2)))))'
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 98 transition count 200
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 98 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 98 transition count 199
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 95 transition count 192
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 95 transition count 192
Applied a total of 23 rules in 4 ms. Remains 95 /106 variables (removed 11) and now considering 192/214 (removed 22) transitions.
// Phase 1: matrix 192 rows 95 cols
[2024-06-02 19:17:11] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 19:17:11] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 19:17:11] [INFO ] Invariant cache hit.
[2024-06-02 19:17:11] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2024-06-02 19:17:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-06-02 19:17:13] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
[2024-06-02 19:17:13] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:17:13] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:17:13] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (OVERLAPS) 192/287 variables, 95/109 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/287 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 109 constraints, problems are : Problem set: 0 solved, 191 unsolved in 6495 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (OVERLAPS) 192/287 variables, 95/109 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 191/300 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-06-02 19:17:24] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:17:24] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:17:24] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:17:24] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/287 variables, 4/304 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-06-02 19:17:27] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/287 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 11 (OVERLAPS) 0/287 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 305 constraints, problems are : Problem set: 0 solved, 191 unsolved in 17528 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 9/9 constraints]
After SMT, in 24171ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 24174ms
Starting structural reductions in LTL mode, iteration 1 : 95/106 places, 192/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24423 ms. Remains : 95/106 places, 192/214 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), true, (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLFireability-13 finished in 24702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 97 transition count 194
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 97 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 97 transition count 193
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 93 transition count 180
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 93 transition count 180
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 91 transition count 175
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 91 transition count 175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 90 transition count 172
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 90 transition count 172
Applied a total of 33 rules in 4 ms. Remains 90 /106 variables (removed 16) and now considering 172/214 (removed 42) transitions.
// Phase 1: matrix 172 rows 90 cols
[2024-06-02 19:17:36] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 19:17:36] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 19:17:36] [INFO ] Invariant cache hit.
[2024-06-02 19:17:36] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2024-06-02 19:17:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-06-02 19:17:37] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:17:37] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/262 variables, 90/102 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 0/262 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 102 constraints, problems are : Problem set: 0 solved, 171 unsolved in 5232 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/262 variables, 90/102 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 171/273 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 0/262 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 273 constraints, problems are : Problem set: 0 solved, 171 unsolved in 6769 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 2/2 constraints]
After SMT, in 12119ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 12121ms
Starting structural reductions in LTL mode, iteration 1 : 90/106 places, 172/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12334 ms. Remains : 90/106 places, 172/214 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-14
Product exploration explored 100000 steps with 4952 reset in 179 ms.
Product exploration explored 100000 steps with 4952 reset in 212 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 320 edges and 90 vertex of which 85 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1977 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (522 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 92026 steps, run visited all 1 properties in 140 ms. (steps per millisecond=657 )
Probabilistic random walk after 92026 steps, saw 19840 distinct states, run finished after 141 ms. (steps per millisecond=652 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2024-06-02 19:17:49] [INFO ] Invariant cache hit.
[2024-06-02 19:17:50] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 19:17:50] [INFO ] Invariant cache hit.
[2024-06-02 19:17:50] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2024-06-02 19:17:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-06-02 19:17:51] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 2 ms to minimize.
[2024-06-02 19:17:51] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/262 variables, 90/102 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 0/262 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 102 constraints, problems are : Problem set: 0 solved, 171 unsolved in 5255 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/262 variables, 90/102 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 171/273 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 0/262 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 273 constraints, problems are : Problem set: 0 solved, 171 unsolved in 6900 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 2/2 constraints]
After SMT, in 12283ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 12285ms
Finished structural reductions in LTL mode , in 1 iterations and 12498 ms. Remains : 90/90 places, 172/172 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 320 edges and 90 vertex of which 85 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1973 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (533 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 92026 steps, run visited all 1 properties in 137 ms. (steps per millisecond=671 )
Probabilistic random walk after 92026 steps, saw 19840 distinct states, run finished after 138 ms. (steps per millisecond=666 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4955 reset in 119 ms.
Product exploration explored 100000 steps with 4966 reset in 133 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 277 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 172/172 transitions.
Graph (complete) has 320 edges and 90 vertex of which 85 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 85 transition count 169
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 85 transition count 167
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 85 transition count 170
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 85 transition count 170
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 82 transition count 167
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 82 transition count 167
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 40 place count 82 transition count 170
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 43 place count 82 transition count 167
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 49 place count 76 transition count 159
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 55 place count 76 transition count 159
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 3 with 7 rules applied. Total rules applied 62 place count 76 transition count 197
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 65 place count 73 transition count 191
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 73 transition count 191
Deduced a syphon composed of 28 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 82 place count 73 transition count 177
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 82 rules in 28 ms. Remains 73 /90 variables (removed 17) and now considering 177/172 (removed -5) transitions.
[2024-06-02 19:18:04] [INFO ] Redundant transitions in 19 ms returned [173]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 174 sub problems to find dead transitions.
// Phase 1: matrix 176 rows 73 cols
[2024-06-02 19:18:04] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 19:18:04] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-02 19:18:05] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD18 is UNSAT
[2024-06-02 19:18:05] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
[2024-06-02 19:18:05] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-06-02 19:18:05] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-06-02 19:18:05] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-02 19:18:05] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 2 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-02 19:18:05] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
[2024-06-02 19:18:06] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 8/16 constraints. Problems are: Problem set: 30 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/16 constraints. Problems are: Problem set: 30 solved, 144 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 5 (OVERLAPS) 176/249 variables, 73/89 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 70/159 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/159 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/249 variables, 0/159 constraints. Problems are: Problem set: 34 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 159 constraints, problems are : Problem set: 34 solved, 140 unsolved in 4740 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 34 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 14/58 variables, 4/4 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 8/12 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 12/70 variables, 4/16 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/16 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 175/245 variables, 70/86 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 70/156 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 140/296 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 0/296 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 10 (OVERLAPS) 4/249 variables, 3/299 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/299 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 12 (OVERLAPS) 0/249 variables, 0/299 constraints. Problems are: Problem set: 34 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 299 constraints, problems are : Problem set: 34 solved, 140 unsolved in 8230 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 140/174 constraints, Known Traps: 8/8 constraints]
After SMT, in 13194ms problems are : Problem set: 34 solved, 140 unsolved
Search for dead transitions found 34 dead transitions in 13197ms
Found 34 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 34 transitions
Dead transitions reduction (with SMT) removed 34 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 73/90 places, 142/172 transitions.
Graph (complete) has 263 edges and 73 vertex of which 45 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.0 ms
Discarding 28 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 44 transition count 156
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 6 ms. Remains 44 /73 variables (removed 29) and now considering 156/142 (removed -14) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/90 places, 156/172 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13287 ms. Remains : 44/90 places, 156/172 transitions.
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 0 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
// Phase 1: matrix 172 rows 90 cols
[2024-06-02 19:18:17] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 19:18:17] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 19:18:17] [INFO ] Invariant cache hit.
[2024-06-02 19:18:17] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2024-06-02 19:18:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-06-02 19:18:19] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 2 ms to minimize.
[2024-06-02 19:18:19] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/262 variables, 90/102 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 0/262 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 102 constraints, problems are : Problem set: 0 solved, 171 unsolved in 5325 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/262 variables, 90/102 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 171/273 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 0/262 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 273 constraints, problems are : Problem set: 0 solved, 171 unsolved in 6688 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 2/2 constraints]
After SMT, in 12136ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 12138ms
Finished structural reductions in LTL mode , in 1 iterations and 12372 ms. Remains : 90/90 places, 172/172 transitions.
Treatment of property MedleyA-PT-08-LTLFireability-14 finished in 53654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 97 transition count 194
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 97 transition count 194
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 93 transition count 183
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 93 transition count 183
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 91 transition count 178
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 91 transition count 178
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 90 transition count 175
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 90 transition count 175
Applied a total of 32 rules in 5 ms. Remains 90 /106 variables (removed 16) and now considering 175/214 (removed 39) transitions.
// Phase 1: matrix 175 rows 90 cols
[2024-06-02 19:18:29] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 19:18:29] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 19:18:29] [INFO ] Invariant cache hit.
[2024-06-02 19:18:30] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2024-06-02 19:18:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-02 19:18:31] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:18:31] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/265 variables, 90/102 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/265 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 102 constraints, problems are : Problem set: 0 solved, 174 unsolved in 5161 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/265 variables, 90/102 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 174/276 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/265 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 276 constraints, problems are : Problem set: 0 solved, 174 unsolved in 6553 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 2/2 constraints]
After SMT, in 11835ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 11837ms
Starting structural reductions in LTL mode, iteration 1 : 90/106 places, 175/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12049 ms. Remains : 90/106 places, 175/214 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-15
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLFireability-15 finished in 12215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(((!p0&&X(F(!p1)))||G(F(!p1)))))||(X((p1||X(p2)))&&F(((!p0&&X(F(!p1)))||G(F(!p1))))))))'
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((G(p0)||X((p1||X((p2||F(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' '!(X(X(X(G(p0)))))'
Found a Lengthening insensitive property : MedleyA-PT-08-LTLFireability-14
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Graph (complete) has 390 edges and 106 vertex of which 101 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 13 place count 100 transition count 198
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 88 transition count 196
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 27 place count 88 transition count 192
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 35 place count 84 transition count 192
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 43 place count 76 transition count 173
Iterating global reduction 2 with 8 rules applied. Total rules applied 51 place count 76 transition count 173
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 73 transition count 163
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 73 transition count 163
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 71 transition count 158
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 71 transition count 158
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 70 transition count 155
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 70 transition count 155
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 94 place count 54 transition count 140
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 98 place count 54 transition count 136
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 101 place count 51 transition count 131
Iterating global reduction 3 with 3 rules applied. Total rules applied 104 place count 51 transition count 131
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 116 place count 45 transition count 155
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 44 transition count 154
Applied a total of 117 rules in 21 ms. Remains 44 /106 variables (removed 62) and now considering 154/214 (removed 60) transitions.
// Phase 1: matrix 154 rows 44 cols
[2024-06-02 19:18:42] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:18:42] [INFO ] Implicit Places using invariants in 64 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 43/106 places, 154/214 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 98 ms. Remains : 43/106 places, 154/214 transitions.
Running random walk in product with property : MedleyA-PT-08-LTLFireability-14
Entered a terminal (fully accepting) state of product in 32070 steps with 4078 reset in 39 ms.
Treatment of property MedleyA-PT-08-LTLFireability-14 finished in 392 ms.
FORMULA MedleyA-PT-08-LTLFireability-14 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-06-02 19:18:42] [INFO ] Flatten gal took : 21 ms
[2024-06-02 19:18:42] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-02 19:18:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 106 places, 214 transitions and 918 arcs took 4 ms.
Total runtime 410519 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MedleyA-PT-08

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 106
TRANSITIONS: 214
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.003s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 2176
MODEL NAME: /home/mcc/execution/413/model
106 places, 214 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.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA MedleyA-PT-08-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-08-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-08-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717356053129

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

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