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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.6K 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 46K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K 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 90K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FireWire-PT-15-LTLFireability-00
FORMULA_NAME FireWire-PT-15-LTLFireability-01
FORMULA_NAME FireWire-PT-15-LTLFireability-02
FORMULA_NAME FireWire-PT-15-LTLFireability-03
FORMULA_NAME FireWire-PT-15-LTLFireability-04
FORMULA_NAME FireWire-PT-15-LTLFireability-05
FORMULA_NAME FireWire-PT-15-LTLFireability-06
FORMULA_NAME FireWire-PT-15-LTLFireability-07
FORMULA_NAME FireWire-PT-15-LTLFireability-08
FORMULA_NAME FireWire-PT-15-LTLFireability-09
FORMULA_NAME FireWire-PT-15-LTLFireability-10
FORMULA_NAME FireWire-PT-15-LTLFireability-11
FORMULA_NAME FireWire-PT-15-LTLFireability-12
FORMULA_NAME FireWire-PT-15-LTLFireability-13
FORMULA_NAME FireWire-PT-15-LTLFireability-14
FORMULA_NAME FireWire-PT-15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717371300136

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 23:35:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 23:35:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:35:01] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-06-02 23:35:01] [INFO ] Transformed 248 places.
[2024-06-02 23:35:01] [INFO ] Transformed 383 transitions.
[2024-06-02 23:35:01] [INFO ] Found NUPN structural information;
[2024-06-02 23:35:01] [INFO ] Parsed PT model containing 248 places and 383 transitions and 1144 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA FireWire-PT-15-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 383/383 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 243 transition count 383
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 65 place count 183 transition count 323
Iterating global reduction 1 with 60 rules applied. Total rules applied 125 place count 183 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 126 place count 183 transition count 322
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 136 place count 173 transition count 298
Iterating global reduction 2 with 10 rules applied. Total rules applied 146 place count 173 transition count 298
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 149 place count 170 transition count 294
Iterating global reduction 2 with 3 rules applied. Total rules applied 152 place count 170 transition count 294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 153 place count 170 transition count 293
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 154 place count 169 transition count 290
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 169 transition count 290
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 156 place count 168 transition count 288
Iterating global reduction 3 with 1 rules applied. Total rules applied 157 place count 168 transition count 288
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 158 place count 167 transition count 285
Iterating global reduction 3 with 1 rules applied. Total rules applied 159 place count 167 transition count 285
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 160 place count 166 transition count 283
Iterating global reduction 3 with 1 rules applied. Total rules applied 161 place count 166 transition count 283
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 162 place count 165 transition count 280
Iterating global reduction 3 with 1 rules applied. Total rules applied 163 place count 165 transition count 280
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 164 place count 164 transition count 278
Iterating global reduction 3 with 1 rules applied. Total rules applied 165 place count 164 transition count 278
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 166 place count 163 transition count 275
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 163 transition count 275
Applied a total of 167 rules in 91 ms. Remains 163 /248 variables (removed 85) and now considering 275/383 (removed 108) transitions.
// Phase 1: matrix 275 rows 163 cols
[2024-06-02 23:35:01] [INFO ] Computed 4 invariants in 17 ms
[2024-06-02 23:35:02] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-06-02 23:35:02] [INFO ] Invariant cache hit.
[2024-06-02 23:35:02] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2024-06-02 23:35:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-06-02 23:35:04] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 14 ms to minimize.
[2024-06-02 23:35:04] [INFO ] Deduced a trap composed of 82 places in 78 ms of which 2 ms to minimize.
[2024-06-02 23:35:04] [INFO ] Deduced a trap composed of 80 places in 64 ms of which 2 ms to minimize.
[2024-06-02 23:35:04] [INFO ] Deduced a trap composed of 81 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:35:04] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 2 ms to minimize.
[2024-06-02 23:35:05] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 2 ms to minimize.
[2024-06-02 23:35:05] [INFO ] Deduced a trap composed of 90 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:35:05] [INFO ] Deduced a trap composed of 97 places in 56 ms of which 2 ms to minimize.
Problem TDEAD129 is UNSAT
[2024-06-02 23:35:05] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 2 ms to minimize.
Problem TDEAD135 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD219 is UNSAT
[2024-06-02 23:35:05] [INFO ] Deduced a trap composed of 91 places in 58 ms of which 1 ms to minimize.
[2024-06-02 23:35:05] [INFO ] Deduced a trap composed of 92 places in 56 ms of which 1 ms to minimize.
Problem TDEAD223 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD253 is UNSAT
[2024-06-02 23:35:05] [INFO ] Deduced a trap composed of 89 places in 66 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 12/16 constraints. Problems are: Problem set: 14 solved, 260 unsolved
[2024-06-02 23:35:06] [INFO ] Deduced a trap composed of 94 places in 59 ms of which 1 ms to minimize.
[2024-06-02 23:35:06] [INFO ] Deduced a trap composed of 103 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:35:06] [INFO ] Deduced a trap composed of 91 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:35:07] [INFO ] Deduced a trap composed of 88 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 4/20 constraints. Problems are: Problem set: 14 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 14 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 275/438 variables, 163/183 constraints. Problems are: Problem set: 14 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/183 constraints. Problems are: Problem set: 14 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/438 variables, 0/183 constraints. Problems are: Problem set: 14 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 183 constraints, problems are : Problem set: 14 solved, 260 unsolved in 11413 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 14 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 14 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 4/4 constraints. Problems are: Problem set: 14 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 16/20 constraints. Problems are: Problem set: 14 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 14 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 275/438 variables, 163/183 constraints. Problems are: Problem set: 14 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 260/443 constraints. Problems are: Problem set: 14 solved, 260 unsolved
[2024-06-02 23:35:17] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 1/444 constraints. Problems are: Problem set: 14 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 0/444 constraints. Problems are: Problem set: 14 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 0/438 variables, 0/444 constraints. Problems are: Problem set: 14 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 444 constraints, problems are : Problem set: 14 solved, 260 unsolved in 17259 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 260/274 constraints, Known Traps: 17/17 constraints]
After SMT, in 28803ms problems are : Problem set: 14 solved, 260 unsolved
Search for dead transitions found 14 dead transitions in 28824ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in LTL mode, iteration 1 : 163/248 places, 261/383 transitions.
Applied a total of 0 rules in 3 ms. Remains 163 /163 variables (removed 0) and now considering 261/261 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29424 ms. Remains : 163/248 places, 261/383 transitions.
Support contains 30 out of 163 places after structural reductions.
[2024-06-02 23:35:31] [INFO ] Flatten gal took : 45 ms
[2024-06-02 23:35:31] [INFO ] Flatten gal took : 21 ms
[2024-06-02 23:35:31] [INFO ] Input system was already deterministic with 261 transitions.
Support contains 28 out of 163 places (down from 30) after GAL structural reductions.
RANDOM walk for 40000 steps (10 resets) in 1399 ms. (28 steps per ms) remains 22/25 properties
BEST_FIRST walk for 4000 steps (8 resets) in 72 ms. (54 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (10 resets) in 70 ms. (56 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4000 steps (11 resets) in 65 ms. (60 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4001 steps (12 resets) in 44 ms. (88 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (11 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (9 resets) in 35 ms. (111 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (11 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (10 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (13 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (9 resets) in 22 ms. (173 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (11 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (9 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (10 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (11 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (9 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (13 resets) in 34 ms. (114 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (10 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (10 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (11 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
// Phase 1: matrix 261 rows 163 cols
[2024-06-02 23:35:32] [INFO ] Computed 4 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 126/151 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-02 23:35:32] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:35:32] [INFO ] Deduced a trap composed of 91 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:35:32] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 1 ms to minimize.
Problem AtomicPropp3 is UNSAT
[2024-06-02 23:35:32] [INFO ] Deduced a trap composed of 80 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 4/8 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 249/400 variables, 151/159 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 12/412 variables, 6/165 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 0/165 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 8/420 variables, 3/168 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 0/168 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 4/424 variables, 3/171 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 0/424 variables, 0/171 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 171 constraints, problems are : Problem set: 1 solved, 20 unsolved in 1363 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 1 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 128/151 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 4/8 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-06-02 23:35:33] [INFO ] Deduced a trap composed of 85 places in 61 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 249/400 variables, 151/160 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 20/180 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 12/412 variables, 6/186 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 8/420 variables, 3/189 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/420 variables, 0/189 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 4/424 variables, 3/192 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 0/192 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 0/424 variables, 0/192 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 192 constraints, problems are : Problem set: 1 solved, 20 unsolved in 1632 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 20/21 constraints, Known Traps: 5/5 constraints]
After SMT, in 3005ms problems are : Problem set: 1 solved, 20 unsolved
Fused 20 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 2198 ms.
Support contains 23 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 261/261 transitions.
Graph (trivial) has 88 edges and 163 vertex of which 11 / 163 are part of one of the 3 SCC in 2 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 155 transition count 235
Reduce places removed 13 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 15 rules applied. Total rules applied 29 place count 142 transition count 233
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 141 transition count 231
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 34 place count 139 transition count 231
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 34 place count 139 transition count 218
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 60 place count 126 transition count 218
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 125 transition count 217
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 125 transition count 217
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 86 place count 113 transition count 205
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 104 place count 104 transition count 250
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 105 place count 104 transition count 249
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 110 place count 104 transition count 244
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 115 place count 99 transition count 244
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 116 place count 98 transition count 243
Iterating global reduction 5 with 1 rules applied. Total rules applied 117 place count 98 transition count 243
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 122 place count 98 transition count 243
Applied a total of 122 rules in 85 ms. Remains 98 /163 variables (removed 65) and now considering 243/261 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 98/163 places, 243/261 transitions.
RANDOM walk for 40000 steps (3073 resets) in 470 ms. (84 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (115 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (120 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (112 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (117 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (98 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (113 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (117 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (119 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (111 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (116 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (117 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (117 resets) in 35 ms. (111 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (111 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (111 resets) in 37 ms. (105 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (119 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (108 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (119 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (113 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (123 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (113 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
Finished probabilistic random walk after 70313 steps, run visited all 20 properties in 287 ms. (steps per millisecond=244 )
Probabilistic random walk after 70313 steps, saw 19825 distinct states, run finished after 290 ms. (steps per millisecond=242 ) properties seen :20
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 36 stabilizing places and 48 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' '!(G(F(((p0 U p1)||G(p2)))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 261/261 transitions.
Graph (trivial) has 118 edges and 163 vertex of which 11 / 163 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 154 transition count 232
Reduce places removed 19 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 21 rules applied. Total rules applied 41 place count 135 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 134 transition count 230
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 42 place count 134 transition count 215
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 72 place count 119 transition count 215
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 77 place count 114 transition count 192
Iterating global reduction 3 with 5 rules applied. Total rules applied 82 place count 114 transition count 192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 84 place count 114 transition count 190
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 87 place count 111 transition count 183
Iterating global reduction 4 with 3 rules applied. Total rules applied 90 place count 111 transition count 183
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 91 place count 110 transition count 182
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 110 transition count 182
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 109 transition count 180
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 109 transition count 180
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 116 place count 98 transition count 169
Performed 15 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 146 place count 83 transition count 235
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 160 place count 83 transition count 221
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 161 place count 82 transition count 220
Applied a total of 161 rules in 50 ms. Remains 82 /163 variables (removed 81) and now considering 220/261 (removed 41) transitions.
[2024-06-02 23:35:38] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
// Phase 1: matrix 212 rows 82 cols
[2024-06-02 23:35:38] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 23:35:38] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 23:35:38] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
[2024-06-02 23:35:38] [INFO ] Invariant cache hit.
[2024-06-02 23:35:38] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-02 23:35:38] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-06-02 23:35:38] [INFO ] Redundant transitions in 12 ms returned []
Running 217 sub problems to find dead transitions.
[2024-06-02 23:35:38] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
[2024-06-02 23:35:38] [INFO ] Invariant cache hit.
[2024-06-02 23:35:38] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-06-02 23:35:39] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-02 23:35:39] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-06-02 23:35:39] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:35:39] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
[2024-06-02 23:35:40] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 0 ms to minimize.
[2024-06-02 23:35:40] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 0 ms to minimize.
[2024-06-02 23:35:40] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 0 ms to minimize.
Problem TDEAD74 is UNSAT
[2024-06-02 23:35:40] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 8/12 constraints. Problems are: Problem set: 24 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/12 constraints. Problems are: Problem set: 24 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 211/293 variables, 82/94 constraints. Problems are: Problem set: 24 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 33/127 constraints. Problems are: Problem set: 24 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/127 constraints. Problems are: Problem set: 24 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 0/293 variables, 0/127 constraints. Problems are: Problem set: 24 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/294 variables, and 127 constraints, problems are : Problem set: 24 solved, 193 unsolved in 4450 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 82/82 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 24 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 24 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 1/2 constraints. Problems are: Problem set: 24 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 193 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 3/5 constraints. Problems are: Problem set: 24 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 7/12 constraints. Problems are: Problem set: 24 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/12 constraints. Problems are: Problem set: 24 solved, 193 unsolved
At refinement iteration 6 (OVERLAPS) 211/293 variables, 82/94 constraints. Problems are: Problem set: 24 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 33/127 constraints. Problems are: Problem set: 24 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 193/320 constraints. Problems are: Problem set: 24 solved, 193 unsolved
[2024-06-02 23:35:46] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 3 ms to minimize.
[2024-06-02 23:35:46] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 2/322 constraints. Problems are: Problem set: 24 solved, 193 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 0/322 constraints. Problems are: Problem set: 24 solved, 193 unsolved
At refinement iteration 11 (OVERLAPS) 0/293 variables, 0/322 constraints. Problems are: Problem set: 24 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/294 variables, and 322 constraints, problems are : Problem set: 24 solved, 193 unsolved in 11930 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 82/82 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 193/217 constraints, Known Traps: 10/10 constraints]
After SMT, in 16503ms problems are : Problem set: 24 solved, 193 unsolved
Search for dead transitions found 24 dead transitions in 16506ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 82/163 places, 196/261 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 81 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 195
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
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 4 place count 80 transition count 200
Applied a total of 4 rules in 18 ms. Remains 80 /82 variables (removed 2) and now considering 200/196 (removed -4) transitions.
[2024-06-02 23:35:55] [INFO ] Flow matrix only has 192 transitions (discarded 8 similar events)
// Phase 1: matrix 192 rows 80 cols
[2024-06-02 23:35:55] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 23:35:55] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 23:35:55] [INFO ] Flow matrix only has 192 transitions (discarded 8 similar events)
[2024-06-02 23:35:55] [INFO ] Invariant cache hit.
[2024-06-02 23:35:55] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-02 23:35:55] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/163 places, 200/261 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16941 ms. Remains : 80/163 places, 200/261 transitions.
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : FireWire-PT-15-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA FireWire-PT-15-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-15-LTLFireability-00 finished in 17214 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)&&X(G(p1)))))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 261/261 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 156 transition count 236
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 156 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 156 transition count 235
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 154 transition count 230
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 154 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 153 transition count 229
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 153 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 152 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 152 transition count 227
Applied a total of 23 rules in 16 ms. Remains 152 /163 variables (removed 11) and now considering 227/261 (removed 34) transitions.
// Phase 1: matrix 227 rows 152 cols
[2024-06-02 23:35:55] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 23:35:55] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 23:35:55] [INFO ] Invariant cache hit.
[2024-06-02 23:35:55] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2024-06-02 23:35:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-02 23:35:57] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:35:57] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 2 ms to minimize.
[2024-06-02 23:35:57] [INFO ] Deduced a trap composed of 86 places in 56 ms of which 5 ms to minimize.
[2024-06-02 23:35:57] [INFO ] Deduced a trap composed of 80 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:35:57] [INFO ] Deduced a trap composed of 81 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:35:57] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:35:57] [INFO ] Deduced a trap composed of 76 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:35:57] [INFO ] Deduced a trap composed of 76 places in 48 ms of which 2 ms to minimize.
[2024-06-02 23:35:57] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:35:57] [INFO ] Deduced a trap composed of 81 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:35:57] [INFO ] Deduced a trap composed of 93 places in 52 ms of which 2 ms to minimize.
[2024-06-02 23:35:57] [INFO ] Deduced a trap composed of 90 places in 59 ms of which 1 ms to minimize.
[2024-06-02 23:35:58] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
Problem TDEAD126 is UNSAT
Problem TDEAD139 is UNSAT
[2024-06-02 23:35:58] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 1 ms to minimize.
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 14/18 constraints. Problems are: Problem set: 15 solved, 211 unsolved
[2024-06-02 23:35:58] [INFO ] Deduced a trap composed of 91 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:35:59] [INFO ] Deduced a trap composed of 69 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 2/20 constraints. Problems are: Problem set: 15 solved, 211 unsolved
[2024-06-02 23:36:00] [INFO ] Deduced a trap composed of 86 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:36:00] [INFO ] Deduced a trap composed of 84 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 2/22 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/22 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 227/379 variables, 152/174 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 0/174 constraints. Problems are: Problem set: 15 solved, 211 unsolved
[2024-06-02 23:36:04] [INFO ] Deduced a trap composed of 77 places in 51 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/379 variables, 1/175 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 0/175 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 10 (OVERLAPS) 0/379 variables, 0/175 constraints. Problems are: Problem set: 15 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 379/379 variables, and 175 constraints, problems are : Problem set: 15 solved, 211 unsolved in 12873 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 15 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/152 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 19/23 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/23 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 227/379 variables, 152/175 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 211/386 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 0/386 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 0/379 variables, 0/386 constraints. Problems are: Problem set: 15 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 379/379 variables, and 386 constraints, problems are : Problem set: 15 solved, 211 unsolved in 9994 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 211/226 constraints, Known Traps: 19/19 constraints]
After SMT, in 22928ms problems are : Problem set: 15 solved, 211 unsolved
Search for dead transitions found 15 dead transitions in 22940ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 152/163 places, 212/261 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 151 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 151 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 150 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 150 transition count 210
Applied a total of 4 rules in 3 ms. Remains 150 /152 variables (removed 2) and now considering 210/212 (removed 2) transitions.
// Phase 1: matrix 210 rows 150 cols
[2024-06-02 23:36:18] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 23:36:18] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 23:36:18] [INFO ] Invariant cache hit.
[2024-06-02 23:36:18] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 150/163 places, 210/261 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23342 ms. Remains : 150/163 places, 210/261 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-15-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-15-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-15-LTLFireability-02 finished in 23534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 261/261 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 157 transition count 237
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 157 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 157 transition count 236
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 155 transition count 232
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 155 transition count 232
Applied a total of 17 rules in 5 ms. Remains 155 /163 variables (removed 8) and now considering 232/261 (removed 29) transitions.
// Phase 1: matrix 232 rows 155 cols
[2024-06-02 23:36:19] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 23:36:19] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 23:36:19] [INFO ] Invariant cache hit.
[2024-06-02 23:36:19] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-06-02 23:36:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-06-02 23:36:20] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-06-02 23:36:20] [INFO ] Deduced a trap composed of 91 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:36:20] [INFO ] Deduced a trap composed of 87 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:36:20] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-06-02 23:36:21] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 5 ms to minimize.
[2024-06-02 23:36:21] [INFO ] Deduced a trap composed of 83 places in 57 ms of which 1 ms to minimize.
[2024-06-02 23:36:21] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 1 ms to minimize.
[2024-06-02 23:36:21] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:36:21] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:36:21] [INFO ] Deduced a trap composed of 80 places in 57 ms of which 1 ms to minimize.
[2024-06-02 23:36:21] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 11/15 constraints. Problems are: Problem set: 18 solved, 213 unsolved
[2024-06-02 23:36:22] [INFO ] Deduced a trap composed of 87 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:36:22] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:36:22] [INFO ] Deduced a trap composed of 76 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 3/18 constraints. Problems are: Problem set: 18 solved, 213 unsolved
[2024-06-02 23:36:23] [INFO ] Deduced a trap composed of 90 places in 58 ms of which 1 ms to minimize.
[2024-06-02 23:36:23] [INFO ] Deduced a trap composed of 86 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:36:23] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:36:24] [INFO ] Deduced a trap composed of 92 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 4/22 constraints. Problems are: Problem set: 18 solved, 213 unsolved
[2024-06-02 23:36:24] [INFO ] Deduced a trap composed of 86 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 1/23 constraints. Problems are: Problem set: 18 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/23 constraints. Problems are: Problem set: 18 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 232/387 variables, 155/178 constraints. Problems are: Problem set: 18 solved, 213 unsolved
[2024-06-02 23:36:28] [INFO ] Deduced a trap composed of 87 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 1/179 constraints. Problems are: Problem set: 18 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/179 constraints. Problems are: Problem set: 18 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 0/387 variables, 0/179 constraints. Problems are: Problem set: 18 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 179 constraints, problems are : Problem set: 18 solved, 213 unsolved in 12173 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 18 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 4/4 constraints. Problems are: Problem set: 18 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/24 constraints. Problems are: Problem set: 18 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/24 constraints. Problems are: Problem set: 18 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 232/387 variables, 155/179 constraints. Problems are: Problem set: 18 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 213/392 constraints. Problems are: Problem set: 18 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 0/392 constraints. Problems are: Problem set: 18 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/387 variables, 0/392 constraints. Problems are: Problem set: 18 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 392 constraints, problems are : Problem set: 18 solved, 213 unsolved in 11847 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 213/231 constraints, Known Traps: 20/20 constraints]
After SMT, in 24067ms problems are : Problem set: 18 solved, 213 unsolved
Search for dead transitions found 18 dead transitions in 24069ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 155/163 places, 214/261 transitions.
Applied a total of 0 rules in 2 ms. Remains 155 /155 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 24254 ms. Remains : 155/163 places, 214/261 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-15-LTLFireability-05
Stuttering criterion allowed to conclude after 67 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-15-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-15-LTLFireability-05 finished in 24409 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)||(p1&&X(F(p2))))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 261/261 transitions.
Graph (trivial) has 121 edges and 163 vertex of which 11 / 163 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 154 transition count 233
Reduce places removed 18 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 20 rules applied. Total rules applied 39 place count 136 transition count 231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 135 transition count 231
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 40 place count 135 transition count 216
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 70 place count 120 transition count 216
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 74 place count 116 transition count 203
Iterating global reduction 3 with 4 rules applied. Total rules applied 78 place count 116 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 116 transition count 202
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 81 place count 114 transition count 197
Iterating global reduction 4 with 2 rules applied. Total rules applied 83 place count 114 transition count 197
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 84 place count 113 transition count 196
Iterating global reduction 4 with 1 rules applied. Total rules applied 85 place count 113 transition count 196
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 86 place count 112 transition count 194
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 112 transition count 194
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 113 place count 99 transition count 181
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 114 place count 98 transition count 179
Iterating global reduction 4 with 1 rules applied. Total rules applied 115 place count 98 transition count 179
Performed 15 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 145 place count 83 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 158 place count 83 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 159 place count 82 transition count 244
Applied a total of 159 rules in 47 ms. Remains 82 /163 variables (removed 81) and now considering 244/261 (removed 17) transitions.
[2024-06-02 23:36:43] [INFO ] Flow matrix only has 235 transitions (discarded 9 similar events)
// Phase 1: matrix 235 rows 82 cols
[2024-06-02 23:36:43] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 23:36:43] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 23:36:43] [INFO ] Flow matrix only has 235 transitions (discarded 9 similar events)
[2024-06-02 23:36:43] [INFO ] Invariant cache hit.
[2024-06-02 23:36:43] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 23:36:43] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-06-02 23:36:43] [INFO ] Redundant transitions in 14 ms returned []
Running 241 sub problems to find dead transitions.
[2024-06-02 23:36:43] [INFO ] Flow matrix only has 235 transitions (discarded 9 similar events)
[2024-06-02 23:36:43] [INFO ] Invariant cache hit.
[2024-06-02 23:36:43] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-06-02 23:36:44] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:36:44] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 0 ms to minimize.
[2024-06-02 23:36:45] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-02 23:36:45] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
[2024-06-02 23:36:45] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 0 ms to minimize.
[2024-06-02 23:36:45] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-06-02 23:36:45] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:36:45] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 8/12 constraints. Problems are: Problem set: 24 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/12 constraints. Problems are: Problem set: 24 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 234/316 variables, 82/94 constraints. Problems are: Problem set: 24 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 36/130 constraints. Problems are: Problem set: 24 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/130 constraints. Problems are: Problem set: 24 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/316 variables, 0/130 constraints. Problems are: Problem set: 24 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/317 variables, and 130 constraints, problems are : Problem set: 24 solved, 217 unsolved in 4826 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 82/82 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 24 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 24 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 2/3 constraints. Problems are: Problem set: 24 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 3/6 constraints. Problems are: Problem set: 24 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 6/12 constraints. Problems are: Problem set: 24 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/12 constraints. Problems are: Problem set: 24 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 234/316 variables, 82/94 constraints. Problems are: Problem set: 24 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 36/130 constraints. Problems are: Problem set: 24 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 217/347 constraints. Problems are: Problem set: 24 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 0/347 constraints. Problems are: Problem set: 24 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/316 variables, 0/347 constraints. Problems are: Problem set: 24 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/317 variables, and 347 constraints, problems are : Problem set: 24 solved, 217 unsolved in 10398 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 82/82 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 217/241 constraints, Known Traps: 8/8 constraints]
After SMT, in 15343ms problems are : Problem set: 24 solved, 217 unsolved
Search for dead transitions found 24 dead transitions in 15348ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 82/163 places, 220/261 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 81 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 219
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
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 4 place count 80 transition count 224
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 80 transition count 223
Applied a total of 5 rules in 15 ms. Remains 80 /82 variables (removed 2) and now considering 223/220 (removed -3) transitions.
[2024-06-02 23:36:59] [INFO ] Flow matrix only has 214 transitions (discarded 9 similar events)
// Phase 1: matrix 214 rows 80 cols
[2024-06-02 23:36:59] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 23:36:59] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 23:36:59] [INFO ] Flow matrix only has 214 transitions (discarded 9 similar events)
[2024-06-02 23:36:59] [INFO ] Invariant cache hit.
[2024-06-02 23:36:59] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 23:36:59] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/163 places, 223/261 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15769 ms. Remains : 80/163 places, 223/261 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FireWire-PT-15-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-15-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-15-LTLFireability-06 finished in 15917 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(F((p1&&X(p2)))))))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 261/261 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 157 transition count 237
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 157 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 157 transition count 236
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 155 transition count 231
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 155 transition count 231
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 154 transition count 230
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 154 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 153 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 153 transition count 228
Applied a total of 21 rules in 6 ms. Remains 153 /163 variables (removed 10) and now considering 228/261 (removed 33) transitions.
// Phase 1: matrix 228 rows 153 cols
[2024-06-02 23:36:59] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 23:36:59] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 23:36:59] [INFO ] Invariant cache hit.
[2024-06-02 23:36:59] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 227 sub problems to find dead transitions.
[2024-06-02 23:36:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-06-02 23:37:00] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-06-02 23:37:01] [INFO ] Deduced a trap composed of 79 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:37:01] [INFO ] Deduced a trap composed of 91 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:37:01] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-06-02 23:37:01] [INFO ] Deduced a trap composed of 87 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:37:01] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
[2024-06-02 23:37:01] [INFO ] Deduced a trap composed of 83 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:37:01] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:37:01] [INFO ] Deduced a trap composed of 92 places in 58 ms of which 1 ms to minimize.
[2024-06-02 23:37:01] [INFO ] Deduced a trap composed of 87 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:37:01] [INFO ] Deduced a trap composed of 86 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:37:01] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:37:02] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 2 ms to minimize.
Problem TDEAD127 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
[2024-06-02 23:37:02] [INFO ] Deduced a trap composed of 78 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 14/18 constraints. Problems are: Problem set: 15 solved, 212 unsolved
[2024-06-02 23:37:02] [INFO ] Deduced a trap composed of 78 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:37:02] [INFO ] Deduced a trap composed of 77 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 2/20 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/20 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 228/381 variables, 153/173 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 0/173 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 0/381 variables, 0/173 constraints. Problems are: Problem set: 15 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/381 variables, and 173 constraints, problems are : Problem set: 15 solved, 212 unsolved in 8309 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 15 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 16/20 constraints. Problems are: Problem set: 15 solved, 212 unsolved
[2024-06-02 23:37:09] [INFO ] Deduced a trap composed of 90 places in 58 ms of which 1 ms to minimize.
[2024-06-02 23:37:09] [INFO ] Deduced a trap composed of 89 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 2/22 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 228/381 variables, 153/175 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 212/387 constraints. Problems are: Problem set: 15 solved, 212 unsolved
[2024-06-02 23:37:12] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 1/388 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/388 constraints. Problems are: Problem set: 15 solved, 212 unsolved
At refinement iteration 9 (OVERLAPS) 0/381 variables, 0/388 constraints. Problems are: Problem set: 15 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 381/381 variables, and 388 constraints, problems are : Problem set: 15 solved, 212 unsolved in 16080 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 212/227 constraints, Known Traps: 19/19 constraints]
After SMT, in 24432ms problems are : Problem set: 15 solved, 212 unsolved
Search for dead transitions found 15 dead transitions in 24435ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 153/163 places, 213/261 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 152 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 152 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 151 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 151 transition count 211
Applied a total of 4 rules in 7 ms. Remains 151 /153 variables (removed 2) and now considering 211/213 (removed 2) transitions.
// Phase 1: matrix 211 rows 151 cols
[2024-06-02 23:37:24] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 23:37:24] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 23:37:24] [INFO ] Invariant cache hit.
[2024-06-02 23:37:24] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 151/163 places, 211/261 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 24835 ms. Remains : 151/163 places, 211/261 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : FireWire-PT-15-LTLFireability-07
Stuttering criterion allowed to conclude after 45 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-15-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-15-LTLFireability-07 finished in 24978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p1)))&&p0)))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 261/261 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 156 transition count 236
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 156 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 156 transition count 235
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 153 transition count 228
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 153 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 152 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 152 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 151 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 151 transition count 225
Applied a total of 25 rules in 10 ms. Remains 151 /163 variables (removed 12) and now considering 225/261 (removed 36) transitions.
// Phase 1: matrix 225 rows 151 cols
[2024-06-02 23:37:24] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 23:37:24] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 23:37:24] [INFO ] Invariant cache hit.
[2024-06-02 23:37:24] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2024-06-02 23:37:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-06-02 23:37:25] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:37:25] [INFO ] Deduced a trap composed of 86 places in 57 ms of which 1 ms to minimize.
[2024-06-02 23:37:26] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-06-02 23:37:26] [INFO ] Deduced a trap composed of 88 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:37:26] [INFO ] Deduced a trap composed of 93 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:37:26] [INFO ] Deduced a trap composed of 84 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:37:26] [INFO ] Deduced a trap composed of 90 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:37:26] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-06-02 23:37:26] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:37:26] [INFO ] Deduced a trap composed of 78 places in 57 ms of which 2 ms to minimize.
[2024-06-02 23:37:26] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 1 ms to minimize.
[2024-06-02 23:37:27] [INFO ] Deduced a trap composed of 83 places in 51 ms of which 1 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 12/16 constraints. Problems are: Problem set: 15 solved, 209 unsolved
[2024-06-02 23:37:27] [INFO ] Deduced a trap composed of 75 places in 47 ms of which 0 ms to minimize.
[2024-06-02 23:37:27] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-06-02 23:37:27] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 3/19 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/19 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 225/376 variables, 151/170 constraints. Problems are: Problem set: 15 solved, 209 unsolved
[2024-06-02 23:37:30] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 1/171 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 0/171 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 8 (OVERLAPS) 0/376 variables, 0/171 constraints. Problems are: Problem set: 15 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 171 constraints, problems are : Problem set: 15 solved, 209 unsolved in 9597 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 15 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 16/20 constraints. Problems are: Problem set: 15 solved, 209 unsolved
[2024-06-02 23:37:34] [INFO ] Deduced a trap composed of 88 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 1/21 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/21 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 225/376 variables, 151/172 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 209/381 constraints. Problems are: Problem set: 15 solved, 209 unsolved
[2024-06-02 23:37:37] [INFO ] Deduced a trap composed of 89 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 1/382 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/382 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 9 (OVERLAPS) 0/376 variables, 0/382 constraints. Problems are: Problem set: 15 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 382 constraints, problems are : Problem set: 15 solved, 209 unsolved in 14230 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 209/224 constraints, Known Traps: 18/18 constraints]
After SMT, in 23865ms problems are : Problem set: 15 solved, 209 unsolved
Search for dead transitions found 15 dead transitions in 23868ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 151/163 places, 210/261 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 150 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 150 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 149 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 149 transition count 208
Applied a total of 4 rules in 9 ms. Remains 149 /151 variables (removed 2) and now considering 208/210 (removed 2) transitions.
// Phase 1: matrix 208 rows 149 cols
[2024-06-02 23:37:48] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 23:37:48] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 23:37:48] [INFO ] Invariant cache hit.
[2024-06-02 23:37:48] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 149/163 places, 208/261 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 24266 ms. Remains : 149/163 places, 208/261 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-15-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-15-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-15-LTLFireability-08 finished in 24497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 261/261 transitions.
Graph (trivial) has 124 edges and 163 vertex of which 11 / 163 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 154 transition count 232
Reduce places removed 19 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 21 rules applied. Total rules applied 41 place count 135 transition count 230
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 134 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 44 place count 133 transition count 229
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 44 place count 133 transition count 213
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 76 place count 117 transition count 213
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 81 place count 112 transition count 190
Iterating global reduction 4 with 5 rules applied. Total rules applied 86 place count 112 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 88 place count 112 transition count 188
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 90 place count 110 transition count 183
Iterating global reduction 5 with 2 rules applied. Total rules applied 92 place count 110 transition count 183
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 93 place count 109 transition count 182
Iterating global reduction 5 with 1 rules applied. Total rules applied 94 place count 109 transition count 182
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 95 place count 108 transition count 180
Iterating global reduction 5 with 1 rules applied. Total rules applied 96 place count 108 transition count 180
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 122 place count 95 transition count 167
Performed 16 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 154 place count 79 transition count 230
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 167 place count 79 transition count 217
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 168 place count 78 transition count 216
Applied a total of 168 rules in 23 ms. Remains 78 /163 variables (removed 85) and now considering 216/261 (removed 45) transitions.
[2024-06-02 23:37:48] [INFO ] Flow matrix only has 209 transitions (discarded 7 similar events)
// Phase 1: matrix 209 rows 78 cols
[2024-06-02 23:37:48] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 23:37:49] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 23:37:49] [INFO ] Flow matrix only has 209 transitions (discarded 7 similar events)
[2024-06-02 23:37:49] [INFO ] Invariant cache hit.
[2024-06-02 23:37:49] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 23:37:49] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-06-02 23:37:49] [INFO ] Redundant transitions in 6 ms returned []
Running 213 sub problems to find dead transitions.
[2024-06-02 23:37:49] [INFO ] Flow matrix only has 209 transitions (discarded 7 similar events)
[2024-06-02 23:37:49] [INFO ] Invariant cache hit.
[2024-06-02 23:37:49] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-02 23:37:50] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 0 ms to minimize.
[2024-06-02 23:37:50] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-02 23:37:50] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
[2024-06-02 23:37:50] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 0 ms to minimize.
[2024-06-02 23:37:50] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-06-02 23:37:50] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:37:50] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 7/11 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 208/286 variables, 78/89 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 35/124 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/124 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 8 (OVERLAPS) 0/286 variables, 0/124 constraints. Problems are: Problem set: 24 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/287 variables, and 124 constraints, problems are : Problem set: 24 solved, 189 unsolved in 4753 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 78/78 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 24 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 1/1 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 1/2 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 1/78 variables, 3/5 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/11 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/11 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 208/286 variables, 78/89 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 35/124 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 189/313 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 0/313 constraints. Problems are: Problem set: 24 solved, 189 unsolved
[2024-06-02 23:37:59] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/286 variables, 1/314 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 0/314 constraints. Problems are: Problem set: 24 solved, 189 unsolved
At refinement iteration 12 (OVERLAPS) 0/286 variables, 0/314 constraints. Problems are: Problem set: 24 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/287 variables, and 314 constraints, problems are : Problem set: 24 solved, 189 unsolved in 15377 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 78/78 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 189/213 constraints, Known Traps: 8/8 constraints]
After SMT, in 20224ms problems are : Problem set: 24 solved, 189 unsolved
Search for dead transitions found 24 dead transitions in 20227ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 78/163 places, 192/261 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 77 transition count 191
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 77 transition count 191
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
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 4 place count 76 transition count 196
Applied a total of 4 rules in 14 ms. Remains 76 /78 variables (removed 2) and now considering 196/192 (removed -4) transitions.
[2024-06-02 23:38:09] [INFO ] Flow matrix only has 189 transitions (discarded 7 similar events)
// Phase 1: matrix 189 rows 76 cols
[2024-06-02 23:38:09] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 23:38:09] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 23:38:09] [INFO ] Flow matrix only has 189 transitions (discarded 7 similar events)
[2024-06-02 23:38:09] [INFO ] Invariant cache hit.
[2024-06-02 23:38:09] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-02 23:38:09] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/163 places, 196/261 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20699 ms. Remains : 76/163 places, 196/261 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-15-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-15-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-15-LTLFireability-09 finished in 20759 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 261/261 transitions.
Graph (trivial) has 121 edges and 163 vertex of which 11 / 163 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 154 transition count 232
Reduce places removed 19 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 21 rules applied. Total rules applied 41 place count 135 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 134 transition count 230
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 42 place count 134 transition count 214
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 74 place count 118 transition count 214
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 79 place count 113 transition count 200
Iterating global reduction 3 with 5 rules applied. Total rules applied 84 place count 113 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 85 place count 113 transition count 199
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 88 place count 110 transition count 192
Iterating global reduction 4 with 3 rules applied. Total rules applied 91 place count 110 transition count 192
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 92 place count 109 transition count 191
Iterating global reduction 4 with 1 rules applied. Total rules applied 93 place count 109 transition count 191
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 94 place count 108 transition count 189
Iterating global reduction 4 with 1 rules applied. Total rules applied 95 place count 108 transition count 189
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 119 place count 96 transition count 177
Performed 16 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 151 place count 80 transition count 263
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 166 place count 80 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 167 place count 79 transition count 247
Applied a total of 167 rules in 36 ms. Remains 79 /163 variables (removed 84) and now considering 247/261 (removed 14) transitions.
[2024-06-02 23:38:09] [INFO ] Flow matrix only has 238 transitions (discarded 9 similar events)
// Phase 1: matrix 238 rows 79 cols
[2024-06-02 23:38:09] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 23:38:09] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 23:38:09] [INFO ] Flow matrix only has 238 transitions (discarded 9 similar events)
[2024-06-02 23:38:09] [INFO ] Invariant cache hit.
[2024-06-02 23:38:09] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 23:38:09] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-06-02 23:38:09] [INFO ] Redundant transitions in 3 ms returned []
Running 244 sub problems to find dead transitions.
[2024-06-02 23:38:09] [INFO ] Flow matrix only has 238 transitions (discarded 9 similar events)
[2024-06-02 23:38:09] [INFO ] Invariant cache hit.
[2024-06-02 23:38:09] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 244 unsolved
[2024-06-02 23:38:11] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-06-02 23:38:11] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
[2024-06-02 23:38:11] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:38:11] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-06-02 23:38:11] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 0 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 5/9 constraints. Problems are: Problem set: 24 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/9 constraints. Problems are: Problem set: 24 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 237/316 variables, 79/88 constraints. Problems are: Problem set: 24 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 36/124 constraints. Problems are: Problem set: 24 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/124 constraints. Problems are: Problem set: 24 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 0/316 variables, 0/124 constraints. Problems are: Problem set: 24 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/317 variables, and 124 constraints, problems are : Problem set: 24 solved, 220 unsolved in 4948 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 24 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 24 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 24 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 3/4 constraints. Problems are: Problem set: 24 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 5/9 constraints. Problems are: Problem set: 24 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/9 constraints. Problems are: Problem set: 24 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 237/316 variables, 79/88 constraints. Problems are: Problem set: 24 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 36/124 constraints. Problems are: Problem set: 24 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 220/344 constraints. Problems are: Problem set: 24 solved, 220 unsolved
[2024-06-02 23:38:17] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 1/345 constraints. Problems are: Problem set: 24 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 0/345 constraints. Problems are: Problem set: 24 solved, 220 unsolved
At refinement iteration 10 (OVERLAPS) 0/316 variables, 0/345 constraints. Problems are: Problem set: 24 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/317 variables, and 345 constraints, problems are : Problem set: 24 solved, 220 unsolved in 13577 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 220/244 constraints, Known Traps: 6/6 constraints]
After SMT, in 18649ms problems are : Problem set: 24 solved, 220 unsolved
Search for dead transitions found 24 dead transitions in 18653ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 79/163 places, 223/261 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 78 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 78 transition count 222
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
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 4 place count 77 transition count 227
Applied a total of 4 rules in 12 ms. Remains 77 /79 variables (removed 2) and now considering 227/223 (removed -4) transitions.
[2024-06-02 23:38:28] [INFO ] Flow matrix only has 218 transitions (discarded 9 similar events)
// Phase 1: matrix 218 rows 77 cols
[2024-06-02 23:38:28] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 23:38:28] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 23:38:28] [INFO ] Flow matrix only has 218 transitions (discarded 9 similar events)
[2024-06-02 23:38:28] [INFO ] Invariant cache hit.
[2024-06-02 23:38:28] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 23:38:28] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/163 places, 227/261 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19090 ms. Remains : 77/163 places, 227/261 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-15-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 133 ms.
Product exploration explored 100000 steps with 1 reset in 77 ms.
Computed a total of 11 stabilizing places and 18 stable transitions
Computed a total of 11 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 40000 steps (3027 resets) in 551 ms. (72 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1068 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3764 steps, run visited all 1 properties in 21 ms. (steps per millisecond=179 )
Probabilistic random walk after 3764 steps, saw 1576 distinct states, run finished after 21 ms. (steps per millisecond=179 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 227/227 transitions.
Applied a total of 0 rules in 10 ms. Remains 77 /77 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2024-06-02 23:38:29] [INFO ] Flow matrix only has 218 transitions (discarded 9 similar events)
[2024-06-02 23:38:29] [INFO ] Invariant cache hit.
[2024-06-02 23:38:29] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 23:38:29] [INFO ] Flow matrix only has 218 transitions (discarded 9 similar events)
[2024-06-02 23:38:29] [INFO ] Invariant cache hit.
[2024-06-02 23:38:29] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 23:38:29] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-06-02 23:38:29] [INFO ] Redundant transitions in 1 ms returned []
Running 224 sub problems to find dead transitions.
[2024-06-02 23:38:29] [INFO ] Flow matrix only has 218 transitions (discarded 9 similar events)
[2024-06-02 23:38:29] [INFO ] Invariant cache hit.
[2024-06-02 23:38:29] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-06-02 23:38:30] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:38:31] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 2/6 constraints. Problems are: Problem set: 3 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 217/294 variables, 77/83 constraints. Problems are: Problem set: 3 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 29/112 constraints. Problems are: Problem set: 3 solved, 221 unsolved
[2024-06-02 23:38:33] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 1/113 constraints. Problems are: Problem set: 3 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/113 constraints. Problems are: Problem set: 3 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/294 variables, 0/113 constraints. Problems are: Problem set: 3 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/295 variables, and 113 constraints, problems are : Problem set: 3 solved, 221 unsolved in 6240 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 77/77 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 1/77 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/7 constraints. Problems are: Problem set: 3 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 217/294 variables, 77/84 constraints. Problems are: Problem set: 3 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 29/113 constraints. Problems are: Problem set: 3 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 221/334 constraints. Problems are: Problem set: 3 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/334 constraints. Problems are: Problem set: 3 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/294 variables, 0/334 constraints. Problems are: Problem set: 3 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/295 variables, and 334 constraints, problems are : Problem set: 3 solved, 221 unsolved in 10504 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 77/77 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 221/224 constraints, Known Traps: 3/3 constraints]
After SMT, in 16865ms problems are : Problem set: 3 solved, 221 unsolved
Search for dead transitions found 3 dead transitions in 16867ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 77/77 places, 224/227 transitions.
Applied a total of 0 rules in 10 ms. Remains 77 /77 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-06-02 23:38:46] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 17071 ms. Remains : 77/77 places, 224/227 transitions.
Computed a total of 11 stabilizing places and 18 stable transitions
Computed a total of 11 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 40000 steps (3043 resets) in 58 ms. (677 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1065 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3764 steps, run visited all 1 properties in 10 ms. (steps per millisecond=376 )
Probabilistic random walk after 3764 steps, saw 1576 distinct states, run finished after 10 ms. (steps per millisecond=376 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2 reset in 83 ms.
Product exploration explored 100000 steps with 1 reset in 83 ms.
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 224/224 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-06-02 23:38:47] [INFO ] Flow matrix only has 215 transitions (discarded 9 similar events)
// Phase 1: matrix 215 rows 77 cols
[2024-06-02 23:38:47] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 23:38:47] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 23:38:47] [INFO ] Flow matrix only has 215 transitions (discarded 9 similar events)
[2024-06-02 23:38:47] [INFO ] Invariant cache hit.
[2024-06-02 23:38:47] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 23:38:47] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-06-02 23:38:47] [INFO ] Redundant transitions in 1 ms returned []
Running 221 sub problems to find dead transitions.
[2024-06-02 23:38:47] [INFO ] Flow matrix only has 215 transitions (discarded 9 similar events)
[2024-06-02 23:38:47] [INFO ] Invariant cache hit.
[2024-06-02 23:38:47] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-02 23:38:48] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-06-02 23:38:48] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 214/291 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 29/112 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/292 variables, and 112 constraints, problems are : Problem set: 0 solved, 221 unsolved in 4311 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 77/77 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 214/291 variables, 77/83 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 29/112 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 221/333 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-02 23:38:57] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/291 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (OVERLAPS) 0/291 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/292 variables, and 334 constraints, problems are : Problem set: 0 solved, 221 unsolved in 16673 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 77/77 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 3/3 constraints]
After SMT, in 21111ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 21114ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21296 ms. Remains : 77/77 places, 224/224 transitions.
Treatment of property FireWire-PT-15-LTLFireability-10 finished in 58934 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((X((X(G(p2))&&p1))&&p0))))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 261/261 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 158 transition count 247
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 158 transition count 247
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 155 transition count 240
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 155 transition count 240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 154 transition count 239
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 154 transition count 239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 153 transition count 237
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 153 transition count 237
Applied a total of 20 rules in 4 ms. Remains 153 /163 variables (removed 10) and now considering 237/261 (removed 24) transitions.
// Phase 1: matrix 237 rows 153 cols
[2024-06-02 23:39:08] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 23:39:08] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 23:39:08] [INFO ] Invariant cache hit.
[2024-06-02 23:39:08] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2024-06-02 23:39:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-06-02 23:39:10] [INFO ] Deduced a trap composed of 98 places in 51 ms of which 1 ms to minimize.
[2024-06-02 23:39:10] [INFO ] Deduced a trap composed of 85 places in 58 ms of which 1 ms to minimize.
[2024-06-02 23:39:10] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2024-06-02 23:39:10] [INFO ] Deduced a trap composed of 85 places in 58 ms of which 1 ms to minimize.
[2024-06-02 23:39:10] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:39:10] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 1 ms to minimize.
[2024-06-02 23:39:10] [INFO ] Deduced a trap composed of 84 places in 58 ms of which 3 ms to minimize.
[2024-06-02 23:39:10] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:39:11] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:39:11] [INFO ] Deduced a trap composed of 76 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:39:11] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 11/15 constraints. Problems are: Problem set: 15 solved, 221 unsolved
[2024-06-02 23:39:11] [INFO ] Deduced a trap composed of 76 places in 58 ms of which 1 ms to minimize.
[2024-06-02 23:39:11] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:39:12] [INFO ] Deduced a trap composed of 87 places in 68 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 3/18 constraints. Problems are: Problem set: 15 solved, 221 unsolved
[2024-06-02 23:39:13] [INFO ] Deduced a trap composed of 90 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 1/19 constraints. Problems are: Problem set: 15 solved, 221 unsolved
[2024-06-02 23:39:14] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 1/20 constraints. Problems are: Problem set: 15 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/20 constraints. Problems are: Problem set: 15 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 237/390 variables, 153/173 constraints. Problems are: Problem set: 15 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/173 constraints. Problems are: Problem set: 15 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/390 variables, 0/173 constraints. Problems are: Problem set: 15 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 173 constraints, problems are : Problem set: 15 solved, 221 unsolved in 11598 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 15 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 16/20 constraints. Problems are: Problem set: 15 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/20 constraints. Problems are: Problem set: 15 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 237/390 variables, 153/173 constraints. Problems are: Problem set: 15 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 221/394 constraints. Problems are: Problem set: 15 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/394 constraints. Problems are: Problem set: 15 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 0/390 variables, 0/394 constraints. Problems are: Problem set: 15 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 394 constraints, problems are : Problem set: 15 solved, 221 unsolved in 12097 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 221/236 constraints, Known Traps: 16/16 constraints]
After SMT, in 23735ms problems are : Problem set: 15 solved, 221 unsolved
Search for dead transitions found 15 dead transitions in 23737ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 153/163 places, 222/261 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 152 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 152 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 151 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 151 transition count 220
Applied a total of 4 rules in 6 ms. Remains 151 /153 variables (removed 2) and now considering 220/222 (removed 2) transitions.
// Phase 1: matrix 220 rows 151 cols
[2024-06-02 23:39:32] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 23:39:32] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 23:39:32] [INFO ] Invariant cache hit.
[2024-06-02 23:39:32] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 151/163 places, 220/261 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 24136 ms. Remains : 151/163 places, 220/261 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : FireWire-PT-15-LTLFireability-13
Stuttering criterion allowed to conclude after 66 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-15-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-15-LTLFireability-13 finished in 24398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(F(p1))&&(p2||G(p3)))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 261/261 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 156 transition count 236
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 156 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 156 transition count 235
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 153 transition count 228
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 153 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 152 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 152 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 151 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 151 transition count 225
Applied a total of 25 rules in 10 ms. Remains 151 /163 variables (removed 12) and now considering 225/261 (removed 36) transitions.
// Phase 1: matrix 225 rows 151 cols
[2024-06-02 23:39:33] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 23:39:33] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 23:39:33] [INFO ] Invariant cache hit.
[2024-06-02 23:39:33] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2024-06-02 23:39:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-06-02 23:39:34] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:39:34] [INFO ] Deduced a trap composed of 86 places in 66 ms of which 1 ms to minimize.
[2024-06-02 23:39:34] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:39:34] [INFO ] Deduced a trap composed of 88 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:39:34] [INFO ] Deduced a trap composed of 93 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:39:34] [INFO ] Deduced a trap composed of 84 places in 73 ms of which 2 ms to minimize.
[2024-06-02 23:39:34] [INFO ] Deduced a trap composed of 90 places in 62 ms of which 1 ms to minimize.
[2024-06-02 23:39:35] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-06-02 23:39:35] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 1 ms to minimize.
[2024-06-02 23:39:35] [INFO ] Deduced a trap composed of 78 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:39:35] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:39:35] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 1 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 12/16 constraints. Problems are: Problem set: 15 solved, 209 unsolved
[2024-06-02 23:39:36] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 1 ms to minimize.
[2024-06-02 23:39:36] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-06-02 23:39:36] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 3/19 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/19 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 225/376 variables, 151/170 constraints. Problems are: Problem set: 15 solved, 209 unsolved
[2024-06-02 23:39:39] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 1/171 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 0/171 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 8 (OVERLAPS) 0/376 variables, 0/171 constraints. Problems are: Problem set: 15 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 171 constraints, problems are : Problem set: 15 solved, 209 unsolved in 9803 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 15 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 16/20 constraints. Problems are: Problem set: 15 solved, 209 unsolved
[2024-06-02 23:39:43] [INFO ] Deduced a trap composed of 88 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 1/21 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/21 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 225/376 variables, 151/172 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 209/381 constraints. Problems are: Problem set: 15 solved, 209 unsolved
[2024-06-02 23:39:46] [INFO ] Deduced a trap composed of 89 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 1/382 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/382 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 9 (OVERLAPS) 0/376 variables, 0/382 constraints. Problems are: Problem set: 15 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 382 constraints, problems are : Problem set: 15 solved, 209 unsolved in 14106 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 209/224 constraints, Known Traps: 18/18 constraints]
After SMT, in 23944ms problems are : Problem set: 15 solved, 209 unsolved
Search for dead transitions found 15 dead transitions in 23946ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 151/163 places, 210/261 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 150 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 150 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 149 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 149 transition count 208
Applied a total of 4 rules in 8 ms. Remains 149 /151 variables (removed 2) and now considering 208/210 (removed 2) transitions.
// Phase 1: matrix 208 rows 149 cols
[2024-06-02 23:39:57] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 23:39:57] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 23:39:57] [INFO ] Invariant cache hit.
[2024-06-02 23:39:57] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 149/163 places, 208/261 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 24350 ms. Remains : 149/163 places, 208/261 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : FireWire-PT-15-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 101 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 0 ms.
FORMULA FireWire-PT-15-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property FireWire-PT-15-LTLFireability-14 finished in 24681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-06-02 23:39:58] [INFO ] Flatten gal took : 31 ms
[2024-06-02 23:39:58] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-02 23:39:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 163 places, 261 transitions and 784 arcs took 4 ms.
Total runtime 296764 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-15

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/400/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 163
TRANSITIONS: 261
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.005s, Sys 0.000s]


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


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

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

Process ID: 1555
MODEL NAME: /home/mcc/execution/400/model
163 places, 261 transitions.

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

BK_STOP 1717371603059

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FireWire-PT-15, 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 r549-tall-171734898200284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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