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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 12 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 110K May 18 16:42 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 AutonomousCar-PT-04b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-04b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716345849407

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 02:44:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 02:44:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 02:44:11] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2024-05-22 02:44:11] [INFO ] Transformed 221 places.
[2024-05-22 02:44:11] [INFO ] Transformed 368 transitions.
[2024-05-22 02:44:11] [INFO ] Found NUPN structural information;
[2024-05-22 02:44:11] [INFO ] Parsed PT model containing 221 places and 368 transitions and 1658 arcs in 293 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA AutonomousCar-PT-04b-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 368/368 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 191 transition count 338
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 191 transition count 338
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 124 place count 191 transition count 274
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 129 place count 186 transition count 269
Iterating global reduction 1 with 5 rules applied. Total rules applied 134 place count 186 transition count 269
Applied a total of 134 rules in 100 ms. Remains 186 /221 variables (removed 35) and now considering 269/368 (removed 99) transitions.
// Phase 1: matrix 269 rows 186 cols
[2024-05-22 02:44:12] [INFO ] Computed 9 invariants in 27 ms
[2024-05-22 02:44:12] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-05-22 02:44:12] [INFO ] Invariant cache hit.
[2024-05-22 02:44:12] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-22 02:44:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-22 02:44:15] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 30 ms to minimize.
[2024-05-22 02:44:16] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 3 ms to minimize.
[2024-05-22 02:44:16] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 2 ms to minimize.
[2024-05-22 02:44:16] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 3 ms to minimize.
[2024-05-22 02:44:16] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 3 ms to minimize.
[2024-05-22 02:44:16] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 2 ms to minimize.
[2024-05-22 02:44:16] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-05-22 02:44:16] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2024-05-22 02:44:16] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
[2024-05-22 02:44:17] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-05-22 02:44:17] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 2 ms to minimize.
[2024-05-22 02:44:17] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 2 ms to minimize.
[2024-05-22 02:44:17] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 2 ms to minimize.
[2024-05-22 02:44:17] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-05-22 02:44:17] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 3 ms to minimize.
[2024-05-22 02:44:18] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-05-22 02:44:18] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-05-22 02:44:18] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 2 ms to minimize.
[2024-05-22 02:44:18] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-05-22 02:44:18] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-22 02:44:18] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-22 02:44:18] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 2 ms to minimize.
[2024-05-22 02:44:19] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
[2024-05-22 02:44:19] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-05-22 02:44:19] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 2 ms to minimize.
[2024-05-22 02:44:19] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 1 ms to minimize.
[2024-05-22 02:44:19] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 2 ms to minimize.
[2024-05-22 02:44:20] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 2 ms to minimize.
[2024-05-22 02:44:20] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-05-22 02:44:20] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2024-05-22 02:44:20] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-22 02:44:20] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2024-05-22 02:44:20] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-05-22 02:44:20] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 3 ms to minimize.
[2024-05-22 02:44:20] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 4 ms to minimize.
[2024-05-22 02:44:21] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-22 02:44:23] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 2 ms to minimize.
[2024-05-22 02:44:23] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-05-22 02:44:23] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-05-22 02:44:23] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 3 ms to minimize.
[2024-05-22 02:44:23] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-22 02:44:23] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-22 02:44:25] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 2 ms to minimize.
[2024-05-22 02:44:25] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 3 ms to minimize.
[2024-05-22 02:44:25] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 2 ms to minimize.
[2024-05-22 02:44:25] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 2 ms to minimize.
[2024-05-22 02:44:25] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:44:25] [INFO ] Deduced a trap composed of 43 places in 86 ms of which 2 ms to minimize.
[2024-05-22 02:44:25] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 268 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD244 is UNSAT
At refinement iteration 7 (OVERLAPS) 269/455 variables, 186/244 constraints. Problems are: Problem set: 2 solved, 266 unsolved
[2024-05-22 02:44:29] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2024-05-22 02:44:30] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-05-22 02:44:30] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:44:30] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 4/248 constraints. Problems are: Problem set: 2 solved, 266 unsolved
[2024-05-22 02:44:33] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-05-22 02:44:33] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 2/250 constraints. Problems are: Problem set: 2 solved, 266 unsolved
[2024-05-22 02:44:36] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 1/251 constraints. Problems are: Problem set: 2 solved, 266 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/455 variables, 0/251 constraints. Problems are: Problem set: 2 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/455 variables, and 251 constraints, problems are : Problem set: 2 solved, 266 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 2 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 266 unsolved
At refinement iteration 1 (OVERLAPS) 2/186 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 56/65 constraints. Problems are: Problem set: 2 solved, 266 unsolved
[2024-05-22 02:44:45] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 1/66 constraints. Problems are: Problem set: 2 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/66 constraints. Problems are: Problem set: 2 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 269/455 variables, 186/252 constraints. Problems are: Problem set: 2 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 266/518 constraints. Problems are: Problem set: 2 solved, 266 unsolved
[2024-05-22 02:44:49] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 2 ms to minimize.
[2024-05-22 02:44:49] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 2/520 constraints. Problems are: Problem set: 2 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 0/520 constraints. Problems are: Problem set: 2 solved, 266 unsolved
At refinement iteration 9 (OVERLAPS) 0/455 variables, 0/520 constraints. Problems are: Problem set: 2 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Int declared 455/455 variables, and 520 constraints, problems are : Problem set: 2 solved, 266 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 266/268 constraints, Known Traps: 59/59 constraints]
After SMT, in 60448ms problems are : Problem set: 2 solved, 266 unsolved
Search for dead transitions found 2 dead transitions in 60485ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 186/221 places, 267/368 transitions.
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 0 rules in 6 ms. Remains 186 /186 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61330 ms. Remains : 186/221 places, 267/368 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Support contains 37 out of 185 places after structural reductions.
[2024-05-22 02:45:13] [INFO ] Flatten gal took : 77 ms
[2024-05-22 02:45:13] [INFO ] Flatten gal took : 32 ms
[2024-05-22 02:45:13] [INFO ] Input system was already deterministic with 267 transitions.
RANDOM walk for 40000 steps (80 resets) in 2289 ms. (17 steps per ms) remains 7/28 properties
BEST_FIRST walk for 40000 steps (52 resets) in 309 ms. (129 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (110 resets) in 134 ms. (296 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40001 steps (96 resets) in 89 ms. (444 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40001 steps (44 resets) in 194 ms. (205 steps per ms) remains 2/4 properties
// Phase 1: matrix 267 rows 185 cols
[2024-05-22 02:45:14] [INFO ] Computed 9 invariants in 19 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 96/102 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 83/185 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 267/452 variables, 185/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/452 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 194 constraints, problems are : Problem set: 0 solved, 2 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 185/185 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 1 (OVERLAPS) 96/102 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/185 variables, 4/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 267/452 variables, 185/194 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 1/195 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 02:45:15] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 1/196 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/452 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/452 variables, and 196 constraints, problems are : Problem set: 1 solved, 1 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 618ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 267/267 transitions.
Graph (trivial) has 172 edges and 185 vertex of which 4 / 185 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 521 edges and 183 vertex of which 179 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 179 transition count 190
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 98 rules applied. Total rules applied 171 place count 110 transition count 161
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 188 place count 93 transition count 161
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 188 place count 93 transition count 155
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 200 place count 87 transition count 155
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 204 place count 83 transition count 151
Iterating global reduction 3 with 4 rules applied. Total rules applied 208 place count 83 transition count 151
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 282 place count 46 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 283 place count 46 transition count 113
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 291 place count 38 transition count 80
Iterating global reduction 4 with 8 rules applied. Total rules applied 299 place count 38 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 302 place count 38 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 304 place count 37 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 306 place count 36 transition count 89
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 310 place count 36 transition count 85
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 314 place count 32 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 315 place count 31 transition count 84
Applied a total of 315 rules in 83 ms. Remains 31 /185 variables (removed 154) and now considering 84/267 (removed 183) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 31/185 places, 84/267 transitions.
RANDOM walk for 6310 steps (286 resets) in 51 ms. (121 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-04b-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA AutonomousCar-PT-04b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 34 stabilizing places and 34 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 267/267 transitions.
Graph (trivial) has 173 edges and 185 vertex of which 4 / 185 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 182 transition count 194
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 97 rules applied. Total rules applied 168 place count 112 transition count 167
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 184 place count 96 transition count 167
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 184 place count 96 transition count 161
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 196 place count 90 transition count 161
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 200 place count 86 transition count 157
Iterating global reduction 3 with 4 rules applied. Total rules applied 204 place count 86 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 205 place count 85 transition count 153
Iterating global reduction 3 with 1 rules applied. Total rules applied 206 place count 85 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 208 place count 85 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 209 place count 84 transition count 151
Performed 36 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 281 place count 48 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 282 place count 48 transition count 113
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 290 place count 40 transition count 80
Iterating global reduction 6 with 8 rules applied. Total rules applied 298 place count 40 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 301 place count 40 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 305 place count 38 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 307 place count 37 transition count 88
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 309 place count 35 transition count 86
Applied a total of 309 rules in 63 ms. Remains 35 /185 variables (removed 150) and now considering 86/267 (removed 181) transitions.
// Phase 1: matrix 86 rows 35 cols
[2024-05-22 02:45:16] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 02:45:16] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 02:45:16] [INFO ] Invariant cache hit.
[2024-05-22 02:45:16] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-22 02:45:16] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [31, 34]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 184 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/185 places, 86/267 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 31 transition count 84
Applied a total of 4 rules in 8 ms. Remains 31 /33 variables (removed 2) and now considering 84/86 (removed 2) transitions.
// Phase 1: matrix 84 rows 31 cols
[2024-05-22 02:45:16] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 02:45:16] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 02:45:16] [INFO ] Invariant cache hit.
[2024-05-22 02:45:16] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 02:45:16] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/185 places, 84/267 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 420 ms. Remains : 31/185 places, 84/267 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-01
Product exploration explored 100000 steps with 20750 reset in 348 ms.
Product exploration explored 100000 steps with 20677 reset in 245 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Detected a total of 5/31 stabilizing places and 5/84 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 194 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 205 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-22 02:45:17] [INFO ] Invariant cache hit.
[2024-05-22 02:45:17] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 02:45:17] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-22 02:45:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 02:45:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 02:45:17] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-22 02:45:17] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 02:45:17] [INFO ] [Nat]Added 37 Read/Feed constraints in 6 ms returned sat
[2024-05-22 02:45:18] [INFO ] Computed and/alt/rep : 12/53/12 causal constraints (skipped 68 transitions) in 12 ms.
[2024-05-22 02:45:18] [INFO ] Added : 0 causal constraints over 0 iterations in 29 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 84/84 transitions.
Applied a total of 0 rules in 7 ms. Remains 31 /31 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-22 02:45:18] [INFO ] Invariant cache hit.
[2024-05-22 02:45:18] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 02:45:18] [INFO ] Invariant cache hit.
[2024-05-22 02:45:18] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 02:45:18] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-05-22 02:45:18] [INFO ] Redundant transitions in 16 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-22 02:45:18] [INFO ] Invariant cache hit.
[2024-05-22 02:45:18] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 02:45:18] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 83/114 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 36/74 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 02:45:19] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 1/115 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/115 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 76 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2403 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 31/31 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 83/114 variables, 31/39 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 36/75 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 80/155 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 1/115 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/115 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 156 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3175 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 31/31 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
After SMT, in 5719ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 5721ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5905 ms. Remains : 31/31 places, 84/84 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Detected a total of 5/31 stabilizing places and 5/84 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 175 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 15 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 201 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2024-05-22 02:45:24] [INFO ] Invariant cache hit.
[2024-05-22 02:45:24] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-22 02:45:24] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-22 02:45:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 02:45:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-22 02:45:24] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-22 02:45:24] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 02:45:24] [INFO ] [Nat]Added 37 Read/Feed constraints in 5 ms returned sat
[2024-05-22 02:45:24] [INFO ] Computed and/alt/rep : 12/53/12 causal constraints (skipped 68 transitions) in 10 ms.
[2024-05-22 02:45:24] [INFO ] Added : 0 causal constraints over 0 iterations in 20 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 20591 reset in 276 ms.
Product exploration explored 100000 steps with 20657 reset in 218 ms.
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 84/84 transitions.
Applied a total of 0 rules in 4 ms. Remains 31 /31 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-22 02:45:25] [INFO ] Invariant cache hit.
[2024-05-22 02:45:25] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-22 02:45:25] [INFO ] Invariant cache hit.
[2024-05-22 02:45:25] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 02:45:25] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2024-05-22 02:45:25] [INFO ] Redundant transitions in 14 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-22 02:45:25] [INFO ] Invariant cache hit.
[2024-05-22 02:45:25] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 1/31 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 02:45:25] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 83/114 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 36/74 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-22 02:45:26] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 1/115 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/115 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 76 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2285 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 31/31 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/31 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 83/114 variables, 31/39 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 36/75 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 80/155 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 1/115 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/115 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/115 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 156 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3243 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 31/31 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 2/2 constraints]
After SMT, in 5636ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 5637ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5813 ms. Remains : 31/31 places, 84/84 transitions.
Treatment of property AutonomousCar-PT-04b-LTLFireability-01 finished in 15147 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(F(p1) U p2))))'
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 267/267 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 180 transition count 262
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 180 transition count 262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 179 transition count 261
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 179 transition count 261
Applied a total of 12 rules in 12 ms. Remains 179 /185 variables (removed 6) and now considering 261/267 (removed 6) transitions.
// Phase 1: matrix 261 rows 179 cols
[2024-05-22 02:45:31] [INFO ] Computed 9 invariants in 2 ms
[2024-05-22 02:45:31] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-22 02:45:31] [INFO ] Invariant cache hit.
[2024-05-22 02:45:31] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2024-05-22 02:45:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:45:33] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 2 ms to minimize.
[2024-05-22 02:45:34] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
[2024-05-22 02:45:34] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2024-05-22 02:45:34] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:45:34] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-22 02:45:34] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 2 ms to minimize.
[2024-05-22 02:45:34] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-05-22 02:45:34] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-22 02:45:34] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 2 ms to minimize.
[2024-05-22 02:45:34] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 2 ms to minimize.
[2024-05-22 02:45:35] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-05-22 02:45:35] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2024-05-22 02:45:35] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-05-22 02:45:35] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 2 ms to minimize.
[2024-05-22 02:45:35] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 2 ms to minimize.
[2024-05-22 02:45:35] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
[2024-05-22 02:45:36] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
[2024-05-22 02:45:36] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 1 ms to minimize.
[2024-05-22 02:45:36] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:45:36] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:45:36] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2024-05-22 02:45:36] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-05-22 02:45:36] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 2 ms to minimize.
[2024-05-22 02:45:37] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-22 02:45:37] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:45:37] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:45:37] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:45:37] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-22 02:45:38] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
[2024-05-22 02:45:38] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 2 ms to minimize.
[2024-05-22 02:45:38] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 11/40 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:45:40] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 2 ms to minimize.
[2024-05-22 02:45:40] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:45:40] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2024-05-22 02:45:40] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 2 ms to minimize.
[2024-05-22 02:45:40] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:45:41] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-05-22 02:45:42] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 2 ms to minimize.
[2024-05-22 02:45:42] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 2 ms to minimize.
[2024-05-22 02:45:42] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 2 ms to minimize.
[2024-05-22 02:45:42] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 2 ms to minimize.
[2024-05-22 02:45:42] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2024-05-22 02:45:42] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 2 ms to minimize.
[2024-05-22 02:45:42] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
[2024-05-22 02:45:42] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:45:44] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2024-05-22 02:45:44] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 261/440 variables, 179/235 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (OVERLAPS) 0/440 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 235 constraints, problems are : Problem set: 0 solved, 260 unsolved in 22434 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 47/56 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 261/440 variables, 179/235 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 260/495 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/440 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 495 constraints, problems are : Problem set: 0 solved, 260 unsolved in 16871 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 47/47 constraints]
After SMT, in 39473ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 39477ms
Starting structural reductions in LTL mode, iteration 1 : 179/185 places, 261/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39794 ms. Remains : 179/185 places, 261/267 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-03 finished in 40031 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(G(!p0)&&(p1 U (p2||G(p1)))))))'
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 267/267 transitions.
Graph (trivial) has 160 edges and 185 vertex of which 4 / 185 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 183 transition count 195
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 95 rules applied. Total rules applied 166 place count 113 transition count 170
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 16 rules applied. Total rules applied 182 place count 98 transition count 169
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 185 place count 97 transition count 167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 186 place count 96 transition count 167
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 186 place count 96 transition count 162
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 196 place count 91 transition count 162
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 202 place count 85 transition count 156
Iterating global reduction 5 with 6 rules applied. Total rules applied 208 place count 85 transition count 156
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 208 place count 85 transition count 155
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 210 place count 84 transition count 155
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 211 place count 83 transition count 151
Iterating global reduction 5 with 1 rules applied. Total rules applied 212 place count 83 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 214 place count 83 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 215 place count 82 transition count 149
Performed 30 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 275 place count 52 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 276 place count 52 transition count 117
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 281 place count 47 transition count 99
Iterating global reduction 8 with 5 rules applied. Total rules applied 286 place count 47 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 289 place count 47 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 293 place count 45 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 295 place count 44 transition count 107
Applied a total of 295 rules in 76 ms. Remains 44 /185 variables (removed 141) and now considering 107/267 (removed 160) transitions.
// Phase 1: matrix 107 rows 44 cols
[2024-05-22 02:46:11] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 02:46:11] [INFO ] Implicit Places using invariants in 76 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/185 places, 107/267 transitions.
Applied a total of 0 rules in 4 ms. Remains 43 /43 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 160 ms. Remains : 43/185 places, 107/267 transitions.
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-05
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-05 TRUE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-05 finished in 223 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||G((p1||F(p0)))||G(p2))))'
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 267/267 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 180 transition count 262
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 180 transition count 262
Applied a total of 10 rules in 9 ms. Remains 180 /185 variables (removed 5) and now considering 262/267 (removed 5) transitions.
// Phase 1: matrix 262 rows 180 cols
[2024-05-22 02:46:11] [INFO ] Computed 9 invariants in 2 ms
[2024-05-22 02:46:11] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-22 02:46:11] [INFO ] Invariant cache hit.
[2024-05-22 02:46:11] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2024-05-22 02:46:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 02:46:14] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2024-05-22 02:46:14] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 2 ms to minimize.
[2024-05-22 02:46:14] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2024-05-22 02:46:14] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
[2024-05-22 02:46:14] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-05-22 02:46:14] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
[2024-05-22 02:46:14] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-05-22 02:46:14] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-05-22 02:46:15] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
[2024-05-22 02:46:15] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 2 ms to minimize.
[2024-05-22 02:46:15] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-22 02:46:15] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 3 ms to minimize.
[2024-05-22 02:46:15] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
[2024-05-22 02:46:15] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-05-22 02:46:15] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2024-05-22 02:46:15] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:46:15] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
[2024-05-22 02:46:16] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-05-22 02:46:16] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-05-22 02:46:16] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 02:46:16] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:46:16] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2024-05-22 02:46:16] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 2 ms to minimize.
[2024-05-22 02:46:17] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-05-22 02:46:17] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 1 ms to minimize.
[2024-05-22 02:46:17] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-22 02:46:17] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 3 ms to minimize.
[2024-05-22 02:46:17] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-05-22 02:46:17] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 2 ms to minimize.
[2024-05-22 02:46:17] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 2 ms to minimize.
[2024-05-22 02:46:17] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2024-05-22 02:46:17] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 3 ms to minimize.
[2024-05-22 02:46:18] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 2 ms to minimize.
[2024-05-22 02:46:18] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 2 ms to minimize.
[2024-05-22 02:46:18] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-05-22 02:46:18] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-22 02:46:18] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-05-22 02:46:18] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 2 ms to minimize.
[2024-05-22 02:46:18] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:46:18] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 02:46:20] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 2 ms to minimize.
[2024-05-22 02:46:20] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-05-22 02:46:20] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 2 ms to minimize.
[2024-05-22 02:46:20] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:46:21] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-05-22 02:46:21] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-05-22 02:46:21] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-05-22 02:46:21] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 02:46:22] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
[2024-05-22 02:46:22] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 1 ms to minimize.
[2024-05-22 02:46:22] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 2 ms to minimize.
[2024-05-22 02:46:22] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 262/442 variables, 180/241 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 02:46:27] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 2 ms to minimize.
[2024-05-22 02:46:27] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (OVERLAPS) 0/442 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/442 variables, and 243 constraints, problems are : Problem set: 0 solved, 261 unsolved in 23187 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-22 02:46:36] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-22 02:46:37] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 2 ms to minimize.
[2024-05-22 02:46:37] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 2 ms to minimize.
[2024-05-22 02:46:37] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (OVERLAPS) 262/442 variables, 180/247 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 261/508 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 0/442 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Int declared 442/442 variables, and 508 constraints, problems are : Problem set: 0 solved, 261 unsolved in 19863 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 58/58 constraints]
After SMT, in 43193ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 43197ms
Starting structural reductions in LTL mode, iteration 1 : 180/185 places, 262/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43463 ms. Remains : 180/185 places, 262/267 transitions.
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-07
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-07 finished in 43742 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 5 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 267/267 transitions.
Graph (trivial) has 169 edges and 185 vertex of which 4 / 185 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 182 transition count 195
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 96 rules applied. Total rules applied 166 place count 113 transition count 168
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 182 place count 97 transition count 168
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 182 place count 97 transition count 161
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 196 place count 90 transition count 161
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 201 place count 85 transition count 156
Iterating global reduction 3 with 5 rules applied. Total rules applied 206 place count 85 transition count 156
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 207 place count 84 transition count 152
Iterating global reduction 3 with 1 rules applied. Total rules applied 208 place count 84 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 210 place count 84 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 211 place count 83 transition count 150
Performed 33 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 277 place count 50 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 278 place count 50 transition count 115
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 284 place count 44 transition count 91
Iterating global reduction 6 with 6 rules applied. Total rules applied 290 place count 44 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 292 place count 44 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 296 place count 42 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 298 place count 41 transition count 100
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 299 place count 41 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 300 place count 40 transition count 99
Applied a total of 300 rules in 42 ms. Remains 40 /185 variables (removed 145) and now considering 99/267 (removed 168) transitions.
// Phase 1: matrix 99 rows 40 cols
[2024-05-22 02:46:55] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 02:46:55] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-22 02:46:55] [INFO ] Invariant cache hit.
[2024-05-22 02:46:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 02:46:55] [INFO ] Implicit Places using invariants and state equation in 86 ms returned [36, 39]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 141 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/185 places, 99/267 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 36 transition count 97
Applied a total of 4 rules in 5 ms. Remains 36 /38 variables (removed 2) and now considering 97/99 (removed 2) transitions.
// Phase 1: matrix 97 rows 36 cols
[2024-05-22 02:46:55] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 02:46:55] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 02:46:55] [INFO ] Invariant cache hit.
[2024-05-22 02:46:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:46:55] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/185 places, 97/267 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 317 ms. Remains : 36/185 places, 97/267 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-08
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-08 finished in 368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||F((X(p1)||(p1 U p2)))))'
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 267/267 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 179 transition count 261
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 179 transition count 261
Applied a total of 12 rules in 4 ms. Remains 179 /185 variables (removed 6) and now considering 261/267 (removed 6) transitions.
// Phase 1: matrix 261 rows 179 cols
[2024-05-22 02:46:55] [INFO ] Computed 9 invariants in 2 ms
[2024-05-22 02:46:55] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-22 02:46:55] [INFO ] Invariant cache hit.
[2024-05-22 02:46:55] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2024-05-22 02:46:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:46:58] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 2 ms to minimize.
[2024-05-22 02:46:58] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-05-22 02:46:58] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 3 ms to minimize.
[2024-05-22 02:46:58] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-22 02:46:58] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-05-22 02:46:58] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 2 ms to minimize.
[2024-05-22 02:46:58] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 2 ms to minimize.
[2024-05-22 02:46:59] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 2 ms to minimize.
[2024-05-22 02:46:59] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 2 ms to minimize.
[2024-05-22 02:46:59] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
[2024-05-22 02:46:59] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 2 ms to minimize.
[2024-05-22 02:46:59] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 4 ms to minimize.
[2024-05-22 02:46:59] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
[2024-05-22 02:46:59] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-05-22 02:46:59] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-22 02:46:59] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 2 ms to minimize.
[2024-05-22 02:47:00] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-05-22 02:47:00] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-05-22 02:47:00] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-05-22 02:47:00] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:47:00] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-22 02:47:00] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-22 02:47:00] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-22 02:47:00] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-05-22 02:47:01] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 4 ms to minimize.
[2024-05-22 02:47:01] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 2 ms to minimize.
[2024-05-22 02:47:01] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 2 ms to minimize.
[2024-05-22 02:47:01] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 2 ms to minimize.
[2024-05-22 02:47:01] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-05-22 02:47:01] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:47:01] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:47:01] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:47:02] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
[2024-05-22 02:47:02] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 2 ms to minimize.
[2024-05-22 02:47:02] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-22 02:47:02] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 2 ms to minimize.
[2024-05-22 02:47:02] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 17/46 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:47:04] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 2 ms to minimize.
[2024-05-22 02:47:04] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
[2024-05-22 02:47:04] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
[2024-05-22 02:47:04] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
[2024-05-22 02:47:04] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-05-22 02:47:05] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2024-05-22 02:47:05] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 2 ms to minimize.
[2024-05-22 02:47:05] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 2 ms to minimize.
[2024-05-22 02:47:05] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
[2024-05-22 02:47:05] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-05-22 02:47:05] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:47:06] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 261/440 variables, 179/237 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:47:11] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 2 ms to minimize.
[2024-05-22 02:47:11] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
[2024-05-22 02:47:11] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:47:13] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:47:14] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:47:19] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-05-22 02:47:20] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 2 ms to minimize.
[2024-05-22 02:47:20] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/440 variables, 3/245 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/440 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:47:25] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 440/440 variables, and 246 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 58/67 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:47:27] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2024-05-22 02:47:27] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/440 variables, 179/248 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 260/508 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:47:32] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 1 ms to minimize.
[2024-05-22 02:47:32] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 2/510 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:47:40] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 511 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 63/63 constraints]
After SMT, in 60169ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60172ms
Starting structural reductions in LTL mode, iteration 1 : 179/185 places, 261/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60462 ms. Remains : 179/185 places, 261/267 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-09
Stuttering criterion allowed to conclude after 428 steps with 4 reset in 1 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-09 finished in 60652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (!p0 U (p1&&X(!p2)))))'
Support contains 6 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 267/267 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 180 transition count 262
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 180 transition count 262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 179 transition count 261
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 179 transition count 261
Applied a total of 12 rules in 5 ms. Remains 179 /185 variables (removed 6) and now considering 261/267 (removed 6) transitions.
// Phase 1: matrix 261 rows 179 cols
[2024-05-22 02:47:56] [INFO ] Computed 9 invariants in 2 ms
[2024-05-22 02:47:56] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-22 02:47:56] [INFO ] Invariant cache hit.
[2024-05-22 02:47:56] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2024-05-22 02:47:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:47:58] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-22 02:47:58] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 2 ms to minimize.
[2024-05-22 02:47:59] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 2 ms to minimize.
[2024-05-22 02:47:59] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 2 ms to minimize.
[2024-05-22 02:47:59] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 2 ms to minimize.
[2024-05-22 02:47:59] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-05-22 02:47:59] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-05-22 02:47:59] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 2 ms to minimize.
[2024-05-22 02:47:59] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 2 ms to minimize.
[2024-05-22 02:47:59] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 3 ms to minimize.
[2024-05-22 02:47:59] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 2 ms to minimize.
[2024-05-22 02:48:00] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-05-22 02:48:00] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
[2024-05-22 02:48:00] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-05-22 02:48:00] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 1 ms to minimize.
[2024-05-22 02:48:00] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 1 ms to minimize.
[2024-05-22 02:48:00] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
[2024-05-22 02:48:00] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 2 ms to minimize.
[2024-05-22 02:48:00] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-22 02:48:00] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:48:01] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2024-05-22 02:48:01] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2024-05-22 02:48:01] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 2 ms to minimize.
[2024-05-22 02:48:01] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 4 ms to minimize.
[2024-05-22 02:48:01] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-05-22 02:48:01] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 1 ms to minimize.
[2024-05-22 02:48:02] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
[2024-05-22 02:48:02] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2024-05-22 02:48:02] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 2 ms to minimize.
[2024-05-22 02:48:02] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 2 ms to minimize.
[2024-05-22 02:48:02] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 1 ms to minimize.
[2024-05-22 02:48:02] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2024-05-22 02:48:02] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 2 ms to minimize.
[2024-05-22 02:48:02] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 2 ms to minimize.
[2024-05-22 02:48:03] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-05-22 02:48:03] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:48:03] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2024-05-22 02:48:03] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2024-05-22 02:48:03] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 19/48 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:48:05] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2024-05-22 02:48:05] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-22 02:48:05] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 2 ms to minimize.
[2024-05-22 02:48:05] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:48:06] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:48:07] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:48:07] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-05-22 02:48:07] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 2 ms to minimize.
[2024-05-22 02:48:07] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
[2024-05-22 02:48:07] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2024-05-22 02:48:07] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 2 ms to minimize.
[2024-05-22 02:48:07] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2024-05-22 02:48:07] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:48:09] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2024-05-22 02:48:09] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 1 ms to minimize.
[2024-05-22 02:48:09] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 1 ms to minimize.
[2024-05-22 02:48:09] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:48:11] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2024-05-22 02:48:11] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 2 ms to minimize.
[2024-05-22 02:48:11] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:48:12] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-22 02:48:12] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 9 (OVERLAPS) 261/440 variables, 179/249 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 11 (OVERLAPS) 0/440 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 249 constraints, problems are : Problem set: 0 solved, 260 unsolved in 24260 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 261/440 variables, 179/249 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 260/509 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/440 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 509 constraints, problems are : Problem set: 0 solved, 260 unsolved in 19211 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 61/61 constraints]
After SMT, in 43609ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 43613ms
Starting structural reductions in LTL mode, iteration 1 : 179/185 places, 261/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43903 ms. Remains : 179/185 places, 261/267 transitions.
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p1) p2), (NOT p0), (OR (NOT p1) p2), p2, p2, true, p2]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 137 ms.
Product exploration explored 100000 steps with 50000 reset in 337 ms.
Computed a total of 32 stabilizing places and 32 stable transitions
Computed a total of 32 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (AND p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X p0), (X p1), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 27 factoid took 202 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-04b-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-04b-LTLFireability-10 finished in 44919 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' '!(((p0||F(!p1)||G(!p2)) U X((p3||X(p2)))))'
Support contains 8 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 267/267 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 179 transition count 261
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 179 transition count 261
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 178 transition count 260
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 178 transition count 260
Applied a total of 14 rules in 5 ms. Remains 178 /185 variables (removed 7) and now considering 260/267 (removed 7) transitions.
// Phase 1: matrix 260 rows 178 cols
[2024-05-22 02:48:41] [INFO ] Computed 9 invariants in 2 ms
[2024-05-22 02:48:41] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-22 02:48:41] [INFO ] Invariant cache hit.
[2024-05-22 02:48:41] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2024-05-22 02:48:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-22 02:48:43] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2024-05-22 02:48:44] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 2 ms to minimize.
[2024-05-22 02:48:44] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:48:44] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-05-22 02:48:44] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-05-22 02:48:44] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 2 ms to minimize.
[2024-05-22 02:48:44] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-22 02:48:44] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-22 02:48:44] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
[2024-05-22 02:48:44] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
[2024-05-22 02:48:45] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 2 ms to minimize.
[2024-05-22 02:48:45] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-05-22 02:48:45] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2024-05-22 02:48:45] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2024-05-22 02:48:45] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-05-22 02:48:45] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 2 ms to minimize.
[2024-05-22 02:48:45] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2024-05-22 02:48:45] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 2 ms to minimize.
[2024-05-22 02:48:45] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2024-05-22 02:48:46] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-22 02:48:46] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 2 ms to minimize.
[2024-05-22 02:48:46] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
[2024-05-22 02:48:46] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
[2024-05-22 02:48:46] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 2 ms to minimize.
[2024-05-22 02:48:46] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-05-22 02:48:46] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-05-22 02:48:47] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-05-22 02:48:47] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-05-22 02:48:47] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-05-22 02:48:47] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-05-22 02:48:47] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-05-22 02:48:47] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
[2024-05-22 02:48:47] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-05-22 02:48:47] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2024-05-22 02:48:48] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 2 ms to minimize.
[2024-05-22 02:48:48] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
[2024-05-22 02:48:48] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-05-22 02:48:48] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 2 ms to minimize.
[2024-05-22 02:48:48] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-05-22 02:48:49] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-22 02:48:50] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 2 ms to minimize.
[2024-05-22 02:48:50] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
[2024-05-22 02:48:51] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 2 ms to minimize.
[2024-05-22 02:48:51] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-22 02:48:52] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-05-22 02:48:52] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2024-05-22 02:48:52] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-22 02:48:53] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
[2024-05-22 02:48:54] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 2 ms to minimize.
[2024-05-22 02:48:54] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
[2024-05-22 02:48:54] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (OVERLAPS) 260/438 variables, 178/238 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-22 02:48:58] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-22 02:48:58] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 2 ms to minimize.
[2024-05-22 02:48:58] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2024-05-22 02:48:58] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-05-22 02:48:59] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 1 ms to minimize.
[2024-05-22 02:48:59] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 6/244 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-22 02:49:03] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/438 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 12 (OVERLAPS) 0/438 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 245 constraints, problems are : Problem set: 0 solved, 259 unsolved in 29554 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 58/67 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (OVERLAPS) 260/438 variables, 178/245 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 259/504 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-22 02:49:20] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-22 02:49:32] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/438 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/438 variables, and 506 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 60/60 constraints]
After SMT, in 59696ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 59699ms
Starting structural reductions in LTL mode, iteration 1 : 178/185 places, 260/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59980 ms. Remains : 178/185 places, 260/267 transitions.
Stuttering acceptance computed with spot in 564 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), false, (AND p1 (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), false, (AND p1 (NOT p2) (NOT p3)), false, (AND p1 (NOT p2)), (AND p1 p2), p1]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-12
Stuttering criterion allowed to conclude after 116 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-12 finished in 60587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 267/267 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 179 transition count 261
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 179 transition count 261
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 178 transition count 260
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 178 transition count 260
Applied a total of 14 rules in 4 ms. Remains 178 /185 variables (removed 7) and now considering 260/267 (removed 7) transitions.
[2024-05-22 02:49:41] [INFO ] Invariant cache hit.
[2024-05-22 02:49:41] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-22 02:49:41] [INFO ] Invariant cache hit.
[2024-05-22 02:49:41] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2024-05-22 02:49:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-22 02:49:45] [INFO ] Deduced a trap composed of 16 places in 209 ms of which 3 ms to minimize.
[2024-05-22 02:49:45] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 3 ms to minimize.
[2024-05-22 02:49:46] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 2 ms to minimize.
[2024-05-22 02:49:46] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 4 ms to minimize.
[2024-05-22 02:49:46] [INFO ] Deduced a trap composed of 22 places in 188 ms of which 3 ms to minimize.
[2024-05-22 02:49:46] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 3 ms to minimize.
[2024-05-22 02:49:46] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 3 ms to minimize.
[2024-05-22 02:49:47] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 3 ms to minimize.
[2024-05-22 02:49:47] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 4 ms to minimize.
[2024-05-22 02:49:47] [INFO ] Deduced a trap composed of 28 places in 182 ms of which 3 ms to minimize.
[2024-05-22 02:49:47] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 2 ms to minimize.
[2024-05-22 02:49:47] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 3 ms to minimize.
[2024-05-22 02:49:48] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 2 ms to minimize.
[2024-05-22 02:49:48] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 3 ms to minimize.
[2024-05-22 02:49:48] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 3 ms to minimize.
[2024-05-22 02:49:48] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 3 ms to minimize.
[2024-05-22 02:49:48] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
[2024-05-22 02:49:48] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 2 ms to minimize.
[2024-05-22 02:49:49] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 2 ms to minimize.
[2024-05-22 02:49:49] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-22 02:49:49] [INFO ] Deduced a trap composed of 33 places in 171 ms of which 3 ms to minimize.
[2024-05-22 02:49:50] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 3 ms to minimize.
[2024-05-22 02:49:50] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 2 ms to minimize.
[2024-05-22 02:49:50] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 4 ms to minimize.
[2024-05-22 02:49:50] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 3 ms to minimize.
[2024-05-22 02:49:50] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 3 ms to minimize.
[2024-05-22 02:49:50] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 3 ms to minimize.
[2024-05-22 02:49:51] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 3 ms to minimize.
[2024-05-22 02:49:51] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 3 ms to minimize.
[2024-05-22 02:49:51] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 2 ms to minimize.
[2024-05-22 02:49:51] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 3 ms to minimize.
[2024-05-22 02:49:51] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 3 ms to minimize.
[2024-05-22 02:49:52] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 2 ms to minimize.
[2024-05-22 02:49:52] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 3 ms to minimize.
[2024-05-22 02:49:52] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-05-22 02:49:53] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2024-05-22 02:49:53] [INFO ] Deduced a trap composed of 14 places in 189 ms of which 3 ms to minimize.
[2024-05-22 02:49:53] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 3 ms to minimize.
[2024-05-22 02:49:53] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 3 ms to minimize.
[2024-05-22 02:49:54] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-22 02:49:56] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 2 ms to minimize.
[2024-05-22 02:49:56] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 3 ms to minimize.
[2024-05-22 02:49:57] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-05-22 02:49:57] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-22 02:49:59] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 3 ms to minimize.
[2024-05-22 02:50:00] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 3 ms to minimize.
[2024-05-22 02:50:00] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-22 02:50:01] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2024-05-22 02:50:02] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 3 ms to minimize.
[2024-05-22 02:50:02] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 3 ms to minimize.
[2024-05-22 02:50:02] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (OVERLAPS) 260/438 variables, 178/238 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-22 02:50:07] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 3 ms to minimize.
[2024-05-22 02:50:07] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 3 ms to minimize.
[2024-05-22 02:50:07] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 3 ms to minimize.
[2024-05-22 02:50:07] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 3 ms to minimize.
[2024-05-22 02:50:09] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 2 ms to minimize.
[2024-05-22 02:50:09] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 6/244 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/438 variables, and 244 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 57/57 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 57/66 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-22 02:50:15] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 260/438 variables, 178/245 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 259/504 constraints. Problems are: Problem set: 0 solved, 259 unsolved
[2024-05-22 02:50:24] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (OVERLAPS) 0/438 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 259 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 505 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 59/59 constraints]
After SMT, in 60175ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 60178ms
Starting structural reductions in LTL mode, iteration 1 : 178/185 places, 260/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60496 ms. Remains : 178/185 places, 260/267 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-14 finished in 60637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(p1)))))'
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 267/267 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 180 transition count 262
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 180 transition count 262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 179 transition count 261
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 179 transition count 261
Applied a total of 12 rules in 4 ms. Remains 179 /185 variables (removed 6) and now considering 261/267 (removed 6) transitions.
// Phase 1: matrix 261 rows 179 cols
[2024-05-22 02:50:42] [INFO ] Computed 9 invariants in 1 ms
[2024-05-22 02:50:42] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-22 02:50:42] [INFO ] Invariant cache hit.
[2024-05-22 02:50:42] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2024-05-22 02:50:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:50:46] [INFO ] Deduced a trap composed of 31 places in 264 ms of which 3 ms to minimize.
[2024-05-22 02:50:46] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 3 ms to minimize.
[2024-05-22 02:50:46] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 3 ms to minimize.
[2024-05-22 02:50:46] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-22 02:50:46] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 3 ms to minimize.
[2024-05-22 02:50:47] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 2 ms to minimize.
[2024-05-22 02:50:47] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 3 ms to minimize.
[2024-05-22 02:50:47] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 3 ms to minimize.
[2024-05-22 02:50:47] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 3 ms to minimize.
[2024-05-22 02:50:47] [INFO ] Deduced a trap composed of 49 places in 158 ms of which 3 ms to minimize.
[2024-05-22 02:50:47] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 3 ms to minimize.
[2024-05-22 02:50:48] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 2 ms to minimize.
[2024-05-22 02:50:48] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 3 ms to minimize.
[2024-05-22 02:50:48] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 3 ms to minimize.
[2024-05-22 02:50:48] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 3 ms to minimize.
[2024-05-22 02:50:48] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 2 ms to minimize.
[2024-05-22 02:50:49] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 3 ms to minimize.
[2024-05-22 02:50:49] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 3 ms to minimize.
[2024-05-22 02:50:49] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
[2024-05-22 02:50:49] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:50:50] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-05-22 02:50:50] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2024-05-22 02:50:50] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 3 ms to minimize.
[2024-05-22 02:50:50] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 2 ms to minimize.
[2024-05-22 02:50:50] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2024-05-22 02:50:51] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
[2024-05-22 02:50:51] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 2 ms to minimize.
[2024-05-22 02:50:51] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 2 ms to minimize.
[2024-05-22 02:50:51] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2024-05-22 02:50:51] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 2 ms to minimize.
[2024-05-22 02:50:52] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-05-22 02:50:52] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
[2024-05-22 02:50:52] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
[2024-05-22 02:50:52] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 14/43 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:50:55] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 4 ms to minimize.
[2024-05-22 02:50:55] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 3 ms to minimize.
[2024-05-22 02:50:55] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 3 ms to minimize.
[2024-05-22 02:50:55] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 3 ms to minimize.
[2024-05-22 02:50:56] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 3 ms to minimize.
[2024-05-22 02:50:56] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 3 ms to minimize.
[2024-05-22 02:50:56] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 3 ms to minimize.
[2024-05-22 02:50:57] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:50:58] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 2 ms to minimize.
[2024-05-22 02:50:59] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 3 ms to minimize.
[2024-05-22 02:50:59] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 261/440 variables, 179/233 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:51:05] [INFO ] Deduced a trap composed of 51 places in 140 ms of which 3 ms to minimize.
[2024-05-22 02:51:05] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 2 ms to minimize.
[2024-05-22 02:51:05] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 2 ms to minimize.
[2024-05-22 02:51:06] [INFO ] Deduced a trap composed of 51 places in 98 ms of which 2 ms to minimize.
[2024-05-22 02:51:06] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-05-22 02:51:07] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 2 ms to minimize.
[2024-05-22 02:51:07] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 7/240 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:51:10] [INFO ] Deduced a trap composed of 53 places in 152 ms of which 3 ms to minimize.
[2024-05-22 02:51:10] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 440/440 variables, and 242 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 260 unsolved
[2024-05-22 02:51:15] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-22 02:51:15] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 3 ms to minimize.
[2024-05-22 02:51:15] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/440 variables, 179/245 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 260/505 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 0/440 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 505 constraints, problems are : Problem set: 0 solved, 260 unsolved in 25083 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 57/57 constraints]
After SMT, in 55242ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 55245ms
Starting structural reductions in LTL mode, iteration 1 : 179/185 places, 261/267 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55533 ms. Remains : 179/185 places, 261/267 transitions.
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-04b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04b-LTLFireability-15 finished in 55751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2024-05-22 02:51:38] [INFO ] Flatten gal took : 39 ms
[2024-05-22 02:51:38] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-22 02:51:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 185 places, 267 transitions and 1070 arcs took 13 ms.
Total runtime 447268 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutonomousCar-PT-04b

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 2466
MODEL NAME: /home/mcc/execution/412/model
185 places, 267 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA AutonomousCar-PT-04b-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716346299893

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is AutonomousCar-PT-04b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r025-smll-171620166300276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-04b.tgz
mv AutonomousCar-PT-04b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;