About the Execution of ITS-Tools for FireWire-PT-15
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1760.960 | 226595.00 | 295488.00 | 568.40 | FFFTFFFTTFFTFFFT | normal |
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.r550-tall-171734899000283.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 itstools
Input is FireWire-PT-15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734899000283
=====================================================================
--------------------
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-LTLCardinality-00
FORMULA_NAME FireWire-PT-15-LTLCardinality-01
FORMULA_NAME FireWire-PT-15-LTLCardinality-02
FORMULA_NAME FireWire-PT-15-LTLCardinality-03
FORMULA_NAME FireWire-PT-15-LTLCardinality-04
FORMULA_NAME FireWire-PT-15-LTLCardinality-05
FORMULA_NAME FireWire-PT-15-LTLCardinality-06
FORMULA_NAME FireWire-PT-15-LTLCardinality-07
FORMULA_NAME FireWire-PT-15-LTLCardinality-08
FORMULA_NAME FireWire-PT-15-LTLCardinality-09
FORMULA_NAME FireWire-PT-15-LTLCardinality-10
FORMULA_NAME FireWire-PT-15-LTLCardinality-11
FORMULA_NAME FireWire-PT-15-LTLCardinality-12
FORMULA_NAME FireWire-PT-15-LTLCardinality-13
FORMULA_NAME FireWire-PT-15-LTLCardinality-14
FORMULA_NAME FireWire-PT-15-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717367836240
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-06-02 22:37:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 22:37:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:37:17] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-06-02 22:37:17] [INFO ] Transformed 248 places.
[2024-06-02 22:37:17] [INFO ] Transformed 383 transitions.
[2024-06-02 22:37:17] [INFO ] Found NUPN structural information;
[2024-06-02 22:37:17] [INFO ] Parsed PT model containing 248 places and 383 transitions and 1144 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA FireWire-PT-15-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 383/383 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 245 transition count 383
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 56 place count 192 transition count 330
Iterating global reduction 1 with 53 rules applied. Total rules applied 109 place count 192 transition count 330
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 110 place count 192 transition count 329
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 124 place count 178 transition count 283
Iterating global reduction 2 with 14 rules applied. Total rules applied 138 place count 178 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 139 place count 178 transition count 282
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 143 place count 174 transition count 276
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 174 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 148 place count 174 transition count 275
Applied a total of 148 rules in 63 ms. Remains 174 /248 variables (removed 74) and now considering 275/383 (removed 108) transitions.
// Phase 1: matrix 275 rows 174 cols
[2024-06-02 22:37:17] [INFO ] Computed 4 invariants in 19 ms
[2024-06-02 22:37:18] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-06-02 22:37:18] [INFO ] Invariant cache hit.
[2024-06-02 22:37:18] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2024-06-02 22:37:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-06-02 22:37:20] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 14 ms to minimize.
[2024-06-02 22:37:20] [INFO ] Deduced a trap composed of 103 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:37:20] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 2 ms to minimize.
[2024-06-02 22:37:20] [INFO ] Deduced a trap composed of 107 places in 58 ms of which 2 ms to minimize.
[2024-06-02 22:37:20] [INFO ] Deduced a trap composed of 90 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:37:20] [INFO ] Deduced a trap composed of 85 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:37:21] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 2 ms to minimize.
[2024-06-02 22:37:21] [INFO ] Deduced a trap composed of 94 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:37:21] [INFO ] Deduced a trap composed of 83 places in 54 ms of which 2 ms to minimize.
[2024-06-02 22:37:21] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:37:21] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 2 ms to minimize.
[2024-06-02 22:37:21] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:37:21] [INFO ] Deduced a trap composed of 106 places in 57 ms of which 2 ms to minimize.
Problem TDEAD131 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD253 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 13/17 constraints. Problems are: Problem set: 17 solved, 257 unsolved
[2024-06-02 22:37:22] [INFO ] Deduced a trap composed of 97 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:37:22] [INFO ] Deduced a trap composed of 96 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 2/19 constraints. Problems are: Problem set: 17 solved, 257 unsolved
[2024-06-02 22:37:24] [INFO ] Deduced a trap composed of 102 places in 69 ms of which 2 ms to minimize.
[2024-06-02 22:37:24] [INFO ] Deduced a trap composed of 123 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:37:25] [INFO ] Deduced a trap composed of 98 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:37:25] [INFO ] Deduced a trap composed of 107 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 4/23 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/23 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 275/447 variables, 172/195 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 0/195 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 8 (OVERLAPS) 2/449 variables, 2/197 constraints. Problems are: Problem set: 17 solved, 257 unsolved
[2024-06-02 22:37:30] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 2 ms to minimize.
[2024-06-02 22:37:30] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 2/199 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 0/199 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 11 (OVERLAPS) 0/449 variables, 0/199 constraints. Problems are: Problem set: 17 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 199 constraints, problems are : Problem set: 17 solved, 257 unsolved in 18354 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 17 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 0/0 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/172 variables, 4/4 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 21/25 constraints. Problems are: Problem set: 17 solved, 257 unsolved
[2024-06-02 22:37:37] [INFO ] Deduced a trap composed of 103 places in 70 ms of which 2 ms to minimize.
[2024-06-02 22:37:38] [INFO ] Deduced a trap composed of 92 places in 60 ms of which 2 ms to minimize.
[2024-06-02 22:37:38] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 3/28 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/28 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 275/447 variables, 172/200 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 249/449 constraints. Problems are: Problem set: 17 solved, 257 unsolved
[2024-06-02 22:37:42] [INFO ] Deduced a trap composed of 97 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:37:43] [INFO ] Deduced a trap composed of 120 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 2/451 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 0/451 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 9 (OVERLAPS) 2/449 variables, 2/453 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 8/461 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/449 variables, 0/461 constraints. Problems are: Problem set: 17 solved, 257 unsolved
At refinement iteration 12 (OVERLAPS) 0/449 variables, 0/461 constraints. Problems are: Problem set: 17 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 449/449 variables, and 461 constraints, problems are : Problem set: 17 solved, 257 unsolved in 28986 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 257/274 constraints, Known Traps: 26/26 constraints]
After SMT, in 47469ms problems are : Problem set: 17 solved, 257 unsolved
Search for dead transitions found 17 dead transitions in 47495ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 174/248 places, 258/383 transitions.
Applied a total of 0 rules in 4 ms. Remains 174 /174 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48146 ms. Remains : 174/248 places, 258/383 transitions.
Support contains 15 out of 174 places after structural reductions.
[2024-06-02 22:38:06] [INFO ] Flatten gal took : 43 ms
[2024-06-02 22:38:06] [INFO ] Flatten gal took : 18 ms
[2024-06-02 22:38:06] [INFO ] Input system was already deterministic with 258 transitions.
RANDOM walk for 40000 steps (9 resets) in 1261 ms. (31 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40000 steps (12 resets) in 263 ms. (151 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40000 steps (18 resets) in 140 ms. (283 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (10 resets) in 213 ms. (186 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (12 resets) in 148 ms. (268 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (9 resets) in 325 ms. (122 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (9 resets) in 158 ms. (251 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (12 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
// Phase 1: matrix 258 rows 174 cols
[2024-06-02 22:38:07] [INFO ] Computed 4 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 149/160 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 246/406 variables, 160/164 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 14/420 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 8/428 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 4/432 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/432 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 178 constraints, problems are : Problem set: 0 solved, 7 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 149/160 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 22:38:07] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 2 ms to minimize.
[2024-06-02 22:38:07] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:38:07] [INFO ] Deduced a trap composed of 92 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 246/406 variables, 160/167 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 7/174 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 22:38:08] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 14/420 variables, 8/183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 8/428 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 4/432 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/432 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/432 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 189 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1062 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints]
After SMT, in 1551ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 1554 ms.
Support contains 11 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 258/258 transitions.
Graph (trivial) has 117 edges and 174 vertex of which 11 / 174 are part of one of the 3 SCC in 3 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 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 166 transition count 226
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 22 rules applied. Total rules applied 42 place count 147 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 146 transition count 223
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 43 place count 146 transition count 210
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 69 place count 133 transition count 210
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 101 place count 117 transition count 194
Performed 15 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
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 131 place count 102 transition count 263
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 133 place count 102 transition count 261
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 143 place count 102 transition count 251
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 153 place count 102 transition count 241
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 163 place count 92 transition count 241
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 165 place count 90 transition count 239
Iterating global reduction 5 with 2 rules applied. Total rules applied 167 place count 90 transition count 239
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 171 place count 90 transition count 235
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 175 place count 90 transition count 231
Applied a total of 175 rules in 79 ms. Remains 90 /174 variables (removed 84) and now considering 231/258 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 90/174 places, 231/258 transitions.
RANDOM walk for 40000 steps (3761 resets) in 257 ms. (155 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1255 resets) in 158 ms. (251 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1319 resets) in 126 ms. (314 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1248 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1255 resets) in 80 ms. (493 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1256 resets) in 136 ms. (291 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1252 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1242 resets) in 78 ms. (506 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 34156 steps, run visited all 7 properties in 110 ms. (steps per millisecond=310 )
Probabilistic random walk after 34156 steps, saw 11240 distinct states, run finished after 114 ms. (steps per millisecond=299 ) properties seen :7
FORMULA FireWire-PT-15-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 46 stabilizing places and 64 stable transitions
Graph (complete) has 474 edges and 174 vertex of which 172 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 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 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 258/258 transitions.
Graph (trivial) has 125 edges and 174 vertex of which 11 / 174 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.
Graph (complete) has 464 edges and 166 vertex of which 164 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 163 transition count 227
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 24 rules applied. Total rules applied 47 place count 142 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 141 transition count 224
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 48 place count 141 transition count 210
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 76 place count 127 transition count 210
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 82 place count 121 transition count 202
Iterating global reduction 3 with 6 rules applied. Total rules applied 88 place count 121 transition count 202
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 88 place count 121 transition count 201
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 120 transition count 201
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 118 transition count 199
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 118 transition count 199
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 117 transition count 196
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 117 transition count 196
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 116 transition count 195
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 116 transition count 195
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 115 transition count 192
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 115 transition count 192
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 114 transition count 191
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 114 transition count 191
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 113 transition count 188
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 113 transition count 188
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 112 transition count 187
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 112 transition count 187
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 107 place count 111 transition count 184
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 111 transition count 184
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 109 place count 110 transition count 183
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 110 transition count 183
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 111 place count 109 transition count 181
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 109 transition count 181
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 140 place count 95 transition count 167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 94 transition count 165
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 94 transition count 165
Performed 15 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
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 172 place count 79 transition count 230
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 187 place count 79 transition count 215
Applied a total of 187 rules in 69 ms. Remains 79 /174 variables (removed 95) and now considering 215/258 (removed 43) transitions.
[2024-06-02 22:38:11] [INFO ] Flow matrix only has 204 transitions (discarded 11 similar events)
// Phase 1: matrix 204 rows 79 cols
[2024-06-02 22:38:11] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:38:11] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-06-02 22:38:11] [INFO ] Flow matrix only has 204 transitions (discarded 11 similar events)
[2024-06-02 22:38:11] [INFO ] Invariant cache hit.
[2024-06-02 22:38:11] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-02 22:38:11] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2024-06-02 22:38:11] [INFO ] Redundant transitions in 8 ms returned []
Running 212 sub problems to find dead transitions.
[2024-06-02 22:38:11] [INFO ] Flow matrix only has 204 transitions (discarded 11 similar events)
[2024-06-02 22:38:11] [INFO ] Invariant cache hit.
[2024-06-02 22:38:11] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-02 22:38:13] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:38:13] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-06-02 22:38:13] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
[2024-06-02 22:38:13] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 2 ms to minimize.
[2024-06-02 22:38:13] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 5 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-06-02 22:38:13] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-02 22:38:13] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
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 TDEAD101 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 7/11 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/11 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 5 (OVERLAPS) 203/282 variables, 79/90 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 33/123 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/123 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 8 (OVERLAPS) 0/282 variables, 0/123 constraints. Problems are: Problem set: 24 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/283 variables, and 123 constraints, problems are : Problem set: 24 solved, 188 unsolved in 4822 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 24 solved, 188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 1/1 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 2/3 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 3 (OVERLAPS) 1/79 variables, 3/6 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 5/11 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/11 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 6 (OVERLAPS) 203/282 variables, 79/90 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 33/123 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 188/311 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/311 constraints. Problems are: Problem set: 24 solved, 188 unsolved
At refinement iteration 10 (OVERLAPS) 0/282 variables, 0/311 constraints. Problems are: Problem set: 24 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/283 variables, and 311 constraints, problems are : Problem set: 24 solved, 188 unsolved in 8182 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 188/212 constraints, Known Traps: 7/7 constraints]
After SMT, in 13155ms problems are : Problem set: 24 solved, 188 unsolved
Search for dead transitions found 24 dead transitions in 13158ms
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/174 places, 191/258 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 78 transition count 190
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 78 transition count 190
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 195
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 77 transition count 194
Applied a total of 5 rules in 27 ms. Remains 77 /79 variables (removed 2) and now considering 194/191 (removed -3) transitions.
[2024-06-02 22:38:24] [INFO ] Flow matrix only has 183 transitions (discarded 11 similar events)
// Phase 1: matrix 183 rows 77 cols
[2024-06-02 22:38:24] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:38:24] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 22:38:24] [INFO ] Flow matrix only has 183 transitions (discarded 11 similar events)
[2024-06-02 22:38:24] [INFO ] Invariant cache hit.
[2024-06-02 22:38:24] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-02 22:38:24] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/174 places, 194/258 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13871 ms. Remains : 77/174 places, 194/258 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-15-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-15-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-15-LTLCardinality-02 finished in 14093 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 258/258 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 173 transition count 258
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 166 transition count 249
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 166 transition count 249
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 163 transition count 245
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 163 transition count 245
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 162 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 162 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 161 transition count 241
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 161 transition count 241
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 160 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 160 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 159 transition count 237
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 159 transition count 237
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 158 transition count 234
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 158 transition count 234
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 157 transition count 233
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 157 transition count 233
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 156 transition count 230
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 156 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 155 transition count 229
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 155 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 154 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 154 transition count 227
Applied a total of 39 rules in 36 ms. Remains 154 /174 variables (removed 20) and now considering 227/258 (removed 31) transitions.
// Phase 1: matrix 227 rows 154 cols
[2024-06-02 22:38:25] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:38:25] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 22:38:25] [INFO ] Invariant cache hit.
[2024-06-02 22:38:25] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 226 sub problems to find dead transitions.
[2024-06-02 22:38:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-06-02 22:38:26] [INFO ] Deduced a trap composed of 86 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:38:26] [INFO ] Deduced a trap composed of 85 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:38:26] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 2 ms to minimize.
[2024-06-02 22:38:26] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:38:26] [INFO ] Deduced a trap composed of 86 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:38:26] [INFO ] Deduced a trap composed of 79 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:38:27] [INFO ] Deduced a trap composed of 82 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:38:27] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:38:27] [INFO ] Deduced a trap composed of 86 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:38:27] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 2 ms to minimize.
[2024-06-02 22:38:27] [INFO ] Deduced a trap composed of 76 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:38:27] [INFO ] Deduced a trap composed of 91 places in 52 ms of which 1 ms to minimize.
Problem TDEAD125 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 12/16 constraints. Problems are: Problem set: 15 solved, 211 unsolved
[2024-06-02 22:38:28] [INFO ] Deduced a trap composed of 90 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:38:28] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 2/18 constraints. Problems are: Problem set: 15 solved, 211 unsolved
[2024-06-02 22:38:29] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:38:30] [INFO ] Deduced a trap composed of 90 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 2/20 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/20 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 227/380 variables, 153/173 constraints. Problems are: Problem set: 15 solved, 211 unsolved
[2024-06-02 22:38:32] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/174 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/174 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 9 (OVERLAPS) 1/381 variables, 1/175 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/175 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 11 (OVERLAPS) 0/381 variables, 0/175 constraints. Problems are: Problem set: 15 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/381 variables, and 175 constraints, problems are : Problem set: 15 solved, 211 unsolved in 12958 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 15 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 17/21 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/21 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 227/380 variables, 153/174 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 204/378 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 0/378 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 1/381 variables, 1/379 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 7/386 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 0/386 constraints. Problems are: Problem set: 15 solved, 211 unsolved
At refinement iteration 10 (OVERLAPS) 0/381 variables, 0/386 constraints. Problems are: Problem set: 15 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 381/381 variables, and 386 constraints, problems are : Problem set: 15 solved, 211 unsolved in 18471 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 211/226 constraints, Known Traps: 17/17 constraints]
After SMT, in 31480ms problems are : Problem set: 15 solved, 211 unsolved
Search for dead transitions found 15 dead transitions in 31484ms
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 : 154/174 places, 212/258 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 152 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 152 transition count 210
Applied a total of 4 rules in 9 ms. Remains 152 /154 variables (removed 2) and now considering 210/212 (removed 2) transitions.
// Phase 1: matrix 210 rows 152 cols
[2024-06-02 22:38:56] [INFO ] Computed 4 invariants in 11 ms
[2024-06-02 22:38:56] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 22:38:56] [INFO ] Invariant cache hit.
[2024-06-02 22:38:57] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 152/174 places, 210/258 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31909 ms. Remains : 152/174 places, 210/258 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FireWire-PT-15-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-15-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-15-LTLCardinality-06 finished in 32028 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((!X((X(F(p0))||X(p1))) U p2)))'
Support contains 5 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 258/258 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 172 transition count 258
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 167 transition count 253
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 167 transition count 253
Applied a total of 12 rules in 5 ms. Remains 167 /174 variables (removed 7) and now considering 253/258 (removed 5) transitions.
// Phase 1: matrix 253 rows 167 cols
[2024-06-02 22:38:57] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 22:38:57] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 22:38:57] [INFO ] Invariant cache hit.
[2024-06-02 22:38:57] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2024-06-02 22:38:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
[2024-06-02 22:38:58] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:38:58] [INFO ] Deduced a trap composed of 96 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:38:59] [INFO ] Deduced a trap composed of 88 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:38:59] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:38:59] [INFO ] Deduced a trap composed of 94 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:38:59] [INFO ] Deduced a trap composed of 93 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:38:59] [INFO ] Deduced a trap composed of 95 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:38:59] [INFO ] Deduced a trap composed of 94 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:38:59] [INFO ] Deduced a trap composed of 97 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:38:59] [INFO ] Deduced a trap composed of 83 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:38:59] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:38:59] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 0 ms to minimize.
[2024-06-02 22:39:00] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
Problem TDEAD129 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 13/17 constraints. Problems are: Problem set: 26 solved, 226 unsolved
[2024-06-02 22:39:00] [INFO ] Deduced a trap composed of 95 places in 58 ms of which 2 ms to minimize.
[2024-06-02 22:39:00] [INFO ] Deduced a trap composed of 80 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 2/19 constraints. Problems are: Problem set: 26 solved, 226 unsolved
[2024-06-02 22:39:02] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 1/20 constraints. Problems are: Problem set: 26 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/20 constraints. Problems are: Problem set: 26 solved, 226 unsolved
At refinement iteration 6 (OVERLAPS) 253/420 variables, 167/187 constraints. Problems are: Problem set: 26 solved, 226 unsolved
[2024-06-02 22:39:06] [INFO ] Deduced a trap composed of 92 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 1/188 constraints. Problems are: Problem set: 26 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 0/188 constraints. Problems are: Problem set: 26 solved, 226 unsolved
At refinement iteration 9 (OVERLAPS) 0/420 variables, 0/188 constraints. Problems are: Problem set: 26 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 188 constraints, problems are : Problem set: 26 solved, 226 unsolved in 13134 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 26 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 26 solved, 226 unsolved
At refinement iteration 1 (OVERLAPS) 1/167 variables, 4/4 constraints. Problems are: Problem set: 26 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 17/21 constraints. Problems are: Problem set: 26 solved, 226 unsolved
[2024-06-02 22:39:11] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:39:11] [INFO ] Deduced a trap composed of 99 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 2/23 constraints. Problems are: Problem set: 26 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/23 constraints. Problems are: Problem set: 26 solved, 226 unsolved
At refinement iteration 5 (OVERLAPS) 253/420 variables, 167/190 constraints. Problems are: Problem set: 26 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 226/416 constraints. Problems are: Problem set: 26 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 0/416 constraints. Problems are: Problem set: 26 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 0/420 variables, 0/416 constraints. Problems are: Problem set: 26 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Int declared 420/420 variables, and 416 constraints, problems are : Problem set: 26 solved, 226 unsolved in 12592 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 226/252 constraints, Known Traps: 19/19 constraints]
After SMT, in 25790ms problems are : Problem set: 26 solved, 226 unsolved
Search for dead transitions found 26 dead transitions in 25792ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 167/174 places, 227/258 transitions.
Applied a total of 0 rules in 5 ms. Remains 167 /167 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26020 ms. Remains : 167/174 places, 227/258 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p2), (OR (NOT p2) p0 p1), (OR p1 p0), true, p0]
Running random walk in product with property : FireWire-PT-15-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 163 ms.
Product exploration explored 100000 steps with 0 reset in 121 ms.
Computed a total of 42 stabilizing places and 51 stable transitions
Computed a total of 42 stabilizing places and 51 stable transitions
Detected a total of 42/167 stabilizing places and 51/227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 119 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p2), (OR (NOT p2) p1 p0), (OR p1 p0), true, p0]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (12 resets) in 309 ms. (129 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (12 resets) in 144 ms. (275 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (16 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (10 resets) in 61 ms. (645 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (10 resets) in 61 ms. (645 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 2297364 steps, run timeout after 3001 ms. (steps per millisecond=765 ) properties seen :3 out of 4
Probabilistic random walk after 2297364 steps, saw 439645 distinct states, run finished after 3003 ms. (steps per millisecond=765 ) properties seen :3
// Phase 1: matrix 227 rows 167 cols
[2024-06-02 22:39:27] [INFO ] Computed 4 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 151/155 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 215/370 variables, 155/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/382 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/390 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/394 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/394 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/394 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 171 constraints, problems are : Problem set: 0 solved, 1 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 155/394 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/167 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 157ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 10 factoid took 227 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-15-LTLCardinality-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-15-LTLCardinality-10 finished in 30593 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((X(X(p0))||(G(F(p1)) U !p0)))))'
Support contains 4 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 258/258 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 172 transition count 258
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 163 transition count 247
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 163 transition count 247
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 160 transition count 243
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 160 transition count 243
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 159 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 159 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 158 transition count 239
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 158 transition count 239
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 157 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 157 transition count 236
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 156 transition count 235
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 156 transition count 235
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 155 transition count 232
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 155 transition count 232
Applied a total of 36 rules in 14 ms. Remains 155 /174 variables (removed 19) and now considering 232/258 (removed 26) transitions.
// Phase 1: matrix 232 rows 155 cols
[2024-06-02 22:39:27] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:39:27] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 22:39:27] [INFO ] Invariant cache hit.
[2024-06-02 22:39:27] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-06-02 22:39:27] [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 22:39:29] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:39:29] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:39:29] [INFO ] Deduced a trap composed of 87 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:39:29] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:39:29] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:39:29] [INFO ] Deduced a trap composed of 83 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:39:29] [INFO ] Deduced a trap composed of 84 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:39:29] [INFO ] Deduced a trap composed of 75 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:39:29] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:39:30] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:39:30] [INFO ] Deduced a trap composed of 59 places in 64 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 22:39:30] [INFO ] Deduced a trap composed of 87 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:39:30] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:39:31] [INFO ] Deduced a trap composed of 76 places in 50 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 22:39:32] [INFO ] Deduced a trap composed of 90 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:39:32] [INFO ] Deduced a trap composed of 86 places in 49 ms of which 2 ms to minimize.
[2024-06-02 22:39:32] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:39:32] [INFO ] Deduced a trap composed of 92 places in 59 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 22:39:33] [INFO ] Deduced a trap composed of 86 places in 59 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 22:39:36] [INFO ] Deduced a trap composed of 87 places in 52 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 12218 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 11859 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 24118ms problems are : Problem set: 18 solved, 213 unsolved
Search for dead transitions found 18 dead transitions in 24120ms
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/174 places, 214/258 transitions.
Applied a total of 0 rules in 4 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 24334 ms. Remains : 155/174 places, 214/258 transitions.
Stuttering acceptance computed with spot in 197 ms :[false, false, false, false, false]
Running random walk in product with property : FireWire-PT-15-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 124 ms.
Product exploration explored 100000 steps with 1 reset in 101 ms.
Computed a total of 34 stabilizing places and 42 stable transitions
Computed a total of 34 stabilizing places and 42 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 91 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[false, false, false, false, false]
RANDOM walk for 40000 steps (13 resets) in 142 ms. (279 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
// Phase 1: matrix 214 rows 155 cols
[2024-06-02 22:39:52] [INFO ] Computed 4 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 104/108 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/143 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 202/345 variables, 143/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/357 variables, 6/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/365 variables, 3/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/369 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/369 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 104/108 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/143 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 202/345 variables, 143/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/357 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/357 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/365 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/365 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/369 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/369 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/369 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 237ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 41 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 (NOT p0)))), (F (NOT p0)), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 7 factoid took 283 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[false, false, false, false, false]
Stuttering acceptance computed with spot in 188 ms :[false, false, false, false, false]
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 214/214 transitions.
Applied a total of 0 rules in 1 ms. Remains 155 /155 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-06-02 22:39:53] [INFO ] Invariant cache hit.
[2024-06-02 22:39:53] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 22:39:53] [INFO ] Invariant cache hit.
[2024-06-02 22:39:54] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2024-06-02 22:39:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-02 22:39:55] [INFO ] Deduced a trap composed of 96 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:39:55] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:39:55] [INFO ] Deduced a trap composed of 92 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:39:55] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:39:55] [INFO ] Deduced a trap composed of 75 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:39:55] [INFO ] Deduced a trap composed of 86 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:39:55] [INFO ] Deduced a trap composed of 84 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:39:55] [INFO ] Deduced a trap composed of 87 places in 54 ms of which 2 ms to minimize.
[2024-06-02 22:39:55] [INFO ] Deduced a trap composed of 84 places in 52 ms of which 2 ms to minimize.
[2024-06-02 22:39:55] [INFO ] Deduced a trap composed of 82 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:39:56] [INFO ] Deduced a trap composed of 87 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:39:56] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:39:56] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:39:56] [INFO ] Deduced a trap composed of 99 places in 66 ms of which 1 ms to minimize.
Problem TDEAD125 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 14/18 constraints. Problems are: Problem set: 1 solved, 212 unsolved
[2024-06-02 22:39:56] [INFO ] Deduced a trap composed of 77 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:39:56] [INFO ] Deduced a trap composed of 107 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 2/20 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 214/369 variables, 155/175 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 212 unsolved
[2024-06-02 22:40:01] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/369 variables, 1/176 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/176 constraints. Problems are: Problem set: 1 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 176 constraints, problems are : Problem set: 1 solved, 212 unsolved in 11723 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 1 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 17/21 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 214/369 variables, 155/176 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 212/388 constraints. Problems are: Problem set: 1 solved, 212 unsolved
[2024-06-02 22:40:08] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 1/389 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 0/389 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 8 (OVERLAPS) 0/369 variables, 0/389 constraints. Problems are: Problem set: 1 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 389 constraints, problems are : Problem set: 1 solved, 212 unsolved in 13838 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 212/213 constraints, Known Traps: 18/18 constraints]
After SMT, in 25607ms problems are : Problem set: 1 solved, 212 unsolved
Search for dead transitions found 1 dead transitions in 25610ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 155/155 places, 213/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25816 ms. Remains : 155/155 places, 213/214 transitions.
Computed a total of 34 stabilizing places and 42 stable transitions
Computed a total of 34 stabilizing places and 42 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 128 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[false, false, false, false, false]
RANDOM walk for 40000 steps (9 resets) in 108 ms. (366 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
// Phase 1: matrix 213 rows 155 cols
[2024-06-02 22:40:20] [INFO ] Computed 4 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 104/108 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/143 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 201/344 variables, 143/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 12/356 variables, 6/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/364 variables, 3/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/364 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/368 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/368 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/368 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 159 constraints, problems are : Problem set: 0 solved, 2 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 104/108 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/143 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 201/344 variables, 143/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/356 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 8/364 variables, 3/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/364 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/368 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/368 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/368 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 161 constraints, problems are : Problem set: 0 solved, 2 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 341ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 151 steps, including 3 resets, run visited all 2 properties in 2 ms. (steps per millisecond=75 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 (NOT p0)))), (F (NOT p0)), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 7 factoid took 195 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[false, false, false, false, false]
Stuttering acceptance computed with spot in 206 ms :[false, false, false, false, false]
Stuttering acceptance computed with spot in 189 ms :[false, false, false, false, false]
Product exploration explored 100000 steps with 0 reset in 64 ms.
Product exploration explored 100000 steps with 2 reset in 65 ms.
Built C files in :
/tmp/ltsmin17798276969194453758
[2024-06-02 22:40:21] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17798276969194453758
Running compilation step : cd /tmp/ltsmin17798276969194453758;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 470 ms.
Running link step : cd /tmp/ltsmin17798276969194453758;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin17798276969194453758;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15598007353220737500.hoa' '--buchi-type=spotba'
LTSmin run took 5576 ms.
FORMULA FireWire-PT-15-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-15-LTLCardinality-11 finished in 59993 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 258/258 transitions.
Graph (trivial) has 127 edges and 174 vertex of which 11 / 174 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.
Graph (complete) has 464 edges and 166 vertex of which 164 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 163 transition count 226
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 25 rules applied. Total rules applied 49 place count 141 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 140 transition count 223
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 50 place count 140 transition count 209
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 78 place count 126 transition count 209
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 84 place count 120 transition count 201
Iterating global reduction 3 with 6 rules applied. Total rules applied 90 place count 120 transition count 201
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 90 place count 120 transition count 200
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 92 place count 119 transition count 200
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 94 place count 117 transition count 198
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 117 transition count 198
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 116 transition count 195
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 116 transition count 195
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 115 transition count 194
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 115 transition count 194
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 114 transition count 191
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 114 transition count 191
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 113 transition count 190
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 113 transition count 190
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 112 transition count 187
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 112 transition count 187
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 134 place count 98 transition count 173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 135 place count 97 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 136 place count 97 transition count 171
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 3 with 32 rules applied. Total rules applied 168 place count 81 transition count 239
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 183 place count 81 transition count 224
Applied a total of 183 rules in 39 ms. Remains 81 /174 variables (removed 93) and now considering 224/258 (removed 34) transitions.
[2024-06-02 22:40:27] [INFO ] Flow matrix only has 213 transitions (discarded 11 similar events)
// Phase 1: matrix 213 rows 81 cols
[2024-06-02 22:40:27] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:40:27] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 22:40:27] [INFO ] Flow matrix only has 213 transitions (discarded 11 similar events)
[2024-06-02 22:40:27] [INFO ] Invariant cache hit.
[2024-06-02 22:40:27] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 22:40:28] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-06-02 22:40:28] [INFO ] Redundant transitions in 10 ms returned []
Running 221 sub problems to find dead transitions.
[2024-06-02 22:40:28] [INFO ] Flow matrix only has 213 transitions (discarded 11 similar events)
[2024-06-02 22:40:28] [INFO ] Invariant cache hit.
[2024-06-02 22:40:28] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-06-02 22:40:29] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 0 ms to minimize.
[2024-06-02 22:40:29] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 0 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
[2024-06-02 22:40:29] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-06-02 22:40:29] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:40:29] [INFO ] Deduced a trap composed of 40 places in 43 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 TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 5/9 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/9 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 212/293 variables, 81/90 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 35/125 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/125 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 0/293 variables, 0/125 constraints. Problems are: Problem set: 28 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/294 variables, and 125 constraints, problems are : Problem set: 28 solved, 193 unsolved in 4415 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 81/81 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 28 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 2/3 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 3 (OVERLAPS) 1/81 variables, 3/6 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 3/9 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/9 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 6 (OVERLAPS) 212/293 variables, 81/90 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 35/125 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 193/318 constraints. Problems are: Problem set: 28 solved, 193 unsolved
[2024-06-02 22:40:34] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 1/319 constraints. Problems are: Problem set: 28 solved, 193 unsolved
[2024-06-02 22:40:37] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 1/320 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/320 constraints. Problems are: Problem set: 28 solved, 193 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/320 constraints. Problems are: Problem set: 28 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/294 variables, and 320 constraints, problems are : Problem set: 28 solved, 193 unsolved in 14106 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 81/81 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 193/221 constraints, Known Traps: 7/7 constraints]
After SMT, in 18630ms problems are : Problem set: 28 solved, 193 unsolved
Search for dead transitions found 28 dead transitions in 18632ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 81/174 places, 196/258 transitions.
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 2 place count 80 transition count 201
Applied a total of 2 rules in 21 ms. Remains 80 /81 variables (removed 1) and now considering 201/196 (removed -5) transitions.
[2024-06-02 22:40:46] [INFO ] Flow matrix only has 190 transitions (discarded 11 similar events)
// Phase 1: matrix 190 rows 80 cols
[2024-06-02 22:40:46] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 22:40:46] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 22:40:46] [INFO ] Flow matrix only has 190 transitions (discarded 11 similar events)
[2024-06-02 22:40:46] [INFO ] Invariant cache hit.
[2024-06-02 22:40:46] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-06-02 22:40:46] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/174 places, 201/258 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19129 ms. Remains : 80/174 places, 201/258 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-15-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 88 ms.
Product exploration explored 100000 steps with 0 reset in 83 ms.
Computed a total of 16 stabilizing places and 23 stable transitions
Computed a total of 16 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1831 steps (165 resets) in 27 ms. (65 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 201/201 transitions.
Applied a total of 0 rules in 8 ms. Remains 80 /80 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2024-06-02 22:40:47] [INFO ] Flow matrix only has 190 transitions (discarded 11 similar events)
[2024-06-02 22:40:47] [INFO ] Invariant cache hit.
[2024-06-02 22:40:47] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 22:40:47] [INFO ] Flow matrix only has 190 transitions (discarded 11 similar events)
[2024-06-02 22:40:47] [INFO ] Invariant cache hit.
[2024-06-02 22:40:47] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-06-02 22:40:47] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-06-02 22:40:47] [INFO ] Redundant transitions in 2 ms returned []
Running 198 sub problems to find dead transitions.
[2024-06-02 22:40:47] [INFO ] Flow matrix only has 190 transitions (discarded 11 similar events)
[2024-06-02 22:40:47] [INFO ] Invariant cache hit.
[2024-06-02 22:40:47] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/80 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-02 22:40:48] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 0 ms to minimize.
[2024-06-02 22:40:48] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-06-02 22:40:48] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2024-06-02 22:40:49] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 0 ms to minimize.
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 4/8 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 189/269 variables, 80/88 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 27/115 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/115 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/269 variables, 0/115 constraints. Problems are: Problem set: 3 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/270 variables, and 115 constraints, problems are : Problem set: 3 solved, 195 unsolved in 3952 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 3 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 3 (OVERLAPS) 1/80 variables, 3/6 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 2/8 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 6 (OVERLAPS) 189/269 variables, 80/88 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 27/115 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 195/310 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/310 constraints. Problems are: Problem set: 3 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/269 variables, 0/310 constraints. Problems are: Problem set: 3 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/270 variables, and 310 constraints, problems are : Problem set: 3 solved, 195 unsolved in 9577 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 195/198 constraints, Known Traps: 4/4 constraints]
After SMT, in 13615ms problems are : Problem set: 3 solved, 195 unsolved
Search for dead transitions found 3 dead transitions in 13618ms
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 : 80/80 places, 198/201 transitions.
Applied a total of 0 rules in 6 ms. Remains 80 /80 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2024-06-02 22:41:01] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 13811 ms. Remains : 80/80 places, 198/201 transitions.
Computed a total of 16 stabilizing places and 23 stable transitions
Computed a total of 16 stabilizing places and 23 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4618 steps (427 resets) in 43 ms. (104 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 36 ms.
Product exploration explored 100000 steps with 0 reset in 38 ms.
Built C files in :
/tmp/ltsmin6486309207783471118
[2024-06-02 22:41:02] [INFO ] Computing symmetric may disable matrix : 198 transitions.
[2024-06-02 22:41:02] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:41:02] [INFO ] Computing symmetric may enable matrix : 198 transitions.
[2024-06-02 22:41:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:41:02] [INFO ] Computing Do-Not-Accords matrix : 198 transitions.
[2024-06-02 22:41:02] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:41:02] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6486309207783471118
Running compilation step : cd /tmp/ltsmin6486309207783471118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 446 ms.
Running link step : cd /tmp/ltsmin6486309207783471118;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6486309207783471118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1958156267749336162.hoa' '--buchi-type=spotba'
LTSmin run took 230 ms.
FORMULA FireWire-PT-15-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-15-LTLCardinality-13 finished in 35037 ms.
All properties solved by simple procedures.
Total runtime 225455 ms.
BK_STOP 1717368062835
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is FireWire-PT-15, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734899000283"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;