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.r553-tall-171734901300300.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 FireWire-PT-17, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901300300
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K 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 153K 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 FireWire-PT-17-LTLFireability-00
FORMULA_NAME FireWire-PT-17-LTLFireability-01
FORMULA_NAME FireWire-PT-17-LTLFireability-02
FORMULA_NAME FireWire-PT-17-LTLFireability-03
FORMULA_NAME FireWire-PT-17-LTLFireability-04
FORMULA_NAME FireWire-PT-17-LTLFireability-05
FORMULA_NAME FireWire-PT-17-LTLFireability-06
FORMULA_NAME FireWire-PT-17-LTLFireability-07
FORMULA_NAME FireWire-PT-17-LTLFireability-08
FORMULA_NAME FireWire-PT-17-LTLFireability-09
FORMULA_NAME FireWire-PT-17-LTLFireability-10
FORMULA_NAME FireWire-PT-17-LTLFireability-11
FORMULA_NAME FireWire-PT-17-LTLFireability-12
FORMULA_NAME FireWire-PT-17-LTLFireability-13
FORMULA_NAME FireWire-PT-17-LTLFireability-14
FORMULA_NAME FireWire-PT-17-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717357225210

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:40:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 19:40:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:40:26] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-06-02 19:40:26] [INFO ] Transformed 428 places.
[2024-06-02 19:40:26] [INFO ] Transformed 656 transitions.
[2024-06-02 19:40:26] [INFO ] Found NUPN structural information;
[2024-06-02 19:40:26] [INFO ] Parsed PT model containing 428 places and 656 transitions and 1904 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-17-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 428 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 428/428 places, 656/656 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 422 transition count 656
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 94 place count 334 transition count 568
Iterating global reduction 1 with 88 rules applied. Total rules applied 182 place count 334 transition count 568
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 204 place count 312 transition count 538
Iterating global reduction 1 with 22 rules applied. Total rules applied 226 place count 312 transition count 538
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 228 place count 312 transition count 536
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 230 place count 310 transition count 534
Iterating global reduction 2 with 2 rules applied. Total rules applied 232 place count 310 transition count 534
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 233 place count 309 transition count 533
Iterating global reduction 2 with 1 rules applied. Total rules applied 234 place count 309 transition count 533
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 235 place count 308 transition count 532
Iterating global reduction 2 with 1 rules applied. Total rules applied 236 place count 308 transition count 532
Applied a total of 236 rules in 90 ms. Remains 308 /428 variables (removed 120) and now considering 532/656 (removed 124) transitions.
// Phase 1: matrix 532 rows 308 cols
[2024-06-02 19:40:26] [INFO ] Computed 7 invariants in 22 ms
[2024-06-02 19:40:27] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-06-02 19:40:27] [INFO ] Invariant cache hit.
[2024-06-02 19:40:27] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
Running 531 sub problems to find dead transitions.
[2024-06-02 19:40:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-02 19:40:32] [INFO ] Deduced a trap composed of 164 places in 122 ms of which 18 ms to minimize.
[2024-06-02 19:40:33] [INFO ] Deduced a trap composed of 150 places in 111 ms of which 2 ms to minimize.
[2024-06-02 19:40:33] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:40:33] [INFO ] Deduced a trap composed of 75 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:40:33] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:40:33] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-06-02 19:40:34] [INFO ] Deduced a trap composed of 152 places in 95 ms of which 2 ms to minimize.
[2024-06-02 19:40:34] [INFO ] Deduced a trap composed of 166 places in 88 ms of which 2 ms to minimize.
[2024-06-02 19:40:34] [INFO ] Deduced a trap composed of 165 places in 86 ms of which 2 ms to minimize.
[2024-06-02 19:40:35] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:40:35] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 11 ms to minimize.
[2024-06-02 19:40:35] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 1 ms to minimize.
[2024-06-02 19:40:37] [INFO ] Deduced a trap composed of 79 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-02 19:40:38] [INFO ] Deduced a trap composed of 87 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-02 19:40:44] [INFO ] Deduced a trap composed of 157 places in 94 ms of which 2 ms to minimize.
[2024-06-02 19:40:46] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-02 19:40:49] [INFO ] Deduced a trap composed of 150 places in 94 ms of which 2 ms to minimize.
[2024-06-02 19:40:49] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2024-06-02 19:40:49] [INFO ] Deduced a trap composed of 87 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-02 19:40:53] [INFO ] Deduced a trap composed of 158 places in 95 ms of which 2 ms to minimize.
[2024-06-02 19:40:53] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 1 ms to minimize.
[2024-06-02 19:40:54] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 531 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/840 variables, and 29 constraints, problems are : Problem set: 0 solved, 531 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/308 constraints, PredecessorRefiner: 531/531 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 531 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 1 (OVERLAPS) 1/308 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-02 19:41:01] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-02 19:41:04] [INFO ] Deduced a trap composed of 135 places in 105 ms of which 2 ms to minimize.
[2024-06-02 19:41:06] [INFO ] Deduced a trap composed of 161 places in 102 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-02 19:41:09] [INFO ] Deduced a trap composed of 157 places in 100 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 7 (OVERLAPS) 532/840 variables, 308/341 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/840 variables, 531/872 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-02 19:41:21] [INFO ] Deduced a trap composed of 115 places in 109 ms of which 2 ms to minimize.
[2024-06-02 19:41:22] [INFO ] Deduced a trap composed of 112 places in 98 ms of which 2 ms to minimize.
[2024-06-02 19:41:22] [INFO ] Deduced a trap composed of 111 places in 98 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/840 variables, and 875 constraints, problems are : Problem set: 0 solved, 531 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 531/531 constraints, Known Traps: 29/29 constraints]
After SMT, in 60301ms problems are : Problem set: 0 solved, 531 unsolved
Search for dead transitions found 0 dead transitions in 60327ms
Starting structural reductions in LTL mode, iteration 1 : 308/428 places, 532/656 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61093 ms. Remains : 308/428 places, 532/656 transitions.
Support contains 54 out of 308 places after structural reductions.
[2024-06-02 19:41:28] [INFO ] Flatten gal took : 63 ms
[2024-06-02 19:41:28] [INFO ] Flatten gal took : 32 ms
[2024-06-02 19:41:28] [INFO ] Input system was already deterministic with 532 transitions.
Support contains 49 out of 308 places (down from 54) after GAL structural reductions.
RANDOM walk for 40000 steps (18 resets) in 1737 ms. (23 steps per ms) remains 26/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 8 ms. (444 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (8 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
[2024-06-02 19:41:28] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 1 (OVERLAPS) 218/257 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 12/269 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 491/760 variables, 269/276 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/760 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 17/777 variables, 8/284 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/777 variables, 0/284 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 20/797 variables, 9/293 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/797 variables, 0/293 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 14/811 variables, 7/300 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/811 variables, 0/300 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 13 (OVERLAPS) 17/828 variables, 7/307 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/828 variables, 0/307 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 15 (OVERLAPS) 11/839 variables, 7/314 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/839 variables, 0/314 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 17 (OVERLAPS) 1/840 variables, 1/315 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/840 variables, 0/315 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 19 (OVERLAPS) 0/840 variables, 0/315 constraints. Problems are: Problem set: 1 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 315 constraints, problems are : Problem set: 1 solved, 25 unsolved in 2657 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 308/308 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 219/257 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 25 unsolved
[2024-06-02 19:41:31] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:41:31] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 2 ms to minimize.
[2024-06-02 19:41:32] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 2 ms to minimize.
[2024-06-02 19:41:32] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 4/10 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 12/269 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 491/760 variables, 269/280 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/760 variables, 24/304 constraints. Problems are: Problem set: 1 solved, 25 unsolved
[2024-06-02 19:41:33] [INFO ] Deduced a trap composed of 79 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 1/305 constraints. Problems are: Problem set: 1 solved, 25 unsolved
[2024-06-02 19:41:34] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/760 variables, 1/306 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/760 variables, 0/306 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 17/777 variables, 8/314 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/777 variables, 1/315 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/777 variables, 0/315 constraints. Problems are: Problem set: 1 solved, 25 unsolved
At refinement iteration 14 (OVERLAPS) 20/797 variables, 9/324 constraints. Problems are: Problem set: 1 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 797/840 variables, and 324 constraints, problems are : Problem set: 1 solved, 25 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 286/308 constraints, PredecessorRefiner: 25/26 constraints, Known Traps: 6/6 constraints]
After SMT, in 7692ms problems are : Problem set: 1 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 38 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 532/532 transitions.
Graph (trivial) has 203 edges and 308 vertex of which 15 / 308 are part of one of the 3 SCC in 3 ms
Free SCC test removed 12 places
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 296 transition count 468
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 99 place count 249 transition count 464
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 102 place count 247 transition count 463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 103 place count 246 transition count 463
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 103 place count 246 transition count 435
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 159 place count 218 transition count 435
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 217 place count 189 transition count 406
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 257 place count 169 transition count 505
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 261 place count 169 transition count 501
Free-agglomeration rule applied 20 times.
Iterating global reduction 4 with 20 rules applied. Total rules applied 281 place count 169 transition count 481
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 301 place count 149 transition count 481
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 302 place count 149 transition count 480
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 303 place count 148 transition count 480
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 306 place count 148 transition count 480
Applied a total of 306 rules in 117 ms. Remains 148 /308 variables (removed 160) and now considering 480/532 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 148/308 places, 480/532 transitions.
RANDOM walk for 40000 steps (1616 resets) in 1003 ms. (39 steps per ms) remains 15/25 properties
BEST_FIRST walk for 4001 steps (40 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (41 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (30 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (58 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (38 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (44 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (30 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (52 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (16 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (36 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (28 resets) in 11 ms. (333 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4001 steps (15 resets) in 11 ms. (333 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4002 steps (44 resets) in 33 ms. (117 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (29 resets) in 15 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 13/13 properties
[2024-06-02 19:41:37] [INFO ] Flow matrix only has 465 transitions (discarded 15 similar events)
// Phase 1: matrix 465 rows 148 cols
[2024-06-02 19:41:37] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:41:37] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 119/140 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 4/144 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 465/609 variables, 144/151 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/609 variables, 14/165 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/609 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 4/613 variables, 4/169 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/613 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/613 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 613/613 variables, and 169 constraints, problems are : Problem set: 0 solved, 13 unsolved in 500 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 119/140 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 19:41:37] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-06-02 19:41:37] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2024-06-02 19:41:37] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 4/144 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 19:41:38] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 465/609 variables, 144/155 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/609 variables, 14/169 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/609 variables, 12/181 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 19:41:38] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/609 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/609 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 4/613 variables, 4/186 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/613 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/613 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 0/613 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 613/613 variables, and 187 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1848 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 148/148 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 5/5 constraints]
After SMT, in 2367ms problems are : Problem set: 0 solved, 13 unsolved
Parikh walk visited 1 properties in 9529 ms.
Support contains 21 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 480/480 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 148 transition count 479
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 147 transition count 479
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 147 transition count 477
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 145 transition count 477
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 144 transition count 436
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 144 transition count 436
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 14 place count 141 transition count 433
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 140 transition count 431
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 140 transition count 431
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 21 place count 140 transition count 426
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -27
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 31 place count 135 transition count 453
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 39 place count 135 transition count 445
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 41 place count 135 transition count 443
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 43 place count 133 transition count 443
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 49 place count 133 transition count 437
Applied a total of 49 rules in 62 ms. Remains 133 /148 variables (removed 15) and now considering 437/480 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 133/148 places, 437/480 transitions.
RANDOM walk for 40000 steps (1767 resets) in 335 ms. (119 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (454 resets) in 196 ms. (203 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40004 steps (444 resets) in 92 ms. (430 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (279 resets) in 77 ms. (512 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (531 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (455 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (438 resets) in 94 ms. (421 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (540 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (469 resets) in 94 ms. (421 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (188 resets) in 81 ms. (487 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (348 resets) in 62 ms. (634 steps per ms) remains 9/9 properties
[2024-06-02 19:41:49] [INFO ] Flow matrix only has 420 transitions (discarded 17 similar events)
// Phase 1: matrix 420 rows 133 cols
[2024-06-02 19:41:49] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:41:49] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 107/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 4/129 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 420/549 variables, 129/136 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 12/148 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 4/553 variables, 4/152 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/553 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/553 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 152 constraints, problems are : Problem set: 0 solved, 9 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 133/133 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 107/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:41:50] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 2 ms to minimize.
[2024-06-02 19:41:50] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 1 ms to minimize.
[2024-06-02 19:41:50] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:41:50] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 4/129 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:41:50] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 420/549 variables, 129/141 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/549 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/549 variables, 8/161 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 19:41:50] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:41:50] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/549 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/549 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 4/553 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/553 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/553 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 168 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1548 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 133/133 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 7/7 constraints]
After SMT, in 1947ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 23221 ms.
Support contains 18 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 437/437 transitions.
Graph (trivial) has 14 edges and 133 vertex of which 2 / 133 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 132 transition count 434
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 131 transition count 434
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 129 transition count 440
Drop transitions (Redundant composition of simpler transitions.) removed 89 transitions
Redundant transition composition rules discarded 89 transitions
Iterating global reduction 0 with 89 rules applied. Total rules applied 96 place count 129 transition count 351
Applied a total of 96 rules in 19 ms. Remains 129 /133 variables (removed 4) and now considering 351/437 (removed 86) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 129/133 places, 351/437 transitions.
RANDOM walk for 40000 steps (1874 resets) in 170 ms. (233 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (538 resets) in 90 ms. (439 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (523 resets) in 78 ms. (506 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (24 resets) in 68 ms. (579 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (618 resets) in 60 ms. (655 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (520 resets) in 42 ms. (930 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (527 resets) in 59 ms. (666 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (540 resets) in 57 ms. (689 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (276 resets) in 64 ms. (615 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (387 resets) in 58 ms. (678 steps per ms) remains 8/8 properties
[2024-06-02 19:42:15] [INFO ] Flow matrix only has 336 transitions (discarded 15 similar events)
// Phase 1: matrix 336 rows 129 cols
[2024-06-02 19:42:15] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:42:15] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 105/121 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 4/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 336/461 variables, 125/132 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 41/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 4/465 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/465 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/465 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 465/465 variables, and 177 constraints, problems are : Problem set: 0 solved, 8 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 129/129 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 105/121 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 19:42:15] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:42:15] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:42:15] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2024-06-02 19:42:15] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 4/125 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 19:42:15] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 19:42:16] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 336/461 variables, 125/138 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 41/179 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 7/186 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 19:42:16] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:42:16] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/461 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 4/465 variables, 4/192 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/465 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/465 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/465 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 465/465 variables, and 193 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1358 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 129/129 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 8/8 constraints]
After SMT, in 1681ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 7602 ms.
Support contains 16 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 351/351 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 129 transition count 349
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 127 transition count 349
Applied a total of 4 rules in 12 ms. Remains 127 /129 variables (removed 2) and now considering 349/351 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 127/129 places, 349/351 transitions.
RANDOM walk for 40000 steps (1974 resets) in 193 ms. (206 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (519 resets) in 57 ms. (689 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (506 resets) in 59 ms. (666 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (26 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (512 resets) in 66 ms. (597 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (499 resets) in 33 ms. (1176 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (567 resets) in 35 ms. (1111 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (231 resets) in 37 ms. (1052 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40001 steps (397 resets) in 32 ms. (1212 steps per ms) remains 7/7 properties
[2024-06-02 19:42:24] [INFO ] Flow matrix only has 334 transitions (discarded 15 similar events)
// Phase 1: matrix 334 rows 127 cols
[2024-06-02 19:42:24] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:42:24] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 105/119 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 4/123 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 334/457 variables, 123/130 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 41/171 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 4/461 variables, 4/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/461 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 175 constraints, problems are : Problem set: 0 solved, 7 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 105/119 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 19:42:25] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 2 ms to minimize.
[2024-06-02 19:42:25] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 4/123 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 19:42:25] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 19:42:25] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 334/457 variables, 123/134 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/457 variables, 41/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 6/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 19:42:25] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/457 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 4/461 variables, 4/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/461 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/461 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/461 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 461/461 variables, and 187 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1055 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 5/5 constraints]
After SMT, in 1360ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 13874 ms.
Support contains 14 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 349/349 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 351
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 126 transition count 348
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 126 transition count 347
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 125 transition count 347
Applied a total of 7 rules in 21 ms. Remains 125 /127 variables (removed 2) and now considering 347/349 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 125/127 places, 347/349 transitions.
RANDOM walk for 40000 steps (2004 resets) in 133 ms. (298 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (503 resets) in 65 ms. (606 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (20 resets) in 48 ms. (816 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (510 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (512 resets) in 49 ms. (800 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (565 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (247 resets) in 51 ms. (769 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (390 resets) in 42 ms. (930 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 700098 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :4 out of 7
Probabilistic random walk after 700098 steps, saw 204337 distinct states, run finished after 3004 ms. (steps per millisecond=233 ) properties seen :4
[2024-06-02 19:42:43] [INFO ] Flow matrix only has 332 transitions (discarded 15 similar events)
// Phase 1: matrix 332 rows 125 cols
[2024-06-02 19:42:43] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:42:43] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 62/68 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:42:43] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 53/121 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 332/453 variables, 121/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 41/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/457 variables, 4/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/457 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/457 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 174 constraints, problems are : Problem set: 0 solved, 3 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 41/41 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 62/68 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 53/121 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 332/453 variables, 121/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 41/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4/457 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/457 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/457 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/457 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 177 constraints, problems are : Problem set: 0 solved, 3 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 545ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 309 ms.
Support contains 6 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 347/347 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 125 transition count 346
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 124 transition count 346
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 122 transition count 344
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 121 transition count 343
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 121 transition count 343
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 120 transition count 345
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 120 transition count 341
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 17 place count 120 transition count 338
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 54 place count 117 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 1 with 15 rules applied. Total rules applied 69 place count 117 transition count 289
Applied a total of 69 rules in 35 ms. Remains 117 /125 variables (removed 8) and now considering 289/347 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 117/125 places, 289/347 transitions.
RANDOM walk for 40000 steps (2214 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (574 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (244 resets) in 81 ms. (487 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (412 resets) in 42 ms. (930 steps per ms) remains 1/2 properties
[2024-06-02 19:42:44] [INFO ] Flow matrix only has 254 transitions (discarded 35 similar events)
// Phase 1: matrix 254 rows 117 cols
[2024-06-02 19:42:44] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:42:44] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 58/113 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:42:44] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 254/367 variables, 113/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 43/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/371 variables, 4/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/371 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 168 constraints, problems are : Problem set: 0 solved, 1 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 43/43 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 58/113 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 254/367 variables, 113/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 43/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/371 variables, 4/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/371 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/371 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 169 constraints, problems are : Problem set: 0 solved, 1 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 298ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 289/289 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 117 transition count 288
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 288
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 114 transition count 288
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 114 transition count 288
Applied a total of 7 rules in 15 ms. Remains 114 /117 variables (removed 3) and now considering 288/289 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 114/117 places, 288/289 transitions.
RANDOM walk for 40000 steps (2286 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (631 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 72350 steps, run visited all 1 properties in 156 ms. (steps per millisecond=463 )
Probabilistic random walk after 72350 steps, saw 28561 distinct states, run finished after 160 ms. (steps per millisecond=452 ) properties seen :1
FORMULA FireWire-PT-17-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FireWire-PT-17-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA FireWire-PT-17-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 47 stabilizing places and 51 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((p0 U p1) U (F(!p0)&&G(!p2)))))))'
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 301 transition count 506
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 301 transition count 506
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 296 transition count 501
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 296 transition count 501
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 296 transition count 500
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 295 transition count 499
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 295 transition count 499
Applied a total of 27 rules in 8 ms. Remains 295 /308 variables (removed 13) and now considering 499/532 (removed 33) transitions.
// Phase 1: matrix 499 rows 295 cols
[2024-06-02 19:42:45] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 19:42:45] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 19:42:45] [INFO ] Invariant cache hit.
[2024-06-02 19:42:45] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2024-06-02 19:42:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:42:50] [INFO ] Deduced a trap composed of 182 places in 99 ms of which 1 ms to minimize.
[2024-06-02 19:42:50] [INFO ] Deduced a trap composed of 154 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:42:50] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 1 ms to minimize.
[2024-06-02 19:42:50] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:42:51] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 2 ms to minimize.
[2024-06-02 19:42:51] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:42:51] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-02 19:42:51] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:42:51] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:42:52] [INFO ] Deduced a trap composed of 85 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:42:52] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 2 ms to minimize.
[2024-06-02 19:42:52] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 1 ms to minimize.
[2024-06-02 19:42:52] [INFO ] Deduced a trap composed of 114 places in 98 ms of which 1 ms to minimize.
[2024-06-02 19:42:53] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 1 ms to minimize.
[2024-06-02 19:42:53] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:42:55] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:42:56] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 794/794 variables, and 319 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 498/817 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:43:26] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-06-02 19:43:28] [INFO ] Deduced a trap composed of 115 places in 96 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/794 variables, and 819 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 19/19 constraints]
After SMT, in 60167ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60173ms
Starting structural reductions in LTL mode, iteration 1 : 295/308 places, 499/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60540 ms. Remains : 295/308 places, 499/532 transitions.
Stuttering acceptance computed with spot in 530 ms :[(OR p0 p2), (OR p0 p2), (OR p0 p2), true, (NOT p1), p2, (OR p0 p2), p2, p0]
Running random walk in product with property : FireWire-PT-17-LTLFireability-01
Product exploration explored 100000 steps with 3 reset in 167 ms.
Product exploration explored 100000 steps with 0 reset in 118 ms.
Computed a total of 42 stabilizing places and 46 stable transitions
Computed a total of 42 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1))))), (X (X (OR p0 (NOT p2) p1))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 131 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 335 ms :[(OR p0 p2), (OR p0 p2), (OR p0 p2), true, (NOT p1), p2, (OR p0 p2), p2, p0]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (12 resets) in 280 ms. (142 steps per ms) remains 7/11 properties
BEST_FIRST walk for 40000 steps (27 resets) in 185 ms. (215 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (15 resets) in 180 ms. (220 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (26 resets) in 144 ms. (275 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (15 resets) in 199 ms. (200 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (17 resets) in 282 ms. (141 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (15 resets) in 149 ms. (266 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (11 resets) in 141 ms. (281 steps per ms) remains 7/7 properties
[2024-06-02 19:43:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf3 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 1 (OVERLAPS) 206/211 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-06-02 19:43:48] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 50/261 variables, 4/8 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 463/724 variables, 261/269 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/724 variables, 0/269 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 18/742 variables, 8/277 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/742 variables, 0/277 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 20/762 variables, 10/287 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/762 variables, 0/287 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 12/774 variables, 6/293 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/774 variables, 0/293 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 14/788 variables, 6/299 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/788 variables, 0/299 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 6/794 variables, 4/303 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/303 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/794 variables, 0/303 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 794/794 variables, and 303 constraints, problems are : Problem set: 2 solved, 5 unsolved in 1031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 206/211 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 50/261 variables, 4/8 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 463/724 variables, 261/269 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/724 variables, 5/274 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/724 variables, 0/274 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 18/742 variables, 8/282 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/742 variables, 0/282 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 20/762 variables, 10/292 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/762 variables, 0/292 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 12/774 variables, 6/298 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/774 variables, 0/298 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 14/788 variables, 6/304 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/788 variables, 0/304 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 6/794 variables, 4/308 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/794 variables, 0/308 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/794 variables, 0/308 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 794/794 variables, and 308 constraints, problems are : Problem set: 2 solved, 5 unsolved in 948 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 1996ms problems are : Problem set: 2 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 810 ms.
Support contains 5 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 499/499 transitions.
Graph (trivial) has 225 edges and 295 vertex of which 18 / 295 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 280 transition count 429
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 53 rules applied. Total rules applied 103 place count 231 transition count 425
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 105 place count 229 transition count 425
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 105 place count 229 transition count 393
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 169 place count 197 transition count 393
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 225 place count 169 transition count 365
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -126
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 283 place count 140 transition count 491
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 289 place count 140 transition count 485
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 4 with 55 rules applied. Total rules applied 344 place count 140 transition count 430
Free-agglomeration rule applied 20 times.
Iterating global reduction 4 with 20 rules applied. Total rules applied 364 place count 140 transition count 410
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 390 place count 120 transition count 404
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 5 with 55 rules applied. Total rules applied 445 place count 120 transition count 349
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 448 place count 120 transition count 349
Applied a total of 448 rules in 47 ms. Remains 120 /295 variables (removed 175) and now considering 349/499 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 120/295 places, 349/499 transitions.
RANDOM walk for 40000 steps (1931 resets) in 150 ms. (264 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (663 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (431 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (14 resets) in 121 ms. (327 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (20 resets) in 112 ms. (354 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (12 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 88536 steps, run visited all 5 properties in 397 ms. (steps per millisecond=223 )
Probabilistic random walk after 88536 steps, saw 33456 distinct states, run finished after 397 ms. (steps per millisecond=223 ) properties seen :5
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1))))), (X (X (OR p0 (NOT p2) p1))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p2) p1)), (G (AND (OR (NOT p0) (NOT p2)) (OR (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (OR (NOT p0) p2) (OR p2 (NOT p1))))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F p1), (F p0)]
Knowledge based reduction with 12 factoid took 558 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Stuttering acceptance computed with spot in 187 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Support contains 4 out of 295 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 499/499 transitions.
Applied a total of 0 rules in 4 ms. Remains 295 /295 variables (removed 0) and now considering 499/499 (removed 0) transitions.
[2024-06-02 19:43:52] [INFO ] Invariant cache hit.
[2024-06-02 19:43:52] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 19:43:52] [INFO ] Invariant cache hit.
[2024-06-02 19:43:52] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2024-06-02 19:43:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:43:57] [INFO ] Deduced a trap composed of 182 places in 103 ms of which 2 ms to minimize.
[2024-06-02 19:43:57] [INFO ] Deduced a trap composed of 154 places in 88 ms of which 1 ms to minimize.
[2024-06-02 19:43:57] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:43:57] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:43:57] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 2 ms to minimize.
[2024-06-02 19:43:58] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 2 ms to minimize.
[2024-06-02 19:43:58] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:43:58] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:43:58] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:43:59] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:43:59] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 2 ms to minimize.
[2024-06-02 19:43:59] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 2 ms to minimize.
[2024-06-02 19:43:59] [INFO ] Deduced a trap composed of 114 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:43:59] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 2 ms to minimize.
[2024-06-02 19:44:00] [INFO ] Deduced a trap composed of 66 places in 95 ms of which 1 ms to minimize.
[2024-06-02 19:44:02] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:44:03] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 794/794 variables, and 319 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 498/817 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:44:33] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-06-02 19:44:35] [INFO ] Deduced a trap composed of 115 places in 104 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/794 variables, and 819 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 19/19 constraints]
After SMT, in 60191ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60195ms
Finished structural reductions in LTL mode , in 1 iterations and 60553 ms. Remains : 295/295 places, 499/499 transitions.
Computed a total of 42 stabilizing places and 46 stable transitions
Computed a total of 42 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
RANDOM walk for 40000 steps (16 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (14 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (12 resets) in 129 ms. (307 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (16 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 822330 steps, run timeout after 3001 ms. (steps per millisecond=274 ) properties seen :0 out of 3
Probabilistic random walk after 822330 steps, saw 161758 distinct states, run finished after 3001 ms. (steps per millisecond=274 ) properties seen :0
[2024-06-02 19:44:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 207/211 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:44:56] [INFO ] Deduced a trap composed of 51 places in 75 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 50/261 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 463/724 variables, 261/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/724 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 18/742 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/742 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 20/762 variables, 10/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/762 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 12/774 variables, 6/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/774 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 14/788 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/788 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 6/794 variables, 4/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/794 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 794/794 variables, and 303 constraints, problems are : Problem set: 0 solved, 3 unsolved in 653 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 207/211 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 50/261 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 463/724 variables, 261/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/724 variables, 3/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/724 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 18/742 variables, 8/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/742 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 20/762 variables, 10/290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/762 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 12/774 variables, 6/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/774 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 14/788 variables, 6/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/788 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 6/794 variables, 4/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/794 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/794 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 794/794 variables, and 306 constraints, problems are : Problem set: 0 solved, 3 unsolved in 607 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1270ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1035 ms.
Support contains 4 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 499/499 transitions.
Graph (trivial) has 229 edges and 295 vertex of which 18 / 295 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 280 transition count 429
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 53 rules applied. Total rules applied 103 place count 231 transition count 425
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 105 place count 229 transition count 425
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 105 place count 229 transition count 392
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 171 place count 196 transition count 392
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 227 place count 168 transition count 364
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -126
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 285 place count 139 transition count 490
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 291 place count 139 transition count 484
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 4 with 55 rules applied. Total rules applied 346 place count 139 transition count 429
Free-agglomeration rule applied 21 times.
Iterating global reduction 4 with 21 rules applied. Total rules applied 367 place count 139 transition count 408
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 394 place count 118 transition count 402
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 5 with 55 rules applied. Total rules applied 449 place count 118 transition count 347
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 451 place count 118 transition count 347
Applied a total of 451 rules in 49 ms. Remains 118 /295 variables (removed 177) and now considering 347/499 (removed 152) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 118/295 places, 347/499 transitions.
RANDOM walk for 40000 steps (2133 resets) in 145 ms. (273 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (701 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (15 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (24 resets) in 112 ms. (354 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 14747 steps, run visited all 3 properties in 84 ms. (steps per millisecond=175 )
Probabilistic random walk after 14747 steps, saw 5533 distinct states, run finished after 84 ms. (steps per millisecond=175 ) properties seen :3
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p2), (F p0), (F (NOT (OR p2 (NOT p0))))]
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Stuttering acceptance computed with spot in 167 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Stuttering acceptance computed with spot in 181 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Product exploration explored 100000 steps with 0 reset in 125 ms.
Product exploration explored 100000 steps with 2 reset in 140 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 162 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Support contains 4 out of 295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 295/295 places, 499/499 transitions.
Graph (trivial) has 229 edges and 295 vertex of which 18 / 295 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 280 transition count 483
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 280 transition count 481
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 50 place count 280 transition count 501
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 68 place count 280 transition count 501
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 83 place count 265 transition count 486
Deduced a syphon composed of 50 places in 1 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 98 place count 265 transition count 486
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 88 places in 1 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 136 place count 265 transition count 488
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 156 place count 245 transition count 468
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 176 place count 245 transition count 468
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -241
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 2 with 37 rules applied. Total rules applied 213 place count 245 transition count 709
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 223 place count 235 transition count 687
Deduced a syphon composed of 95 places in 1 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 233 place count 235 transition count 687
Deduced a syphon composed of 95 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 2 with 55 rules applied. Total rules applied 288 place count 235 transition count 632
Deduced a syphon composed of 95 places in 0 ms
Applied a total of 288 rules in 73 ms. Remains 235 /295 variables (removed 60) and now considering 632/499 (removed -133) transitions.
[2024-06-02 19:45:00] [INFO ] Redundant transitions in 60 ms returned []
Running 623 sub problems to find dead transitions.
[2024-06-02 19:45:00] [INFO ] Flow matrix only has 612 transitions (discarded 20 similar events)
// Phase 1: matrix 612 rows 235 cols
[2024-06-02 19:45:00] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:45:00] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 623 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 623 unsolved
[2024-06-02 19:45:05] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 2 ms to minimize.
[2024-06-02 19:45:05] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
[2024-06-02 19:45:05] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 0 ms to minimize.
[2024-06-02 19:45:05] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-02 19:45:06] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
[2024-06-02 19:45:06] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:45:06] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
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
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 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
[2024-06-02 19:45:06] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:45:06] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
[2024-06-02 19:45:06] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2024-06-02 19:45:06] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-06-02 19:45:06] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
[2024-06-02 19:45:06] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 1 ms to minimize.
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
[2024-06-02 19:45:07] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
[2024-06-02 19:45:07] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
[2024-06-02 19:45:07] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 1 ms to minimize.
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 16/23 constraints. Problems are: Problem set: 188 solved, 435 unsolved
[2024-06-02 19:45:09] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 2 ms to minimize.
[2024-06-02 19:45:09] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2024-06-02 19:45:10] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 3/26 constraints. Problems are: Problem set: 188 solved, 435 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/26 constraints. Problems are: Problem set: 188 solved, 435 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
At refinement iteration 5 (OVERLAPS) 611/846 variables, 235/261 constraints. Problems are: Problem set: 200 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/846 variables, 52/313 constraints. Problems are: Problem set: 200 solved, 423 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/846 variables, 0/313 constraints. Problems are: Problem set: 200 solved, 423 unsolved
At refinement iteration 8 (OVERLAPS) 1/847 variables, 1/314 constraints. Problems are: Problem set: 200 solved, 423 unsolved
[2024-06-02 19:45:23] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
[2024-06-02 19:45:23] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/847 variables, 2/316 constraints. Problems are: Problem set: 200 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 847/847 variables, and 316 constraints, problems are : Problem set: 200 solved, 423 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 235/235 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 623/623 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 200 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 200 solved, 423 unsolved
At refinement iteration 1 (OVERLAPS) 90/229 variables, 7/7 constraints. Problems are: Problem set: 200 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 21/28 constraints. Problems are: Problem set: 200 solved, 423 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/28 constraints. Problems are: Problem set: 200 solved, 423 unsolved
At refinement iteration 4 (OVERLAPS) 607/836 variables, 229/257 constraints. Problems are: Problem set: 200 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/836 variables, 52/309 constraints. Problems are: Problem set: 200 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/836 variables, 423/732 constraints. Problems are: Problem set: 200 solved, 423 unsolved
[2024-06-02 19:45:39] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/836 variables, 1/733 constraints. Problems are: Problem set: 200 solved, 423 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/836 variables, 0/733 constraints. Problems are: Problem set: 200 solved, 423 unsolved
SMT process timed out in 60426ms, After SMT, problems are : Problem set: 200 solved, 423 unsolved
Search for dead transitions found 200 dead transitions in 60435ms
Found 200 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 200 transitions
Dead transitions reduction (with SMT) removed 200 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 235/295 places, 432/499 transitions.
Graph (complete) has 745 edges and 235 vertex of which 140 are kept as prefixes of interest. Removing 95 places using SCC suffix rule.2 ms
Discarding 95 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 24 ms. Remains 140 /235 variables (removed 95) and now considering 432/432 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 140/295 places, 432/499 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60598 ms. Remains : 140/295 places, 432/499 transitions.
Support contains 4 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 499/499 transitions.
Applied a total of 0 rules in 3 ms. Remains 295 /295 variables (removed 0) and now considering 499/499 (removed 0) transitions.
// Phase 1: matrix 499 rows 295 cols
[2024-06-02 19:46:00] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:46:01] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 19:46:01] [INFO ] Invariant cache hit.
[2024-06-02 19:46:01] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2024-06-02 19:46:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:46:05] [INFO ] Deduced a trap composed of 182 places in 96 ms of which 2 ms to minimize.
[2024-06-02 19:46:05] [INFO ] Deduced a trap composed of 154 places in 88 ms of which 1 ms to minimize.
[2024-06-02 19:46:06] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 2 ms to minimize.
[2024-06-02 19:46:06] [INFO ] Deduced a trap composed of 74 places in 49 ms of which 0 ms to minimize.
[2024-06-02 19:46:06] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:46:06] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 1 ms to minimize.
[2024-06-02 19:46:06] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-06-02 19:46:06] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 1 ms to minimize.
[2024-06-02 19:46:07] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:46:07] [INFO ] Deduced a trap composed of 85 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:46:07] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 1 ms to minimize.
[2024-06-02 19:46:07] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 2 ms to minimize.
[2024-06-02 19:46:08] [INFO ] Deduced a trap composed of 114 places in 97 ms of which 2 ms to minimize.
[2024-06-02 19:46:08] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
[2024-06-02 19:46:08] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:46:10] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:46:11] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 794/794 variables, and 319 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 498/817 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:46:42] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 2 ms to minimize.
[2024-06-02 19:46:44] [INFO ] Deduced a trap composed of 115 places in 102 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/794 variables, and 819 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 19/19 constraints]
After SMT, in 60171ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60177ms
Finished structural reductions in LTL mode , in 1 iterations and 60513 ms. Remains : 295/295 places, 499/499 transitions.
Treatment of property FireWire-PT-17-LTLFireability-01 finished in 256220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 4 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 301 transition count 506
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 301 transition count 506
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 297 transition count 502
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 297 transition count 502
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 297 transition count 501
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 296 transition count 500
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 296 transition count 500
Applied a total of 25 rules in 13 ms. Remains 296 /308 variables (removed 12) and now considering 500/532 (removed 32) transitions.
// Phase 1: matrix 500 rows 296 cols
[2024-06-02 19:47:01] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:47:01] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 19:47:01] [INFO ] Invariant cache hit.
[2024-06-02 19:47:01] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 499 sub problems to find dead transitions.
[2024-06-02 19:47:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (OVERLAPS) 1/296 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-02 19:47:06] [INFO ] Deduced a trap composed of 188 places in 94 ms of which 1 ms to minimize.
[2024-06-02 19:47:06] [INFO ] Deduced a trap composed of 142 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:47:06] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
[2024-06-02 19:47:07] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:47:07] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:47:07] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-06-02 19:47:07] [INFO ] Deduced a trap composed of 85 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:47:07] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:47:08] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 0 ms to minimize.
[2024-06-02 19:47:08] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 2 ms to minimize.
[2024-06-02 19:47:08] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 1 ms to minimize.
[2024-06-02 19:47:09] [INFO ] Deduced a trap composed of 66 places in 103 ms of which 2 ms to minimize.
[2024-06-02 19:47:11] [INFO ] Deduced a trap composed of 78 places in 49 ms of which 0 ms to minimize.
[2024-06-02 19:47:11] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-02 19:47:12] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-06-02 19:47:12] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 5 (OVERLAPS) 500/796 variables, 296/319 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/796 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-02 19:47:32] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 2 ms to minimize.
SMT process timed out in 30169ms, After SMT, problems are : Problem set: 0 solved, 499 unsolved
Search for dead transitions found 0 dead transitions in 30176ms
Starting structural reductions in LTL mode, iteration 1 : 296/308 places, 500/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30528 ms. Remains : 296/308 places, 500/532 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : FireWire-PT-17-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 98 ms.
Product exploration explored 100000 steps with 0 reset in 91 ms.
Computed a total of 42 stabilizing places and 46 stable transitions
Computed a total of 42 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 87 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
RANDOM walk for 40000 steps (15 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (15 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (10 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (11 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 786602 steps, run timeout after 3001 ms. (steps per millisecond=262 ) properties seen :0 out of 3
Probabilistic random walk after 786602 steps, saw 155666 distinct states, run finished after 3001 ms. (steps per millisecond=262 ) properties seen :0
[2024-06-02 19:47:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 141/145 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 117/262 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 464/726 variables, 262/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 18/744 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/744 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 20/764 variables, 10/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/764 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 12/776 variables, 6/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/776 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 14/790 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/790 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 6/796 variables, 4/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/796 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/796 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 796/796 variables, and 303 constraints, problems are : Problem set: 0 solved, 3 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 141/145 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:47:36] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 117/262 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:47:36] [INFO ] Deduced a trap composed of 78 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 464/726 variables, 262/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 3/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 18/744 variables, 8/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/744 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 20/764 variables, 10/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/764 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 12/776 variables, 6/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/776 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 14/790 variables, 6/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/790 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 6/796 variables, 4/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/796 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/796 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 796/796 variables, and 308 constraints, problems are : Problem set: 0 solved, 3 unsolved in 781 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 1132ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1612 ms.
Support contains 4 out of 296 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 296/296 places, 500/500 transitions.
Graph (trivial) has 231 edges and 296 vertex of which 18 / 296 are part of one of the 3 SCC in 2 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 281 transition count 429
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 54 rules applied. Total rules applied 105 place count 231 transition count 425
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 229 transition count 425
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 107 place count 229 transition count 393
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 171 place count 197 transition count 393
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 172 place count 196 transition count 373
Iterating global reduction 3 with 1 rules applied. Total rules applied 173 place count 196 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 174 place count 196 transition count 372
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 230 place count 168 transition count 344
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 292 place count 137 transition count 443
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 298 place count 137 transition count 437
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 334 place count 137 transition count 401
Free-agglomeration rule applied 19 times.
Iterating global reduction 5 with 19 rules applied. Total rules applied 353 place count 137 transition count 382
Reduce places removed 19 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 378 place count 118 transition count 376
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 6 with 56 rules applied. Total rules applied 434 place count 118 transition count 320
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 436 place count 118 transition count 320
Applied a total of 436 rules in 52 ms. Remains 118 /296 variables (removed 178) and now considering 320/500 (removed 180) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 118/296 places, 320/500 transitions.
RANDOM walk for 40000 steps (2325 resets) in 177 ms. (224 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (577 resets) in 77 ms. (512 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (584 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (583 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 652094 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :0 out of 3
Probabilistic random walk after 652094 steps, saw 193599 distinct states, run finished after 3001 ms. (steps per millisecond=217 ) properties seen :0
[2024-06-02 19:47:41] [INFO ] Flow matrix only has 283 transitions (discarded 37 similar events)
// Phase 1: matrix 283 rows 118 cols
[2024-06-02 19:47:41] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:47:41] [INFO ] State equation strengthened by 63 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 58/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 52/114 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 283/397 variables, 114/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 63/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 4/401 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/401 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 188 constraints, problems are : Problem set: 0 solved, 3 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 58/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:47:41] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 52/114 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-02 19:47:42] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 283/397 variables, 114/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 63/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/401 variables, 4/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/401 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/401 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 193 constraints, problems are : Problem set: 0 solved, 3 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 501ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 161 ms.
Support contains 4 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 320/320 transitions.
Applied a total of 0 rules in 4 ms. Remains 118 /118 variables (removed 0) and now considering 320/320 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 118/118 places, 320/320 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 320/320 transitions.
Applied a total of 0 rules in 4 ms. Remains 118 /118 variables (removed 0) and now considering 320/320 (removed 0) transitions.
[2024-06-02 19:47:42] [INFO ] Flow matrix only has 283 transitions (discarded 37 similar events)
[2024-06-02 19:47:42] [INFO ] Invariant cache hit.
[2024-06-02 19:47:42] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 19:47:42] [INFO ] Flow matrix only has 283 transitions (discarded 37 similar events)
[2024-06-02 19:47:42] [INFO ] Invariant cache hit.
[2024-06-02 19:47:42] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-02 19:47:42] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-06-02 19:47:42] [INFO ] Redundant transitions in 6 ms returned []
Running 316 sub problems to find dead transitions.
[2024-06-02 19:47:42] [INFO ] Flow matrix only has 283 transitions (discarded 37 similar events)
[2024-06-02 19:47:42] [INFO ] Invariant cache hit.
[2024-06-02 19:47:42] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-02 19:47:44] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-06-02 19:47:44] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-02 19:47:44] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:47:44] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:47:44] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:47:44] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-06-02 19:47:44] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:47:44] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 0 ms to minimize.
[2024-06-02 19:47:45] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:47:45] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:47:45] [INFO ] Deduced a trap composed of 86 places in 57 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-02 19:47:46] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-02 19:47:47] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:47:47] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:47:47] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 0 ms to minimize.
[2024-06-02 19:47:47] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (OVERLAPS) 283/401 variables, 118/141 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 63/204 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 9 (OVERLAPS) 0/401 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 204 constraints, problems are : Problem set: 0 solved, 316 unsolved in 15134 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 283/401 variables, 118/141 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 63/204 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 316/520 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-02 19:48:02] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 9 (OVERLAPS) 0/401 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 521 constraints, problems are : Problem set: 0 solved, 316 unsolved in 21264 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 17/17 constraints]
After SMT, in 36569ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 36572ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36867 ms. Remains : 118/118 places, 320/320 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 118 vertex of which 20 / 118 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 77 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 91 transitions.
Graph (complete) has 441 edges and 101 vertex of which 99 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 6 place count 95 transition count 225
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 95 transition count 225
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 14 place count 95 transition count 221
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 94 transition count 220
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 92 transition count 224
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 28 place count 92 transition count 216
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 38 place count 92 transition count 206
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 92 transition count 204
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 42 place count 90 transition count 204
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 48 place count 87 transition count 201
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 54 place count 87 transition count 195
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 55 place count 87 transition count 194
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 57 place count 86 transition count 193
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 58 place count 85 transition count 171
Iterating global reduction 5 with 1 rules applied. Total rules applied 59 place count 85 transition count 171
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 64 place count 85 transition count 166
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 69 place count 80 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 73 place count 80 transition count 162
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 75 place count 80 transition count 160
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 77 place count 78 transition count 160
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 81 place count 78 transition count 160
Applied a total of 81 rules in 30 ms. Remains 78 /118 variables (removed 40) and now considering 160/320 (removed 160) transitions.
Running SMT prover for 3 properties.
[2024-06-02 19:48:19] [INFO ] Flow matrix only has 158 transitions (discarded 2 similar events)
// Phase 1: matrix 158 rows 78 cols
[2024-06-02 19:48:19] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:48:19] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 19:48:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 19:48:19] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 19:48:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 19:48:19] [INFO ] After 18ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-02 19:48:19] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-06-02 19:48:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
TRAPS : Iteration 1
[2024-06-02 19:48:19] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-02 19:48:19] [INFO ] After 202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 270 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 71 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 4 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 500/500 transitions.
Graph (trivial) has 231 edges and 296 vertex of which 18 / 296 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 280 transition count 435
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 52 rules applied. Total rules applied 101 place count 232 transition count 431
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 230 transition count 431
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 103 place count 230 transition count 399
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 167 place count 198 transition count 399
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 168 place count 197 transition count 379
Iterating global reduction 3 with 1 rules applied. Total rules applied 169 place count 197 transition count 379
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 170 place count 197 transition count 378
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 224 place count 170 transition count 351
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -104
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 290 place count 137 transition count 455
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 4 with 42 rules applied. Total rules applied 332 place count 137 transition count 413
Applied a total of 332 rules in 31 ms. Remains 137 /296 variables (removed 159) and now considering 413/500 (removed 87) transitions.
[2024-06-02 19:48:19] [INFO ] Flow matrix only has 394 transitions (discarded 19 similar events)
// Phase 1: matrix 394 rows 137 cols
[2024-06-02 19:48:19] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:48:19] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 19:48:19] [INFO ] Flow matrix only has 394 transitions (discarded 19 similar events)
[2024-06-02 19:48:19] [INFO ] Invariant cache hit.
[2024-06-02 19:48:19] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:48:20] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2024-06-02 19:48:20] [INFO ] Redundant transitions in 18 ms returned []
Running 403 sub problems to find dead transitions.
[2024-06-02 19:48:20] [INFO ] Flow matrix only has 394 transitions (discarded 19 similar events)
[2024-06-02 19:48:20] [INFO ] Invariant cache hit.
[2024-06-02 19:48:20] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-02 19:48:22] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:48:22] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:48:22] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:48:22] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-06-02 19:48:22] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:48:23] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:48:23] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:48:23] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-02 19:48:25] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (OVERLAPS) 393/530 variables, 137/153 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 61/214 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 9 (OVERLAPS) 0/530 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/531 variables, and 214 constraints, problems are : Problem set: 0 solved, 403 unsolved in 18559 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 137/137 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 3 (OVERLAPS) 1/137 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 6 (OVERLAPS) 393/530 variables, 137/153 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 61/214 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 403/617 constraints. Problems are: Problem set: 0 solved, 403 unsolved
[2024-06-02 19:48:46] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 1/618 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 403 unsolved
At refinement iteration 11 (OVERLAPS) 0/530 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 403 unsolved
No progress, stopping.
After SMT solving in domain Int declared 530/531 variables, and 618 constraints, problems are : Problem set: 0 solved, 403 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 137/137 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 403/403 constraints, Known Traps: 10/10 constraints]
After SMT, in 48822ms problems are : Problem set: 0 solved, 403 unsolved
Search for dead transitions found 0 dead transitions in 48827ms
Starting structural reductions in SI_LTL mode, iteration 1 : 137/296 places, 413/500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49157 ms. Remains : 137/296 places, 413/500 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 90 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
RANDOM walk for 40000 steps (3280 resets) in 495 ms. (80 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (689 resets) in 28 ms. (1379 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (708 resets) in 24 ms. (1600 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (687 resets) in 24 ms. (1600 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 781899 steps, run timeout after 3001 ms. (steps per millisecond=260 ) properties seen :1 out of 3
Probabilistic random walk after 781899 steps, saw 215382 distinct states, run finished after 3001 ms. (steps per millisecond=260 ) properties seen :1
[2024-06-02 19:49:12] [INFO ] Flow matrix only has 394 transitions (discarded 19 similar events)
[2024-06-02 19:49:12] [INFO ] Invariant cache hit.
[2024-06-02 19:49:12] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 67/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/133 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 393/526 variables, 133/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 61/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 4/530 variables, 4/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/530 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/531 variables, and 205 constraints, problems are : Problem set: 0 solved, 2 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 137/137 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 67/71 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/133 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:49:12] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 393/526 variables, 133/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 61/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/526 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/530 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/530 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/530 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 530/531 variables, and 208 constraints, problems are : Problem set: 0 solved, 2 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 137/137 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 447ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 85 ms.
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 413/413 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 137 transition count 410
Free-agglomeration rule applied 19 times.
Iterating global reduction 1 with 19 rules applied. Total rules applied 22 place count 137 transition count 391
Reduce places removed 19 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 47 place count 118 transition count 385
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 2 with 56 rules applied. Total rules applied 103 place count 118 transition count 329
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 107 place count 118 transition count 329
Applied a total of 107 rules in 29 ms. Remains 118 /137 variables (removed 19) and now considering 329/413 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 118/137 places, 329/413 transitions.
RANDOM walk for 40000 steps (2416 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (592 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (590 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 236711 steps, run visited all 2 properties in 1089 ms. (steps per millisecond=217 )
Probabilistic random walk after 236711 steps, saw 83679 distinct states, run finished after 1090 ms. (steps per millisecond=217 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 7 factoid took 189 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-17-LTLFireability-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-17-LTLFireability-02 finished in 132825 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X((p1&&G(p2))))))))'
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 301 transition count 506
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 301 transition count 506
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 296 transition count 501
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 296 transition count 501
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 296 transition count 500
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 295 transition count 499
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 295 transition count 499
Applied a total of 27 rules in 14 ms. Remains 295 /308 variables (removed 13) and now considering 499/532 (removed 33) transitions.
// Phase 1: matrix 499 rows 295 cols
[2024-06-02 19:49:14] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 19:49:14] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 19:49:14] [INFO ] Invariant cache hit.
[2024-06-02 19:49:14] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2024-06-02 19:49:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:49:19] [INFO ] Deduced a trap composed of 182 places in 99 ms of which 2 ms to minimize.
[2024-06-02 19:49:19] [INFO ] Deduced a trap composed of 154 places in 93 ms of which 2 ms to minimize.
[2024-06-02 19:49:19] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 2 ms to minimize.
[2024-06-02 19:49:19] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:49:20] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 2 ms to minimize.
[2024-06-02 19:49:20] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 2 ms to minimize.
[2024-06-02 19:49:20] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-02 19:49:20] [INFO ] Deduced a trap composed of 72 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:49:20] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 0 ms to minimize.
[2024-06-02 19:49:21] [INFO ] Deduced a trap composed of 85 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:49:21] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 1 ms to minimize.
[2024-06-02 19:49:21] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 1 ms to minimize.
[2024-06-02 19:49:21] [INFO ] Deduced a trap composed of 114 places in 92 ms of which 1 ms to minimize.
[2024-06-02 19:49:21] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 1 ms to minimize.
[2024-06-02 19:49:22] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 2 ms to minimize.
[2024-06-02 19:49:24] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:49:25] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 794/794 variables, and 319 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 498/817 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:49:55] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 2 ms to minimize.
[2024-06-02 19:49:57] [INFO ] Deduced a trap composed of 115 places in 99 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/794 variables, and 819 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 19/19 constraints]
After SMT, in 60169ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60174ms
Starting structural reductions in LTL mode, iteration 1 : 295/308 places, 499/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60536 ms. Remains : 295/308 places, 499/532 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : FireWire-PT-17-LTLFireability-03
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-03 finished in 60784 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 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Graph (trivial) has 240 edges and 308 vertex of which 18 / 308 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 292 transition count 463
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 107 place count 240 transition count 461
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 239 transition count 461
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 108 place count 239 transition count 432
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 166 place count 210 transition count 432
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 170 place count 206 transition count 409
Iterating global reduction 3 with 4 rules applied. Total rules applied 174 place count 206 transition count 409
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 174 place count 206 transition count 406
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 180 place count 203 transition count 406
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 182 place count 201 transition count 404
Iterating global reduction 3 with 2 rules applied. Total rules applied 184 place count 201 transition count 404
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 186 place count 201 transition count 402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 187 place count 200 transition count 402
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 243 place count 172 transition count 374
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 244 place count 171 transition count 354
Iterating global reduction 5 with 1 rules applied. Total rules applied 245 place count 171 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 246 place count 171 transition count 353
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -106
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 312 place count 138 transition count 459
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 6 with 39 rules applied. Total rules applied 351 place count 138 transition count 420
Applied a total of 351 rules in 40 ms. Remains 138 /308 variables (removed 170) and now considering 420/532 (removed 112) transitions.
[2024-06-02 19:50:15] [INFO ] Flow matrix only has 404 transitions (discarded 16 similar events)
// Phase 1: matrix 404 rows 138 cols
[2024-06-02 19:50:15] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 19:50:15] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 19:50:15] [INFO ] Flow matrix only has 404 transitions (discarded 16 similar events)
[2024-06-02 19:50:15] [INFO ] Invariant cache hit.
[2024-06-02 19:50:15] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-06-02 19:50:15] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2024-06-02 19:50:15] [INFO ] Redundant transitions in 27 ms returned []
Running 407 sub problems to find dead transitions.
[2024-06-02 19:50:15] [INFO ] Flow matrix only has 404 transitions (discarded 16 similar events)
[2024-06-02 19:50:15] [INFO ] Invariant cache hit.
[2024-06-02 19:50:15] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 19:50:18] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:50:18] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:50:18] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:50:18] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:50:18] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-06-02 19:50:18] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:50:18] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:50:18] [INFO ] Deduced a trap composed of 82 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:50:18] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (OVERLAPS) 403/541 variables, 138/154 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/541 variables, 62/216 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 19:50:25] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 19:50:26] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 1 ms to minimize.
[2024-06-02 19:50:26] [INFO ] Deduced a trap composed of 80 places in 75 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 10 (OVERLAPS) 0/541 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 407 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/542 variables, and 219 constraints, problems are : Problem set: 0 solved, 407 unsolved in 19437 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (OVERLAPS) 1/138 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 6 (OVERLAPS) 403/541 variables, 138/157 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/541 variables, 62/219 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 407/626 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 10 (OVERLAPS) 0/541 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 407 unsolved
No progress, stopping.
After SMT solving in domain Int declared 541/542 variables, and 626 constraints, problems are : Problem set: 0 solved, 407 unsolved in 24020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 12/12 constraints]
After SMT, in 43697ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 43701ms
Starting structural reductions in SI_LTL mode, iteration 1 : 138/308 places, 420/532 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44064 ms. Remains : 138/308 places, 420/532 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-17-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-05 finished in 44219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Graph (trivial) has 236 edges and 308 vertex of which 18 / 308 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 292 transition count 466
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 243 transition count 464
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 105 place count 242 transition count 461
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 110 place count 239 transition count 459
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 111 place count 238 transition count 459
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 28 Pre rules applied. Total rules applied 111 place count 238 transition count 431
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 167 place count 210 transition count 431
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 171 place count 206 transition count 408
Iterating global reduction 5 with 4 rules applied. Total rules applied 175 place count 206 transition count 408
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 175 place count 206 transition count 405
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 181 place count 203 transition count 405
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 183 place count 201 transition count 403
Iterating global reduction 5 with 2 rules applied. Total rules applied 185 place count 201 transition count 403
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 187 place count 201 transition count 401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 188 place count 200 transition count 401
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 244 place count 172 transition count 373
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 245 place count 171 transition count 353
Iterating global reduction 7 with 1 rules applied. Total rules applied 246 place count 171 transition count 353
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 247 place count 171 transition count 352
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -101
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 8 with 64 rules applied. Total rules applied 311 place count 139 transition count 453
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 8 with 42 rules applied. Total rules applied 353 place count 139 transition count 411
Applied a total of 353 rules in 45 ms. Remains 139 /308 variables (removed 169) and now considering 411/532 (removed 121) transitions.
[2024-06-02 19:50:59] [INFO ] Flow matrix only has 392 transitions (discarded 19 similar events)
// Phase 1: matrix 392 rows 139 cols
[2024-06-02 19:50:59] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 19:50:59] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 19:50:59] [INFO ] Flow matrix only has 392 transitions (discarded 19 similar events)
[2024-06-02 19:50:59] [INFO ] Invariant cache hit.
[2024-06-02 19:50:59] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:50:59] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2024-06-02 19:50:59] [INFO ] Redundant transitions in 4 ms returned []
Running 407 sub problems to find dead transitions.
[2024-06-02 19:50:59] [INFO ] Flow matrix only has 392 transitions (discarded 19 similar events)
[2024-06-02 19:50:59] [INFO ] Invariant cache hit.
[2024-06-02 19:50:59] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 19:51:02] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:51:02] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:51:02] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:51:02] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:51:02] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:51:02] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:51:02] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 19:51:05] [INFO ] Deduced a trap composed of 79 places in 74 ms of which 2 ms to minimize.
[2024-06-02 19:51:05] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:51:05] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 407 unsolved
[2024-06-02 19:51:07] [INFO ] Deduced a trap composed of 76 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 7 (OVERLAPS) 391/530 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 61/218 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 10 (OVERLAPS) 0/530 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 407 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/531 variables, and 218 constraints, problems are : Problem set: 0 solved, 407 unsolved in 18359 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 139/139 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (OVERLAPS) 1/139 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 6 (OVERLAPS) 391/530 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 61/218 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 407/625 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 10 (OVERLAPS) 0/530 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 407 unsolved
No progress, stopping.
After SMT solving in domain Int declared 530/531 variables, and 625 constraints, problems are : Problem set: 0 solved, 407 unsolved in 24014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 139/139 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 11/11 constraints]
After SMT, in 42608ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 42613ms
Starting structural reductions in SI_LTL mode, iteration 1 : 139/308 places, 411/532 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42960 ms. Remains : 139/308 places, 411/532 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-17-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-07 finished in 43057 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(X(F(p1))||G(p2))))'
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 303 transition count 527
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 303 transition count 527
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 299 transition count 523
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 299 transition count 523
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 299 transition count 522
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 298 transition count 521
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 298 transition count 521
Applied a total of 21 rules in 16 ms. Remains 298 /308 variables (removed 10) and now considering 521/532 (removed 11) transitions.
// Phase 1: matrix 521 rows 298 cols
[2024-06-02 19:51:42] [INFO ] Computed 7 invariants in 6 ms
[2024-06-02 19:51:42] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 19:51:42] [INFO ] Invariant cache hit.
[2024-06-02 19:51:42] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 520 sub problems to find dead transitions.
[2024-06-02 19:51:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (OVERLAPS) 1/298 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-02 19:51:47] [INFO ] Deduced a trap composed of 148 places in 98 ms of which 1 ms to minimize.
[2024-06-02 19:51:47] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
[2024-06-02 19:51:47] [INFO ] Deduced a trap composed of 156 places in 105 ms of which 2 ms to minimize.
[2024-06-02 19:51:48] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:51:48] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-02 19:51:48] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:51:48] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2024-06-02 19:51:49] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:51:49] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-02 19:51:49] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:51:49] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 2 ms to minimize.
[2024-06-02 19:51:50] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 2 ms to minimize.
[2024-06-02 19:51:52] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-02 19:51:52] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-02 19:51:59] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 6 (OVERLAPS) 521/819 variables, 298/320 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 819/819 variables, and 320 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (OVERLAPS) 1/298 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 4 (OVERLAPS) 521/819 variables, 298/320 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/819 variables, 520/840 constraints. Problems are: Problem set: 0 solved, 520 unsolved
[2024-06-02 19:52:24] [INFO ] Deduced a trap composed of 118 places in 111 ms of which 1 ms to minimize.
[2024-06-02 19:52:24] [INFO ] Deduced a trap composed of 115 places in 92 ms of which 2 ms to minimize.
[2024-06-02 19:52:26] [INFO ] Deduced a trap composed of 151 places in 98 ms of which 2 ms to minimize.
[2024-06-02 19:52:27] [INFO ] Deduced a trap composed of 157 places in 100 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/819 variables, 4/844 constraints. Problems are: Problem set: 0 solved, 520 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 819/819 variables, and 844 constraints, problems are : Problem set: 0 solved, 520 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 19/19 constraints]
After SMT, in 60160ms problems are : Problem set: 0 solved, 520 unsolved
Search for dead transitions found 0 dead transitions in 60166ms
Starting structural reductions in LTL mode, iteration 1 : 298/308 places, 521/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60546 ms. Remains : 298/308 places, 521/532 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : FireWire-PT-17-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-08 finished in 60737 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))))'
Support contains 2 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 302 transition count 507
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 302 transition count 507
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 297 transition count 502
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 297 transition count 502
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 297 transition count 501
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 296 transition count 500
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 296 transition count 500
Applied a total of 25 rules in 11 ms. Remains 296 /308 variables (removed 12) and now considering 500/532 (removed 32) transitions.
// Phase 1: matrix 500 rows 296 cols
[2024-06-02 19:52:43] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:52:43] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 19:52:43] [INFO ] Invariant cache hit.
[2024-06-02 19:52:43] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 499 sub problems to find dead transitions.
[2024-06-02 19:52:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (OVERLAPS) 1/296 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-02 19:52:48] [INFO ] Deduced a trap composed of 141 places in 89 ms of which 2 ms to minimize.
[2024-06-02 19:52:48] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:52:48] [INFO ] Deduced a trap composed of 85 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:52:49] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:52:49] [INFO ] Deduced a trap composed of 85 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:52:49] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 1 ms to minimize.
[2024-06-02 19:52:50] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 2 ms to minimize.
[2024-06-02 19:52:50] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:52:52] [INFO ] Deduced a trap composed of 148 places in 92 ms of which 2 ms to minimize.
[2024-06-02 19:52:52] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-02 19:52:52] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 5 (OVERLAPS) 500/796 variables, 296/314 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-02 19:53:02] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/796 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-02 19:53:13] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 796/796 variables, and 316 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 499 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (OVERLAPS) 1/296 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/296 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 4 (OVERLAPS) 500/796 variables, 296/316 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/796 variables, 499/815 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-06-02 19:53:23] [INFO ] Deduced a trap composed of 109 places in 108 ms of which 2 ms to minimize.
[2024-06-02 19:53:30] [INFO ] Deduced a trap composed of 158 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/796 variables, 2/817 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 796/796 variables, and 817 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 15/15 constraints]
After SMT, in 60166ms problems are : Problem set: 0 solved, 499 unsolved
Search for dead transitions found 0 dead transitions in 60171ms
Starting structural reductions in LTL mode, iteration 1 : 296/308 places, 500/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60554 ms. Remains : 296/308 places, 500/532 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : FireWire-PT-17-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-09 finished in 60715 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)&&X(p1)) U X(X(G((p2||X(!p3)))))))'
Support contains 7 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 301 transition count 506
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 301 transition count 506
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 296 transition count 501
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 296 transition count 501
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 296 transition count 500
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 295 transition count 499
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 295 transition count 499
Applied a total of 27 rules in 14 ms. Remains 295 /308 variables (removed 13) and now considering 499/532 (removed 33) transitions.
// Phase 1: matrix 499 rows 295 cols
[2024-06-02 19:53:43] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:53:44] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 19:53:44] [INFO ] Invariant cache hit.
[2024-06-02 19:53:44] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2024-06-02 19:53:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:53:48] [INFO ] Deduced a trap composed of 182 places in 101 ms of which 1 ms to minimize.
[2024-06-02 19:53:49] [INFO ] Deduced a trap composed of 154 places in 87 ms of which 2 ms to minimize.
[2024-06-02 19:53:49] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 2 ms to minimize.
[2024-06-02 19:53:49] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:53:49] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 1 ms to minimize.
[2024-06-02 19:53:49] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 2 ms to minimize.
[2024-06-02 19:53:49] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:53:49] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 0 ms to minimize.
[2024-06-02 19:53:50] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 0 ms to minimize.
[2024-06-02 19:53:50] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:53:50] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 1 ms to minimize.
[2024-06-02 19:53:50] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:53:51] [INFO ] Deduced a trap composed of 114 places in 100 ms of which 1 ms to minimize.
[2024-06-02 19:53:51] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 2 ms to minimize.
[2024-06-02 19:53:51] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:53:53] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:53:54] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 794/794 variables, and 319 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 498/817 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:54:25] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 2 ms to minimize.
[2024-06-02 19:54:27] [INFO ] Deduced a trap composed of 115 places in 97 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/794 variables, and 819 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 19/19 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Starting structural reductions in LTL mode, iteration 1 : 295/308 places, 499/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60500 ms. Remains : 295/308 places, 499/532 transitions.
Stuttering acceptance computed with spot in 562 ms :[(AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2) (NOT p0)), (OR (AND p1 (NOT p2) p3) (AND p0 (NOT p2) p3)), (AND (NOT p2) p3), p3, true, (AND p3 (NOT p2) (NOT p0)), (AND (NOT p2) p0 (NOT p1) p3), (AND (NOT p2) p3), (AND (NOT p0) p3), (AND (NOT p2) p3), (NOT p0)]
Running random walk in product with property : FireWire-PT-17-LTLFireability-11
Product exploration explored 100000 steps with 20058 reset in 126 ms.
Product exploration explored 100000 steps with 19912 reset in 133 ms.
Computed a total of 42 stabilizing places and 46 stable transitions
Computed a total of 42 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 80 ms. Reduced automaton from 13 states, 34 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
RANDOM walk for 40000 steps (15 resets) in 111 ms. (357 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40000 steps (10 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
[2024-06-02 19:54:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 129/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/261 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 463/724 variables, 261/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/724 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/742 variables, 8/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/742 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/762 variables, 10/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/762 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/774 variables, 6/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/774 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/788 variables, 6/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/788 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/794 variables, 4/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/794 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 794/794 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 129/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/261 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 463/724 variables, 261/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/724 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/724 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 18/742 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/742 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 20/762 variables, 10/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/762 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/774 variables, 6/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/774 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/788 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/788 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/794 variables, 4/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/794 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 794/794 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 374 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 649ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 85 ms.
Support contains 2 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 499/499 transitions.
Graph (trivial) has 233 edges and 295 vertex of which 18 / 295 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 280 transition count 428
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 54 rules applied. Total rules applied 105 place count 230 transition count 424
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 228 transition count 424
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 107 place count 228 transition count 391
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 173 place count 195 transition count 391
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 174 place count 194 transition count 371
Iterating global reduction 3 with 1 rules applied. Total rules applied 175 place count 194 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 176 place count 194 transition count 370
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 232 place count 166 transition count 342
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 294 place count 135 transition count 441
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 300 place count 135 transition count 435
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 336 place count 135 transition count 399
Free-agglomeration rule applied 20 times.
Iterating global reduction 5 with 20 rules applied. Total rules applied 356 place count 135 transition count 379
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 26 rules applied. Total rules applied 382 place count 115 transition count 373
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 6 with 56 rules applied. Total rules applied 438 place count 115 transition count 317
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 440 place count 115 transition count 317
Applied a total of 440 rules in 32 ms. Remains 115 /295 variables (removed 180) and now considering 317/499 (removed 182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 115/295 places, 317/499 transitions.
RANDOM walk for 40000 steps (2343 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (223 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4915 steps, run visited all 1 properties in 14 ms. (steps per millisecond=351 )
Probabilistic random walk after 4915 steps, saw 1781 distinct states, run finished after 14 ms. (steps per millisecond=351 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p3))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3), (F p2)]
Knowledge based reduction with 12 factoid took 194 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Stuttering acceptance computed with spot in 169 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Support contains 4 out of 295 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 499/499 transitions.
Applied a total of 0 rules in 5 ms. Remains 295 /295 variables (removed 0) and now considering 499/499 (removed 0) transitions.
[2024-06-02 19:54:46] [INFO ] Invariant cache hit.
[2024-06-02 19:54:47] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 19:54:47] [INFO ] Invariant cache hit.
[2024-06-02 19:54:47] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2024-06-02 19:54:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:54:51] [INFO ] Deduced a trap composed of 182 places in 92 ms of which 2 ms to minimize.
[2024-06-02 19:54:52] [INFO ] Deduced a trap composed of 154 places in 90 ms of which 1 ms to minimize.
[2024-06-02 19:54:52] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 1 ms to minimize.
[2024-06-02 19:54:52] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 0 ms to minimize.
[2024-06-02 19:54:52] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:54:52] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 2 ms to minimize.
[2024-06-02 19:54:52] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-02 19:54:52] [INFO ] Deduced a trap composed of 72 places in 37 ms of which 1 ms to minimize.
[2024-06-02 19:54:53] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:54:53] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 2 ms to minimize.
[2024-06-02 19:54:53] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:54:54] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 2 ms to minimize.
[2024-06-02 19:54:54] [INFO ] Deduced a trap composed of 114 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:54:54] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 2 ms to minimize.
[2024-06-02 19:54:54] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:54:56] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:54:57] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 794/794 variables, and 319 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 498/817 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:55:27] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 2 ms to minimize.
[2024-06-02 19:55:30] [INFO ] Deduced a trap composed of 115 places in 104 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/794 variables, and 819 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 19/19 constraints]
After SMT, in 60154ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60159ms
Finished structural reductions in LTL mode , in 1 iterations and 60490 ms. Remains : 295/295 places, 499/499 transitions.
Computed a total of 42 stabilizing places and 46 stable transitions
Computed a total of 42 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
RANDOM walk for 40000 steps (14 resets) in 137 ms. (289 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40000 steps (14 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
[2024-06-02 19:55:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 129/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/261 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 463/724 variables, 261/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/724 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/742 variables, 8/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/742 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/762 variables, 10/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/762 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/774 variables, 6/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/774 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/788 variables, 6/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/788 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/794 variables, 4/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/794 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 794/794 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 129/131 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/261 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 463/724 variables, 261/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/724 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/724 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 18/742 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/742 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 20/762 variables, 10/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/762 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/774 variables, 6/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/774 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/788 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/788 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/794 variables, 4/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/794 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 794/794 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 384 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 663ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 91 ms.
Support contains 2 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 499/499 transitions.
Graph (trivial) has 233 edges and 295 vertex of which 18 / 295 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 280 transition count 428
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 54 rules applied. Total rules applied 105 place count 230 transition count 424
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 228 transition count 424
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 107 place count 228 transition count 391
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 173 place count 195 transition count 391
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 174 place count 194 transition count 371
Iterating global reduction 3 with 1 rules applied. Total rules applied 175 place count 194 transition count 371
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 176 place count 194 transition count 370
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 232 place count 166 transition count 342
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 294 place count 135 transition count 441
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 300 place count 135 transition count 435
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 336 place count 135 transition count 399
Free-agglomeration rule applied 20 times.
Iterating global reduction 5 with 20 rules applied. Total rules applied 356 place count 135 transition count 379
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 26 rules applied. Total rules applied 382 place count 115 transition count 373
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 6 with 56 rules applied. Total rules applied 438 place count 115 transition count 317
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 440 place count 115 transition count 317
Applied a total of 440 rules in 40 ms. Remains 115 /295 variables (removed 180) and now considering 317/499 (removed 182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 115/295 places, 317/499 transitions.
RANDOM walk for 40000 steps (2313 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (223 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4915 steps, run visited all 1 properties in 13 ms. (steps per millisecond=378 )
Probabilistic random walk after 4915 steps, saw 1781 distinct states, run finished after 13 ms. (steps per millisecond=378 ) properties seen :1
Knowledge obtained : [(AND (NOT p3) (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p3))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3), (F p2)]
Knowledge based reduction with 2 factoid took 185 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Stuttering acceptance computed with spot in 166 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Stuttering acceptance computed with spot in 147 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Product exploration explored 100000 steps with 1 reset in 92 ms.
Product exploration explored 100000 steps with 0 reset in 92 ms.
Support contains 4 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 499/499 transitions.
Applied a total of 0 rules in 7 ms. Remains 295 /295 variables (removed 0) and now considering 499/499 (removed 0) transitions.
[2024-06-02 19:55:49] [INFO ] Invariant cache hit.
[2024-06-02 19:55:49] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 19:55:49] [INFO ] Invariant cache hit.
[2024-06-02 19:55:49] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2024-06-02 19:55:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:55:54] [INFO ] Deduced a trap composed of 182 places in 99 ms of which 1 ms to minimize.
[2024-06-02 19:55:54] [INFO ] Deduced a trap composed of 154 places in 88 ms of which 1 ms to minimize.
[2024-06-02 19:55:54] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 1 ms to minimize.
[2024-06-02 19:55:54] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:55:54] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 2 ms to minimize.
[2024-06-02 19:55:55] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 1 ms to minimize.
[2024-06-02 19:55:55] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-06-02 19:55:55] [INFO ] Deduced a trap composed of 72 places in 38 ms of which 1 ms to minimize.
[2024-06-02 19:55:55] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:55:56] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:55:56] [INFO ] Deduced a trap composed of 72 places in 92 ms of which 1 ms to minimize.
[2024-06-02 19:55:56] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 1 ms to minimize.
[2024-06-02 19:55:56] [INFO ] Deduced a trap composed of 114 places in 96 ms of which 1 ms to minimize.
[2024-06-02 19:55:56] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
[2024-06-02 19:55:57] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 2 ms to minimize.
[2024-06-02 19:55:59] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:56:00] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 794/794 variables, and 319 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 498/817 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:56:30] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 2 ms to minimize.
[2024-06-02 19:56:32] [INFO ] Deduced a trap composed of 115 places in 104 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/794 variables, and 819 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 19/19 constraints]
After SMT, in 60158ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Finished structural reductions in LTL mode , in 1 iterations and 60496 ms. Remains : 295/295 places, 499/499 transitions.
Treatment of property FireWire-PT-17-LTLFireability-11 finished in 186202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(p0&&F(!p1)&&X(X(F(p2))))))'
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 302 transition count 507
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 302 transition count 507
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 298 transition count 503
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 298 transition count 503
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 297 transition count 502
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 297 transition count 502
Applied a total of 22 rules in 16 ms. Remains 297 /308 variables (removed 11) and now considering 502/532 (removed 30) transitions.
// Phase 1: matrix 502 rows 297 cols
[2024-06-02 19:56:50] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:56:50] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 19:56:50] [INFO ] Invariant cache hit.
[2024-06-02 19:56:50] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 501 sub problems to find dead transitions.
[2024-06-02 19:56:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-06-02 19:56:55] [INFO ] Deduced a trap composed of 184 places in 104 ms of which 2 ms to minimize.
[2024-06-02 19:56:55] [INFO ] Deduced a trap composed of 156 places in 88 ms of which 1 ms to minimize.
[2024-06-02 19:56:55] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 2 ms to minimize.
[2024-06-02 19:56:56] [INFO ] Deduced a trap composed of 87 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:56:56] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-06-02 19:56:56] [INFO ] Deduced a trap composed of 85 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:56:57] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 2 ms to minimize.
[2024-06-02 19:56:57] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 2 ms to minimize.
[2024-06-02 19:56:57] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 2 ms to minimize.
[2024-06-02 19:56:59] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 2 ms to minimize.
[2024-06-02 19:56:59] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-06-02 19:57:00] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-06-02 19:57:05] [INFO ] Deduced a trap composed of 144 places in 80 ms of which 2 ms to minimize.
[2024-06-02 19:57:06] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-06-02 19:57:06] [INFO ] Deduced a trap composed of 143 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:57:06] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:57:06] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:57:07] [INFO ] Deduced a trap composed of 74 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 6 (OVERLAPS) 502/799 variables, 297/322 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 799/799 variables, and 322 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 501 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 4 (OVERLAPS) 502/799 variables, 297/322 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/799 variables, 501/823 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-06-02 19:57:31] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 2 ms to minimize.
[2024-06-02 19:57:31] [INFO ] Deduced a trap composed of 107 places in 103 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/799 variables, 2/825 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 799/799 variables, and 825 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 20/20 constraints]
After SMT, in 60158ms problems are : Problem set: 0 solved, 501 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Starting structural reductions in LTL mode, iteration 1 : 297/308 places, 502/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60539 ms. Remains : 297/308 places, 502/532 transitions.
Stuttering acceptance computed with spot in 284 ms :[(NOT p0), true, (AND (NOT p2) (NOT p0)), (AND p1 (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p0)), p1]
Running random walk in product with property : FireWire-PT-17-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 103 ms.
Product exploration explored 100000 steps with 33333 reset in 104 ms.
Computed a total of 42 stabilizing places and 46 stable transitions
Computed a total of 42 stabilizing places and 46 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 20 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-17-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-17-LTLFireability-12 finished in 61076 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Graph (trivial) has 242 edges and 308 vertex of which 18 / 308 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 292 transition count 462
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 57 rules applied. Total rules applied 111 place count 239 transition count 458
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 114 place count 237 transition count 457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 236 transition count 457
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 115 place count 236 transition count 428
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 173 place count 207 transition count 428
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 176 place count 204 transition count 425
Iterating global reduction 4 with 3 rules applied. Total rules applied 179 place count 204 transition count 425
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 179 place count 204 transition count 422
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 185 place count 201 transition count 422
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 187 place count 199 transition count 420
Iterating global reduction 4 with 2 rules applied. Total rules applied 189 place count 199 transition count 420
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 191 place count 199 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 192 place count 198 transition count 418
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 248 place count 170 transition count 390
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 249 place count 169 transition count 370
Iterating global reduction 6 with 1 rules applied. Total rules applied 250 place count 169 transition count 370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 251 place count 169 transition count 369
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -126
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 7 with 62 rules applied. Total rules applied 313 place count 138 transition count 495
Drop transitions (Redundant composition of simpler transitions.) removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 7 with 58 rules applied. Total rules applied 371 place count 138 transition count 437
Applied a total of 371 rules in 43 ms. Remains 138 /308 variables (removed 170) and now considering 437/532 (removed 95) transitions.
[2024-06-02 19:57:51] [INFO ] Flow matrix only has 413 transitions (discarded 24 similar events)
// Phase 1: matrix 413 rows 138 cols
[2024-06-02 19:57:51] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:57:51] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 19:57:51] [INFO ] Flow matrix only has 413 transitions (discarded 24 similar events)
[2024-06-02 19:57:51] [INFO ] Invariant cache hit.
[2024-06-02 19:57:51] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-06-02 19:57:51] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-06-02 19:57:51] [INFO ] Redundant transitions in 3 ms returned []
Running 433 sub problems to find dead transitions.
[2024-06-02 19:57:51] [INFO ] Flow matrix only has 413 transitions (discarded 24 similar events)
[2024-06-02 19:57:51] [INFO ] Invariant cache hit.
[2024-06-02 19:57:51] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-02 19:57:54] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 1 ms to minimize.
[2024-06-02 19:57:54] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:57:54] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-06-02 19:57:54] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-06-02 19:57:54] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-06-02 19:57:54] [INFO ] Deduced a trap composed of 80 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:57:55] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-06-02 19:57:55] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 0 ms to minimize.
[2024-06-02 19:57:55] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:57:55] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 5 (OVERLAPS) 412/550 variables, 138/155 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 62/217 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 8 (OVERLAPS) 0/550 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 433 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/551 variables, and 217 constraints, problems are : Problem set: 0 solved, 433 unsolved in 14924 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 433 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (OVERLAPS) 1/138 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 6 (OVERLAPS) 412/550 variables, 138/155 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 62/217 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 433/650 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 10 (OVERLAPS) 0/550 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 433 unsolved
No progress, stopping.
After SMT solving in domain Int declared 550/551 variables, and 650 constraints, problems are : Problem set: 0 solved, 433 unsolved in 26952 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 10/10 constraints]
After SMT, in 42155ms problems are : Problem set: 0 solved, 433 unsolved
Search for dead transitions found 0 dead transitions in 42159ms
Starting structural reductions in SI_LTL mode, iteration 1 : 138/308 places, 437/532 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42529 ms. Remains : 138/308 places, 437/532 transitions.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-17-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-13 finished in 42594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((G(p1)&&X(p2)))&&p0)))'
Support contains 4 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 301 transition count 506
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 301 transition count 506
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 296 transition count 501
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 296 transition count 501
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 296 transition count 500
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 295 transition count 499
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 295 transition count 499
Applied a total of 27 rules in 13 ms. Remains 295 /308 variables (removed 13) and now considering 499/532 (removed 33) transitions.
// Phase 1: matrix 499 rows 295 cols
[2024-06-02 19:58:33] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:58:33] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 19:58:33] [INFO ] Invariant cache hit.
[2024-06-02 19:58:34] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2024-06-02 19:58:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:58:38] [INFO ] Deduced a trap composed of 182 places in 104 ms of which 2 ms to minimize.
[2024-06-02 19:58:38] [INFO ] Deduced a trap composed of 154 places in 88 ms of which 1 ms to minimize.
[2024-06-02 19:58:39] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 1 ms to minimize.
[2024-06-02 19:58:39] [INFO ] Deduced a trap composed of 74 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:58:39] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 1 ms to minimize.
[2024-06-02 19:58:39] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 2 ms to minimize.
[2024-06-02 19:58:39] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-02 19:58:39] [INFO ] Deduced a trap composed of 72 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:58:40] [INFO ] Deduced a trap composed of 85 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:58:40] [INFO ] Deduced a trap composed of 85 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:58:40] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 2 ms to minimize.
[2024-06-02 19:58:40] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 1 ms to minimize.
[2024-06-02 19:58:41] [INFO ] Deduced a trap composed of 114 places in 90 ms of which 1 ms to minimize.
[2024-06-02 19:58:41] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 1 ms to minimize.
[2024-06-02 19:58:41] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:58:43] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:58:44] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 794/794 variables, and 319 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 498/817 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:59:14] [INFO ] Deduced a trap composed of 104 places in 100 ms of which 2 ms to minimize.
[2024-06-02 19:59:16] [INFO ] Deduced a trap composed of 115 places in 98 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/794 variables, and 819 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 19/19 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Starting structural reductions in LTL mode, iteration 1 : 295/308 places, 499/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60497 ms. Remains : 295/308 places, 499/532 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : FireWire-PT-17-LTLFireability-14
Stuttering criterion allowed to conclude after 97 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-14 finished in 60748 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)))'
Support contains 2 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 301 transition count 506
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 301 transition count 506
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 296 transition count 501
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 296 transition count 501
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 296 transition count 500
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 295 transition count 499
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 295 transition count 499
Applied a total of 27 rules in 17 ms. Remains 295 /308 variables (removed 13) and now considering 499/532 (removed 33) transitions.
[2024-06-02 19:59:34] [INFO ] Invariant cache hit.
[2024-06-02 19:59:34] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 19:59:34] [INFO ] Invariant cache hit.
[2024-06-02 19:59:34] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2024-06-02 19:59:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:59:39] [INFO ] Deduced a trap composed of 182 places in 99 ms of which 1 ms to minimize.
[2024-06-02 19:59:39] [INFO ] Deduced a trap composed of 154 places in 86 ms of which 2 ms to minimize.
[2024-06-02 19:59:39] [INFO ] Deduced a trap composed of 74 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:59:39] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:59:39] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 2 ms to minimize.
[2024-06-02 19:59:40] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:59:40] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-06-02 19:59:40] [INFO ] Deduced a trap composed of 72 places in 39 ms of which 1 ms to minimize.
[2024-06-02 19:59:40] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:59:41] [INFO ] Deduced a trap composed of 85 places in 42 ms of which 0 ms to minimize.
[2024-06-02 19:59:41] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 2 ms to minimize.
[2024-06-02 19:59:41] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 1 ms to minimize.
[2024-06-02 19:59:41] [INFO ] Deduced a trap composed of 114 places in 97 ms of which 1 ms to minimize.
[2024-06-02 19:59:41] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 1 ms to minimize.
[2024-06-02 19:59:42] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 1 ms to minimize.
[2024-06-02 19:59:44] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 19:59:45] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 794/794 variables, and 319 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (OVERLAPS) 1/295 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/295 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 4 (OVERLAPS) 499/794 variables, 295/319 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 498/817 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-06-02 20:00:15] [INFO ] Deduced a trap composed of 104 places in 103 ms of which 2 ms to minimize.
[2024-06-02 20:00:17] [INFO ] Deduced a trap composed of 115 places in 98 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/794 variables, and 819 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 295/295 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 19/19 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Starting structural reductions in LTL mode, iteration 1 : 295/308 places, 499/532 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60529 ms. Remains : 295/308 places, 499/532 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-17-LTLFireability-15
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-17-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-17-LTLFireability-15 finished in 60647 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 U p1) U (F(!p0)&&G(!p2)))))))'
Found a Lengthening insensitive property : FireWire-PT-17-LTLFireability-01
Stuttering acceptance computed with spot in 354 ms :[(OR p0 p2), (OR p0 p2), (OR p0 p2), true, (NOT p1), p2, (OR p0 p2), p2, p0]
Support contains 5 out of 308 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Graph (trivial) has 236 edges and 308 vertex of which 18 / 308 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 292 transition count 462
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 57 rules applied. Total rules applied 111 place count 239 transition count 458
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 113 place count 237 transition count 458
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 113 place count 237 transition count 430
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 169 place count 209 transition count 430
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 173 place count 205 transition count 407
Iterating global reduction 3 with 4 rules applied. Total rules applied 177 place count 205 transition count 407
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 177 place count 205 transition count 404
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 183 place count 202 transition count 404
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 185 place count 200 transition count 402
Iterating global reduction 3 with 2 rules applied. Total rules applied 187 place count 200 transition count 402
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 189 place count 200 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 190 place count 199 transition count 400
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 246 place count 171 transition count 372
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -131
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 308 place count 140 transition count 503
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 314 place count 140 transition count 497
Applied a total of 314 rules in 35 ms. Remains 140 /308 variables (removed 168) and now considering 497/532 (removed 35) transitions.
[2024-06-02 20:00:35] [INFO ] Flow matrix only has 475 transitions (discarded 22 similar events)
// Phase 1: matrix 475 rows 140 cols
[2024-06-02 20:00:35] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 20:00:35] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 20:00:35] [INFO ] Flow matrix only has 475 transitions (discarded 22 similar events)
[2024-06-02 20:00:35] [INFO ] Invariant cache hit.
[2024-06-02 20:00:35] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-02 20:00:36] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 487 sub problems to find dead transitions.
[2024-06-02 20:00:36] [INFO ] Flow matrix only has 475 transitions (discarded 22 similar events)
[2024-06-02 20:00:36] [INFO ] Invariant cache hit.
[2024-06-02 20:00:36] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 487 unsolved
[2024-06-02 20:00:39] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-06-02 20:00:39] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-06-02 20:00:39] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-06-02 20:00:39] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 1 ms to minimize.
[2024-06-02 20:00:39] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 1 ms to minimize.
[2024-06-02 20:00:39] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2024-06-02 20:00:39] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 0 ms to minimize.
[2024-06-02 20:00:40] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 3 ms to minimize.
[2024-06-02 20:00:40] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2024-06-02 20:00:40] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 5 (OVERLAPS) 474/614 variables, 140/157 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/614 variables, 75/232 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/614 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 8 (OVERLAPS) 0/614 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 487 unsolved
No progress, stopping.
After SMT solving in domain Real declared 614/615 variables, and 232 constraints, problems are : Problem set: 0 solved, 487 unsolved in 17536 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 140/140 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 487/487 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 487 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 3 (OVERLAPS) 1/140 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 6 (OVERLAPS) 474/614 variables, 140/157 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/614 variables, 75/232 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/614 variables, 487/719 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/614 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 487 unsolved
[2024-06-02 20:01:13] [INFO ] Deduced a trap composed of 98 places in 84 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/614 variables, 1/720 constraints. Problems are: Problem set: 0 solved, 487 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/615 variables, and 720 constraints, problems are : Problem set: 0 solved, 487 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 140/140 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 487/487 constraints, Known Traps: 11/11 constraints]
After SMT, in 47946ms problems are : Problem set: 0 solved, 487 unsolved
Search for dead transitions found 0 dead transitions in 47952ms
Starting structural reductions in LI_LTL mode, iteration 1 : 140/308 places, 497/532 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 48325 ms. Remains : 140/308 places, 497/532 transitions.
Running random walk in product with property : FireWire-PT-17-LTLFireability-01
Product exploration explored 100000 steps with 2 reset in 38 ms.
Product exploration explored 100000 steps with 1 reset in 43 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1))))), (X (X (OR p0 (NOT p2) p1))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 126 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 430 ms :[(OR p0 p2), (OR p0 p2), (OR p0 p2), true, (NOT p1), p2, (OR p0 p2), p2, p0]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (2783 resets) in 336 ms. (118 steps per ms) remains 7/11 properties
BEST_FIRST walk for 40004 steps (714 resets) in 37 ms. (1052 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (737 resets) in 110 ms. (360 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (728 resets) in 145 ms. (273 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (666 resets) in 45 ms. (869 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (720 resets) in 187 ms. (212 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (667 resets) in 250 ms. (159 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (679 resets) in 159 ms. (250 steps per ms) remains 7/7 properties
[2024-06-02 20:01:25] [INFO ] Flow matrix only has 475 transitions (discarded 22 similar events)
[2024-06-02 20:01:25] [INFO ] Invariant cache hit.
[2024-06-02 20:01:25] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf3 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 1 (OVERLAPS) 111/116 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-06-02 20:01:25] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-06-02 20:01:25] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 20/136 variables, 4/9 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 474/610 variables, 136/145 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/610 variables, 75/220 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/610 variables, 0/220 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 4/614 variables, 4/224 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/614 variables, 0/224 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/614 variables, 0/224 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 614/615 variables, and 224 constraints, problems are : Problem set: 2 solved, 5 unsolved in 566 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 140/140 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 111/116 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 20/136 variables, 4/9 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 474/610 variables, 136/145 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/610 variables, 75/220 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/610 variables, 5/225 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/610 variables, 0/225 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 4/614 variables, 4/229 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/614 variables, 0/229 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/614 variables, 0/229 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 614/615 variables, and 229 constraints, problems are : Problem set: 2 solved, 5 unsolved in 513 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 140/140 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 2/2 constraints]
After SMT, in 1091ms problems are : Problem set: 2 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 364 ms.
Support contains 5 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 497/497 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 140 transition count 494
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 1 with 55 rules applied. Total rules applied 58 place count 140 transition count 439
Free-agglomeration rule applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 78 place count 140 transition count 419
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 104 place count 120 transition count 413
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 2 with 55 rules applied. Total rules applied 159 place count 120 transition count 358
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 164 place count 120 transition count 358
Applied a total of 164 rules in 22 ms. Remains 120 /140 variables (removed 20) and now considering 358/497 (removed 139) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 120/140 places, 358/497 transitions.
RANDOM walk for 40000 steps (1989 resets) in 584 ms. (68 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (663 resets) in 207 ms. (192 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (469 resets) in 254 ms. (156 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (20 resets) in 279 ms. (142 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (15 resets) in 281 ms. (141 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (16 resets) in 260 ms. (153 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 84371 steps, run visited all 5 properties in 388 ms. (steps per millisecond=217 )
Probabilistic random walk after 84371 steps, saw 32433 distinct states, run finished after 389 ms. (steps per millisecond=216 ) properties seen :5
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1))))), (X (X (OR p0 (NOT p2) p1))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p2) p1)), (G (AND (OR (NOT p0) (NOT p2)) (OR (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (OR (NOT p0) p2) (OR p2 (NOT p1))))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F p1), (F p0)]
Knowledge based reduction with 12 factoid took 528 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Stuttering acceptance computed with spot in 187 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Support contains 4 out of 140 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 497/497 transitions.
Applied a total of 0 rules in 3 ms. Remains 140 /140 variables (removed 0) and now considering 497/497 (removed 0) transitions.
[2024-06-02 20:01:28] [INFO ] Flow matrix only has 475 transitions (discarded 22 similar events)
[2024-06-02 20:01:28] [INFO ] Invariant cache hit.
[2024-06-02 20:01:28] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 20:01:28] [INFO ] Flow matrix only has 475 transitions (discarded 22 similar events)
[2024-06-02 20:01:28] [INFO ] Invariant cache hit.
[2024-06-02 20:01:28] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-02 20:01:28] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 487 sub problems to find dead transitions.
[2024-06-02 20:01:28] [INFO ] Flow matrix only has 475 transitions (discarded 22 similar events)
[2024-06-02 20:01:28] [INFO ] Invariant cache hit.
[2024-06-02 20:01:28] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 487 unsolved
[2024-06-02 20:01:32] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-06-02 20:01:32] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-06-02 20:01:32] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-06-02 20:01:32] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 1 ms to minimize.
[2024-06-02 20:01:32] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 2 ms to minimize.
[2024-06-02 20:01:32] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2024-06-02 20:01:32] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-02 20:01:33] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 1 ms to minimize.
[2024-06-02 20:01:33] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2024-06-02 20:01:33] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 5 (OVERLAPS) 474/614 variables, 140/157 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/614 variables, 75/232 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/614 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 8 (OVERLAPS) 0/614 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 487 unsolved
No progress, stopping.
After SMT solving in domain Real declared 614/615 variables, and 232 constraints, problems are : Problem set: 0 solved, 487 unsolved in 17588 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 140/140 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 487/487 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 487 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 3 (OVERLAPS) 1/140 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 6 (OVERLAPS) 474/614 variables, 140/157 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/614 variables, 75/232 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/614 variables, 487/719 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/614 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 487 unsolved
[2024-06-02 20:02:06] [INFO ] Deduced a trap composed of 98 places in 82 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/614 variables, 1/720 constraints. Problems are: Problem set: 0 solved, 487 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/615 variables, and 720 constraints, problems are : Problem set: 0 solved, 487 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 140/140 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 487/487 constraints, Known Traps: 11/11 constraints]
After SMT, in 47996ms problems are : Problem set: 0 solved, 487 unsolved
Search for dead transitions found 0 dead transitions in 48001ms
Finished structural reductions in LTL mode , in 1 iterations and 48374 ms. Remains : 140/140 places, 497/497 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
RANDOM walk for 40000 steps (2741 resets) in 561 ms. (71 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (734 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (674 resets) in 128 ms. (310 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (642 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 1075660 steps, run visited all 3 properties in 2603 ms. (steps per millisecond=413 )
Probabilistic random walk after 1075660 steps, saw 306887 distinct states, run finished after 2603 ms. (steps per millisecond=413 ) properties seen :3
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p2), (F p0), (F (NOT (OR p2 (NOT p0))))]
Knowledge based reduction with 4 factoid took 174 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Stuttering acceptance computed with spot in 169 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Stuttering acceptance computed with spot in 163 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Product exploration explored 100000 steps with 1 reset in 55 ms.
Product exploration explored 100000 steps with 0 reset in 55 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 158 ms :[(OR p2 p0), (OR p2 p0), (OR p2 p0), true, p0]
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 497/497 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 140 transition count 497
Deduced a syphon composed of 1 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 0 with 55 rules applied. Total rules applied 56 place count 140 transition count 442
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 56 rules in 16 ms. Remains 140 /140 variables (removed 0) and now considering 442/497 (removed 55) transitions.
[2024-06-02 20:02:21] [INFO ] Redundant transitions in 20 ms returned []
Running 432 sub problems to find dead transitions.
[2024-06-02 20:02:21] [INFO ] Flow matrix only has 418 transitions (discarded 24 similar events)
// Phase 1: matrix 418 rows 140 cols
[2024-06-02 20:02:21] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:02:21] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-02 20:02:22] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 3 (OVERLAPS) 1/140 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 431 unsolved
[2024-06-02 20:02:26] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-06-02 20:02:26] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:02:26] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 2 ms to minimize.
[2024-06-02 20:02:26] [INFO ] Deduced a trap composed of 78 places in 72 ms of which 1 ms to minimize.
[2024-06-02 20:02:26] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2024-06-02 20:02:26] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-06-02 20:02:26] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 0 ms to minimize.
[2024-06-02 20:02:27] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-06-02 20:02:27] [INFO ] Deduced a trap composed of 81 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 9/17 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 6 (OVERLAPS) 417/557 variables, 140/157 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 62/219 constraints. Problems are: Problem set: 1 solved, 431 unsolved
[2024-06-02 20:02:33] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-06-02 20:02:34] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 2/221 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 0/221 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 10 (OVERLAPS) 0/557 variables, 0/221 constraints. Problems are: Problem set: 1 solved, 431 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/558 variables, and 221 constraints, problems are : Problem set: 1 solved, 431 unsolved in 23467 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 140/140 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 1 solved, 431 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 2 (OVERLAPS) 2/140 variables, 7/14 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 5/19 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 5 (OVERLAPS) 417/557 variables, 140/159 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 62/221 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 431/652 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 0/652 constraints. Problems are: Problem set: 1 solved, 431 unsolved
At refinement iteration 9 (OVERLAPS) 0/557 variables, 0/652 constraints. Problems are: Problem set: 1 solved, 431 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/558 variables, and 652 constraints, problems are : Problem set: 1 solved, 431 unsolved in 28369 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 140/140 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 431/432 constraints, Known Traps: 12/12 constraints]
After SMT, in 52110ms problems are : Problem set: 1 solved, 431 unsolved
Search for dead transitions found 1 dead transitions in 52115ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 140/140 places, 441/497 transitions.
Graph (complete) has 754 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 139 /140 variables (removed 1) and now considering 441/441 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 139/140 places, 441/497 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 52166 ms. Remains : 139/140 places, 441/497 transitions.
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 497/497 transitions.
Applied a total of 0 rules in 1 ms. Remains 140 /140 variables (removed 0) and now considering 497/497 (removed 0) transitions.
[2024-06-02 20:03:13] [INFO ] Flow matrix only has 475 transitions (discarded 22 similar events)
// Phase 1: matrix 475 rows 140 cols
[2024-06-02 20:03:13] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 20:03:13] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 20:03:13] [INFO ] Flow matrix only has 475 transitions (discarded 22 similar events)
[2024-06-02 20:03:13] [INFO ] Invariant cache hit.
[2024-06-02 20:03:13] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-02 20:03:13] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 487 sub problems to find dead transitions.
[2024-06-02 20:03:13] [INFO ] Flow matrix only has 475 transitions (discarded 22 similar events)
[2024-06-02 20:03:13] [INFO ] Invariant cache hit.
[2024-06-02 20:03:13] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 487 unsolved
[2024-06-02 20:03:16] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2024-06-02 20:03:16] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-06-02 20:03:16] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-06-02 20:03:17] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
[2024-06-02 20:03:17] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 1 ms to minimize.
[2024-06-02 20:03:17] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-06-02 20:03:17] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:03:17] [INFO ] Deduced a trap composed of 81 places in 80 ms of which 1 ms to minimize.
[2024-06-02 20:03:18] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2024-06-02 20:03:18] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 5 (OVERLAPS) 474/614 variables, 140/157 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/614 variables, 75/232 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/614 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 8 (OVERLAPS) 0/614 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 487 unsolved
No progress, stopping.
After SMT solving in domain Real declared 614/615 variables, and 232 constraints, problems are : Problem set: 0 solved, 487 unsolved in 17889 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 140/140 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 487/487 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 487 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 3 (OVERLAPS) 1/140 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 6 (OVERLAPS) 474/614 variables, 140/157 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/614 variables, 75/232 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/614 variables, 487/719 constraints. Problems are: Problem set: 0 solved, 487 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/614 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 487 unsolved
[2024-06-02 20:03:51] [INFO ] Deduced a trap composed of 98 places in 88 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/614 variables, 1/720 constraints. Problems are: Problem set: 0 solved, 487 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/615 variables, and 720 constraints, problems are : Problem set: 0 solved, 487 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 140/140 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 487/487 constraints, Known Traps: 11/11 constraints]
After SMT, in 48273ms problems are : Problem set: 0 solved, 487 unsolved
Search for dead transitions found 0 dead transitions in 48279ms
Finished structural reductions in LTL mode , in 1 iterations and 48614 ms. Remains : 140/140 places, 497/497 transitions.
Treatment of property FireWire-PT-17-LTLFireability-01 finished in 206756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)&&X(p1)) U X(X(G((p2||X(!p3)))))))'
Found a Lengthening insensitive property : FireWire-PT-17-LTLFireability-11
Stuttering acceptance computed with spot in 520 ms :[(AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2) (NOT p0)), (OR (AND p1 (NOT p2) p3) (AND p0 (NOT p2) p3)), (AND (NOT p2) p3), p3, true, (AND p3 (NOT p2) (NOT p0)), (AND (NOT p2) p0 (NOT p1) p3), (AND (NOT p2) p3), (AND (NOT p0) p3), (AND (NOT p2) p3), (NOT p0)]
Support contains 7 out of 308 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 308/308 places, 532/532 transitions.
Graph (trivial) has 237 edges and 308 vertex of which 18 / 308 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 292 transition count 462
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 57 rules applied. Total rules applied 111 place count 239 transition count 458
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 114 place count 237 transition count 457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 236 transition count 457
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 115 place count 236 transition count 429
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 171 place count 208 transition count 429
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 175 place count 204 transition count 406
Iterating global reduction 4 with 4 rules applied. Total rules applied 179 place count 204 transition count 406
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 179 place count 204 transition count 403
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 185 place count 201 transition count 403
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 187 place count 199 transition count 401
Iterating global reduction 4 with 2 rules applied. Total rules applied 189 place count 199 transition count 401
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 191 place count 199 transition count 399
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 192 place count 198 transition count 399
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 248 place count 170 transition count 371
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 249 place count 169 transition count 351
Iterating global reduction 6 with 1 rules applied. Total rules applied 250 place count 169 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 251 place count 169 transition count 350
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -94
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 7 with 62 rules applied. Total rules applied 313 place count 138 transition count 444
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 319 place count 138 transition count 438
Applied a total of 319 rules in 29 ms. Remains 138 /308 variables (removed 170) and now considering 438/532 (removed 94) transitions.
[2024-06-02 20:04:02] [INFO ] Flow matrix only has 419 transitions (discarded 19 similar events)
// Phase 1: matrix 419 rows 138 cols
[2024-06-02 20:04:02] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 20:04:02] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 20:04:02] [INFO ] Flow matrix only has 419 transitions (discarded 19 similar events)
[2024-06-02 20:04:02] [INFO ] Invariant cache hit.
[2024-06-02 20:04:02] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 20:04:02] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 428 sub problems to find dead transitions.
[2024-06-02 20:04:02] [INFO ] Flow matrix only has 419 transitions (discarded 19 similar events)
[2024-06-02 20:04:02] [INFO ] Invariant cache hit.
[2024-06-02 20:04:02] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 20:04:05] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-06-02 20:04:05] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-02 20:04:05] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 0 ms to minimize.
[2024-06-02 20:04:06] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-06-02 20:04:06] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:04:06] [INFO ] Deduced a trap composed of 42 places in 33 ms of which 1 ms to minimize.
[2024-06-02 20:04:06] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 1 ms to minimize.
[2024-06-02 20:04:06] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 1 ms to minimize.
[2024-06-02 20:04:06] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (OVERLAPS) 418/556 variables, 138/154 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 71/225 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 8 (OVERLAPS) 0/556 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 428 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/557 variables, and 225 constraints, problems are : Problem set: 0 solved, 428 unsolved in 14933 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 428 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 3 (OVERLAPS) 1/138 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (OVERLAPS) 418/556 variables, 138/154 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 71/225 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 428/653 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 10 (OVERLAPS) 0/556 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 428 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/557 variables, and 653 constraints, problems are : Problem set: 0 solved, 428 unsolved in 25520 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 9/9 constraints]
After SMT, in 40722ms problems are : Problem set: 0 solved, 428 unsolved
Search for dead transitions found 0 dead transitions in 40727ms
Starting structural reductions in LI_LTL mode, iteration 1 : 138/308 places, 438/532 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 41067 ms. Remains : 138/308 places, 438/532 transitions.
Running random walk in product with property : FireWire-PT-17-LTLFireability-11
Product exploration explored 100000 steps with 20053 reset in 157 ms.
Product exploration explored 100000 steps with 20009 reset in 168 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 96 ms. Reduced automaton from 13 states, 34 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
RANDOM walk for 40000 steps (3217 resets) in 69 ms. (571 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (675 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
[2024-06-02 20:04:44] [INFO ] Flow matrix only has 419 transitions (discarded 19 similar events)
[2024-06-02 20:04:44] [INFO ] Invariant cache hit.
[2024-06-02 20:04:44] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/134 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 418/552 variables, 134/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 71/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/556 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/556 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/557 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 71/71 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/134 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 418/552 variables, 134/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 71/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/556 variables, 4/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/556 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/556 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/557 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 340ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 438/438 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 138 transition count 435
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 138 transition count 434
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 5 place count 137 transition count 434
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 135 transition count 444
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 1 with 38 rules applied. Total rules applied 47 place count 135 transition count 406
Free-agglomeration rule applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 67 place count 135 transition count 386
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 93 place count 115 transition count 380
Drop transitions (Redundant composition of simpler transitions.) removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 2 with 58 rules applied. Total rules applied 151 place count 115 transition count 322
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 155 place count 115 transition count 322
Applied a total of 155 rules in 22 ms. Remains 115 /138 variables (removed 23) and now considering 322/438 (removed 116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 115/138 places, 322/438 transitions.
RANDOM walk for 40000 steps (2461 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (233 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 11433 steps, run visited all 1 properties in 31 ms. (steps per millisecond=368 )
Probabilistic random walk after 11433 steps, saw 4833 distinct states, run finished after 31 ms. (steps per millisecond=368 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p3))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3), (F p2)]
Knowledge based reduction with 12 factoid took 211 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Stuttering acceptance computed with spot in 182 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Support contains 4 out of 138 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 438/438 transitions.
Applied a total of 0 rules in 1 ms. Remains 138 /138 variables (removed 0) and now considering 438/438 (removed 0) transitions.
[2024-06-02 20:04:45] [INFO ] Flow matrix only has 419 transitions (discarded 19 similar events)
[2024-06-02 20:04:45] [INFO ] Invariant cache hit.
[2024-06-02 20:04:45] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 20:04:45] [INFO ] Flow matrix only has 419 transitions (discarded 19 similar events)
[2024-06-02 20:04:45] [INFO ] Invariant cache hit.
[2024-06-02 20:04:45] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 20:04:45] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 428 sub problems to find dead transitions.
[2024-06-02 20:04:45] [INFO ] Flow matrix only has 419 transitions (discarded 19 similar events)
[2024-06-02 20:04:45] [INFO ] Invariant cache hit.
[2024-06-02 20:04:45] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 20:04:48] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-06-02 20:04:48] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:04:48] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-06-02 20:04:48] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-06-02 20:04:48] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 0 ms to minimize.
[2024-06-02 20:04:48] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 0 ms to minimize.
[2024-06-02 20:04:49] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 1 ms to minimize.
[2024-06-02 20:04:49] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2024-06-02 20:04:49] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (OVERLAPS) 418/556 variables, 138/154 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 71/225 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 8 (OVERLAPS) 0/556 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 428 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/557 variables, and 225 constraints, problems are : Problem set: 0 solved, 428 unsolved in 14748 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 428 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 3 (OVERLAPS) 1/138 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (OVERLAPS) 418/556 variables, 138/154 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 71/225 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 428/653 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 10 (OVERLAPS) 0/556 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 428 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/557 variables, and 653 constraints, problems are : Problem set: 0 solved, 428 unsolved in 24852 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 9/9 constraints]
After SMT, in 39872ms problems are : Problem set: 0 solved, 428 unsolved
Search for dead transitions found 0 dead transitions in 39877ms
Finished structural reductions in LTL mode , in 1 iterations and 40196 ms. Remains : 138/138 places, 438/438 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
RANDOM walk for 40000 steps (3179 resets) in 72 ms. (547 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (664 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
[2024-06-02 20:05:25] [INFO ] Flow matrix only has 419 transitions (discarded 19 similar events)
[2024-06-02 20:05:25] [INFO ] Invariant cache hit.
[2024-06-02 20:05:25] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/134 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 418/552 variables, 134/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 71/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/556 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/556 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/557 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 71/71 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 64/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/134 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 418/552 variables, 134/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 71/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/552 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/556 variables, 4/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/556 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/556 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/557 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 341ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 438/438 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 138 transition count 435
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 138 transition count 434
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 5 place count 137 transition count 434
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 135 transition count 444
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 1 with 38 rules applied. Total rules applied 47 place count 135 transition count 406
Free-agglomeration rule applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 67 place count 135 transition count 386
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 93 place count 115 transition count 380
Drop transitions (Redundant composition of simpler transitions.) removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 2 with 58 rules applied. Total rules applied 151 place count 115 transition count 322
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 155 place count 115 transition count 322
Applied a total of 155 rules in 20 ms. Remains 115 /138 variables (removed 23) and now considering 322/438 (removed 116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 115/138 places, 322/438 transitions.
RANDOM walk for 40000 steps (2474 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (241 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 11433 steps, run visited all 1 properties in 30 ms. (steps per millisecond=381 )
Probabilistic random walk after 11433 steps, saw 4833 distinct states, run finished after 30 ms. (steps per millisecond=381 ) properties seen :1
Knowledge obtained : [(AND (NOT p3) (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p3))), (F (NOT (AND (NOT p2) (NOT p3)))), (F p3), (F p2)]
Knowledge based reduction with 2 factoid took 195 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Stuttering acceptance computed with spot in 173 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Stuttering acceptance computed with spot in 178 ms :[true, p3, (AND (NOT p2) p3), (AND p3 (NOT p2)), (AND p3 (NOT p2))]
Product exploration explored 100000 steps with 1 reset in 53 ms.
Product exploration explored 100000 steps with 0 reset in 57 ms.
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 438/438 transitions.
Applied a total of 0 rules in 3 ms. Remains 138 /138 variables (removed 0) and now considering 438/438 (removed 0) transitions.
[2024-06-02 20:05:27] [INFO ] Flow matrix only has 419 transitions (discarded 19 similar events)
[2024-06-02 20:05:27] [INFO ] Invariant cache hit.
[2024-06-02 20:05:27] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 20:05:27] [INFO ] Flow matrix only has 419 transitions (discarded 19 similar events)
[2024-06-02 20:05:27] [INFO ] Invariant cache hit.
[2024-06-02 20:05:27] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 20:05:27] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 428 sub problems to find dead transitions.
[2024-06-02 20:05:27] [INFO ] Flow matrix only has 419 transitions (discarded 19 similar events)
[2024-06-02 20:05:27] [INFO ] Invariant cache hit.
[2024-06-02 20:05:27] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 428 unsolved
[2024-06-02 20:05:30] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-06-02 20:05:30] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-02 20:05:30] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-06-02 20:05:30] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-06-02 20:05:30] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-06-02 20:05:30] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2024-06-02 20:05:30] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 1 ms to minimize.
[2024-06-02 20:05:30] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2024-06-02 20:05:31] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (OVERLAPS) 418/556 variables, 138/154 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 71/225 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 8 (OVERLAPS) 0/556 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 428 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/557 variables, and 225 constraints, problems are : Problem set: 0 solved, 428 unsolved in 14548 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 428 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 3 (OVERLAPS) 1/138 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 6 (OVERLAPS) 418/556 variables, 138/154 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 71/225 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 428/653 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 428 unsolved
At refinement iteration 10 (OVERLAPS) 0/556 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 428 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/557 variables, and 653 constraints, problems are : Problem set: 0 solved, 428 unsolved in 25058 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 428/428 constraints, Known Traps: 9/9 constraints]
After SMT, in 39870ms problems are : Problem set: 0 solved, 428 unsolved
Search for dead transitions found 0 dead transitions in 39876ms
Finished structural reductions in LTL mode , in 1 iterations and 40173 ms. Remains : 138/138 places, 438/438 transitions.
Treatment of property FireWire-PT-17-LTLFireability-11 finished in 125492 ms.
[2024-06-02 20:06:07] [INFO ] Flatten gal took : 27 ms
[2024-06-02 20:06:07] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-02 20:06:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 308 places, 532 transitions and 1624 arcs took 14 ms.
Total runtime 1541169 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA FireWire-PT-17-LTLFireability-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA FireWire-PT-17-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717359058770

