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-171620166300292.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-05b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166300292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 18:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 18:09 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 159K 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-05b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-05b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716346875059

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-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 03:01:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 03:01:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 03:01:18] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2024-05-22 03:01:18] [INFO ] Transformed 255 places.
[2024-05-22 03:01:18] [INFO ] Transformed 490 transitions.
[2024-05-22 03:01:18] [INFO ] Found NUPN structural information;
[2024-05-22 03:01:18] [INFO ] Parsed PT model containing 255 places and 490 transitions and 2527 arcs in 493 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA AutonomousCar-PT-05b-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 490/490 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 222 transition count 457
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 222 transition count 457
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 166 place count 222 transition count 357
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 171 place count 217 transition count 352
Iterating global reduction 1 with 5 rules applied. Total rules applied 176 place count 217 transition count 352
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 177 place count 216 transition count 351
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 216 transition count 351
Applied a total of 178 rules in 155 ms. Remains 216 /255 variables (removed 39) and now considering 351/490 (removed 139) transitions.
// Phase 1: matrix 351 rows 216 cols
[2024-05-22 03:01:19] [INFO ] Computed 10 invariants in 52 ms
[2024-05-22 03:01:19] [INFO ] Implicit Places using invariants in 499 ms returned []
[2024-05-22 03:01:19] [INFO ] Invariant cache hit.
[2024-05-22 03:01:19] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 1055 ms to find 0 implicit places.
Running 350 sub problems to find dead transitions.
[2024-05-22 03:01:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 350 unsolved
[2024-05-22 03:01:27] [INFO ] Deduced a trap composed of 18 places in 349 ms of which 51 ms to minimize.
[2024-05-22 03:01:27] [INFO ] Deduced a trap composed of 18 places in 345 ms of which 5 ms to minimize.
[2024-05-22 03:01:27] [INFO ] Deduced a trap composed of 49 places in 226 ms of which 4 ms to minimize.
[2024-05-22 03:01:28] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 4 ms to minimize.
[2024-05-22 03:01:28] [INFO ] Deduced a trap composed of 52 places in 151 ms of which 3 ms to minimize.
[2024-05-22 03:01:28] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 3 ms to minimize.
[2024-05-22 03:01:28] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 3 ms to minimize.
[2024-05-22 03:01:29] [INFO ] Deduced a trap composed of 51 places in 137 ms of which 3 ms to minimize.
[2024-05-22 03:01:29] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 2 ms to minimize.
[2024-05-22 03:01:29] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 3 ms to minimize.
[2024-05-22 03:01:29] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 3 ms to minimize.
[2024-05-22 03:01:29] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 3 ms to minimize.
[2024-05-22 03:01:29] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 2 ms to minimize.
[2024-05-22 03:01:30] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2024-05-22 03:01:30] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 3 ms to minimize.
[2024-05-22 03:01:30] [INFO ] Deduced a trap composed of 53 places in 165 ms of which 3 ms to minimize.
[2024-05-22 03:01:30] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 2 ms to minimize.
[2024-05-22 03:01:30] [INFO ] Deduced a trap composed of 45 places in 179 ms of which 3 ms to minimize.
[2024-05-22 03:01:31] [INFO ] Deduced a trap composed of 40 places in 190 ms of which 3 ms to minimize.
[2024-05-22 03:01:31] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 350 unsolved
[2024-05-22 03:01:31] [INFO ] Deduced a trap composed of 56 places in 297 ms of which 3 ms to minimize.
[2024-05-22 03:01:32] [INFO ] Deduced a trap composed of 24 places in 242 ms of which 4 ms to minimize.
[2024-05-22 03:01:32] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 4 ms to minimize.
[2024-05-22 03:01:32] [INFO ] Deduced a trap composed of 54 places in 227 ms of which 4 ms to minimize.
[2024-05-22 03:01:32] [INFO ] Deduced a trap composed of 35 places in 189 ms of which 3 ms to minimize.
[2024-05-22 03:01:33] [INFO ] Deduced a trap composed of 39 places in 242 ms of which 4 ms to minimize.
[2024-05-22 03:01:33] [INFO ] Deduced a trap composed of 27 places in 227 ms of which 3 ms to minimize.
[2024-05-22 03:01:33] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 2 ms to minimize.
[2024-05-22 03:01:34] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 5 ms to minimize.
[2024-05-22 03:01:34] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 2 ms to minimize.
[2024-05-22 03:01:34] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 2 ms to minimize.
[2024-05-22 03:01:34] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 3 ms to minimize.
[2024-05-22 03:01:34] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 4 ms to minimize.
[2024-05-22 03:01:34] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 3 ms to minimize.
[2024-05-22 03:01:35] [INFO ] Deduced a trap composed of 32 places in 233 ms of which 4 ms to minimize.
[2024-05-22 03:01:35] [INFO ] Deduced a trap composed of 32 places in 218 ms of which 4 ms to minimize.
[2024-05-22 03:01:35] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 3 ms to minimize.
[2024-05-22 03:01:36] [INFO ] Deduced a trap composed of 40 places in 226 ms of which 4 ms to minimize.
[2024-05-22 03:01:36] [INFO ] Deduced a trap composed of 42 places in 211 ms of which 3 ms to minimize.
[2024-05-22 03:01:36] [INFO ] Deduced a trap composed of 37 places in 228 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 350 unsolved
[2024-05-22 03:01:39] [INFO ] Deduced a trap composed of 41 places in 215 ms of which 4 ms to minimize.
[2024-05-22 03:01:40] [INFO ] Deduced a trap composed of 35 places in 217 ms of which 3 ms to minimize.
[2024-05-22 03:01:40] [INFO ] Deduced a trap composed of 36 places in 184 ms of which 4 ms to minimize.
[2024-05-22 03:01:40] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 3 ms to minimize.
[2024-05-22 03:01:41] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 3 ms to minimize.
[2024-05-22 03:01:41] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 2 ms to minimize.
[2024-05-22 03:01:41] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 3 ms to minimize.
[2024-05-22 03:01:41] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 4 ms to minimize.
[2024-05-22 03:01:42] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 2 ms to minimize.
[2024-05-22 03:01:42] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 2 ms to minimize.
[2024-05-22 03:01:42] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 3 ms to minimize.
[2024-05-22 03:01:43] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 3 ms to minimize.
[2024-05-22 03:01:43] [INFO ] Deduced a trap composed of 35 places in 224 ms of which 3 ms to minimize.
[2024-05-22 03:01:43] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 3 ms to minimize.
[2024-05-22 03:01:44] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 350 unsolved
[2024-05-22 03:01:46] [INFO ] Deduced a trap composed of 42 places in 230 ms of which 4 ms to minimize.
[2024-05-22 03:01:47] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 6 ms to minimize.
[2024-05-22 03:01:47] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 2 ms to minimize.
[2024-05-22 03:01:47] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 2 ms to minimize.
[2024-05-22 03:01:48] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 3 ms to minimize.
[2024-05-22 03:01:48] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 2 ms to minimize.
[2024-05-22 03:01:48] [INFO ] Deduced a trap composed of 33 places in 200 ms of which 3 ms to minimize.
[2024-05-22 03:01:48] [INFO ] Deduced a trap composed of 32 places in 195 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 350 unsolved
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 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 216/567 variables, and 73 constraints, problems are : Problem set: 0 solved, 350 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/216 constraints, PredecessorRefiner: 350/350 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 0 solved, 350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 63/73 constraints. Problems are: Problem set: 0 solved, 350 unsolved
[2024-05-22 03:01:56] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 350 unsolved
[2024-05-22 03:01:59] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 350 unsolved
[2024-05-22 03:02:03] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-05-22 03:02:03] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 350 unsolved
[2024-05-22 03:02:06] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 350 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 350 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD309 is UNSAT
At refinement iteration 8 (OVERLAPS) 351/567 variables, 216/294 constraints. Problems are: Problem set: 2 solved, 348 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 348/642 constraints. Problems are: Problem set: 2 solved, 348 unsolved
[2024-05-22 03:02:20] [INFO ] Deduced a trap composed of 39 places in 234 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/567 variables, and 643 constraints, problems are : Problem set: 2 solved, 348 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 348/350 constraints, Known Traps: 69/69 constraints]
After SMT, in 61173ms problems are : Problem set: 2 solved, 348 unsolved
Search for dead transitions found 2 dead transitions in 61238ms
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 : 216/255 places, 349/490 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 349
Applied a total of 1 rules in 17 ms. Remains 215 /216 variables (removed 1) and now considering 349/349 (removed 0) transitions.
// Phase 1: matrix 349 rows 215 cols
[2024-05-22 03:02:21] [INFO ] Computed 10 invariants in 7 ms
[2024-05-22 03:02:21] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-22 03:02:21] [INFO ] Invariant cache hit.
[2024-05-22 03:02:21] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 215/255 places, 349/490 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63016 ms. Remains : 215/255 places, 349/490 transitions.
Support contains 38 out of 215 places after structural reductions.
[2024-05-22 03:02:22] [INFO ] Flatten gal took : 93 ms
[2024-05-22 03:02:22] [INFO ] Flatten gal took : 40 ms
[2024-05-22 03:02:22] [INFO ] Input system was already deterministic with 349 transitions.
Reduction of identical properties reduced properties to check from 33 to 32
RANDOM walk for 40000 steps (66 resets) in 2197 ms. (18 steps per ms) remains 8/32 properties
BEST_FIRST walk for 40004 steps (89 resets) in 367 ms. (108 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40003 steps (90 resets) in 193 ms. (206 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40001 steps (79 resets) in 344 ms. (115 steps per ms) remains 2/5 properties
[2024-05-22 03:02:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 119/129 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/215 variables, 4/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 349/564 variables, 215/225 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/564 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 225 constraints, problems are : Problem set: 1 solved, 1 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Int declared 79/564 variables, and 4 constraints, problems are : Problem set: 2 solved, 0 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 4/10 constraints, State Equation: 0/215 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 373ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA AutonomousCar-PT-05b-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 39 stabilizing places and 39 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((F(p0)&&X(p1)))&&X(X(F(p2)))))'
Support contains 5 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 349/349 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 208 transition count 342
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 208 transition count 342
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 206 transition count 340
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 206 transition count 340
Applied a total of 18 rules in 24 ms. Remains 206 /215 variables (removed 9) and now considering 340/349 (removed 9) transitions.
// Phase 1: matrix 340 rows 206 cols
[2024-05-22 03:02:24] [INFO ] Computed 10 invariants in 4 ms
[2024-05-22 03:02:24] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-22 03:02:24] [INFO ] Invariant cache hit.
[2024-05-22 03:02:24] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2024-05-22 03:02:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 03:02:30] [INFO ] Deduced a trap composed of 51 places in 273 ms of which 4 ms to minimize.
[2024-05-22 03:02:30] [INFO ] Deduced a trap composed of 31 places in 253 ms of which 4 ms to minimize.
[2024-05-22 03:02:31] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 3 ms to minimize.
[2024-05-22 03:02:31] [INFO ] Deduced a trap composed of 24 places in 225 ms of which 4 ms to minimize.
[2024-05-22 03:02:31] [INFO ] Deduced a trap composed of 38 places in 197 ms of which 4 ms to minimize.
[2024-05-22 03:02:32] [INFO ] Deduced a trap composed of 14 places in 216 ms of which 3 ms to minimize.
[2024-05-22 03:02:32] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 4 ms to minimize.
[2024-05-22 03:02:32] [INFO ] Deduced a trap composed of 33 places in 220 ms of which 4 ms to minimize.
[2024-05-22 03:02:32] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 3 ms to minimize.
[2024-05-22 03:02:33] [INFO ] Deduced a trap composed of 36 places in 201 ms of which 3 ms to minimize.
[2024-05-22 03:02:33] [INFO ] Deduced a trap composed of 29 places in 203 ms of which 3 ms to minimize.
[2024-05-22 03:02:33] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 3 ms to minimize.
[2024-05-22 03:02:33] [INFO ] Deduced a trap composed of 36 places in 247 ms of which 4 ms to minimize.
[2024-05-22 03:02:34] [INFO ] Deduced a trap composed of 31 places in 199 ms of which 4 ms to minimize.
[2024-05-22 03:02:34] [INFO ] Deduced a trap composed of 43 places in 194 ms of which 3 ms to minimize.
[2024-05-22 03:02:34] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 3 ms to minimize.
[2024-05-22 03:02:34] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 3 ms to minimize.
[2024-05-22 03:02:34] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 3 ms to minimize.
[2024-05-22 03:02:35] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 3 ms to minimize.
[2024-05-22 03:02:35] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 03:02:35] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 2 ms to minimize.
[2024-05-22 03:02:36] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 3 ms to minimize.
[2024-05-22 03:02:36] [INFO ] Deduced a trap composed of 18 places in 194 ms of which 3 ms to minimize.
[2024-05-22 03:02:36] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 3 ms to minimize.
[2024-05-22 03:02:37] [INFO ] Deduced a trap composed of 33 places in 223 ms of which 3 ms to minimize.
[2024-05-22 03:02:37] [INFO ] Deduced a trap composed of 42 places in 239 ms of which 4 ms to minimize.
[2024-05-22 03:02:37] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 3 ms to minimize.
[2024-05-22 03:02:37] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 2 ms to minimize.
[2024-05-22 03:02:38] [INFO ] Deduced a trap composed of 56 places in 178 ms of which 2 ms to minimize.
[2024-05-22 03:02:38] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 2 ms to minimize.
[2024-05-22 03:02:38] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 3 ms to minimize.
[2024-05-22 03:02:38] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 2 ms to minimize.
[2024-05-22 03:02:39] [INFO ] Deduced a trap composed of 20 places in 223 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 03:02:43] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-22 03:02:44] [INFO ] Deduced a trap composed of 56 places in 195 ms of which 3 ms to minimize.
[2024-05-22 03:02:44] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 3 ms to minimize.
[2024-05-22 03:02:45] [INFO ] Deduced a trap composed of 36 places in 196 ms of which 3 ms to minimize.
[2024-05-22 03:02:45] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 3 ms to minimize.
[2024-05-22 03:02:45] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2024-05-22 03:02:45] [INFO ] Deduced a trap composed of 39 places in 193 ms of which 3 ms to minimize.
[2024-05-22 03:02:46] [INFO ] Deduced a trap composed of 38 places in 215 ms of which 3 ms to minimize.
[2024-05-22 03:02:46] [INFO ] Deduced a trap composed of 14 places in 206 ms of which 3 ms to minimize.
[2024-05-22 03:02:46] [INFO ] Deduced a trap composed of 53 places in 158 ms of which 3 ms to minimize.
[2024-05-22 03:02:46] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 03:02:49] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2024-05-22 03:02:50] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 03:02:52] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 3 ms to minimize.
[2024-05-22 03:02:53] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
[2024-05-22 03:02:53] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
[2024-05-22 03:02:53] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 206/546 variables, and 60 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/206 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 03:02:59] [INFO ] Deduced a trap composed of 49 places in 215 ms of which 4 ms to minimize.
[2024-05-22 03:02:59] [INFO ] Deduced a trap composed of 37 places in 199 ms of which 3 ms to minimize.
[2024-05-22 03:03:00] [INFO ] Deduced a trap composed of 36 places in 204 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 03:03:03] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 3 ms to minimize.
[2024-05-22 03:03:03] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 3 ms to minimize.
[2024-05-22 03:03:04] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 03:03:07] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2024-05-22 03:03:07] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 03:03:10] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 3 ms to minimize.
[2024-05-22 03:03:10] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 2 ms to minimize.
[2024-05-22 03:03:11] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 8 (OVERLAPS) 340/546 variables, 206/277 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 339/616 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/546 variables, and 616 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 61/61 constraints]
After SMT, in 60718ms problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 60728ms
Starting structural reductions in LTL mode, iteration 1 : 206/215 places, 340/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61288 ms. Remains : 206/215 places, 340/349 transitions.
Stuttering acceptance computed with spot in 579 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-00
Stuttering criterion allowed to conclude after 79 steps with 0 reset in 5 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-00 finished in 61998 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(p0))&&F(!p0))||G(F(p0))))'
Support contains 1 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 349/349 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 209 transition count 343
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 209 transition count 343
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 208 transition count 342
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 208 transition count 342
Applied a total of 14 rules in 20 ms. Remains 208 /215 variables (removed 7) and now considering 342/349 (removed 7) transitions.
// Phase 1: matrix 342 rows 208 cols
[2024-05-22 03:03:26] [INFO ] Computed 10 invariants in 5 ms
[2024-05-22 03:03:26] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-22 03:03:26] [INFO ] Invariant cache hit.
[2024-05-22 03:03:26] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Running 341 sub problems to find dead transitions.
[2024-05-22 03:03:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 03:03:32] [INFO ] Deduced a trap composed of 24 places in 253 ms of which 4 ms to minimize.
[2024-05-22 03:03:33] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 3 ms to minimize.
[2024-05-22 03:03:33] [INFO ] Deduced a trap composed of 20 places in 228 ms of which 3 ms to minimize.
[2024-05-22 03:03:33] [INFO ] Deduced a trap composed of 57 places in 208 ms of which 3 ms to minimize.
[2024-05-22 03:03:33] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-05-22 03:03:33] [INFO ] Deduced a trap composed of 50 places in 213 ms of which 3 ms to minimize.
[2024-05-22 03:03:34] [INFO ] Deduced a trap composed of 38 places in 189 ms of which 3 ms to minimize.
[2024-05-22 03:03:34] [INFO ] Deduced a trap composed of 38 places in 238 ms of which 3 ms to minimize.
[2024-05-22 03:03:34] [INFO ] Deduced a trap composed of 39 places in 212 ms of which 3 ms to minimize.
[2024-05-22 03:03:34] [INFO ] Deduced a trap composed of 34 places in 210 ms of which 3 ms to minimize.
[2024-05-22 03:03:35] [INFO ] Deduced a trap composed of 31 places in 222 ms of which 4 ms to minimize.
[2024-05-22 03:03:35] [INFO ] Deduced a trap composed of 31 places in 218 ms of which 8 ms to minimize.
[2024-05-22 03:03:35] [INFO ] Deduced a trap composed of 32 places in 212 ms of which 3 ms to minimize.
[2024-05-22 03:03:35] [INFO ] Deduced a trap composed of 36 places in 218 ms of which 3 ms to minimize.
[2024-05-22 03:03:36] [INFO ] Deduced a trap composed of 36 places in 214 ms of which 3 ms to minimize.
[2024-05-22 03:03:36] [INFO ] Deduced a trap composed of 41 places in 215 ms of which 4 ms to minimize.
[2024-05-22 03:03:36] [INFO ] Deduced a trap composed of 42 places in 220 ms of which 4 ms to minimize.
[2024-05-22 03:03:36] [INFO ] Deduced a trap composed of 25 places in 221 ms of which 4 ms to minimize.
[2024-05-22 03:03:36] [INFO ] Deduced a trap composed of 31 places in 203 ms of which 3 ms to minimize.
[2024-05-22 03:03:37] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 03:03:37] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 3 ms to minimize.
[2024-05-22 03:03:38] [INFO ] Deduced a trap composed of 23 places in 232 ms of which 3 ms to minimize.
[2024-05-22 03:03:38] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 3 ms to minimize.
[2024-05-22 03:03:38] [INFO ] Deduced a trap composed of 46 places in 211 ms of which 4 ms to minimize.
[2024-05-22 03:03:38] [INFO ] Deduced a trap composed of 36 places in 200 ms of which 3 ms to minimize.
[2024-05-22 03:03:38] [INFO ] Deduced a trap composed of 45 places in 216 ms of which 3 ms to minimize.
[2024-05-22 03:03:39] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 3 ms to minimize.
[2024-05-22 03:03:39] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 3 ms to minimize.
[2024-05-22 03:03:39] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 3 ms to minimize.
[2024-05-22 03:03:40] [INFO ] Deduced a trap composed of 36 places in 203 ms of which 4 ms to minimize.
[2024-05-22 03:03:40] [INFO ] Deduced a trap composed of 39 places in 211 ms of which 4 ms to minimize.
[2024-05-22 03:03:41] [INFO ] Deduced a trap composed of 36 places in 195 ms of which 3 ms to minimize.
[2024-05-22 03:03:41] [INFO ] Deduced a trap composed of 31 places in 202 ms of which 3 ms to minimize.
[2024-05-22 03:03:41] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 4 ms to minimize.
[2024-05-22 03:03:41] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 2 ms to minimize.
[2024-05-22 03:03:42] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 3 ms to minimize.
[2024-05-22 03:03:42] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 3 ms to minimize.
[2024-05-22 03:03:42] [INFO ] Deduced a trap composed of 40 places in 206 ms of which 4 ms to minimize.
[2024-05-22 03:03:42] [INFO ] Deduced a trap composed of 46 places in 192 ms of which 4 ms to minimize.
[2024-05-22 03:03:43] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 03:03:45] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
[2024-05-22 03:03:46] [INFO ] Deduced a trap composed of 38 places in 201 ms of which 3 ms to minimize.
[2024-05-22 03:03:46] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 3 ms to minimize.
[2024-05-22 03:03:46] [INFO ] Deduced a trap composed of 37 places in 195 ms of which 3 ms to minimize.
[2024-05-22 03:03:47] [INFO ] Deduced a trap composed of 53 places in 197 ms of which 3 ms to minimize.
[2024-05-22 03:03:47] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 3 ms to minimize.
[2024-05-22 03:03:47] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 3 ms to minimize.
[2024-05-22 03:03:47] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
[2024-05-22 03:03:47] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-05-22 03:03:48] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 2 ms to minimize.
[2024-05-22 03:03:48] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 2 ms to minimize.
[2024-05-22 03:03:48] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 2 ms to minimize.
[2024-05-22 03:03:49] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 03:03:51] [INFO ] Deduced a trap composed of 33 places in 171 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 03:03:55] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 208/550 variables, and 65 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/208 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 341 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 55/65 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 03:03:59] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 3 ms to minimize.
[2024-05-22 03:04:00] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (OVERLAPS) 342/550 variables, 208/275 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 341/616 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 03:04:10] [INFO ] Deduced a trap composed of 54 places in 152 ms of which 2 ms to minimize.
[2024-05-22 03:04:12] [INFO ] Deduced a trap composed of 32 places in 227 ms of which 4 ms to minimize.
[2024-05-22 03:04:13] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 3 ms to minimize.
[2024-05-22 03:04:14] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 3 ms to minimize.
[2024-05-22 03:04:14] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 5/621 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 621 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 62/62 constraints]
After SMT, in 60560ms problems are : Problem set: 0 solved, 341 unsolved
Search for dead transitions found 0 dead transitions in 60567ms
Starting structural reductions in LTL mode, iteration 1 : 208/215 places, 342/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61122 ms. Remains : 208/215 places, 342/349 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-02
Stuttering criterion allowed to conclude after 78 steps with 0 reset in 3 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-02 finished in 61254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p1&&G(p2))))))'
Support contains 5 out of 215 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 215/215 places, 349/349 transitions.
Graph (trivial) has 200 edges and 215 vertex of which 4 / 215 are part of one of the 2 SCC in 8 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 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 212 transition count 261
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 116 rules applied. Total rules applied 202 place count 127 transition count 230
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 220 place count 109 transition count 230
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 220 place count 109 transition count 224
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 232 place count 103 transition count 224
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 237 place count 98 transition count 219
Iterating global reduction 3 with 5 rules applied. Total rules applied 242 place count 98 transition count 219
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 245 place count 95 transition count 208
Iterating global reduction 3 with 3 rules applied. Total rules applied 248 place count 95 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 252 place count 95 transition count 204
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 254 place count 93 transition count 204
Performed 39 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 332 place count 54 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 333 place count 54 transition count 163
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 339 place count 48 transition count 129
Iterating global reduction 6 with 6 rules applied. Total rules applied 345 place count 48 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 347 place count 48 transition count 127
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 7 with 2 rules applied. Total rules applied 349 place count 47 transition count 126
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 350 place count 47 transition count 126
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 352 place count 45 transition count 124
Applied a total of 352 rules in 166 ms. Remains 45 /215 variables (removed 170) and now considering 124/349 (removed 225) transitions.
// Phase 1: matrix 124 rows 45 cols
[2024-05-22 03:04:27] [INFO ] Computed 9 invariants in 1 ms
[2024-05-22 03:04:27] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-22 03:04:27] [INFO ] Invariant cache hit.
[2024-05-22 03:04:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 03:04:28] [INFO ] Implicit Places using invariants and state equation in 142 ms returned [41, 44]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 321 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/215 places, 124/349 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 41 transition count 122
Applied a total of 4 rules in 10 ms. Remains 41 /43 variables (removed 2) and now considering 122/124 (removed 2) transitions.
// Phase 1: matrix 122 rows 41 cols
[2024-05-22 03:04:28] [INFO ] Computed 7 invariants in 3 ms
[2024-05-22 03:04:28] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-22 03:04:28] [INFO ] Invariant cache hit.
[2024-05-22 03:04:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:04:28] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/215 places, 122/349 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 701 ms. Remains : 41/215 places, 122/349 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-04
Product exploration explored 100000 steps with 42 reset in 352 ms.
Product exploration explored 100000 steps with 47 reset in 389 ms.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 203 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (2363 resets) in 2349 ms. (17 steps per ms) remains 2/12 properties
BEST_FIRST walk for 40003 steps (322 resets) in 319 ms. (125 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (301 resets) in 602 ms. (66 steps per ms) remains 2/2 properties
[2024-05-22 03:04:30] [INFO ] Invariant cache hit.
[2024-05-22 03:04:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 109/132 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 30/162 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/163 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 49 constraints, problems are : Problem set: 0 solved, 2 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 109/132 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 30/162 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/163 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/163 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 51 constraints, problems are : Problem set: 0 solved, 2 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 352ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 124 ms.
Support contains 5 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 122/122 transitions.
Graph (complete) has 337 edges and 41 vertex of which 40 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 40 transition count 120
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 9 place count 40 transition count 113
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 33 transition count 113
Applied a total of 16 rules in 19 ms. Remains 33 /41 variables (removed 8) and now considering 113/122 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 33/41 places, 113/122 transitions.
RANDOM walk for 36393 steps (922 resets) in 453 ms. (80 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (OR p0 p2) (OR p0 p1)))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 p2))), (F p1), (F (NOT p0))]
Knowledge based reduction with 19 factoid took 672 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 122/122 transitions.
Applied a total of 0 rules in 8 ms. Remains 41 /41 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2024-05-22 03:04:32] [INFO ] Invariant cache hit.
[2024-05-22 03:04:32] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-22 03:04:32] [INFO ] Invariant cache hit.
[2024-05-22 03:04:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:04:32] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2024-05-22 03:04:32] [INFO ] Redundant transitions in 24 ms returned []
Running 120 sub problems to find dead transitions.
[2024-05-22 03:04:32] [INFO ] Invariant cache hit.
[2024-05-22 03:04:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/162 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 1/163 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/163 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 49 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/162 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 120/168 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 1/163 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/163 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 169 constraints, problems are : Problem set: 0 solved, 120 unsolved in 7889 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 12228ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 12231ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12492 ms. Remains : 41/41 places, 122/122 transitions.
Computed a total of 2 stabilizing places and 3 stable transitions
Computed a total of 2 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (NOT (AND (NOT p0) p2 p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 144 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (2364 resets) in 574 ms. (69 steps per ms) remains 6/12 properties
BEST_FIRST walk for 40004 steps (326 resets) in 65 ms. (606 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (311 resets) in 593 ms. (67 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40003 steps (302 resets) in 295 ms. (135 steps per ms) remains 2/2 properties
[2024-05-22 03:04:45] [INFO ] Invariant cache hit.
[2024-05-22 03:04:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 109/132 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 30/162 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/163 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 49 constraints, problems are : Problem set: 0 solved, 2 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 109/132 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 30/162 variables, 18/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/163 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/163 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 51 constraints, problems are : Problem set: 0 solved, 2 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 529ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 197 ms.
Support contains 5 out of 41 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 41/41 places, 122/122 transitions.
Graph (complete) has 337 edges and 41 vertex of which 40 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 40 transition count 120
Free-agglomeration rule applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 9 place count 40 transition count 113
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 33 transition count 113
Applied a total of 16 rules in 21 ms. Remains 33 /41 variables (removed 8) and now considering 113/122 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 33/41 places, 113/122 transitions.
RANDOM walk for 40000 steps (969 resets) in 421 ms. (94 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (109 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (108 resets) in 190 ms. (209 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 152411 steps, run visited all 2 properties in 1028 ms. (steps per millisecond=148 )
Probabilistic random walk after 152411 steps, saw 28302 distinct states, run finished after 1037 ms. (steps per millisecond=146 ) properties seen :2
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (NOT (AND (NOT p0) p2 p1))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (OR p0 p2) (OR p0 p1)))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 p2))), (F p1), (F (NOT p0))]
Knowledge based reduction with 19 factoid took 752 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 171 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 24 reset in 332 ms.
Product exploration explored 100000 steps with 88 reset in 244 ms.
Support contains 5 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 122/122 transitions.
Applied a total of 0 rules in 8 ms. Remains 41 /41 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2024-05-22 03:04:49] [INFO ] Invariant cache hit.
[2024-05-22 03:04:49] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-22 03:04:49] [INFO ] Invariant cache hit.
[2024-05-22 03:04:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:04:49] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-05-22 03:04:49] [INFO ] Redundant transitions in 23 ms returned []
Running 120 sub problems to find dead transitions.
[2024-05-22 03:04:49] [INFO ] Invariant cache hit.
[2024-05-22 03:04:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/162 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 1/163 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/163 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 49 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3938 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/162 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 120/168 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 1/163 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/163 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 169 constraints, problems are : Problem set: 0 solved, 120 unsolved in 6589 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 10842ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 10845ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11130 ms. Remains : 41/41 places, 122/122 transitions.
Treatment of property AutonomousCar-PT-05b-LTLFireability-04 finished in 33369 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 U p1) U (G((!p2&&X(!p2))) U p3)))'
Support contains 4 out of 215 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 215/215 places, 349/349 transitions.
Graph (trivial) has 199 edges and 215 vertex of which 4 / 215 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 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 83 place count 212 transition count 264
Reduce places removed 82 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 112 rules applied. Total rules applied 195 place count 130 transition count 234
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 19 rules applied. Total rules applied 214 place count 112 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 215 place count 111 transition count 233
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 215 place count 111 transition count 227
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 227 place count 105 transition count 227
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 231 place count 101 transition count 223
Iterating global reduction 4 with 4 rules applied. Total rules applied 235 place count 101 transition count 223
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 237 place count 99 transition count 217
Iterating global reduction 4 with 2 rules applied. Total rules applied 239 place count 99 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 241 place count 99 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 242 place count 98 transition count 215
Performed 39 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 320 place count 59 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 321 place count 59 transition count 174
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 329 place count 51 transition count 129
Iterating global reduction 7 with 8 rules applied. Total rules applied 337 place count 51 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 340 place count 51 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 342 place count 50 transition count 125
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 343 place count 50 transition count 125
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 345 place count 48 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 346 place count 47 transition count 123
Applied a total of 346 rules in 77 ms. Remains 47 /215 variables (removed 168) and now considering 123/349 (removed 226) transitions.
// Phase 1: matrix 123 rows 47 cols
[2024-05-22 03:05:01] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 03:05:01] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-22 03:05:01] [INFO ] Invariant cache hit.
[2024-05-22 03:05:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 03:05:01] [INFO ] Implicit Places using invariants and state equation in 152 ms returned [42, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 243 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/215 places, 123/349 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 44 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 43 transition count 123
Applied a total of 4 rules in 10 ms. Remains 43 /45 variables (removed 2) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 43 cols
[2024-05-22 03:05:01] [INFO ] Computed 6 invariants in 5 ms
[2024-05-22 03:05:01] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-22 03:05:01] [INFO ] Invariant cache hit.
[2024-05-22 03:05:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:05:01] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 43/215 places, 123/349 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 513 ms. Remains : 43/215 places, 123/349 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p3), true, (NOT p1), p2, (NOT p3), (AND (NOT p1) p2)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-06 finished in 768 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(F(p1)))||p0)))'
Support contains 5 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 349/349 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 209 transition count 343
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 209 transition count 343
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 207 transition count 341
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 207 transition count 341
Applied a total of 16 rules in 10 ms. Remains 207 /215 variables (removed 8) and now considering 341/349 (removed 8) transitions.
// Phase 1: matrix 341 rows 207 cols
[2024-05-22 03:05:01] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 03:05:01] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-22 03:05:01] [INFO ] Invariant cache hit.
[2024-05-22 03:05:02] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Running 340 sub problems to find dead transitions.
[2024-05-22 03:05:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-05-22 03:05:07] [INFO ] Deduced a trap composed of 51 places in 210 ms of which 4 ms to minimize.
[2024-05-22 03:05:08] [INFO ] Deduced a trap composed of 18 places in 243 ms of which 3 ms to minimize.
[2024-05-22 03:05:08] [INFO ] Deduced a trap composed of 14 places in 220 ms of which 4 ms to minimize.
[2024-05-22 03:05:08] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 4 ms to minimize.
[2024-05-22 03:05:08] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-05-22 03:05:09] [INFO ] Deduced a trap composed of 24 places in 244 ms of which 4 ms to minimize.
[2024-05-22 03:05:09] [INFO ] Deduced a trap composed of 38 places in 266 ms of which 4 ms to minimize.
[2024-05-22 03:05:09] [INFO ] Deduced a trap composed of 33 places in 238 ms of which 3 ms to minimize.
[2024-05-22 03:05:10] [INFO ] Deduced a trap composed of 30 places in 229 ms of which 3 ms to minimize.
[2024-05-22 03:05:10] [INFO ] Deduced a trap composed of 40 places in 223 ms of which 3 ms to minimize.
[2024-05-22 03:05:10] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 3 ms to minimize.
[2024-05-22 03:05:10] [INFO ] Deduced a trap composed of 58 places in 220 ms of which 3 ms to minimize.
[2024-05-22 03:05:11] [INFO ] Deduced a trap composed of 45 places in 217 ms of which 4 ms to minimize.
[2024-05-22 03:05:11] [INFO ] Deduced a trap composed of 33 places in 222 ms of which 3 ms to minimize.
[2024-05-22 03:05:11] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 3 ms to minimize.
[2024-05-22 03:05:11] [INFO ] Deduced a trap composed of 26 places in 218 ms of which 3 ms to minimize.
[2024-05-22 03:05:12] [INFO ] Deduced a trap composed of 27 places in 213 ms of which 3 ms to minimize.
[2024-05-22 03:05:12] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 2 ms to minimize.
[2024-05-22 03:05:12] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 3 ms to minimize.
[2024-05-22 03:05:12] [INFO ] Deduced a trap composed of 33 places in 230 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-05-22 03:05:13] [INFO ] Deduced a trap composed of 33 places in 227 ms of which 3 ms to minimize.
[2024-05-22 03:05:13] [INFO ] Deduced a trap composed of 39 places in 195 ms of which 3 ms to minimize.
[2024-05-22 03:05:13] [INFO ] Deduced a trap composed of 36 places in 196 ms of which 3 ms to minimize.
[2024-05-22 03:05:14] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 3 ms to minimize.
[2024-05-22 03:05:14] [INFO ] Deduced a trap composed of 37 places in 171 ms of which 3 ms to minimize.
[2024-05-22 03:05:14] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 3 ms to minimize.
[2024-05-22 03:05:14] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 3 ms to minimize.
[2024-05-22 03:05:14] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 3 ms to minimize.
[2024-05-22 03:05:15] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 3 ms to minimize.
[2024-05-22 03:05:15] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 2 ms to minimize.
[2024-05-22 03:05:15] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2024-05-22 03:05:15] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 3 ms to minimize.
[2024-05-22 03:05:16] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2024-05-22 03:05:16] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 3 ms to minimize.
[2024-05-22 03:05:16] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 2 ms to minimize.
[2024-05-22 03:05:16] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 2 ms to minimize.
[2024-05-22 03:05:16] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
[2024-05-22 03:05:17] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 3 ms to minimize.
[2024-05-22 03:05:17] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 3 ms to minimize.
[2024-05-22 03:05:17] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-05-22 03:05:19] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 2 ms to minimize.
[2024-05-22 03:05:20] [INFO ] Deduced a trap composed of 43 places in 198 ms of which 3 ms to minimize.
[2024-05-22 03:05:20] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 3 ms to minimize.
[2024-05-22 03:05:20] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 2 ms to minimize.
[2024-05-22 03:05:21] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 2 ms to minimize.
[2024-05-22 03:05:21] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 4 ms to minimize.
[2024-05-22 03:05:22] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-05-22 03:05:24] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 3 ms to minimize.
[2024-05-22 03:05:26] [INFO ] Deduced a trap composed of 32 places in 215 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-05-22 03:05:28] [INFO ] Deduced a trap composed of 36 places in 183 ms of which 3 ms to minimize.
[2024-05-22 03:05:30] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 3 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 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 207/548 variables, and 61 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/207 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 51/61 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-05-22 03:05:35] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 3 ms to minimize.
[2024-05-22 03:05:35] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 3 ms to minimize.
[2024-05-22 03:05:36] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 2 ms to minimize.
[2024-05-22 03:05:36] [INFO ] Deduced a trap composed of 51 places in 161 ms of which 3 ms to minimize.
[2024-05-22 03:05:36] [INFO ] Deduced a trap composed of 51 places in 168 ms of which 3 ms to minimize.
[2024-05-22 03:05:36] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 2 ms to minimize.
[2024-05-22 03:05:36] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 3 ms to minimize.
[2024-05-22 03:05:36] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 3 ms to minimize.
[2024-05-22 03:05:38] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 9/70 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-05-22 03:05:42] [INFO ] Deduced a trap composed of 32 places in 217 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 340 unsolved
[2024-05-22 03:05:45] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (OVERLAPS) 341/548 variables, 207/279 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 340/619 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 619 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 62/62 constraints]
After SMT, in 60538ms problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 60547ms
Starting structural reductions in LTL mode, iteration 1 : 207/215 places, 341/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61002 ms. Remains : 207/215 places, 341/349 transitions.
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 437 ms.
Stuttering criterion allowed to conclude after 82 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-07 finished in 61685 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||F((p1||G(F((p2||G(p1)))))))))'
Support contains 3 out of 215 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 215/215 places, 349/349 transitions.
Graph (trivial) has 201 edges and 215 vertex of which 4 / 215 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.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 85 place count 213 transition count 263
Reduce places removed 84 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 113 rules applied. Total rules applied 198 place count 129 transition count 234
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 18 rules applied. Total rules applied 216 place count 112 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 217 place count 111 transition count 233
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 217 place count 111 transition count 225
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 233 place count 103 transition count 225
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 238 place count 98 transition count 220
Iterating global reduction 4 with 5 rules applied. Total rules applied 243 place count 98 transition count 220
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 246 place count 95 transition count 209
Iterating global reduction 4 with 3 rules applied. Total rules applied 249 place count 95 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 253 place count 95 transition count 205
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 255 place count 93 transition count 205
Performed 38 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 6 with 76 rules applied. Total rules applied 331 place count 55 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 332 place count 55 transition count 165
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 340 place count 47 transition count 120
Iterating global reduction 7 with 8 rules applied. Total rules applied 348 place count 47 transition count 120
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 351 place count 47 transition count 117
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 8 with 2 rules applied. Total rules applied 353 place count 46 transition count 116
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 354 place count 46 transition count 116
Applied a total of 354 rules in 60 ms. Remains 46 /215 variables (removed 169) and now considering 116/349 (removed 233) transitions.
// Phase 1: matrix 116 rows 46 cols
[2024-05-22 03:06:03] [INFO ] Computed 9 invariants in 2 ms
[2024-05-22 03:06:03] [INFO ] Implicit Places using invariants in 145 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 147 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/215 places, 116/349 transitions.
Applied a total of 0 rules in 6 ms. Remains 45 /45 variables (removed 0) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 215 ms. Remains : 45/215 places, 116/349 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-08
Stuttering criterion allowed to conclude after 45 steps with 14 reset in 1 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-08 finished in 406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(F((p0&&F(p1))))||(p2&&G(p3)))))'
Support contains 3 out of 215 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 215/215 places, 349/349 transitions.
Graph (trivial) has 198 edges and 215 vertex of which 2 / 215 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 213 transition count 264
Reduce places removed 83 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 112 rules applied. Total rules applied 196 place count 130 transition count 235
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 213 place count 113 transition count 235
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 213 place count 113 transition count 229
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 225 place count 107 transition count 229
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 229 place count 103 transition count 225
Iterating global reduction 3 with 4 rules applied. Total rules applied 233 place count 103 transition count 225
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 236 place count 100 transition count 214
Iterating global reduction 3 with 3 rules applied. Total rules applied 239 place count 100 transition count 214
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 241 place count 100 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 242 place count 99 transition count 212
Performed 42 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 326 place count 57 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 327 place count 57 transition count 168
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 335 place count 49 transition count 123
Iterating global reduction 6 with 8 rules applied. Total rules applied 343 place count 49 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 346 place count 49 transition count 120
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 7 with 2 rules applied. Total rules applied 348 place count 48 transition count 119
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 350 place count 46 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 351 place count 45 transition count 117
Applied a total of 351 rules in 76 ms. Remains 45 /215 variables (removed 170) and now considering 117/349 (removed 232) transitions.
// Phase 1: matrix 117 rows 45 cols
[2024-05-22 03:06:03] [INFO ] Computed 9 invariants in 1 ms
[2024-05-22 03:06:03] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 03:06:03] [INFO ] Invariant cache hit.
[2024-05-22 03:06:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 03:06:04] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [38, 44]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 183 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/215 places, 117/349 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 42 transition count 116
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 0 with 2 rules applied. Total rules applied 4 place count 41 transition count 117
Applied a total of 4 rules in 8 ms. Remains 41 /43 variables (removed 2) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 41 cols
[2024-05-22 03:06:04] [INFO ] Computed 7 invariants in 1 ms
[2024-05-22 03:06:04] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-22 03:06:04] [INFO ] Invariant cache hit.
[2024-05-22 03:06:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:06:04] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/215 places, 117/349 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 421 ms. Remains : 41/215 places, 117/349 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p0) (NOT p1)), (AND p0 (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-09
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-09 finished in 697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1))))'
Support contains 5 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 349/349 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 208 transition count 342
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 208 transition count 342
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 206 transition count 340
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 206 transition count 340
Applied a total of 18 rules in 20 ms. Remains 206 /215 variables (removed 9) and now considering 340/349 (removed 9) transitions.
// Phase 1: matrix 340 rows 206 cols
[2024-05-22 03:06:04] [INFO ] Computed 10 invariants in 7 ms
[2024-05-22 03:06:04] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-22 03:06:04] [INFO ] Invariant cache hit.
[2024-05-22 03:06:05] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2024-05-22 03:06:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 03:06:10] [INFO ] Deduced a trap composed of 51 places in 270 ms of which 4 ms to minimize.
[2024-05-22 03:06:11] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 4 ms to minimize.
[2024-05-22 03:06:11] [INFO ] Deduced a trap composed of 17 places in 231 ms of which 4 ms to minimize.
[2024-05-22 03:06:11] [INFO ] Deduced a trap composed of 24 places in 211 ms of which 4 ms to minimize.
[2024-05-22 03:06:12] [INFO ] Deduced a trap composed of 38 places in 250 ms of which 3 ms to minimize.
[2024-05-22 03:06:12] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 3 ms to minimize.
[2024-05-22 03:06:12] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 3 ms to minimize.
[2024-05-22 03:06:12] [INFO ] Deduced a trap composed of 33 places in 207 ms of which 4 ms to minimize.
[2024-05-22 03:06:12] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 3 ms to minimize.
[2024-05-22 03:06:13] [INFO ] Deduced a trap composed of 36 places in 219 ms of which 3 ms to minimize.
[2024-05-22 03:06:13] [INFO ] Deduced a trap composed of 29 places in 224 ms of which 3 ms to minimize.
[2024-05-22 03:06:13] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 3 ms to minimize.
[2024-05-22 03:06:14] [INFO ] Deduced a trap composed of 36 places in 231 ms of which 3 ms to minimize.
[2024-05-22 03:06:14] [INFO ] Deduced a trap composed of 31 places in 202 ms of which 4 ms to minimize.
[2024-05-22 03:06:14] [INFO ] Deduced a trap composed of 43 places in 193 ms of which 3 ms to minimize.
[2024-05-22 03:06:14] [INFO ] Deduced a trap composed of 39 places in 189 ms of which 3 ms to minimize.
[2024-05-22 03:06:14] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 3 ms to minimize.
[2024-05-22 03:06:15] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 3 ms to minimize.
[2024-05-22 03:06:15] [INFO ] Deduced a trap composed of 32 places in 174 ms of which 3 ms to minimize.
[2024-05-22 03:06:15] [INFO ] Deduced a trap composed of 37 places in 211 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 03:06:15] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 3 ms to minimize.
[2024-05-22 03:06:16] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 3 ms to minimize.
[2024-05-22 03:06:16] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 2 ms to minimize.
[2024-05-22 03:06:16] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 3 ms to minimize.
[2024-05-22 03:06:17] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 3 ms to minimize.
[2024-05-22 03:06:17] [INFO ] Deduced a trap composed of 42 places in 223 ms of which 3 ms to minimize.
[2024-05-22 03:06:17] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 3 ms to minimize.
[2024-05-22 03:06:17] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 3 ms to minimize.
[2024-05-22 03:06:18] [INFO ] Deduced a trap composed of 56 places in 199 ms of which 3 ms to minimize.
[2024-05-22 03:06:18] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 3 ms to minimize.
[2024-05-22 03:06:18] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 3 ms to minimize.
[2024-05-22 03:06:18] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 2 ms to minimize.
[2024-05-22 03:06:19] [INFO ] Deduced a trap composed of 20 places in 214 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 03:06:23] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-22 03:06:24] [INFO ] Deduced a trap composed of 56 places in 217 ms of which 3 ms to minimize.
[2024-05-22 03:06:24] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 3 ms to minimize.
[2024-05-22 03:06:25] [INFO ] Deduced a trap composed of 36 places in 202 ms of which 3 ms to minimize.
[2024-05-22 03:06:25] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 2 ms to minimize.
[2024-05-22 03:06:25] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 2 ms to minimize.
[2024-05-22 03:06:25] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 3 ms to minimize.
[2024-05-22 03:06:26] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 3 ms to minimize.
[2024-05-22 03:06:26] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 3 ms to minimize.
[2024-05-22 03:06:26] [INFO ] Deduced a trap composed of 53 places in 205 ms of which 4 ms to minimize.
[2024-05-22 03:06:26] [INFO ] Deduced a trap composed of 31 places in 203 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 03:06:29] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-05-22 03:06:29] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 03:06:32] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 2 ms to minimize.
[2024-05-22 03:06:32] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 2 ms to minimize.
[2024-05-22 03:06:32] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
[2024-05-22 03:06:33] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 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 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.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 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 206/546 variables, and 60 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/206 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 03:06:39] [INFO ] Deduced a trap composed of 49 places in 218 ms of which 4 ms to minimize.
[2024-05-22 03:06:39] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 3 ms to minimize.
[2024-05-22 03:06:40] [INFO ] Deduced a trap composed of 36 places in 196 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 03:06:42] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 3 ms to minimize.
[2024-05-22 03:06:43] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 3 ms to minimize.
[2024-05-22 03:06:43] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 03:06:47] [INFO ] Deduced a trap composed of 38 places in 131 ms of which 2 ms to minimize.
[2024-05-22 03:06:48] [INFO ] Deduced a trap composed of 51 places in 173 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 03:06:50] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 3 ms to minimize.
[2024-05-22 03:06:51] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 2 ms to minimize.
[2024-05-22 03:06:51] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 8 (OVERLAPS) 340/546 variables, 206/277 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 339/616 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/546 variables, and 616 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 61/61 constraints]
After SMT, in 60550ms problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 60556ms
Starting structural reductions in LTL mode, iteration 1 : 206/215 places, 340/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61100 ms. Remains : 206/215 places, 340/349 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-10 finished in 61307 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(!p1) U p2)&&G(p3)&&p0)))'
Support contains 12 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 349/349 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 208 transition count 342
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 208 transition count 342
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 206 transition count 340
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 206 transition count 340
Applied a total of 18 rules in 10 ms. Remains 206 /215 variables (removed 9) and now considering 340/349 (removed 9) transitions.
[2024-05-22 03:07:05] [INFO ] Invariant cache hit.
[2024-05-22 03:07:05] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-22 03:07:05] [INFO ] Invariant cache hit.
[2024-05-22 03:07:06] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2024-05-22 03:07:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 03:07:12] [INFO ] Deduced a trap composed of 51 places in 269 ms of which 4 ms to minimize.
[2024-05-22 03:07:12] [INFO ] Deduced a trap composed of 31 places in 225 ms of which 3 ms to minimize.
[2024-05-22 03:07:12] [INFO ] Deduced a trap composed of 17 places in 210 ms of which 3 ms to minimize.
[2024-05-22 03:07:13] [INFO ] Deduced a trap composed of 24 places in 237 ms of which 3 ms to minimize.
[2024-05-22 03:07:13] [INFO ] Deduced a trap composed of 38 places in 235 ms of which 4 ms to minimize.
[2024-05-22 03:07:13] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 3 ms to minimize.
[2024-05-22 03:07:13] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 3 ms to minimize.
[2024-05-22 03:07:14] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 3 ms to minimize.
[2024-05-22 03:07:14] [INFO ] Deduced a trap composed of 32 places in 190 ms of which 3 ms to minimize.
[2024-05-22 03:07:14] [INFO ] Deduced a trap composed of 36 places in 188 ms of which 3 ms to minimize.
[2024-05-22 03:07:14] [INFO ] Deduced a trap composed of 29 places in 190 ms of which 3 ms to minimize.
[2024-05-22 03:07:15] [INFO ] Deduced a trap composed of 32 places in 167 ms of which 3 ms to minimize.
[2024-05-22 03:07:15] [INFO ] Deduced a trap composed of 36 places in 234 ms of which 4 ms to minimize.
[2024-05-22 03:07:15] [INFO ] Deduced a trap composed of 31 places in 174 ms of which 3 ms to minimize.
[2024-05-22 03:07:15] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 3 ms to minimize.
[2024-05-22 03:07:16] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 3 ms to minimize.
[2024-05-22 03:07:16] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 3 ms to minimize.
[2024-05-22 03:07:16] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 3 ms to minimize.
[2024-05-22 03:07:16] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 3 ms to minimize.
[2024-05-22 03:07:16] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 03:07:17] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 2 ms to minimize.
[2024-05-22 03:07:17] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 3 ms to minimize.
[2024-05-22 03:07:17] [INFO ] Deduced a trap composed of 18 places in 184 ms of which 3 ms to minimize.
[2024-05-22 03:07:17] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 2 ms to minimize.
[2024-05-22 03:07:18] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 3 ms to minimize.
[2024-05-22 03:07:18] [INFO ] Deduced a trap composed of 42 places in 208 ms of which 3 ms to minimize.
[2024-05-22 03:07:18] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 3 ms to minimize.
[2024-05-22 03:07:19] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 3 ms to minimize.
[2024-05-22 03:07:19] [INFO ] Deduced a trap composed of 56 places in 142 ms of which 2 ms to minimize.
[2024-05-22 03:07:19] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 3 ms to minimize.
[2024-05-22 03:07:20] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 3 ms to minimize.
[2024-05-22 03:07:20] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 3 ms to minimize.
[2024-05-22 03:07:20] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 03:07:25] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-22 03:07:26] [INFO ] Deduced a trap composed of 56 places in 193 ms of which 4 ms to minimize.
[2024-05-22 03:07:26] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 3 ms to minimize.
[2024-05-22 03:07:26] [INFO ] Deduced a trap composed of 36 places in 196 ms of which 3 ms to minimize.
[2024-05-22 03:07:26] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 3 ms to minimize.
[2024-05-22 03:07:26] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 2 ms to minimize.
[2024-05-22 03:07:27] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 3 ms to minimize.
[2024-05-22 03:07:27] [INFO ] Deduced a trap composed of 38 places in 224 ms of which 3 ms to minimize.
[2024-05-22 03:07:27] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 3 ms to minimize.
[2024-05-22 03:07:28] [INFO ] Deduced a trap composed of 53 places in 206 ms of which 3 ms to minimize.
[2024-05-22 03:07:28] [INFO ] Deduced a trap composed of 31 places in 204 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 03:07:31] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 2 ms to minimize.
[2024-05-22 03:07:31] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 03:07:33] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 2 ms to minimize.
[2024-05-22 03:07:34] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
[2024-05-22 03:07:34] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 2 ms to minimize.
[2024-05-22 03:07:34] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 206/546 variables, and 60 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/206 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 03:07:40] [INFO ] Deduced a trap composed of 49 places in 254 ms of which 4 ms to minimize.
[2024-05-22 03:07:40] [INFO ] Deduced a trap composed of 37 places in 213 ms of which 3 ms to minimize.
[2024-05-22 03:07:41] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 03:07:44] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 3 ms to minimize.
[2024-05-22 03:07:44] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 3 ms to minimize.
[2024-05-22 03:07:45] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 03:07:49] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 2 ms to minimize.
[2024-05-22 03:07:49] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 339 unsolved
[2024-05-22 03:07:52] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 3 ms to minimize.
[2024-05-22 03:07:52] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 2 ms to minimize.
[2024-05-22 03:07:52] [INFO ] Deduced a trap composed of 51 places in 106 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 8 (OVERLAPS) 340/546 variables, 206/277 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 339/616 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/546 variables, and 616 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 61/61 constraints]
After SMT, in 60541ms problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 60549ms
Starting structural reductions in LTL mode, iteration 1 : 206/215 places, 340/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61050 ms. Remains : 206/215 places, 340/349 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p2) p1), (NOT p3), (OR (NOT p3) p1), true, (OR (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-11 finished in 61415 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) U (p1 U p0)))&&X((X(p1)&&p2))))'
Support contains 7 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 349/349 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 209 transition count 343
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 209 transition count 343
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 208 transition count 342
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 208 transition count 342
Applied a total of 14 rules in 11 ms. Remains 208 /215 variables (removed 7) and now considering 342/349 (removed 7) transitions.
// Phase 1: matrix 342 rows 208 cols
[2024-05-22 03:08:07] [INFO ] Computed 10 invariants in 4 ms
[2024-05-22 03:08:07] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-22 03:08:07] [INFO ] Invariant cache hit.
[2024-05-22 03:08:07] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
Running 341 sub problems to find dead transitions.
[2024-05-22 03:08:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 03:08:13] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 3 ms to minimize.
[2024-05-22 03:08:13] [INFO ] Deduced a trap composed of 31 places in 254 ms of which 3 ms to minimize.
[2024-05-22 03:08:14] [INFO ] Deduced a trap composed of 37 places in 233 ms of which 3 ms to minimize.
[2024-05-22 03:08:14] [INFO ] Deduced a trap composed of 24 places in 229 ms of which 3 ms to minimize.
[2024-05-22 03:08:14] [INFO ] Deduced a trap composed of 46 places in 215 ms of which 3 ms to minimize.
[2024-05-22 03:08:14] [INFO ] Deduced a trap composed of 31 places in 225 ms of which 3 ms to minimize.
[2024-05-22 03:08:15] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 3 ms to minimize.
[2024-05-22 03:08:15] [INFO ] Deduced a trap composed of 38 places in 258 ms of which 4 ms to minimize.
[2024-05-22 03:08:15] [INFO ] Deduced a trap composed of 14 places in 203 ms of which 3 ms to minimize.
[2024-05-22 03:08:16] [INFO ] Deduced a trap composed of 44 places in 217 ms of which 3 ms to minimize.
[2024-05-22 03:08:16] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 4 ms to minimize.
[2024-05-22 03:08:16] [INFO ] Deduced a trap composed of 32 places in 225 ms of which 3 ms to minimize.
[2024-05-22 03:08:16] [INFO ] Deduced a trap composed of 53 places in 212 ms of which 3 ms to minimize.
[2024-05-22 03:08:17] [INFO ] Deduced a trap composed of 31 places in 198 ms of which 3 ms to minimize.
[2024-05-22 03:08:17] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 3 ms to minimize.
[2024-05-22 03:08:17] [INFO ] Deduced a trap composed of 31 places in 198 ms of which 3 ms to minimize.
[2024-05-22 03:08:17] [INFO ] Deduced a trap composed of 39 places in 235 ms of which 4 ms to minimize.
[2024-05-22 03:08:18] [INFO ] Deduced a trap composed of 43 places in 235 ms of which 4 ms to minimize.
[2024-05-22 03:08:18] [INFO ] Deduced a trap composed of 36 places in 215 ms of which 3 ms to minimize.
[2024-05-22 03:08:18] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 03:08:18] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 3 ms to minimize.
[2024-05-22 03:08:19] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 3 ms to minimize.
[2024-05-22 03:08:19] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-05-22 03:08:19] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 3 ms to minimize.
[2024-05-22 03:08:19] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 3 ms to minimize.
[2024-05-22 03:08:20] [INFO ] Deduced a trap composed of 35 places in 199 ms of which 3 ms to minimize.
[2024-05-22 03:08:20] [INFO ] Deduced a trap composed of 35 places in 222 ms of which 3 ms to minimize.
[2024-05-22 03:08:20] [INFO ] Deduced a trap composed of 18 places in 217 ms of which 3 ms to minimize.
[2024-05-22 03:08:20] [INFO ] Deduced a trap composed of 31 places in 221 ms of which 3 ms to minimize.
[2024-05-22 03:08:21] [INFO ] Deduced a trap composed of 24 places in 221 ms of which 3 ms to minimize.
[2024-05-22 03:08:21] [INFO ] Deduced a trap composed of 52 places in 190 ms of which 3 ms to minimize.
[2024-05-22 03:08:21] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 3 ms to minimize.
[2024-05-22 03:08:22] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 3 ms to minimize.
[2024-05-22 03:08:22] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 3 ms to minimize.
[2024-05-22 03:08:22] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 3 ms to minimize.
[2024-05-22 03:08:22] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 3 ms to minimize.
[2024-05-22 03:08:22] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 2 ms to minimize.
[2024-05-22 03:08:22] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 3 ms to minimize.
[2024-05-22 03:08:23] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 3 ms to minimize.
[2024-05-22 03:08:23] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 03:08:26] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 2 ms to minimize.
[2024-05-22 03:08:26] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2024-05-22 03:08:26] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 2 ms to minimize.
[2024-05-22 03:08:26] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
[2024-05-22 03:08:27] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 4 ms to minimize.
[2024-05-22 03:08:27] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 3 ms to minimize.
[2024-05-22 03:08:28] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 2 ms to minimize.
[2024-05-22 03:08:28] [INFO ] Deduced a trap composed of 18 places in 219 ms of which 3 ms to minimize.
[2024-05-22 03:08:28] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 3 ms to minimize.
[2024-05-22 03:08:29] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 3 ms to minimize.
[2024-05-22 03:08:29] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 3 ms to minimize.
[2024-05-22 03:08:29] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 03:08:32] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
[2024-05-22 03:08:32] [INFO ] Deduced a trap composed of 37 places in 214 ms of which 4 ms to minimize.
[2024-05-22 03:08:32] [INFO ] Deduced a trap composed of 44 places in 219 ms of which 3 ms to minimize.
[2024-05-22 03:08:32] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 4 ms to minimize.
[2024-05-22 03:08:33] [INFO ] Deduced a trap composed of 53 places in 181 ms of which 4 ms to minimize.
[2024-05-22 03:08:33] [INFO ] Deduced a trap composed of 53 places in 211 ms of which 3 ms to minimize.
[2024-05-22 03:08:33] [INFO ] Deduced a trap composed of 54 places in 189 ms of which 4 ms to minimize.
[2024-05-22 03:08:33] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 3 ms to minimize.
[2024-05-22 03:08:34] [INFO ] Deduced a trap composed of 32 places in 218 ms of which 3 ms to minimize.
[2024-05-22 03:08:34] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 3 ms to minimize.
[2024-05-22 03:08:34] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 3 ms to minimize.
[2024-05-22 03:08:34] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2024-05-22 03:08:35] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 13/75 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 03:08:37] [INFO ] Deduced a trap composed of 38 places in 195 ms of which 3 ms to minimize.
[2024-05-22 03:08:37] [INFO ] Deduced a trap composed of 36 places in 170 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 208/550 variables, and 77 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/208 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 67/67 constraints]
Escalating to Integer solving :Problem set: 0 solved, 341 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 67/77 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 03:08:41] [INFO ] Deduced a trap composed of 33 places in 218 ms of which 3 ms to minimize.
[2024-05-22 03:08:42] [INFO ] Deduced a trap composed of 36 places in 192 ms of which 3 ms to minimize.
[2024-05-22 03:08:42] [INFO ] Deduced a trap composed of 39 places in 200 ms of which 3 ms to minimize.
[2024-05-22 03:08:43] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 03:08:46] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 3 ms to minimize.
[2024-05-22 03:08:46] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 6 (OVERLAPS) 342/550 variables, 208/291 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 341/632 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 03:09:02] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 1/633 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 633 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 74/74 constraints]
After SMT, in 60524ms problems are : Problem set: 0 solved, 341 unsolved
Search for dead transitions found 0 dead transitions in 60530ms
Starting structural reductions in LTL mode, iteration 1 : 208/215 places, 342/349 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61065 ms. Remains : 208/215 places, 342/349 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p2) (NOT p1) p0), (OR (NOT p2) (NOT p1) p0), true, p0, (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-13 finished in 61299 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 4 out of 215 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 215/215 places, 349/349 transitions.
Graph (trivial) has 202 edges and 215 vertex of which 4 / 215 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 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 212 transition count 260
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 117 rules applied. Total rules applied 204 place count 126 transition count 229
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 222 place count 108 transition count 229
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 222 place count 108 transition count 223
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 234 place count 102 transition count 223
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 239 place count 97 transition count 218
Iterating global reduction 3 with 5 rules applied. Total rules applied 244 place count 97 transition count 218
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 247 place count 94 transition count 207
Iterating global reduction 3 with 3 rules applied. Total rules applied 250 place count 94 transition count 207
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 254 place count 94 transition count 203
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 256 place count 92 transition count 203
Performed 40 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 336 place count 52 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 337 place count 52 transition count 161
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 344 place count 45 transition count 122
Iterating global reduction 6 with 7 rules applied. Total rules applied 351 place count 45 transition count 122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 354 place count 45 transition count 119
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 7 with 2 rules applied. Total rules applied 356 place count 44 transition count 118
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 358 place count 42 transition count 116
Applied a total of 358 rules in 49 ms. Remains 42 /215 variables (removed 173) and now considering 116/349 (removed 233) transitions.
// Phase 1: matrix 116 rows 42 cols
[2024-05-22 03:09:08] [INFO ] Computed 9 invariants in 2 ms
[2024-05-22 03:09:08] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-22 03:09:08] [INFO ] Invariant cache hit.
[2024-05-22 03:09:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 03:09:08] [INFO ] Implicit Places using invariants and state equation in 150 ms returned [38, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 245 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/215 places, 116/349 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 38 transition count 114
Applied a total of 4 rules in 6 ms. Remains 38 /40 variables (removed 2) and now considering 114/116 (removed 2) transitions.
// Phase 1: matrix 114 rows 38 cols
[2024-05-22 03:09:08] [INFO ] Computed 7 invariants in 2 ms
[2024-05-22 03:09:08] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-22 03:09:08] [INFO ] Invariant cache hit.
[2024-05-22 03:09:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 03:09:09] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/215 places, 114/349 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 530 ms. Remains : 38/215 places, 114/349 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05b-LTLFireability-15
Stuttering criterion allowed to conclude after 500 steps with 34 reset in 4 ms.
FORMULA AutonomousCar-PT-05b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05b-LTLFireability-15 finished in 600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p1&&G(p2))))))'
[2024-05-22 03:09:09] [INFO ] Flatten gal took : 54 ms
[2024-05-22 03:09:09] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-05-22 03:09:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 215 places, 349 transitions and 1643 arcs took 13 ms.
Total runtime 471917 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutonomousCar-PT-05b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 215
TRANSITIONS: 349
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.010s, Sys 0.001s]


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


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

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

Process ID: 2513
MODEL NAME: /home/mcc/execution/411/model
215 places, 349 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-05b-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716347710353

--------------------
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-05b"
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-05b, 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-171620166300292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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