Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r579-smll-171734921200060.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is MedleyA-PT-08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921200060
=====================================================================

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

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:49:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:49:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:49:38] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2024-06-02 18:49:38] [INFO ] Transformed 147 places.
[2024-06-02 18:49:38] [INFO ] Transformed 312 transitions.
[2024-06-02 18:49:38] [INFO ] Found NUPN structural information;
[2024-06-02 18:49:38] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 455 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 44 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 77 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 18:49:39] [INFO ] Computed 10 invariants in 35 ms
[2024-06-02 18:49:39] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-06-02 18:49:39] [INFO ] Invariant cache hit.
[2024-06-02 18:49:39] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2024-06-02 18:49:39] [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 18:49:43] [INFO ] Deduced a trap composed of 40 places in 268 ms of which 33 ms to minimize.
[2024-06-02 18:49:43] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 3 ms to minimize.
[2024-06-02 18:49:44] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 3 ms to minimize.
[2024-06-02 18:49:44] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 2 ms to minimize.
[2024-06-02 18:49:44] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 2 ms to minimize.
[2024-06-02 18:49:44] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 3 ms to minimize.
[2024-06-02 18:49:44] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 3 ms to minimize.
[2024-06-02 18:49:45] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 3 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 13430 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 18:49:56] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 3 ms to minimize.
[2024-06-02 18:49:56] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 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 19261 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 33467ms problems are : Problem set: 48 solved, 213 unsolved
Search for dead transitions found 48 dead transitions in 33535ms
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 34211 ms. Remains : 106/147 places, 214/312 transitions.
Support contains 40 out of 106 places after structural reductions.
[2024-06-02 18:50:13] [INFO ] Flatten gal took : 64 ms
[2024-06-02 18:50:13] [INFO ] Flatten gal took : 33 ms
[2024-06-02 18:50:13] [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 (1975 resets) in 2651 ms. (15 steps per ms) remains 23/32 properties
BEST_FIRST walk for 4003 steps (62 resets) in 55 ms. (71 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (48 resets) in 50 ms. (78 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (56 resets) in 46 ms. (85 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (55 resets) in 83 ms. (47 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (48 resets) in 73 ms. (54 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (47 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (53 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (52 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (56 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (56 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (56 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (59 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (55 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (54 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (50 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (57 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (63 resets) in 39 ms. (100 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (50 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (51 resets) in 16 ms. (235 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4001 steps (52 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (55 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (62 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
// Phase 1: matrix 214 rows 106 cols
[2024-06-02 18:50:15] [INFO ] Computed 10 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 35/63 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 20 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 3 (OVERLAPS) 29/92 variables, 5/9 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 199/291 variables, 92/101 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/101 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 20/311 variables, 8/109 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/109 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 2/313 variables, 1/110 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 2/112 constraints. Problems are: Problem set: 3 solved, 19 unsolved
[2024-06-02 18:50:16] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 2 ms to minimize.
[2024-06-02 18:50:16] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/313 variables, 2/114 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/114 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 6/319 variables, 3/117 constraints. Problems are: Problem set: 3 solved, 19 unsolved
[2024-06-02 18:50:16] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 1/118 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/319 variables, 0/118 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 16 (OVERLAPS) 1/320 variables, 1/119 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/320 variables, 0/119 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 18 (OVERLAPS) 0/320 variables, 0/119 constraints. Problems are: Problem set: 3 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 119 constraints, problems are : Problem set: 3 solved, 19 unsolved in 2026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 36/61 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 19 unsolved
[2024-06-02 18:50:17] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 19 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 4 (OVERLAPS) 31/92 variables, 5/10 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 3/13 constraints. Problems are: Problem set: 4 solved, 18 unsolved
[2024-06-02 18:50:17] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 1/14 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/14 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 199/291 variables, 92/106 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 8/114 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/114 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 20/311 variables, 8/122 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/311 variables, 10/132 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/311 variables, 0/132 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 2/313 variables, 1/133 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/313 variables, 2/135 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/313 variables, 0/135 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 6/319 variables, 3/138 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/319 variables, 0/138 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 19 (OVERLAPS) 1/320 variables, 1/139 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/320 variables, 0/139 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 21 (OVERLAPS) 0/320 variables, 0/139 constraints. Problems are: Problem set: 4 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 139 constraints, problems are : Problem set: 4 solved, 18 unsolved in 3293 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 18/22 constraints, Known Traps: 5/5 constraints]
After SMT, in 5422ms problems are : Problem set: 4 solved, 18 unsolved
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 15 properties in 17389 ms.
Support contains 10 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.3 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 9 transitions
Reduce isomorphic transitions removed 9 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 21 rules applied. Total rules applied 22 place count 101 transition count 190
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 36 place count 89 transition count 188
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 36 place count 89 transition count 185
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 86 transition count 185
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 49 place count 79 transition count 168
Iterating global reduction 2 with 7 rules applied. Total rules applied 56 place count 79 transition count 168
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 76 transition count 162
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 76 transition count 162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 75 transition count 159
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 75 transition count 159
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 84 place count 65 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 65 transition count 147
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 64 transition count 144
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 64 transition count 144
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 102 place count 57 transition count 182
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 146 place count 57 transition count 138
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 152 place count 54 transition count 169
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 155 place count 54 transition count 166
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 158 place count 51 transition count 166
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 160 place count 51 transition count 165
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 162 place count 49 transition count 165
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 163 place count 49 transition count 165
Applied a total of 163 rules in 140 ms. Remains 49 /106 variables (removed 57) and now considering 165/214 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 49/106 places, 165/214 transitions.
RANDOM walk for 40000 steps (4694 resets) in 257 ms. (155 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (1310 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
// Phase 1: matrix 165 rows 49 cols
[2024-06-02 18:50:38] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 18:50:38] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/31 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/47 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 164/211 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 40/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:50:38] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/214 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/214 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 100 constraints, problems are : Problem set: 0 solved, 1 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 49/49 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/31 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/47 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 164/211 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 40/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/211 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/214 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/214 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/214 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 101 constraints, problems are : Problem set: 0 solved, 1 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 49/49 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 370ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 3 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 165/165 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 49 transition count 164
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 49 transition count 163
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 48 transition count 163
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 15 place count 41 transition count 158
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 39 transition count 155
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 39 transition count 155
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 38 transition count 163
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 38 transition count 159
Applied a total of 25 rules in 41 ms. Remains 38 /49 variables (removed 11) and now considering 159/165 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 38/49 places, 159/165 transitions.
RANDOM walk for 40000 steps (127 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (106 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17511 steps, run visited all 1 properties in 98 ms. (steps per millisecond=178 )
Probabilistic random walk after 17511 steps, saw 5366 distinct states, run finished after 106 ms. (steps per millisecond=165 ) properties seen :1
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.4 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 23 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 18:50:39] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 18:50:39] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-02 18:50:39] [INFO ] Invariant cache hit.
[2024-06-02 18:50:39] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-06-02 18:50:39] [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 18:50:41] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
[2024-06-02 18:50:41] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 42 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 6939 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 18:50:53] [INFO ] Deduced a trap composed of 33 places in 76 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 13267 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 20419ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 20426ms
Starting structural reductions in LTL mode, iteration 1 : 88/106 places, 170/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20786 ms. Remains : 88/106 places, 170/214 transitions.
Stuttering acceptance computed with spot in 491 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 524 ms.
Product exploration explored 100000 steps with 33333 reset in 208 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.4 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 27 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 22180 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 11 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 18:51:01] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 18:51:01] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 18:51:01] [INFO ] Invariant cache hit.
[2024-06-02 18:51:01] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2024-06-02 18:51:01] [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 18:51:03] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 2 ms to minimize.
[2024-06-02 18:51:03] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-06-02 18:51:04] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
[2024-06-02 18:51:04] [INFO ] Deduced a trap composed of 40 places in 86 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 8846 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 10185 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 19257ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 19260ms
Starting structural reductions in LTL mode, iteration 1 : 93/106 places, 187/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19519 ms. Remains : 93/106 places, 187/214 transitions.
Stuttering acceptance computed with spot in 352 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 33364 reset in 182 ms.
Product exploration explored 100000 steps with 33198 reset in 234 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 221 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 386 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (1973 resets) in 747 ms. (53 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (558 resets) in 192 ms. (207 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (572 resets) in 430 ms. (92 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (542 resets) in 139 ms. (285 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (558 resets) in 492 ms. (81 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (551 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (570 resets) in 83 ms. (476 steps per ms) remains 6/6 properties
[2024-06-02 18:51:23] [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 607 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 927 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 1580ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Finished Parikh walk after 2261 steps, including 72 resets, run visited all 6 properties in 49 ms. (steps per millisecond=46 )
Parikh walk visited 6 properties in 923 ms.
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 465 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 369 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 396 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 3 ms. Remains 93 /93 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2024-06-02 18:51:26] [INFO ] Invariant cache hit.
[2024-06-02 18:51:27] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 18:51:27] [INFO ] Invariant cache hit.
[2024-06-02 18:51:27] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2024-06-02 18:51:27] [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 18:51:29] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:51:29] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:51:29] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
[2024-06-02 18:51:29] [INFO ] Deduced a trap composed of 40 places in 70 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 8268 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 9464 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 17999ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 18003ms
Finished structural reductions in LTL mode , in 1 iterations and 18327 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.3 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 123 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 321 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (1971 resets) in 267 ms. (149 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (542 resets) in 86 ms. (459 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (559 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (557 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (558 resets) in 75 ms. (526 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (568 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (545 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
[2024-06-02 18:51:45] [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 544 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 1277 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 1853ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1127 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.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 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 1 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 49 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 49 ms. Remains : 48/93 places, 198/187 transitions.
RANDOM walk for 40000 steps (79 resets) in 292 ms. (136 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (30 resets) in 115 ms. (344 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (107 resets) in 261 ms. (152 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (91 resets) in 226 ms. (176 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (89 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (68 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (81 resets) in 45 ms. (869 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 10963 steps, run visited all 6 properties in 115 ms. (steps per millisecond=95 )
Probabilistic random walk after 10963 steps, saw 3165 distinct states, run finished after 116 ms. (steps per millisecond=94 ) 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 615 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 375 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 361 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 336 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 19966 reset in 155 ms.
Product exploration explored 100000 steps with 19950 reset in 181 ms.
Applying partial POR strategy [false, true, false, false, true, false, false]
Stuttering acceptance computed with spot in 324 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.5 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 1 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 1 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 1 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 1 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 68 ms. Remains 79 /93 variables (removed 14) and now considering 189/187 (removed -2) transitions.
[2024-06-02 18:51:52] [INFO ] Redundant transitions in 38 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 18:51:52] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:51:52] [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 18:51:54] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2024-06-02 18:51:54] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
[2024-06-02 18:51:54] [INFO ] Deduced a trap composed of 10 places in 67 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 18:51:54] [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 18:51:54] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 2 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 7416 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 13390 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 21157ms problems are : Problem set: 34 solved, 152 unsolved
Search for dead transitions found 34 dead transitions in 21161ms
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.1 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 1 ms
Applied a total of 2 rules in 9 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 21293 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 18:52:13] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 18:52:13] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 18:52:13] [INFO ] Invariant cache hit.
[2024-06-02 18:52:13] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2024-06-02 18:52:13] [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 18:52:16] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 2 ms to minimize.
[2024-06-02 18:52:16] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-06-02 18:52:16] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 10 ms to minimize.
[2024-06-02 18:52:16] [INFO ] Deduced a trap composed of 40 places in 96 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 9218 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 9841 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 19293ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 19297ms
Finished structural reductions in LTL mode , in 1 iterations and 19517 ms. Remains : 93/93 places, 187/187 transitions.
Treatment of property MedleyA-PT-08-LTLFireability-01 finished in 91786 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 18:52:33] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 18:52:33] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 18:52:33] [INFO ] Invariant cache hit.
[2024-06-02 18:52:33] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2024-06-02 18:52: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 18:52:34] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:52:34] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 2 ms to minimize.
[2024-06-02 18:52:35] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 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 6351 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 11158 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 17642ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 17645ms
Starting structural reductions in LTL mode, iteration 1 : 91/106 places, 178/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17933 ms. Remains : 91/106 places, 178/214 transitions.
Stuttering acceptance computed with spot in 275 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 17 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 18243 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 33 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 18:52:51] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 18:52:51] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-02 18:52:51] [INFO ] Invariant cache hit.
[2024-06-02 18:52:51] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-02 18:52:51] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-06-02 18:52:51] [INFO ] Redundant transitions in 27 ms returned []
Running 164 sub problems to find dead transitions.
[2024-06-02 18:52:51] [INFO ] Invariant cache hit.
[2024-06-02 18:52:51] [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 18:52:53] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 4 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 8705 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 11362 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 20476ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 20481ms
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 20728 ms. Remains : 47/106 places, 170/214 transitions.
Stuttering acceptance computed with spot in 117 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 5 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 20866 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 33 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 18:53:12] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 18:53:12] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 18:53:12] [INFO ] Invariant cache hit.
[2024-06-02 18:53:12] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-06-02 18:53:12] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-06-02 18:53:12] [INFO ] Redundant transitions in 19 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 18:53:12] [INFO ] Computed 6 invariants in 8 ms
[2024-06-02 18:53:12] [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 4804 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 8652 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 13731ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 13733ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/106 places, 164/214 transitions.
Applied a total of 0 rules in 10 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 13972 ms. Remains : 40/106 places, 164/214 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-08
Stuttering criterion allowed to conclude after 6 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 14087 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 8 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 18:53:26] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 18:53:26] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 18:53:26] [INFO ] Invariant cache hit.
[2024-06-02 18:53:26] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2024-06-02 18:53:26] [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 18:53:28] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-06-02 18:53:28] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2024-06-02 18:53:28] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2024-06-02 18:53:28] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2024-06-02 18:53:28] [INFO ] Deduced a trap composed of 16 places in 94 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 6751 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 9643 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 16573ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 16577ms
Starting structural reductions in LTL mode, iteration 1 : 91/106 places, 175/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16889 ms. Remains : 91/106 places, 175/214 transitions.
Stuttering acceptance computed with spot in 365 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 24939 reset in 231 ms.
Product exploration explored 100000 steps with 25002 reset in 295 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 140 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 300 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 (1979 resets) in 545 ms. (73 steps per ms) remains 8/11 properties
BEST_FIRST walk for 40003 steps (513 resets) in 140 ms. (283 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (533 resets) in 87 ms. (454 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40002 steps (522 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (524 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
[2024-06-02 18:53:45] [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 18:53:45] [INFO ] Deduced a trap composed of 20 places in 25 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 308 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 205 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 519ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 6 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 31 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 33 ms. Remains : 35/91 places, 151/175 transitions.
RANDOM walk for 30009 steps (19 resets) in 34 ms. (857 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 486 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 256 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 253 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 18:53:46] [INFO ] Invariant cache hit.
[2024-06-02 18:53:46] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 18:53:46] [INFO ] Invariant cache hit.
[2024-06-02 18:53:46] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2024-06-02 18:53:46] [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 18:53:48] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:53:48] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:53:48] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:53:48] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
[2024-06-02 18:53:48] [INFO ] Deduced a trap composed of 16 places in 67 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 7617 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 9413 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 17210ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 17213ms
Finished structural reductions in LTL mode , in 1 iterations and 17533 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.2 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 142 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 235 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 (1981 resets) in 310 ms. (128 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (537 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (521 resets) in 182 ms. (218 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (519 resets) in 131 ms. (303 steps per ms) remains 1/4 properties
[2024-06-02 18:54:04] [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 225 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 210 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 448ms 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 1 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 359 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 241 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 265 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 264 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 33217 reset in 124 ms.
Product exploration explored 100000 steps with 33173 reset in 121 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 240 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.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 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 1 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 0 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 0 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 27 ms. Remains 74 /91 variables (removed 17) and now considering 181/175 (removed -6) transitions.
[2024-06-02 18:54:07] [INFO ] Redundant transitions in 24 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 18:54:07] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:54:07] [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 18:54:08] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD20 is UNSAT
[2024-06-02 18:54:08] [INFO ] Deduced a trap composed of 8 places in 36 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 18:54:09] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 3 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-06-02 18:54:09] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:54:09] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-02 18:54:09] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 5 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-06-02 18:54:09] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-02 18:54:09] [INFO ] Deduced a trap composed of 7 places in 30 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 18:54:09] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 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 6546 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 18:54:14] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:54:14] [INFO ] Deduced a trap composed of 12 places in 37 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 11411 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 18143ms problems are : Problem set: 33 solved, 145 unsolved
Search for dead transitions found 33 dead transitions in 18145ms
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.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 45 transition count 161
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 7 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 18216 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 1 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 18:54:25] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 18:54:25] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 18:54:25] [INFO ] Invariant cache hit.
[2024-06-02 18:54:25] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2024-06-02 18:54:25] [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 18:54:27] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2024-06-02 18:54:27] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
[2024-06-02 18:54:27] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 2 ms to minimize.
[2024-06-02 18:54:27] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-06-02 18:54:28] [INFO ] Deduced a trap composed of 16 places in 106 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 8178 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 8694 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 17046ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 17050ms
Finished structural reductions in LTL mode , in 1 iterations and 17328 ms. Remains : 91/91 places, 175/175 transitions.
Treatment of property MedleyA-PT-08-LTLFireability-09 finished in 76413 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 5 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 18:54:42] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 18:54:42] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-02 18:54:42] [INFO ] Invariant cache hit.
[2024-06-02 18:54:43] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2024-06-02 18:54:43] [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 18:54:45] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-06-02 18:54:45] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-06-02 18:54:45] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 2 ms to minimize.
[2024-06-02 18:54:45] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 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 8315 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 8623 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 17133ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 17138ms
Starting structural reductions in LTL mode, iteration 1 : 93/106 places, 183/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17477 ms. Remains : 93/106 places, 183/214 transitions.
Stuttering acceptance computed with spot in 126 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 17693 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 7 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 18:55:00] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 18:55:00] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 18:55:00] [INFO ] Invariant cache hit.
[2024-06-02 18:55:00] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-06-02 18:55:00] [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 18:55:02] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 2 ms to minimize.
[2024-06-02 18:55:02] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-06-02 18:55:02] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-06-02 18:55:02] [INFO ] Deduced a trap composed of 27 places in 74 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 7479 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 8698 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 16303ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 16305ms
Starting structural reductions in LTL mode, iteration 1 : 90/106 places, 177/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16603 ms. Remains : 90/106 places, 177/214 transitions.
Stuttering acceptance computed with spot in 232 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 16861 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 6 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 18:55:17] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 18:55:17] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-02 18:55:17] [INFO ] Invariant cache hit.
[2024-06-02 18:55:17] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2024-06-02 18:55:17] [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 18:55:20] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-06-02 18:55:20] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-06-02 18:55:20] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2024-06-02 18:55:20] [INFO ] Deduced a trap composed of 41 places in 74 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 9483 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 18:55:34] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-06-02 18:55:35] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 2 ms to minimize.
[2024-06-02 18:55:35] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-06-02 18:55:35] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 2 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 18:55:39] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 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 22256 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 31966ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 31970ms
Starting structural reductions in LTL mode, iteration 1 : 95/106 places, 192/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32325 ms. Remains : 95/106 places, 192/214 transitions.
Stuttering acceptance computed with spot in 282 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 32641 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 3 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 18:55:50] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 18:55:50] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 18:55:50] [INFO ] Invariant cache hit.
[2024-06-02 18:55:50] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2024-06-02 18:55: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 18:55:52] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-06-02 18:55:52] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 2 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 7924 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 8935 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 17051ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 17054ms
Starting structural reductions in LTL mode, iteration 1 : 90/106 places, 172/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17362 ms. Remains : 90/106 places, 172/214 transitions.
Stuttering acceptance computed with spot in 199 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 4991 reset in 124 ms.
Product exploration explored 100000 steps with 4978 reset in 214 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.3 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 102 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 232 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1973 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (532 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 92026 steps, run visited all 1 properties in 240 ms. (steps per millisecond=383 )
Probabilistic random walk after 92026 steps, saw 19840 distinct states, run finished after 240 ms. (steps per millisecond=383 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 134 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 213 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 206 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 18:56:09] [INFO ] Invariant cache hit.
[2024-06-02 18:56:09] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-02 18:56:09] [INFO ] Invariant cache hit.
[2024-06-02 18:56:09] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2024-06-02 18:56:09] [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 18:56:11] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
[2024-06-02 18:56:11] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 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 6604 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 9453 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 16263ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 16267ms
Finished structural reductions in LTL mode , in 1 iterations and 16621 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 70 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 144 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1991 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (542 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 92026 steps, run visited all 1 properties in 145 ms. (steps per millisecond=634 )
Probabilistic random walk after 92026 steps, saw 19840 distinct states, run finished after 146 ms. (steps per millisecond=630 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 125 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 211 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 205 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 4944 reset in 112 ms.
Product exploration explored 100000 steps with 4967 reset in 127 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 214 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.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 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 1 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 0 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 32 ms. Remains 73 /90 variables (removed 17) and now considering 177/172 (removed -5) transitions.
[2024-06-02 18:56:27] [INFO ] Redundant transitions in 25 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 18:56:27] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:56:27] [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 18:56:29] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD18 is UNSAT
[2024-06-02 18:56:29] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 2 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 18:56:29] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:56:29] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-06-02 18:56:29] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-02 18:56:29] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-02 18:56:29] [INFO ] Deduced a trap composed of 10 places in 61 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 18:56:29] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 2 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 6493 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 10069 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 16820ms problems are : Problem set: 34 solved, 140 unsolved
Search for dead transitions found 34 dead transitions in 16824ms
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.2 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 12 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 16913 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 1 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 18:56:44] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 18:56:44] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 18:56:44] [INFO ] Invariant cache hit.
[2024-06-02 18:56:44] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2024-06-02 18:56:44] [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 18:56:46] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
[2024-06-02 18:56:46] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 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 6410 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 9962 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 16592ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 16596ms
Finished structural reductions in LTL mode , in 1 iterations and 16804 ms. Remains : 90/90 places, 172/172 transitions.
Treatment of property MedleyA-PT-08-LTLFireability-14 finished in 71300 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 7 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 18:57:01] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 18:57:01] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 18:57:01] [INFO ] Invariant cache hit.
[2024-06-02 18:57:01] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2024-06-02 18:57:01] [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 18:57:03] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-06-02 18:57:03] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 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 7055 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 9254 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 16487ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 16490ms
Starting structural reductions in LTL mode, iteration 1 : 90/106 places, 175/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16824 ms. Remains : 90/106 places, 175/214 transitions.
Stuttering acceptance computed with spot in 203 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 17 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 17060 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 205 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 0 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 41 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 18:57:19] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:57:19] [INFO ] Implicit Places using invariants in 96 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 100 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 3 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 146 ms. Remains : 43/106 places, 154/214 transitions.
Running random walk in product with property : MedleyA-PT-08-LTLFireability-14
Product exploration explored 100000 steps with 12750 reset in 203 ms.
Product exploration explored 100000 steps with 12809 reset in 229 ms.
Computed a total of 8 stabilizing places and 72 stable transitions
Computed a total of 8 stabilizing places and 72 stable transitions
Detected a total of 8/43 stabilizing places and 72/154 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 110 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 208 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (5144 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (975 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 112152 steps, run visited all 1 properties in 152 ms. (steps per millisecond=737 )
Probabilistic random walk after 112152 steps, saw 20836 distinct states, run finished after 153 ms. (steps per millisecond=733 ) properties seen :1
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 140 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 214 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 154/154 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 154/154 (removed 0) transitions.
// Phase 1: matrix 154 rows 43 cols
[2024-06-02 18:57:20] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 18:57:21] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 18:57:21] [INFO ] Invariant cache hit.
[2024-06-02 18:57:21] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 18:57:21] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-06-02 18:57:21] [INFO ] Invariant cache hit.
[2024-06-02 18:57:21] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 2/42 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 153/195 variables, 42/48 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 16/64 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 2/197 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (OVERLAPS) 0/197 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 65 constraints, problems are : Problem set: 0 solved, 146 unsolved in 5227 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 2/42 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 153/195 variables, 42/48 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 16/64 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 143/207 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 2/197 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (OVERLAPS) 0/197 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 211 constraints, problems are : Problem set: 0 solved, 146 unsolved in 9337 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints]
After SMT, in 14813ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 14817ms
Finished structural reductions in LTL mode , in 1 iterations and 15051 ms. Remains : 43/43 places, 154/154 transitions.
Computed a total of 8 stabilizing places and 72 stable transitions
Computed a total of 8 stabilizing places and 72 stable transitions
Detected a total of 8/43 stabilizing places and 72/154 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 95 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 208 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (5106 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (986 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 112152 steps, run visited all 1 properties in 227 ms. (steps per millisecond=494 )
Probabilistic random walk after 112152 steps, saw 20836 distinct states, run finished after 227 ms. (steps per millisecond=494 ) properties seen :1
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 142 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 214 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12762 reset in 195 ms.
Entered a terminal (fully accepting) state of product in 23157 steps with 2931 reset in 77 ms.
Treatment of property MedleyA-PT-08-LTLFireability-14 finished in 18859 ms.
FORMULA MedleyA-PT-08-LTLFireability-14 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-06-02 18:57:37] [INFO ] Flatten gal took : 34 ms
[2024-06-02 18:57:37] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-02 18:57:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 106 places, 214 transitions and 918 arcs took 6 ms.
Total runtime 479523 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA MedleyA-PT-08-LTLFireability-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MedleyA-PT-08-LTLFireability-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MedleyA-PT-08-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717355268587

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name MedleyA-PT-08-LTLFireability-01
ltl formula formula --ltl=/tmp/2308/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 106 places, 214 transitions and 918 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.010 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2308/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2308/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2308/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2308/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 108 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 107, there are 566 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~35 levels ~10000 states ~407656 transitions
pnml2lts-mc( 0/ 4): ~129 levels ~20000 states ~959208 transitions
pnml2lts-mc( 0/ 4): ~161 levels ~40000 states ~2159016 transitions
pnml2lts-mc( 0/ 4): ~161 levels ~80000 states ~4373076 transitions
pnml2lts-mc( 0/ 4): ~161 levels ~160000 states ~9059304 transitions
pnml2lts-mc( 0/ 4): ~161 levels ~320000 states ~19289352 transitions
pnml2lts-mc( 0/ 4): ~386 levels ~640000 states ~38324624 transitions
pnml2lts-mc( 0/ 4): ~717 levels ~1280000 states ~83119756 transitions
pnml2lts-mc( 1/ 4): ~2008 levels ~2560000 states ~149311728 transitions
pnml2lts-mc( 1/ 4): ~2008 levels ~5120000 states ~337917220 transitions
pnml2lts-mc( 1/ 4): ~2008 levels ~10240000 states ~725834336 transitions
pnml2lts-mc( 1/ 4): ~22741 levels ~20480000 states ~1579052548 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 22248985
pnml2lts-mc( 0/ 4): unique states count: 23762969
pnml2lts-mc( 0/ 4): unique transitions count: 2021536699
pnml2lts-mc( 0/ 4): - self-loop count: 17900
pnml2lts-mc( 0/ 4): - claim dead count: 1933436412
pnml2lts-mc( 0/ 4): - claim found count: 65394662
pnml2lts-mc( 0/ 4): - claim success count: 23774719
pnml2lts-mc( 0/ 4): - cum. max stack depth: 104399
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 23783482 states 2025080486 transitions, fanout: 85.147
pnml2lts-mc( 0/ 4): Total exploration time 456.880 sec (456.880 sec minimum, 456.880 sec on average)
pnml2lts-mc( 0/ 4): States per second: 52056, Transitions per second: 4432412
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 182.0MB, 8.0 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 70.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 214 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 182.0MB (~256.0MB paged-in)
ltl formula name MedleyA-PT-08-LTLFireability-09
ltl formula formula --ltl=/tmp/2308/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 106 places, 214 transitions and 918 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2308/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2308/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2308/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2308/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 108 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 107, there are 250 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~50 levels ~10000 states ~28828 transitions
pnml2lts-mc( 3/ 4): ~51 levels ~20000 states ~61376 transitions
pnml2lts-mc( 3/ 4): ~51 levels ~40000 states ~134368 transitions
pnml2lts-mc( 3/ 4): ~51 levels ~80000 states ~327628 transitions
pnml2lts-mc( 3/ 4): ~57 levels ~160000 states ~663724 transitions
pnml2lts-mc( 3/ 4): ~119 levels ~320000 states ~1388316 transitions
pnml2lts-mc( 0/ 4): ~219 levels ~640000 states ~2464752 transitions
pnml2lts-mc( 0/ 4): ~219 levels ~1280000 states ~5402692 transitions
pnml2lts-mc( 0/ 4): ~2945 levels ~2560000 states ~11594492 transitions
pnml2lts-mc( 0/ 4): ~2945 levels ~5120000 states ~24391492 transitions
pnml2lts-mc( 2/ 4): ~1467 levels ~10240000 states ~51950048 transitions
pnml2lts-mc( 2/ 4): ~2667 levels ~20480000 states ~112837500 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 32516089
pnml2lts-mc( 0/ 4): unique states count: 33379735
pnml2lts-mc( 0/ 4): unique transitions count: 196438201
pnml2lts-mc( 0/ 4): - self-loop count: 2019
pnml2lts-mc( 0/ 4): - claim dead count: 159230661
pnml2lts-mc( 0/ 4): - claim found count: 2870311
pnml2lts-mc( 0/ 4): - claim success count: 33390544
pnml2lts-mc( 0/ 4): - cum. max stack depth: 101885
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33392764 states 196587262 transitions, fanout: 5.887
pnml2lts-mc( 0/ 4): Total exploration time 152.280 sec (152.230 sec minimum, 152.258 sec on average)
pnml2lts-mc( 0/ 4): States per second: 219285, Transitions per second: 1290959
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 256.7MB, 8.0 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 214 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 256.7MB (~256.0MB paged-in)
ltl formula name MedleyA-PT-08-LTLFireability-14
ltl formula formula --ltl=/tmp/2308/ltl_2_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 106 places, 214 transitions and 918 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2308/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2308/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2308/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2308/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 108 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 107, there are 221 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~50!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3942
pnml2lts-mc( 0/ 4): unique states count: 4049
pnml2lts-mc( 0/ 4): unique transitions count: 13490
pnml2lts-mc( 0/ 4): - self-loop count: 33
pnml2lts-mc( 0/ 4): - claim dead count: 9277
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4147
pnml2lts-mc( 0/ 4): - cum. max stack depth: 149
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4147 states 13895 transitions, fanout: 3.351
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.040 sec minimum, 0.040 sec on average)
pnml2lts-mc( 0/ 4): States per second: 103675, Transitions per second: 347375
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 10.0 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 214 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-08"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is MedleyA-PT-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 r579-smll-171734921200060"
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 ;