--------------------
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 FireWire-PT-17-LTLFireability-01
ltl formula formula --ltl=/tmp/3706/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 308 places, 532 transitions and 1624 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.040 real 0.020 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3706/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3706/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3706/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3706/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): There are 309 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 309, there are 713 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): ~332 levels ~10000 states ~37244 transitions
pnml2lts-mc( 2/ 4): ~333 levels ~20000 states ~87120 transitions
pnml2lts-mc( 2/ 4): ~333 levels ~40000 states ~211268 transitions
pnml2lts-mc( 2/ 4): ~333 levels ~80000 states ~488212 transitions
pnml2lts-mc( 3/ 4): ~465 levels ~160000 states ~1017184 transitions
pnml2lts-mc( 2/ 4): ~787 levels ~320000 states ~2000540 transitions
pnml2lts-mc( 2/ 4): ~787 levels ~640000 states ~4313880 transitions
pnml2lts-mc( 2/ 4): ~2654 levels ~1280000 states ~8974476 transitions
pnml2lts-mc( 1/ 4): ~1472 levels ~2560000 states ~18642036 transitions
pnml2lts-mc( 1/ 4): ~1472 levels ~5120000 states ~39684384 transitions
pnml2lts-mc( 1/ 4): ~1472 levels ~10240000 states ~81875132 transitions
pnml2lts-mc( 1/ 4): ~15226 levels ~20480000 states ~169381644 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 15919571
pnml2lts-mc( 0/ 4): unique states count: 33547638
pnml2lts-mc( 0/ 4): unique transitions count: 320276721
pnml2lts-mc( 0/ 4): - self-loop count: 128592
pnml2lts-mc( 0/ 4): - claim dead count: 224196711
pnml2lts-mc( 0/ 4): - claim found count: 62666060
pnml2lts-mc( 0/ 4): - claim success count: 33585975
pnml2lts-mc( 0/ 4): - cum. max stack depth: 51493
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33603428 states 320869296 transitions, fanout: 9.549
pnml2lts-mc( 0/ 4): Total exploration time 289.940 sec (289.910 sec minimum, 289.920 sec on average)
pnml2lts-mc( 0/ 4): States per second: 115898, Transitions per second: 1106675
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 271.9MB, 8.5 B/state, compr.: 0.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/24.0%
pnml2lts-mc( 0/ 4): Stored 544 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 271.9MB (~256.0MB paged-in)
ltl formula name FireWire-PT-17-LTLFireability-11
ltl formula formula --ltl=/tmp/3706/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 308 places, 532 transitions and 1624 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.040 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3706/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3706/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3706/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3706/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 13 states
pnml2lts-mc( 0/ 4): There are 309 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 309, there are 619 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~288 levels ~10000 states ~27676 transitions
pnml2lts-mc( 1/ 4): ~316 levels ~20000 states ~57528 transitions
pnml2lts-mc( 1/ 4): ~362 levels ~40000 states ~133736 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~289!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 44347
pnml2lts-mc( 0/ 4): unique states count: 59622
pnml2lts-mc( 0/ 4): unique transitions count: 226256
pnml2lts-mc( 0/ 4): - self-loop count: 1167
pnml2lts-mc( 0/ 4): - claim dead count: 158858
pnml2lts-mc( 0/ 4): - claim found count: 10953
pnml2lts-mc( 0/ 4): - claim success count: 61973
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2185
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 62196 states 244628 transitions, fanout: 3.933
pnml2lts-mc( 0/ 4): Total exploration time 0.620 sec (0.620 sec minimum, 0.620 sec on average)
pnml2lts-mc( 0/ 4): States per second: 100316, Transitions per second: 394561
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.9MB, 15.0 B/state, compr.: 1.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 544 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.9MB (~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="FireWire-PT-17"
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 FireWire-PT-17, 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 r553-tall-171734901300300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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