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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 49K 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-02b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-02b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716343606330

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-02b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 02:06:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 02:06:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 02:06:48] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-05-22 02:06:48] [INFO ] Transformed 155 places.
[2024-05-22 02:06:48] [INFO ] Transformed 194 transitions.
[2024-05-22 02:06:48] [INFO ] Found NUPN structural information;
[2024-05-22 02:06:48] [INFO ] Parsed PT model containing 155 places and 194 transitions and 620 arcs in 268 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 111 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA AutonomousCar-PT-02b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 194/194 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 136 transition count 175
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 136 transition count 175
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 54 place count 136 transition count 159
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 132 transition count 155
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 132 transition count 155
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 131 transition count 154
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 131 transition count 154
Applied a total of 64 rules in 80 ms. Remains 131 /155 variables (removed 24) and now considering 154/194 (removed 40) transitions.
// Phase 1: matrix 154 rows 131 cols
[2024-05-22 02:06:48] [INFO ] Computed 7 invariants in 27 ms
[2024-05-22 02:06:49] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-22 02:06:49] [INFO ] Invariant cache hit.
[2024-05-22 02:06:49] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2024-05-22 02:06:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-05-22 02:06:51] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 22 ms to minimize.
[2024-05-22 02:06:51] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-22 02:06:51] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 2 ms to minimize.
[2024-05-22 02:06:51] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
[2024-05-22 02:06:51] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-05-22 02:06:51] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 2 ms to minimize.
[2024-05-22 02:06:51] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:06:51] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
[2024-05-22 02:06:51] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2024-05-22 02:06:52] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 2 ms to minimize.
[2024-05-22 02:06:52] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 2 ms to minimize.
[2024-05-22 02:06:52] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:06:52] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-05-22 02:06:52] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:06:52] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:06:52] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-05-22 02:06:52] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2024-05-22 02:06:52] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:06:53] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:06:53] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-05-22 02:06:53] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
[2024-05-22 02:06:53] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 2 ms to minimize.
[2024-05-22 02:06:53] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-22 02:06:53] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 2 ms to minimize.
[2024-05-22 02:06:53] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2024-05-22 02:06:54] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-05-22 02:06:54] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-05-22 02:06:55] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 153 unsolved
[2024-05-22 02:06:55] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 153 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD144 is UNSAT
At refinement iteration 7 (OVERLAPS) 154/285 variables, 131/167 constraints. Problems are: Problem set: 2 solved, 151 unsolved
[2024-05-22 02:06:57] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:06:58] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 2/169 constraints. Problems are: Problem set: 2 solved, 151 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 0/169 constraints. Problems are: Problem set: 2 solved, 151 unsolved
At refinement iteration 10 (OVERLAPS) 0/285 variables, 0/169 constraints. Problems are: Problem set: 2 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 169 constraints, problems are : Problem set: 2 solved, 151 unsolved in 11373 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 2 solved, 151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 2/131 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 31/38 constraints. Problems are: Problem set: 2 solved, 151 unsolved
[2024-05-22 02:07:01] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 1/39 constraints. Problems are: Problem set: 2 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/39 constraints. Problems are: Problem set: 2 solved, 151 unsolved
At refinement iteration 5 (OVERLAPS) 154/285 variables, 131/170 constraints. Problems are: Problem set: 2 solved, 151 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 151/321 constraints. Problems are: Problem set: 2 solved, 151 unsolved
[2024-05-22 02:07:03] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:07:04] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 2/323 constraints. Problems are: Problem set: 2 solved, 151 unsolved
[2024-05-22 02:07:05] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 1/324 constraints. Problems are: Problem set: 2 solved, 151 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 0/324 constraints. Problems are: Problem set: 2 solved, 151 unsolved
At refinement iteration 10 (OVERLAPS) 0/285 variables, 0/324 constraints. Problems are: Problem set: 2 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 324 constraints, problems are : Problem set: 2 solved, 151 unsolved in 10660 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 151/153 constraints, Known Traps: 35/35 constraints]
After SMT, in 22159ms problems are : Problem set: 2 solved, 151 unsolved
Search for dead transitions found 2 dead transitions in 22189ms
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 : 131/155 places, 152/194 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 130 transition count 152
Applied a total of 1 rules in 11 ms. Remains 130 /131 variables (removed 1) and now considering 152/152 (removed 0) transitions.
// Phase 1: matrix 152 rows 130 cols
[2024-05-22 02:07:11] [INFO ] Computed 7 invariants in 4 ms
[2024-05-22 02:07:11] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-22 02:07:11] [INFO ] Invariant cache hit.
[2024-05-22 02:07:11] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 130/155 places, 152/194 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23086 ms. Remains : 130/155 places, 152/194 transitions.
Support contains 31 out of 130 places after structural reductions.
[2024-05-22 02:07:12] [INFO ] Flatten gal took : 53 ms
[2024-05-22 02:07:12] [INFO ] Flatten gal took : 22 ms
[2024-05-22 02:07:12] [INFO ] Input system was already deterministic with 152 transitions.
RANDOM walk for 40000 steps (34 resets) in 1752 ms. (22 steps per ms) remains 1/28 properties
BEST_FIRST walk for 40003 steps (34 resets) in 318 ms. (125 steps per ms) remains 1/1 properties
[2024-05-22 02:07:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 117/119 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/130 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 152/282 variables, 130/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/282 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp7 is UNSAT
After SMT solving in domain Int declared 119/282 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/130 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 173ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA AutonomousCar-PT-02b-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA AutonomousCar-PT-02b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 31 stabilizing places and 31 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(((F(p0) U p1) U (p2 U p3))))))'
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 152/152 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 125 transition count 147
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 125 transition count 147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 124 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 124 transition count 146
Applied a total of 12 rules in 17 ms. Remains 124 /130 variables (removed 6) and now considering 146/152 (removed 6) transitions.
// Phase 1: matrix 146 rows 124 cols
[2024-05-22 02:07:13] [INFO ] Computed 7 invariants in 3 ms
[2024-05-22 02:07:13] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-22 02:07:13] [INFO ] Invariant cache hit.
[2024-05-22 02:07:13] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2024-05-22 02:07:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 02:07:14] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-22 02:07:15] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-05-22 02:07:15] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2024-05-22 02:07:15] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:07:15] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 2 ms to minimize.
[2024-05-22 02:07:15] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-22 02:07:15] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 2 ms to minimize.
[2024-05-22 02:07:15] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 2 ms to minimize.
[2024-05-22 02:07:15] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2024-05-22 02:07:15] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
[2024-05-22 02:07:15] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2024-05-22 02:07:15] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:07:15] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-22 02:07:15] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-22 02:07:16] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:07:16] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 3 ms to minimize.
[2024-05-22 02:07:16] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 2 ms to minimize.
[2024-05-22 02:07:16] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 02:07:17] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 02:07:17] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/270 variables, 124/151 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 02:07:19] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 152 constraints, problems are : Problem set: 0 solved, 145 unsolved in 8486 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/270 variables, 124/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 145/297 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 02:07:24] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 2 ms to minimize.
[2024-05-22 02:07:24] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 02:07:26] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 300 constraints, problems are : Problem set: 0 solved, 145 unsolved in 9153 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 24/24 constraints]
After SMT, in 17690ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 17693ms
Starting structural reductions in LTL mode, iteration 1 : 124/130 places, 146/152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17926 ms. Remains : 124/130 places, 146/152 transitions.
Stuttering acceptance computed with spot in 559 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p0), (NOT p1), (NOT p3), (AND (NOT p0) p1 (NOT p3))]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-00
Stuttering criterion allowed to conclude after 127 steps with 1 reset in 4 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-00 finished in 18621 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||X((p1||X(p0)))))&&(G(p0) U G(p2)))))'
Support contains 6 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 152/152 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 125 transition count 147
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 125 transition count 147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 124 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 124 transition count 146
Applied a total of 12 rules in 12 ms. Remains 124 /130 variables (removed 6) and now considering 146/152 (removed 6) transitions.
[2024-05-22 02:07:32] [INFO ] Invariant cache hit.
[2024-05-22 02:07:32] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-22 02:07:32] [INFO ] Invariant cache hit.
[2024-05-22 02:07:32] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2024-05-22 02:07:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 02:07:33] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-05-22 02:07:33] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-22 02:07:33] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-22 02:07:33] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
[2024-05-22 02:07:33] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 2 ms to minimize.
[2024-05-22 02:07:33] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-05-22 02:07:33] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:07:33] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:07:33] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-05-22 02:07:34] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
[2024-05-22 02:07:34] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 2 ms to minimize.
[2024-05-22 02:07:34] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 2 ms to minimize.
[2024-05-22 02:07:34] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-22 02:07:34] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-05-22 02:07:34] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 2 ms to minimize.
[2024-05-22 02:07:34] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:07:34] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:07:34] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 02:07:35] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 02:07:36] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/270 variables, 124/151 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 02:07:38] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 152 constraints, problems are : Problem set: 0 solved, 145 unsolved in 8339 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/270 variables, 124/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 145/297 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 02:07:42] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:07:42] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 02:07:44] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 300 constraints, problems are : Problem set: 0 solved, 145 unsolved in 8623 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 24/24 constraints]
After SMT, in 17008ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 17010ms
Starting structural reductions in LTL mode, iteration 1 : 124/130 places, 146/152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17224 ms. Remains : 124/130 places, 146/152 transitions.
Stuttering acceptance computed with spot in 666 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) p2 (NOT p1)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-01
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-01 finished in 17923 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(p2))))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 152/152 transitions.
Graph (trivial) has 120 edges and 130 vertex of which 4 / 130 are part of one of the 2 SCC in 5 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 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 127 transition count 96
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 69 rules applied. Total rules applied 123 place count 74 transition count 80
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 133 place count 65 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 134 place count 64 transition count 79
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 134 place count 64 transition count 72
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 148 place count 57 transition count 72
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 150 place count 55 transition count 70
Iterating global reduction 4 with 2 rules applied. Total rules applied 152 place count 55 transition count 70
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 196 place count 33 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 197 place count 33 transition count 46
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 202 place count 28 transition count 35
Iterating global reduction 5 with 5 rules applied. Total rules applied 207 place count 28 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 209 place count 28 transition count 33
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 6 with 4 rules applied. Total rules applied 213 place count 26 transition count 31
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 217 place count 24 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 218 place count 23 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 219 place count 22 transition count 36
Applied a total of 219 rules in 49 ms. Remains 22 /130 variables (removed 108) and now considering 36/152 (removed 116) transitions.
// Phase 1: matrix 36 rows 22 cols
[2024-05-22 02:07:50] [INFO ] Computed 5 invariants in 0 ms
[2024-05-22 02:07:50] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 02:07:50] [INFO ] Invariant cache hit.
[2024-05-22 02:07:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-22 02:07:50] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 103 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/130 places, 36/152 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 155 ms. Remains : 21/130 places, 36/152 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, (OR (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 34 steps with 4 reset in 0 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-03 finished in 381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U (p1||G(p0)))||(p2&&X(p3)))))'
Support contains 7 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 152/152 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 125 transition count 147
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 125 transition count 147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 124 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 124 transition count 146
Applied a total of 12 rules in 8 ms. Remains 124 /130 variables (removed 6) and now considering 146/152 (removed 6) transitions.
// Phase 1: matrix 146 rows 124 cols
[2024-05-22 02:07:50] [INFO ] Computed 7 invariants in 2 ms
[2024-05-22 02:07:50] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-22 02:07:50] [INFO ] Invariant cache hit.
[2024-05-22 02:07:50] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2024-05-22 02:07:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 02:07:51] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-22 02:07:51] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-05-22 02:07:51] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2024-05-22 02:07:52] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 2 ms to minimize.
[2024-05-22 02:07:52] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 2 ms to minimize.
[2024-05-22 02:07:52] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 2 ms to minimize.
[2024-05-22 02:07:52] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 2 ms to minimize.
[2024-05-22 02:07:52] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:07:52] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-05-22 02:07:52] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
[2024-05-22 02:07:52] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 2 ms to minimize.
[2024-05-22 02:07:52] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 2 ms to minimize.
[2024-05-22 02:07:52] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-05-22 02:07:52] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-22 02:07:52] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 2 ms to minimize.
[2024-05-22 02:07:53] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 1 ms to minimize.
[2024-05-22 02:07:53] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:07:53] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 02:07:53] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 02:07:54] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/270 variables, 124/151 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 02:07:57] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 152 constraints, problems are : Problem set: 0 solved, 145 unsolved in 9002 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/270 variables, 124/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 145/297 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 02:08:01] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-05-22 02:08:02] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 02:08:03] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 300 constraints, problems are : Problem set: 0 solved, 145 unsolved in 8931 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 24/24 constraints]
After SMT, in 17978ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 17981ms
Starting structural reductions in LTL mode, iteration 1 : 124/130 places, 146/152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18200 ms. Remains : 124/130 places, 146/152 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (NOT p3) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 406 ms.
Entered a terminal (fully accepting) state of product in 152 steps with 2 reset in 2 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-04 finished in 18839 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||G(p1)))))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 152/152 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 126 transition count 148
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 126 transition count 148
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 125 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 125 transition count 147
Applied a total of 10 rules in 10 ms. Remains 125 /130 variables (removed 5) and now considering 147/152 (removed 5) transitions.
// Phase 1: matrix 147 rows 125 cols
[2024-05-22 02:08:09] [INFO ] Computed 7 invariants in 4 ms
[2024-05-22 02:08:09] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-22 02:08:09] [INFO ] Invariant cache hit.
[2024-05-22 02:08:09] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-22 02:08:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 02:08:10] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-05-22 02:08:10] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-22 02:08:10] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-22 02:08:10] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:08:10] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 2 ms to minimize.
[2024-05-22 02:08:10] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 2 ms to minimize.
[2024-05-22 02:08:10] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:08:11] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 2 ms to minimize.
[2024-05-22 02:08:11] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:08:11] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:08:11] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 2 ms to minimize.
[2024-05-22 02:08:11] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 2 ms to minimize.
[2024-05-22 02:08:11] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:08:11] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:08:11] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 2 ms to minimize.
[2024-05-22 02:08:11] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 2 ms to minimize.
[2024-05-22 02:08:11] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 02:08:12] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-22 02:08:12] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:08:12] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:08:12] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
[2024-05-22 02:08:12] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-05-22 02:08:12] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 02:08:13] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-05-22 02:08:13] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 02:08:14] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 02:08:15] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 2 ms to minimize.
[2024-05-22 02:08:15] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:08:15] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:08:15] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 147/272 variables, 125/162 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/272 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 162 constraints, problems are : Problem set: 0 solved, 146 unsolved in 9705 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 147/272 variables, 125/162 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 146/308 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 02:08:22] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/272 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (OVERLAPS) 0/272 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 309 constraints, problems are : Problem set: 0 solved, 146 unsolved in 9269 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 31/31 constraints]
After SMT, in 19004ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 19006ms
Starting structural reductions in LTL mode, iteration 1 : 125/130 places, 147/152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19222 ms. Remains : 125/130 places, 147/152 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-05
Product exploration explored 100000 steps with 1 reset in 134 ms.
Product exploration explored 100000 steps with 3 reset in 320 ms.
Computed a total of 28 stabilizing places and 28 stable transitions
Computed a total of 28 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 120 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (24 resets) in 97 ms. (408 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40001 steps (10 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
[2024-05-22 02:08:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 89/125 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 147/272 variables, 125/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/272 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 132 constraints, problems are : Problem set: 0 solved, 1 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 36/272 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/7 constraints, State Equation: 0/125 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 166ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 10 factoid took 333 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 147/147 transitions.
Graph (trivial) has 114 edges and 125 vertex of which 4 / 125 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 122 transition count 97
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 62 rules applied. Total rules applied 110 place count 75 transition count 82
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 119 place count 66 transition count 82
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 119 place count 66 transition count 74
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 135 place count 58 transition count 74
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 136 place count 57 transition count 73
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 57 transition count 73
Performed 24 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 185 place count 33 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 186 place count 33 transition count 47
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 190 place count 29 transition count 39
Iterating global reduction 4 with 4 rules applied. Total rules applied 194 place count 29 transition count 39
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 196 place count 29 transition count 37
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 5 with 4 rules applied. Total rules applied 200 place count 27 transition count 35
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 204 place count 25 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 206 place count 23 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 207 place count 22 transition count 42
Applied a total of 207 rules in 23 ms. Remains 22 /125 variables (removed 103) and now considering 42/147 (removed 105) transitions.
// Phase 1: matrix 42 rows 22 cols
[2024-05-22 02:08:30] [INFO ] Computed 5 invariants in 0 ms
[2024-05-22 02:08:30] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 02:08:30] [INFO ] Invariant cache hit.
[2024-05-22 02:08:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 02:08:30] [INFO ] Implicit Places using invariants and state equation in 74 ms returned [18, 21]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 126 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/125 places, 42/147 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 18 transition count 40
Applied a total of 4 rules in 2 ms. Remains 18 /20 variables (removed 2) and now considering 40/42 (removed 2) transitions.
// Phase 1: matrix 40 rows 18 cols
[2024-05-22 02:08:30] [INFO ] Computed 3 invariants in 0 ms
[2024-05-22 02:08:30] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 02:08:30] [INFO ] Invariant cache hit.
[2024-05-22 02:08:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:08:30] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/125 places, 40/147 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 227 ms. Remains : 18/125 places, 40/147 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 p1 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 207 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (5198 resets) in 485 ms. (82 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (1199 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
[2024-05-22 02:08:30] [INFO ] Invariant cache hit.
[2024-05-22 02:08:30] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/33 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/57 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/58 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/58 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/58 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/58 variables, and 22 constraints, problems are : Problem set: 0 solved, 1 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 7/58 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/3 constraints, State Equation: 0/18 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 76ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR p1 p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 8 factoid took 302 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 132 ms.
Product exploration explored 100000 steps with 6 reset in 129 ms.
Support contains 2 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2024-05-22 02:08:31] [INFO ] Invariant cache hit.
[2024-05-22 02:08:31] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 02:08:31] [INFO ] Invariant cache hit.
[2024-05-22 02:08:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:08:31] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-22 02:08:31] [INFO ] Redundant transitions in 17 ms returned []
Running 28 sub problems to find dead transitions.
[2024-05-22 02:08:31] [INFO ] Invariant cache hit.
[2024-05-22 02:08:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 39/57 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 1/58 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 0/58 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/58 variables, and 22 constraints, problems are : Problem set: 0 solved, 28 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 39/57 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 28/49 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/58 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/58 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 58/58 variables, and 50 constraints, problems are : Problem set: 0 solved, 28 unsolved in 530 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 892ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 893ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1009 ms. Remains : 18/18 places, 40/40 transitions.
Treatment of property AutonomousCar-PT-02b-LTLFireability-05 finished in 23502 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)||G(F(p1)))))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 152/152 transitions.
Graph (trivial) has 119 edges and 130 vertex of which 4 / 130 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 127 transition count 99
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 66 rules applied. Total rules applied 117 place count 77 transition count 83
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 127 place count 68 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 128 place count 67 transition count 82
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 128 place count 67 transition count 73
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 146 place count 58 transition count 73
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 147 place count 57 transition count 72
Iterating global reduction 4 with 1 rules applied. Total rules applied 148 place count 57 transition count 72
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 192 place count 35 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 193 place count 35 transition count 48
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 198 place count 30 transition count 37
Iterating global reduction 5 with 5 rules applied. Total rules applied 203 place count 30 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 205 place count 30 transition count 35
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 6 with 4 rules applied. Total rules applied 209 place count 28 transition count 33
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 213 place count 26 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 215 place count 24 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 216 place count 23 transition count 37
Applied a total of 216 rules in 38 ms. Remains 23 /130 variables (removed 107) and now considering 37/152 (removed 115) transitions.
// Phase 1: matrix 37 rows 23 cols
[2024-05-22 02:08:32] [INFO ] Computed 5 invariants in 0 ms
[2024-05-22 02:08:32] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-22 02:08:32] [INFO ] Invariant cache hit.
[2024-05-22 02:08:32] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-22 02:08:32] [INFO ] Implicit Places using invariants and state equation in 53 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 91 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/130 places, 37/152 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 21 transition count 36
Applied a total of 2 rules in 8 ms. Remains 21 /22 variables (removed 1) and now considering 36/37 (removed 1) transitions.
// Phase 1: matrix 36 rows 21 cols
[2024-05-22 02:08:32] [INFO ] Computed 4 invariants in 1 ms
[2024-05-22 02:08:32] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 02:08:32] [INFO ] Invariant cache hit.
[2024-05-22 02:08:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 02:08:32] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/130 places, 36/152 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 240 ms. Remains : 21/130 places, 36/152 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-08
Product exploration explored 100000 steps with 9 reset in 75 ms.
Product exploration explored 100000 steps with 17 reset in 307 ms.
Computed a total of 5 stabilizing places and 4 stable transitions
Computed a total of 5 stabilizing places and 4 stable transitions
Detected a total of 5/21 stabilizing places and 4/36 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 633 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 70 steps (6 resets) in 4 ms. (14 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 878 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 36/36 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 36/36 (removed 0) transitions.
[2024-05-22 02:08:35] [INFO ] Invariant cache hit.
[2024-05-22 02:08:35] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 02:08:35] [INFO ] Invariant cache hit.
[2024-05-22 02:08:35] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 02:08:35] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-22 02:08:35] [INFO ] Redundant transitions in 1 ms returned []
Running 34 sub problems to find dead transitions.
[2024-05-22 02:08:35] [INFO ] Invariant cache hit.
[2024-05-22 02:08:35] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 2/21 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 35/56 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-22 02:08:35] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 2 ms to minimize.
[2024-05-22 02:08:35] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-22 02:08:35] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 1/57 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 0/57 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/57 variables, and 36 constraints, problems are : Problem set: 0 solved, 34 unsolved in 812 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 2/21 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 35/56 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 7/35 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 34/69 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 1/57 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-22 02:08:36] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/57 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/57 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 13 (OVERLAPS) 0/57 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/57 variables, and 71 constraints, problems are : Problem set: 0 solved, 34 unsolved in 1073 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 4/4 constraints]
After SMT, in 1909ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 1910ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2006 ms. Remains : 21/21 places, 36/36 transitions.
Computed a total of 5 stabilizing places and 4 stable transitions
Computed a total of 5 stabilizing places and 4 stable transitions
Detected a total of 5/21 stabilizing places and 4/36 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 622 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 66 steps (5 resets) in 5 ms. (11 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 792 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5 reset in 63 ms.
Product exploration explored 100000 steps with 5 reset in 66 ms.
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 36/36 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 36/36 (removed 0) transitions.
[2024-05-22 02:08:39] [INFO ] Invariant cache hit.
[2024-05-22 02:08:39] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 02:08:39] [INFO ] Invariant cache hit.
[2024-05-22 02:08:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 02:08:39] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-22 02:08:39] [INFO ] Redundant transitions in 0 ms returned []
Running 34 sub problems to find dead transitions.
[2024-05-22 02:08:39] [INFO ] Invariant cache hit.
[2024-05-22 02:08:39] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 2/21 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 35/56 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 7/32 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-22 02:08:39] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 3 ms to minimize.
[2024-05-22 02:08:39] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-22 02:08:39] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 1/57 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 0/57 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/57 variables, and 36 constraints, problems are : Problem set: 0 solved, 34 unsolved in 834 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 2/21 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 35/56 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 7/35 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 34/69 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 1/57 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-22 02:08:40] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/57 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/57 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 13 (OVERLAPS) 0/57 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/57 variables, and 71 constraints, problems are : Problem set: 0 solved, 34 unsolved in 1014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 4/4 constraints]
After SMT, in 1865ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 1865ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1961 ms. Remains : 21/21 places, 36/36 transitions.
Treatment of property AutonomousCar-PT-02b-LTLFireability-08 finished in 8342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 152/152 transitions.
Graph (trivial) has 120 edges and 130 vertex of which 4 / 130 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 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 127 transition count 96
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 68 rules applied. Total rules applied 122 place count 74 transition count 81
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 130 place count 66 transition count 81
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 130 place count 66 transition count 73
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 146 place count 58 transition count 73
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 149 place count 55 transition count 70
Iterating global reduction 3 with 3 rules applied. Total rules applied 152 place count 55 transition count 70
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 196 place count 33 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 197 place count 33 transition count 46
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 202 place count 28 transition count 35
Iterating global reduction 4 with 5 rules applied. Total rules applied 207 place count 28 transition count 35
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 208 place count 28 transition count 34
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 5 with 4 rules applied. Total rules applied 212 place count 26 transition count 32
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 216 place count 24 transition count 41
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 218 place count 22 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 219 place count 21 transition count 39
Applied a total of 219 rules in 17 ms. Remains 21 /130 variables (removed 109) and now considering 39/152 (removed 113) transitions.
// Phase 1: matrix 39 rows 21 cols
[2024-05-22 02:08:41] [INFO ] Computed 5 invariants in 0 ms
[2024-05-22 02:08:41] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 02:08:41] [INFO ] Invariant cache hit.
[2024-05-22 02:08:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 02:08:41] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [17, 20]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 103 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/130 places, 39/152 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 17 transition count 37
Applied a total of 4 rules in 3 ms. Remains 17 /19 variables (removed 2) and now considering 37/39 (removed 2) transitions.
// Phase 1: matrix 37 rows 17 cols
[2024-05-22 02:08:41] [INFO ] Computed 3 invariants in 0 ms
[2024-05-22 02:08:41] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-22 02:08:41] [INFO ] Invariant cache hit.
[2024-05-22 02:08:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:08:41] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/130 places, 37/152 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 205 ms. Remains : 17/130 places, 37/152 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-09
Product exploration explored 100000 steps with 6 reset in 57 ms.
Product exploration explored 100000 steps with 10 reset in 112 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 96 steps (12 resets) in 4 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 37/37 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2024-05-22 02:08:42] [INFO ] Invariant cache hit.
[2024-05-22 02:08:42] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 02:08:42] [INFO ] Invariant cache hit.
[2024-05-22 02:08:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:08:42] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-22 02:08:42] [INFO ] Redundant transitions in 13 ms returned []
Running 25 sub problems to find dead transitions.
[2024-05-22 02:08:42] [INFO ] Invariant cache hit.
[2024-05-22 02:08:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 36/53 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 1/54 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 0/54 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 21 constraints, problems are : Problem set: 0 solved, 25 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 36/53 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 25/45 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 1/54 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/54 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 46 constraints, problems are : Problem set: 0 solved, 25 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 860ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 860ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 975 ms. Remains : 17/17 places, 37/37 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 55 steps (5 resets) in 6 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 51 ms.
Product exploration explored 100000 steps with 0 reset in 60 ms.
Support contains 1 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 37/37 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2024-05-22 02:08:43] [INFO ] Invariant cache hit.
[2024-05-22 02:08:43] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 02:08:43] [INFO ] Invariant cache hit.
[2024-05-22 02:08:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:08:43] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-22 02:08:43] [INFO ] Redundant transitions in 14 ms returned []
Running 25 sub problems to find dead transitions.
[2024-05-22 02:08:43] [INFO ] Invariant cache hit.
[2024-05-22 02:08:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 36/53 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 1/54 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 0/54 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 21 constraints, problems are : Problem set: 0 solved, 25 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 36/53 variables, 17/20 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 25/45 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 1/54 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/54 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 46 constraints, problems are : Problem set: 0 solved, 25 unsolved in 497 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 17/17 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 826ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 826ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 933 ms. Remains : 17/17 places, 37/37 transitions.
Treatment of property AutonomousCar-PT-02b-LTLFireability-09 finished in 3592 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 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 152/152 transitions.
Graph (trivial) has 117 edges and 130 vertex of which 4 / 130 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 127 transition count 95
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 70 rules applied. Total rules applied 125 place count 73 transition count 79
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 134 place count 64 transition count 79
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 134 place count 64 transition count 72
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 148 place count 57 transition count 72
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 151 place count 54 transition count 69
Iterating global reduction 3 with 3 rules applied. Total rules applied 154 place count 54 transition count 69
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 194 place count 34 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 195 place count 34 transition count 47
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 198 place count 31 transition count 42
Iterating global reduction 4 with 3 rules applied. Total rules applied 201 place count 31 transition count 42
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 203 place count 31 transition count 40
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 5 with 4 rules applied. Total rules applied 207 place count 29 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 211 place count 27 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 213 place count 25 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 214 place count 24 transition count 42
Applied a total of 214 rules in 16 ms. Remains 24 /130 variables (removed 106) and now considering 42/152 (removed 110) transitions.
// Phase 1: matrix 42 rows 24 cols
[2024-05-22 02:08:44] [INFO ] Computed 5 invariants in 1 ms
[2024-05-22 02:08:44] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 02:08:44] [INFO ] Invariant cache hit.
[2024-05-22 02:08:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 02:08:44] [INFO ] Implicit Places using invariants and state equation in 53 ms returned [20, 23]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 91 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/130 places, 42/152 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 20 transition count 40
Applied a total of 4 rules in 2 ms. Remains 20 /22 variables (removed 2) and now considering 40/42 (removed 2) transitions.
// Phase 1: matrix 40 rows 20 cols
[2024-05-22 02:08:44] [INFO ] Computed 3 invariants in 1 ms
[2024-05-22 02:08:44] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 02:08:44] [INFO ] Invariant cache hit.
[2024-05-22 02:08:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:08:44] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/130 places, 40/152 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 191 ms. Remains : 20/130 places, 40/152 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-11
Stuttering criterion allowed to conclude after 24 steps with 2 reset in 0 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-11 finished in 241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0) U !p1))))'
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 152/152 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 126 transition count 148
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 126 transition count 148
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 125 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 125 transition count 147
Applied a total of 10 rules in 6 ms. Remains 125 /130 variables (removed 5) and now considering 147/152 (removed 5) transitions.
// Phase 1: matrix 147 rows 125 cols
[2024-05-22 02:08:44] [INFO ] Computed 7 invariants in 1 ms
[2024-05-22 02:08:45] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-22 02:08:45] [INFO ] Invariant cache hit.
[2024-05-22 02:08:45] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-22 02:08:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 02:08:46] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:08:46] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-22 02:08:46] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-05-22 02:08:46] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-22 02:08:46] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-05-22 02:08:46] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:08:46] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-22 02:08:46] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-05-22 02:08:46] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 2 ms to minimize.
[2024-05-22 02:08:46] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
[2024-05-22 02:08:47] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
[2024-05-22 02:08:47] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:08:47] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-22 02:08:47] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 2 ms to minimize.
[2024-05-22 02:08:47] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 3 ms to minimize.
[2024-05-22 02:08:47] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
[2024-05-22 02:08:47] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 2 ms to minimize.
[2024-05-22 02:08:47] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:08:47] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 2 ms to minimize.
[2024-05-22 02:08:47] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 02:08:47] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:08:47] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:08:48] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-05-22 02:08:48] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 02:08:49] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:08:49] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 02:08:49] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:08:50] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 02:08:50] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 147/272 variables, 125/161 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 02:08:52] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 02:08:53] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 12 (OVERLAPS) 0/272 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 163 constraints, problems are : Problem set: 0 solved, 146 unsolved in 11429 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 02:08:57] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-05-22 02:08:57] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:08:57] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 02:08:58] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 147/272 variables, 125/167 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 146/313 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (OVERLAPS) 0/272 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 313 constraints, problems are : Problem set: 0 solved, 146 unsolved in 6738 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 35/35 constraints]
After SMT, in 18193ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 18195ms
Starting structural reductions in LTL mode, iteration 1 : 125/130 places, 147/152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18409 ms. Remains : 125/130 places, 147/152 transitions.
Stuttering acceptance computed with spot in 167 ms :[p1, p1, p1, true, (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-12
Product exploration explored 100000 steps with 33333 reset in 186 ms.
Product exploration explored 100000 steps with 33333 reset in 203 ms.
Computed a total of 28 stabilizing places and 28 stable transitions
Computed a total of 28 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 15 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-02b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-02b-LTLFireability-12 finished in 19001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 152/152 transitions.
Graph (trivial) has 120 edges and 130 vertex of which 4 / 130 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 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 127 transition count 96
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 69 rules applied. Total rules applied 123 place count 74 transition count 80
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 133 place count 65 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 134 place count 64 transition count 79
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 134 place count 64 transition count 71
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 150 place count 56 transition count 71
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 153 place count 53 transition count 68
Iterating global reduction 4 with 3 rules applied. Total rules applied 156 place count 53 transition count 68
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 200 place count 31 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 201 place count 31 transition count 44
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 206 place count 26 transition count 33
Iterating global reduction 5 with 5 rules applied. Total rules applied 211 place count 26 transition count 33
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 213 place count 26 transition count 31
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 6 with 2 rules applied. Total rules applied 215 place count 25 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 219 place count 23 transition count 36
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 221 place count 21 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 222 place count 20 transition count 34
Applied a total of 222 rules in 12 ms. Remains 20 /130 variables (removed 110) and now considering 34/152 (removed 118) transitions.
// Phase 1: matrix 34 rows 20 cols
[2024-05-22 02:09:03] [INFO ] Computed 5 invariants in 1 ms
[2024-05-22 02:09:03] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 02:09:03] [INFO ] Invariant cache hit.
[2024-05-22 02:09:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 02:09:04] [INFO ] Implicit Places using invariants and state equation in 62 ms returned [16, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 99 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/130 places, 34/152 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 18 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 17 transition count 33
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 2 with 2 rules applied. Total rules applied 4 place count 16 transition count 32
Applied a total of 4 rules in 2 ms. Remains 16 /18 variables (removed 2) and now considering 32/34 (removed 2) transitions.
// Phase 1: matrix 32 rows 16 cols
[2024-05-22 02:09:04] [INFO ] Computed 3 invariants in 0 ms
[2024-05-22 02:09:04] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 02:09:04] [INFO ] Invariant cache hit.
[2024-05-22 02:09:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:09:04] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/130 places, 32/152 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 192 ms. Remains : 16/130 places, 32/152 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-13 finished in 240 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(p1)))))'
Support contains 1 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 152/152 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 125 transition count 147
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 125 transition count 147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 124 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 124 transition count 146
Applied a total of 12 rules in 3 ms. Remains 124 /130 variables (removed 6) and now considering 146/152 (removed 6) transitions.
// Phase 1: matrix 146 rows 124 cols
[2024-05-22 02:09:04] [INFO ] Computed 7 invariants in 1 ms
[2024-05-22 02:09:04] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-22 02:09:04] [INFO ] Invariant cache hit.
[2024-05-22 02:09:04] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2024-05-22 02:09:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 02:09:05] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-22 02:09:05] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-22 02:09:05] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:09:05] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 2 ms to minimize.
[2024-05-22 02:09:05] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 2 ms to minimize.
[2024-05-22 02:09:05] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
[2024-05-22 02:09:05] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:09:05] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:09:06] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:09:06] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:09:06] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:09:06] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 2 ms to minimize.
[2024-05-22 02:09:06] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-05-22 02:09:06] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 2 ms to minimize.
[2024-05-22 02:09:06] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 2 ms to minimize.
[2024-05-22 02:09:06] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:09:06] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 2 ms to minimize.
[2024-05-22 02:09:06] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 02:09:07] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 02:09:08] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/270 variables, 124/151 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 02:09:10] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 152 constraints, problems are : Problem set: 0 solved, 145 unsolved in 8510 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/270 variables, 124/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 145/297 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 02:09:14] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 2 ms to minimize.
[2024-05-22 02:09:15] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 02:09:16] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 300 constraints, problems are : Problem set: 0 solved, 145 unsolved in 8595 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 24/24 constraints]
After SMT, in 17126ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 17127ms
Starting structural reductions in LTL mode, iteration 1 : 124/130 places, 146/152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17340 ms. Remains : 124/130 places, 146/152 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-14
Stuttering criterion allowed to conclude after 172 steps with 1 reset in 1 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-02b-LTLFireability-14 finished in 17488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 152/152 transitions.
Graph (trivial) has 120 edges and 130 vertex of which 4 / 130 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 127 transition count 98
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 67 rules applied. Total rules applied 119 place count 76 transition count 82
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 129 place count 67 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 130 place count 66 transition count 81
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 130 place count 66 transition count 72
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 148 place count 57 transition count 72
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 151 place count 54 transition count 69
Iterating global reduction 4 with 3 rules applied. Total rules applied 154 place count 54 transition count 69
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 196 place count 33 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 197 place count 33 transition count 46
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 202 place count 28 transition count 35
Iterating global reduction 5 with 5 rules applied. Total rules applied 207 place count 28 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 209 place count 28 transition count 33
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 6 with 4 rules applied. Total rules applied 213 place count 26 transition count 31
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 217 place count 24 transition count 37
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 219 place count 22 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 220 place count 21 transition count 35
Applied a total of 220 rules in 12 ms. Remains 21 /130 variables (removed 109) and now considering 35/152 (removed 117) transitions.
// Phase 1: matrix 35 rows 21 cols
[2024-05-22 02:09:21] [INFO ] Computed 5 invariants in 1 ms
[2024-05-22 02:09:21] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 02:09:21] [INFO ] Invariant cache hit.
[2024-05-22 02:09:21] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-22 02:09:21] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [17, 20]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 109 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/130 places, 35/152 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 17 transition count 33
Applied a total of 4 rules in 1 ms. Remains 17 /19 variables (removed 2) and now considering 33/35 (removed 2) transitions.
// Phase 1: matrix 33 rows 17 cols
[2024-05-22 02:09:21] [INFO ] Computed 3 invariants in 1 ms
[2024-05-22 02:09:21] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 02:09:21] [INFO ] Invariant cache hit.
[2024-05-22 02:09:21] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 02:09:21] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/130 places, 33/152 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 198 ms. Remains : 17/130 places, 33/152 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 47 ms.
Product exploration explored 100000 steps with 50000 reset in 61 ms.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Detected a total of 4/17 stabilizing places and 5/33 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 15 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-02b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-02b-LTLFireability-15 finished in 370 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||G(p1)))))'
Found a Lengthening insensitive property : AutonomousCar-PT-02b-LTLFireability-05
Stuttering acceptance computed with spot in 122 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 130/130 places, 152/152 transitions.
Graph (trivial) has 119 edges and 130 vertex of which 4 / 130 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 127 transition count 97
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 66 rules applied. Total rules applied 119 place count 75 transition count 83
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 127 place count 67 transition count 83
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 127 place count 67 transition count 74
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 145 place count 58 transition count 74
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 148 place count 55 transition count 71
Iterating global reduction 3 with 3 rules applied. Total rules applied 151 place count 55 transition count 71
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 195 place count 33 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 196 place count 33 transition count 47
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 200 place count 29 transition count 39
Iterating global reduction 4 with 4 rules applied. Total rules applied 204 place count 29 transition count 39
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 206 place count 29 transition count 37
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 5 with 4 rules applied. Total rules applied 210 place count 27 transition count 35
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 214 place count 25 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 216 place count 23 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 217 place count 22 transition count 42
Applied a total of 217 rules in 11 ms. Remains 22 /130 variables (removed 108) and now considering 42/152 (removed 110) transitions.
// Phase 1: matrix 42 rows 22 cols
[2024-05-22 02:09:22] [INFO ] Computed 5 invariants in 0 ms
[2024-05-22 02:09:22] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 02:09:22] [INFO ] Invariant cache hit.
[2024-05-22 02:09:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 02:09:22] [INFO ] Implicit Places using invariants and state equation in 58 ms returned [18, 21]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 97 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 20/130 places, 42/152 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 18 transition count 40
Applied a total of 4 rules in 1 ms. Remains 18 /20 variables (removed 2) and now considering 40/42 (removed 2) transitions.
// Phase 1: matrix 40 rows 18 cols
[2024-05-22 02:09:22] [INFO ] Computed 3 invariants in 0 ms
[2024-05-22 02:09:22] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-22 02:09:22] [INFO ] Invariant cache hit.
[2024-05-22 02:09:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:09:22] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 18/130 places, 40/152 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 192 ms. Remains : 18/130 places, 40/152 transitions.
Running random walk in product with property : AutonomousCar-PT-02b-LTLFireability-05
Product exploration explored 100000 steps with 11 reset in 51 ms.
Product exploration explored 100000 steps with 0 reset in 76 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 p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 207 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (5169 resets) in 183 ms. (217 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (1148 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
[2024-05-22 02:09:23] [INFO ] Invariant cache hit.
[2024-05-22 02:09:23] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/33 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/57 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/58 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/58 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/58 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/58 variables, and 22 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 7/58 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 1/3 constraints, State Equation: 0/18 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 70ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 8 factoid took 298 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2024-05-22 02:09:23] [INFO ] Invariant cache hit.
[2024-05-22 02:09:23] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 02:09:23] [INFO ] Invariant cache hit.
[2024-05-22 02:09:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 02:09:23] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-22 02:09:23] [INFO ] Redundant transitions in 14 ms returned []
Running 28 sub problems to find dead transitions.
[2024-05-22 02:09:23] [INFO ] Invariant cache hit.
[2024-05-22 02:09:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 39/57 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 1/58 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 0/58 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/58 variables, and 22 constraints, problems are : Problem set: 0 solved, 28 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 39/57 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 28/49 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/58 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/58 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 58/58 variables, and 50 constraints, problems are : Problem set: 0 solved, 28 unsolved in 550 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 965ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 965ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1062 ms. Remains : 18/18 places, 40/40 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 p1 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 196 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (5171 resets) in 99 ms. (400 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (1189 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
[2024-05-22 02:09:25] [INFO ] Invariant cache hit.
[2024-05-22 02:09:25] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/33 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/57 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/58 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/58 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/58 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/58 variables, and 22 constraints, problems are : Problem set: 0 solved, 1 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 7/58 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 1/3 constraints, State Equation: 0/18 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 80ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR p1 p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 8 factoid took 301 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 6 reset in 68 ms.
Entered a terminal (fully accepting) state of product in 29 steps with 5 reset in 0 ms.
Treatment of property AutonomousCar-PT-02b-LTLFireability-05 finished in 3802 ms.
FORMULA AutonomousCar-PT-02b-LTLFireability-05 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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)||G(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-22 02:09:26] [INFO ] Flatten gal took : 15 ms
[2024-05-22 02:09:26] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-22 02:09:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 130 places, 152 transitions and 438 arcs took 7 ms.
Total runtime 157949 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutonomousCar-PT-02b

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/413/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: 2345
MODEL NAME: /home/mcc/execution/413/model
130 places, 152 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-02b-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-02b-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-02b-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716343768480

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

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