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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 193K Apr 12 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 12 17:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 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 177K 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-06a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716347832227

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-06a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 03:17:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 03:17:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 03:17:15] [INFO ] Load time of PNML (sax parser for PT used): 231 ms
[2024-05-22 03:17:15] [INFO ] Transformed 65 places.
[2024-05-22 03:17:15] [INFO ] Transformed 417 transitions.
[2024-05-22 03:17:15] [INFO ] Found NUPN structural information;
[2024-05-22 03:17:15] [INFO ] Parsed PT model containing 65 places and 417 transitions and 3356 arcs in 488 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 159 transitions
Reduce redundant transitions removed 159 transitions.
FORMULA AutonomousCar-PT-06a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 63 transition count 244
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 63 transition count 244
Applied a total of 4 rules in 54 ms. Remains 63 /65 variables (removed 2) and now considering 244/258 (removed 14) transitions.
[2024-05-22 03:17:15] [INFO ] Flow matrix only has 243 transitions (discarded 1 similar events)
// Phase 1: matrix 243 rows 63 cols
[2024-05-22 03:17:15] [INFO ] Computed 11 invariants in 52 ms
[2024-05-22 03:17:16] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-05-22 03:17:16] [INFO ] Flow matrix only has 243 transitions (discarded 1 similar events)
[2024-05-22 03:17:16] [INFO ] Invariant cache hit.
[2024-05-22 03:17:16] [INFO ] State equation strengthened by 135 read => feed constraints.
[2024-05-22 03:17:16] [INFO ] Implicit Places using invariants and state equation in 414 ms returned [58, 61]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 867 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/65 places, 244/258 transitions.
Applied a total of 0 rules in 7 ms. Remains 61 /61 variables (removed 0) and now considering 244/244 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 970 ms. Remains : 61/65 places, 244/258 transitions.
Support contains 32 out of 61 places after structural reductions.
[2024-05-22 03:17:17] [INFO ] Flatten gal took : 159 ms
[2024-05-22 03:17:17] [INFO ] Flatten gal took : 63 ms
[2024-05-22 03:17:17] [INFO ] Input system was already deterministic with 244 transitions.
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 40000 steps (2264 resets) in 4348 ms. (9 steps per ms) remains 7/23 properties
BEST_FIRST walk for 40004 steps (207 resets) in 219 ms. (181 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (229 resets) in 140 ms. (283 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (214 resets) in 126 ms. (314 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (224 resets) in 223 ms. (178 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (199 resets) in 259 ms. (153 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (214 resets) in 223 ms. (178 steps per ms) remains 6/6 properties
[2024-05-22 03:17:19] [INFO ] Flow matrix only has 243 transitions (discarded 1 similar events)
// Phase 1: matrix 243 rows 61 cols
[2024-05-22 03:17:19] [INFO ] Computed 9 invariants in 9 ms
[2024-05-22 03:17:19] [INFO ] State equation strengthened by 135 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 33/44 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 13/57 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 239/296 variables, 57/66 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 134/200 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/200 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 6/302 variables, 3/203 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 0/203 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/303 variables, 1/204 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 0/204 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/304 variables, 1/205 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/304 variables, 0/205 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/304 variables, 0/205 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 205 constraints, problems are : Problem set: 2 solved, 4 unsolved in 608 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 37/44 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 13/57 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 239/296 variables, 57/66 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 134/200 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/200 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 6/302 variables, 3/203 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 4/207 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 0/207 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/303 variables, 1/208 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/303 variables, 0/208 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/304 variables, 1/209 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/304 variables, 0/209 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/304 variables, 0/209 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 209 constraints, problems are : Problem set: 2 solved, 4 unsolved in 1059 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1830ms problems are : Problem set: 2 solved, 4 unsolved
Parikh walk visited 0 properties in 1461 ms.
Support contains 7 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 244/244 transitions.
Graph (complete) has 502 edges and 61 vertex of which 59 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 59 transition count 234
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 54 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 53 transition count 233
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 53 transition count 232
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 52 transition count 232
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 22 place count 48 transition count 210
Iterating global reduction 3 with 4 rules applied. Total rules applied 26 place count 48 transition count 210
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 32 place count 45 transition count 207
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 37 place count 45 transition count 202
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 60 place count 40 transition count 184
Applied a total of 60 rules in 118 ms. Remains 40 /61 variables (removed 21) and now considering 184/244 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 40/61 places, 184/244 transitions.
RANDOM walk for 40000 steps (373 resets) in 424 ms. (94 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (209 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
// Phase 1: matrix 184 rows 40 cols
[2024-05-22 03:17:22] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 03:17:22] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/40 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 184/224 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 97/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/224 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 147 constraints, problems are : Problem set: 0 solved, 1 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 40/40 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/16 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/40 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 184/224 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 97/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/224 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 40/40 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 516ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 184/184 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 39 transition count 177
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 177
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 39 transition count 175
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 18 place count 37 transition count 163
Applied a total of 18 rules in 43 ms. Remains 37 /40 variables (removed 3) and now considering 163/184 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 37/40 places, 163/184 transitions.
RANDOM walk for 40000 steps (130 resets) in 311 ms. (128 steps per ms) remains 1/1 properties
BEST_FIRST walk for 23410 steps (61 resets) in 53 ms. (433 steps per ms) remains 0/1 properties
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-06a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 2 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(X(G(p0)))))'
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 56 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 56 transition count 215
Applied a total of 10 rules in 8 ms. Remains 56 /61 variables (removed 5) and now considering 215/244 (removed 29) transitions.
// Phase 1: matrix 215 rows 56 cols
[2024-05-22 03:17:23] [INFO ] Computed 8 invariants in 7 ms
[2024-05-22 03:17:23] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-22 03:17:24] [INFO ] Invariant cache hit.
[2024-05-22 03:17:24] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-22 03:17:24] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-05-22 03:17:24] [INFO ] Invariant cache hit.
[2024-05-22 03:17:24] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 214/270 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 110/174 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 03:17:29] [INFO ] Deduced a trap composed of 18 places in 176 ms of which 11 ms to minimize.
[2024-05-22 03:17:29] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 3 ms to minimize.
[2024-05-22 03:17:29] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 1/271 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/271 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 178 constraints, problems are : Problem set: 0 solved, 214 unsolved in 14177 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 214/270 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 110/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 214/391 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 1/271 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 392 constraints, problems are : Problem set: 0 solved, 214 unsolved in 22759 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints]
After SMT, in 38156ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 38166ms
Starting structural reductions in LTL mode, iteration 1 : 56/61 places, 215/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38566 ms. Remains : 56/61 places, 215/244 transitions.
Stuttering acceptance computed with spot in 407 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-00
Product exploration explored 100000 steps with 10 reset in 380 ms.
Product exploration explored 100000 steps with 241 reset in 333 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 118 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2287 resets) in 347 ms. (114 steps per ms) remains 1/1 properties
BEST_FIRST walk for 37316 steps (205 resets) in 184 ms. (201 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 127 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 215/215 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-22 03:18:04] [INFO ] Invariant cache hit.
[2024-05-22 03:18:04] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-22 03:18:04] [INFO ] Invariant cache hit.
[2024-05-22 03:18:04] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-22 03:18:04] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-05-22 03:18:04] [INFO ] Invariant cache hit.
[2024-05-22 03:18:04] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 214/270 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 110/174 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 03:18:10] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 3 ms to minimize.
[2024-05-22 03:18:10] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 2 ms to minimize.
[2024-05-22 03:18:10] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 1/271 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/271 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 178 constraints, problems are : Problem set: 0 solved, 214 unsolved in 15986 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 214/270 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 110/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 214/391 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 1/271 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 392 constraints, problems are : Problem set: 0 solved, 214 unsolved in 22604 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints]
After SMT, in 39650ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 39657ms
Finished structural reductions in LTL mode , in 1 iterations and 39981 ms. Remains : 56/56 places, 215/215 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 31474 steps (1774 resets) in 250 ms. (125 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 140 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 57 reset in 107 ms.
Product exploration explored 100000 steps with 74 reset in 212 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 215/215 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 56 transition count 215
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 8 place count 56 transition count 217
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 56 transition count 217
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 56 transition count 217
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 55 transition count 216
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 55 transition count 216
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 11 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 55 transition count 219
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 14 rules in 50 ms. Remains 55 /56 variables (removed 1) and now considering 219/215 (removed -4) transitions.
[2024-05-22 03:18:46] [INFO ] Redundant transitions in 29 ms returned []
Running 218 sub problems to find dead transitions.
// Phase 1: matrix 219 rows 55 cols
[2024-05-22 03:18:46] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 03:18:46] [INFO ] State equation strengthened by 115 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-22 03:18:49] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 3 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-22 03:18:49] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 3 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-22 03:18:49] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-22 03:18:49] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-22 03:18:49] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-05-22 03:18:49] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-05-22 03:18:49] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 7/15 constraints. Problems are: Problem set: 7 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 7 solved, 211 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
At refinement iteration 4 (OVERLAPS) 218/273 variables, 55/70 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 114/184 constraints. Problems are: Problem set: 15 solved, 203 unsolved
[2024-05-22 03:18:53] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 1/185 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/185 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 1/274 variables, 1/186 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/186 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 10 (OVERLAPS) 0/274 variables, 0/186 constraints. Problems are: Problem set: 15 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 186 constraints, problems are : Problem set: 15 solved, 203 unsolved in 15675 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 55/55 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 15 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 8/51 variables, 8/8 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 8/16 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/16 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 217/268 variables, 51/67 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 114/181 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 203/384 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/384 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 5/273 variables, 4/388 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/388 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 10 (OVERLAPS) 1/274 variables, 1/389 constraints. Problems are: Problem set: 15 solved, 203 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/389 constraints. Problems are: Problem set: 15 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 274/274 variables, and 389 constraints, problems are : Problem set: 15 solved, 203 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 55/55 constraints, ReadFeed: 115/115 constraints, PredecessorRefiner: 203/218 constraints, Known Traps: 8/8 constraints]
After SMT, in 46572ms problems are : Problem set: 15 solved, 203 unsolved
Search for dead transitions found 15 dead transitions in 46575ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 55/56 places, 204/215 transitions.
Graph (complete) has 493 edges and 55 vertex of which 44 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 44 /55 variables (removed 11) and now considering 204/204 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/56 places, 204/215 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46684 ms. Remains : 44/56 places, 204/215 transitions.
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 56 /56 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 56 cols
[2024-05-22 03:19:33] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 03:19:33] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-22 03:19:33] [INFO ] Invariant cache hit.
[2024-05-22 03:19:33] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-22 03:19:33] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-05-22 03:19:33] [INFO ] Invariant cache hit.
[2024-05-22 03:19:33] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 214/270 variables, 56/64 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 110/174 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 03:19:38] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 2 ms to minimize.
[2024-05-22 03:19:38] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 2 ms to minimize.
[2024-05-22 03:19:38] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 1/271 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/271 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 178 constraints, problems are : Problem set: 0 solved, 214 unsolved in 16053 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 214/270 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 110/177 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 214/391 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 1/271 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 392 constraints, problems are : Problem set: 0 solved, 214 unsolved in 23569 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 56/56 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 3/3 constraints]
After SMT, in 40328ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 40332ms
Finished structural reductions in LTL mode , in 1 iterations and 40699 ms. Remains : 56/56 places, 215/215 transitions.
Treatment of property AutonomousCar-PT-06a-LTLFireability-00 finished in 170328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 1 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 56 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 56 transition count 215
Applied a total of 10 rules in 7 ms. Remains 56 /61 variables (removed 5) and now considering 215/244 (removed 29) transitions.
[2024-05-22 03:20:14] [INFO ] Invariant cache hit.
[2024-05-22 03:20:14] [INFO ] Implicit Places using invariants in 197 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 199 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/61 places, 215/244 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 208 ms. Remains : 55/61 places, 215/244 transitions.
Stuttering acceptance computed with spot in 349 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-03
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-03 finished in 575 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)) U (G(!p2)&&p1)))'
Support contains 6 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 61 transition count 238
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 55 transition count 238
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 55 transition count 237
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 54 transition count 237
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 49 transition count 208
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 49 transition count 208
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 47 transition count 206
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 30 place count 46 transition count 206
Applied a total of 30 rules in 83 ms. Remains 46 /61 variables (removed 15) and now considering 206/244 (removed 38) transitions.
// Phase 1: matrix 206 rows 46 cols
[2024-05-22 03:20:14] [INFO ] Computed 8 invariants in 3 ms
[2024-05-22 03:20:15] [INFO ] Implicit Places using invariants in 638 ms returned []
[2024-05-22 03:20:15] [INFO ] Invariant cache hit.
[2024-05-22 03:20:15] [INFO ] State equation strengthened by 113 read => feed constraints.
[2024-05-22 03:20:15] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 912 ms to find 0 implicit places.
[2024-05-22 03:20:15] [INFO ] Redundant transitions in 32 ms returned []
Running 205 sub problems to find dead transitions.
[2024-05-22 03:20:15] [INFO ] Invariant cache hit.
[2024-05-22 03:20:15] [INFO ] State equation strengthened by 113 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 205/251 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 112/166 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-22 03:20:21] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (OVERLAPS) 1/252 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (OVERLAPS) 0/252 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 168 constraints, problems are : Problem set: 0 solved, 205 unsolved in 13260 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 205/251 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 112/167 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 205/372 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (OVERLAPS) 1/252 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (OVERLAPS) 0/252 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 373 constraints, problems are : Problem set: 0 solved, 205 unsolved in 26723 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 46/46 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 1/1 constraints]
After SMT, in 41002ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 41006ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/61 places, 206/244 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42046 ms. Remains : 46/61 places, 206/244 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p1) p2), (NOT p0), (NOT p0), p2]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-04
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-04 finished in 42284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||(F(p3)&&p2)||p0)))'
Support contains 8 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 57 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 57 transition count 222
Applied a total of 8 rules in 5 ms. Remains 57 /61 variables (removed 4) and now considering 222/244 (removed 22) transitions.
// Phase 1: matrix 222 rows 57 cols
[2024-05-22 03:20:56] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 03:20:57] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-22 03:20:57] [INFO ] Invariant cache hit.
[2024-05-22 03:20:57] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-05-22 03:20:57] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-05-22 03:20:57] [INFO ] Invariant cache hit.
[2024-05-22 03:20:57] [INFO ] State equation strengthened by 117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 221/278 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 116/181 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-22 03:21:02] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 2 ms to minimize.
[2024-05-22 03:21:02] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 2 ms to minimize.
[2024-05-22 03:21:02] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 2 ms to minimize.
[2024-05-22 03:21:04] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 1/279 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 186 constraints, problems are : Problem set: 0 solved, 221 unsolved in 16574 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 221/278 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 116/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 221/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/279 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 407 constraints, problems are : Problem set: 0 solved, 221 unsolved in 23144 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
After SMT, in 40426ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 40429ms
Starting structural reductions in LTL mode, iteration 1 : 57/61 places, 222/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40709 ms. Remains : 57/61 places, 222/244 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p1)), true, (NOT p3)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-05
Entered a terminal (fully accepting) state of product in 83 steps with 4 reset in 1 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-05 finished in 40893 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((X((p0&&(p1 U p2)))&&G(p0))))'
Support contains 8 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 57 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 57 transition count 222
Applied a total of 8 rules in 4 ms. Remains 57 /61 variables (removed 4) and now considering 222/244 (removed 22) transitions.
// Phase 1: matrix 222 rows 57 cols
[2024-05-22 03:21:37] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 03:21:37] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-22 03:21:37] [INFO ] Invariant cache hit.
[2024-05-22 03:21:38] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-05-22 03:21:38] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-05-22 03:21:38] [INFO ] Invariant cache hit.
[2024-05-22 03:21:38] [INFO ] State equation strengthened by 117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 221/278 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 116/181 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-22 03:21:43] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 7 ms to minimize.
[2024-05-22 03:21:43] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 5 ms to minimize.
[2024-05-22 03:21:43] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 2 ms to minimize.
[2024-05-22 03:21:45] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 1/279 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 186 constraints, problems are : Problem set: 0 solved, 221 unsolved in 15597 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 221/278 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 116/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 221/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/279 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 407 constraints, problems are : Problem set: 0 solved, 221 unsolved in 28412 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
After SMT, in 44811ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 44814ms
Starting structural reductions in LTL mode, iteration 1 : 57/61 places, 222/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45068 ms. Remains : 57/61 places, 222/244 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-06
Product exploration explored 100000 steps with 19 reset in 116 ms.
Product exploration explored 100000 steps with 3 reset in 252 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X p0), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 235 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
RANDOM walk for 40000 steps (2254 resets) in 617 ms. (64 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40003 steps (213 resets) in 363 ms. (109 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (196 resets) in 327 ms. (121 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (204 resets) in 115 ms. (344 steps per ms) remains 3/3 properties
[2024-05-22 03:22:24] [INFO ] Invariant cache hit.
[2024-05-22 03:22:24] [INFO ] State equation strengthened by 117 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 16/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 24/48 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 213/261 variables, 48/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 116/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 13/274 variables, 5/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4/278 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/278 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/279 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/279 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/279 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 182 constraints, problems are : Problem set: 0 solved, 3 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 16/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 24/48 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 213/261 variables, 48/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 116/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 13/274 variables, 5/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/278 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/278 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/279 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/279 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/279 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 185 constraints, problems are : Problem set: 0 solved, 3 unsolved in 770 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1123ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2609 ms.
Support contains 8 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 222/222 transitions.
Graph (complete) has 478 edges and 57 vertex of which 56 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 56 transition count 212
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 18 place count 50 transition count 210
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 48 transition count 210
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 20 place count 48 transition count 209
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 47 transition count 209
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 46 transition count 208
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 46 transition count 208
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 43 transition count 205
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 43 transition count 201
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 62 place count 39 transition count 177
Applied a total of 62 rules in 41 ms. Remains 39 /57 variables (removed 18) and now considering 177/222 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 39/57 places, 177/222 transitions.
RANDOM walk for 30878 steps (164 resets) in 331 ms. (93 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X p0), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) p0))), (F (NOT (OR p1 p2 p0))), (F p1), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F p2), (F (NOT p0)), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 13 factoid took 576 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
[2024-05-22 03:22:29] [INFO ] Invariant cache hit.
[2024-05-22 03:22:29] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-22 03:22:30] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2024-05-22 03:22:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 03:22:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 03:22:30] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-22 03:22:30] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-05-22 03:22:30] [INFO ] [Nat]Added 117 Read/Feed constraints in 18 ms returned sat
[2024-05-22 03:22:30] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 205 transitions) in 82 ms.
[2024-05-22 03:22:30] [INFO ] Added : 1 causal constraints over 1 iterations in 139 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 8 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 222/222 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-05-22 03:22:30] [INFO ] Invariant cache hit.
[2024-05-22 03:22:30] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-22 03:22:30] [INFO ] Invariant cache hit.
[2024-05-22 03:22:30] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-05-22 03:22:30] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-05-22 03:22:30] [INFO ] Invariant cache hit.
[2024-05-22 03:22:30] [INFO ] State equation strengthened by 117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 221/278 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 116/181 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-22 03:22:36] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 2 ms to minimize.
[2024-05-22 03:22:36] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 6 ms to minimize.
[2024-05-22 03:22:36] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 2 ms to minimize.
[2024-05-22 03:22:38] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 1/279 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 186 constraints, problems are : Problem set: 0 solved, 221 unsolved in 15697 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 221/278 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 116/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 221/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/279 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 407 constraints, problems are : Problem set: 0 solved, 221 unsolved in 27052 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
After SMT, in 43679ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 43685ms
Finished structural reductions in LTL mode , in 1 iterations and 44010 ms. Remains : 57/57 places, 222/222 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 164 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
RANDOM walk for 40000 steps (2180 resets) in 718 ms. (55 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40003 steps (195 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (209 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (212 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
[2024-05-22 03:23:15] [INFO ] Invariant cache hit.
[2024-05-22 03:23:15] [INFO ] State equation strengthened by 117 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 16/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 24/48 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 213/261 variables, 48/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 116/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 13/274 variables, 5/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4/278 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/278 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/279 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/279 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/279 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 182 constraints, problems are : Problem set: 0 solved, 3 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 16/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 24/48 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 213/261 variables, 48/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 116/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 13/274 variables, 5/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/278 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/278 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/279 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/279 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/279 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 185 constraints, problems are : Problem set: 0 solved, 3 unsolved in 907 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1331ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5116 ms.
Support contains 8 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 222/222 transitions.
Graph (complete) has 478 edges and 57 vertex of which 56 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 56 transition count 212
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 18 place count 50 transition count 210
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 48 transition count 210
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 20 place count 48 transition count 209
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 47 transition count 209
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 46 transition count 208
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 46 transition count 208
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 43 transition count 205
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 43 transition count 201
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 62 place count 39 transition count 177
Applied a total of 62 rules in 42 ms. Remains 39 /57 variables (removed 18) and now considering 177/222 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 39/57 places, 177/222 transitions.
RANDOM walk for 33612 steps (157 resets) in 354 ms. (94 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) p0))), (F (NOT (OR p1 p2 p0))), (F p1), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F p2), (F (NOT p0)), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 13 factoid took 694 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
[2024-05-22 03:23:23] [INFO ] Invariant cache hit.
[2024-05-22 03:23:23] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-22 03:23:23] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2024-05-22 03:23:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 03:23:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-22 03:23:23] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-05-22 03:23:23] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-05-22 03:23:23] [INFO ] [Nat]Added 117 Read/Feed constraints in 23 ms returned sat
[2024-05-22 03:23:23] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 205 transitions) in 83 ms.
[2024-05-22 03:23:24] [INFO ] Added : 1 causal constraints over 1 iterations in 140 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 139 reset in 136 ms.
Product exploration explored 100000 steps with 64 reset in 314 ms.
Support contains 8 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 222/222 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-05-22 03:23:24] [INFO ] Invariant cache hit.
[2024-05-22 03:23:25] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-22 03:23:25] [INFO ] Invariant cache hit.
[2024-05-22 03:23:25] [INFO ] State equation strengthened by 117 read => feed constraints.
[2024-05-22 03:23:25] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2024-05-22 03:23:25] [INFO ] Invariant cache hit.
[2024-05-22 03:23:25] [INFO ] State equation strengthened by 117 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 221/278 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 116/181 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-22 03:23:30] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 2 ms to minimize.
[2024-05-22 03:23:31] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 1 ms to minimize.
[2024-05-22 03:23:31] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 2 ms to minimize.
[2024-05-22 03:23:33] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 1/279 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/279 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 186 constraints, problems are : Problem set: 0 solved, 221 unsolved in 17303 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 221/278 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 116/185 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 221/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/279 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/279 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 407 constraints, problems are : Problem set: 0 solved, 221 unsolved in 26243 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 57/57 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 4/4 constraints]
After SMT, in 44617ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 44622ms
Finished structural reductions in LTL mode , in 1 iterations and 44988 ms. Remains : 57/57 places, 222/222 transitions.
Treatment of property AutonomousCar-PT-06a-LTLFireability-06 finished in 152078 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(((G(p0) U p1)&&F(p2)))))'
Support contains 11 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 56 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 56 transition count 215
Applied a total of 10 rules in 2 ms. Remains 56 /61 variables (removed 5) and now considering 215/244 (removed 29) transitions.
// Phase 1: matrix 215 rows 56 cols
[2024-05-22 03:24:09] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 03:24:10] [INFO ] Implicit Places using invariants in 113 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 114 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/61 places, 215/244 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 55/61 places, 215/244 transitions.
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-07
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-07 finished in 359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X(X((F(p1)||G((!p0||X(!p2))))))))'
Support contains 13 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 58 transition count 229
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 58 transition count 229
Applied a total of 6 rules in 3 ms. Remains 58 /61 variables (removed 3) and now considering 229/244 (removed 15) transitions.
// Phase 1: matrix 229 rows 58 cols
[2024-05-22 03:24:10] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 03:24:10] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-22 03:24:10] [INFO ] Invariant cache hit.
[2024-05-22 03:24:10] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-22 03:24:10] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-05-22 03:24:10] [INFO ] Invariant cache hit.
[2024-05-22 03:24:10] [INFO ] State equation strengthened by 123 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 228/286 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 122/188 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-22 03:24:16] [INFO ] Deduced a trap composed of 18 places in 167 ms of which 4 ms to minimize.
[2024-05-22 03:24:16] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 2 ms to minimize.
[2024-05-22 03:24:16] [INFO ] Deduced a trap composed of 7 places in 164 ms of which 2 ms to minimize.
[2024-05-22 03:24:18] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 4/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 1/287 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 193 constraints, problems are : Problem set: 0 solved, 228 unsolved in 16459 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 228/286 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 122/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 228/420 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 1/287 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 421 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 4/4 constraints]
After SMT, in 47349ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 47354ms
Starting structural reductions in LTL mode, iteration 1 : 58/61 places, 229/244 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47696 ms. Remains : 58/61 places, 229/244 transitions.
Stuttering acceptance computed with spot in 425 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p0 p2), (AND (NOT p1) p2 p0), (NOT p1), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-12
Product exploration explored 100000 steps with 48 reset in 150 ms.
Product exploration explored 100000 steps with 13 reset in 150 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 98 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 400 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
RANDOM walk for 40000 steps (2295 resets) in 486 ms. (82 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p0) p2))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F p2), (F p1), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 6 factoid took 372 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 349 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Support contains 13 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 229/229 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 229/229 (removed 0) transitions.
[2024-05-22 03:25:00] [INFO ] Invariant cache hit.
[2024-05-22 03:25:00] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-22 03:25:00] [INFO ] Invariant cache hit.
[2024-05-22 03:25:00] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-22 03:25:00] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-05-22 03:25:00] [INFO ] Invariant cache hit.
[2024-05-22 03:25:00] [INFO ] State equation strengthened by 123 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 228/286 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 122/188 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-22 03:25:04] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2024-05-22 03:25:04] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2024-05-22 03:25:04] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2024-05-22 03:25:06] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 4/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 1/287 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 193 constraints, problems are : Problem set: 0 solved, 228 unsolved in 12368 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 228/286 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 122/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 228/420 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 1/287 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 421 constraints, problems are : Problem set: 0 solved, 228 unsolved in 25961 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 4/4 constraints]
After SMT, in 39116ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 39120ms
Finished structural reductions in LTL mode , in 1 iterations and 39358 ms. Remains : 58/58 places, 229/229 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
RANDOM walk for 40000 steps (2263 resets) in 309 ms. (129 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40003 steps (200 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (197 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
[2024-05-22 03:25:40] [INFO ] Invariant cache hit.
[2024-05-22 03:25:40] [INFO ] State equation strengthened by 123 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 222/272 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 122/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 13/285 variables, 7/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/286 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/287 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/287 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/287 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 189 constraints, problems are : Problem set: 0 solved, 2 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/50 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 222/272 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 122/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 13/285 variables, 7/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/286 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/287 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/287 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/287 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 191 constraints, problems are : Problem set: 0 solved, 2 unsolved in 527 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 753ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 202 ms.
Support contains 11 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 229/229 transitions.
Graph (complete) has 486 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 57 transition count 219
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 51 transition count 219
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 16 place count 51 transition count 216
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 48 transition count 216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 46 transition count 208
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 46 transition count 208
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 28 place count 45 transition count 207
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 45 transition count 201
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 76 place count 39 transition count 165
Applied a total of 76 rules in 27 ms. Remains 39 /58 variables (removed 19) and now considering 165/229 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 39/58 places, 165/229 transitions.
RANDOM walk for 40000 steps (72 resets) in 279 ms. (142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (357 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (352 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 63835 steps, run visited all 2 properties in 246 ms. (steps per millisecond=259 )
Probabilistic random walk after 63835 steps, saw 11055 distinct states, run finished after 253 ms. (steps per millisecond=252 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR (NOT p0) p1))), (F p0), (F p2), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 5 factoid took 317 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 270 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Stuttering acceptance computed with spot in 265 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Product exploration explored 100000 steps with 92 reset in 97 ms.
Product exploration explored 100000 steps with 39 reset in 104 ms.
Applying partial POR strategy [true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 328 ms :[(NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0), (AND (NOT p1) p2 p0)]
Support contains 13 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 229/229 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 58 transition count 229
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 6 place count 58 transition count 231
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 58 transition count 231
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 58 transition count 231
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 58 transition count 234
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 10 rules in 20 ms. Remains 58 /58 variables (removed 0) and now considering 234/229 (removed -5) transitions.
[2024-05-22 03:25:43] [INFO ] Redundant transitions in 17 ms returned []
Running 233 sub problems to find dead transitions.
// Phase 1: matrix 234 rows 58 cols
[2024-05-22 03:25:43] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 03:25:43] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-22 03:25:45] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-22 03:25:45] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-22 03:25:45] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-22 03:25:45] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-05-22 03:25:46] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-22 03:25:46] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
[2024-05-22 03:25:46] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
Problem TDEAD144 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 7/15 constraints. Problems are: Problem set: 7 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 7 solved, 226 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
At refinement iteration 4 (OVERLAPS) 233/291 variables, 58/73 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 126/199 constraints. Problems are: Problem set: 14 solved, 219 unsolved
[2024-05-22 03:25:49] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-22 03:25:49] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 2/201 constraints. Problems are: Problem set: 14 solved, 219 unsolved
[2024-05-22 03:25:51] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 1/202 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/202 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 1/292 variables, 1/203 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/203 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 0/292 variables, 0/203 constraints. Problems are: Problem set: 14 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 203 constraints, problems are : Problem set: 14 solved, 219 unsolved in 13621 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 14 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 8/55 variables, 8/8 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 10/18 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/18 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 232/287 variables, 55/73 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 126/199 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 219/418 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/418 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 4/291 variables, 3/421 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/421 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 10 (OVERLAPS) 1/292 variables, 1/422 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 0/422 constraints. Problems are: Problem set: 14 solved, 219 unsolved
At refinement iteration 12 (OVERLAPS) 0/292 variables, 0/422 constraints. Problems are: Problem set: 14 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 422 constraints, problems are : Problem set: 14 solved, 219 unsolved in 28820 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 219/233 constraints, Known Traps: 10/10 constraints]
After SMT, in 43070ms problems are : Problem set: 14 solved, 219 unsolved
Search for dead transitions found 14 dead transitions in 43073ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 58/58 places, 220/229 transitions.
Graph (complete) has 511 edges and 58 vertex of which 48 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 48 /58 variables (removed 10) and now considering 220/220 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/58 places, 220/229 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 43127 ms. Remains : 48/58 places, 220/229 transitions.
Support contains 13 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 229/229 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 229/229 (removed 0) transitions.
// Phase 1: matrix 229 rows 58 cols
[2024-05-22 03:26:26] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 03:26:26] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-22 03:26:26] [INFO ] Invariant cache hit.
[2024-05-22 03:26:27] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-22 03:26:27] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-05-22 03:26:27] [INFO ] Invariant cache hit.
[2024-05-22 03:26:27] [INFO ] State equation strengthened by 123 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (OVERLAPS) 228/286 variables, 58/66 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 122/188 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-22 03:26:30] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 1 ms to minimize.
[2024-05-22 03:26:31] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 1 ms to minimize.
[2024-05-22 03:26:31] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 1 ms to minimize.
[2024-05-22 03:26:32] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 4/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 1/287 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 193 constraints, problems are : Problem set: 0 solved, 228 unsolved in 12145 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 228/286 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 122/192 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 228/420 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 1/287 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 10 (OVERLAPS) 0/287 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 421 constraints, problems are : Problem set: 0 solved, 228 unsolved in 26219 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 4/4 constraints]
After SMT, in 38992ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 38995ms
Finished structural reductions in LTL mode , in 1 iterations and 39227 ms. Remains : 58/58 places, 229/229 transitions.
Treatment of property AutonomousCar-PT-06a-LTLFireability-12 finished in 175796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X(G(p1))))&&G(F(p0))))'
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 61 transition count 237
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 54 transition count 237
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 54 transition count 236
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 16 place count 53 transition count 236
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 49 transition count 208
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 49 transition count 208
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 2 with 4 rules applied. Total rules applied 28 place count 47 transition count 206
Applied a total of 28 rules in 25 ms. Remains 47 /61 variables (removed 14) and now considering 206/244 (removed 38) transitions.
[2024-05-22 03:27:06] [INFO ] Flow matrix only has 205 transitions (discarded 1 similar events)
// Phase 1: matrix 205 rows 47 cols
[2024-05-22 03:27:06] [INFO ] Computed 9 invariants in 1 ms
[2024-05-22 03:27:06] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-22 03:27:06] [INFO ] Flow matrix only has 205 transitions (discarded 1 similar events)
[2024-05-22 03:27:06] [INFO ] Invariant cache hit.
[2024-05-22 03:27:06] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-22 03:27:06] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2024-05-22 03:27:06] [INFO ] Redundant transitions in 2 ms returned []
Running 205 sub problems to find dead transitions.
[2024-05-22 03:27:06] [INFO ] Flow matrix only has 205 transitions (discarded 1 similar events)
[2024-05-22 03:27:06] [INFO ] Invariant cache hit.
[2024-05-22 03:27:06] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-22 03:27:08] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-22 03:27:08] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 204/251 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 110/168 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (OVERLAPS) 1/252 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (OVERLAPS) 0/252 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 169 constraints, problems are : Problem set: 0 solved, 205 unsolved in 8080 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 204/251 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 110/168 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 205/373 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (OVERLAPS) 1/252 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (OVERLAPS) 0/252 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 374 constraints, problems are : Problem set: 0 solved, 205 unsolved in 19682 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 2/2 constraints]
After SMT, in 28407ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 28409ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/61 places, 206/244 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28729 ms. Remains : 47/61 places, 206/244 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-14
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-14 finished in 28932 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Found a Lengthening insensitive property : AutonomousCar-PT-06a-LTLFireability-00
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 61 transition count 237
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 54 transition count 236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 53 transition count 236
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 53 transition count 235
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 52 transition count 235
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 23 place count 47 transition count 206
Iterating global reduction 3 with 5 rules applied. Total rules applied 28 place count 47 transition count 206
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 3 with 4 rules applied. Total rules applied 32 place count 45 transition count 204
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 44 transition count 204
Applied a total of 34 rules in 24 ms. Remains 44 /61 variables (removed 17) and now considering 204/244 (removed 40) transitions.
// Phase 1: matrix 204 rows 44 cols
[2024-05-22 03:27:35] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 03:27:35] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-22 03:27:35] [INFO ] Invariant cache hit.
[2024-05-22 03:27:35] [INFO ] State equation strengthened by 113 read => feed constraints.
[2024-05-22 03:27:35] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-05-22 03:27:35] [INFO ] Invariant cache hit.
[2024-05-22 03:27:35] [INFO ] State equation strengthened by 113 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 203/247 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 112/164 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-22 03:27:39] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 1/248 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/248 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 166 constraints, problems are : Problem set: 0 solved, 203 unsolved in 9303 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 44/44 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 203/247 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 112/165 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 203/368 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 1/248 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 369 constraints, problems are : Problem set: 0 solved, 203 unsolved in 22224 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 44/44 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 1/1 constraints]
After SMT, in 32519ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 32522ms
Starting structural reductions in LI_LTL mode, iteration 1 : 44/61 places, 204/244 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 32849 ms. Remains : 44/61 places, 204/244 transitions.
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-00
Product exploration explored 100000 steps with 8 reset in 70 ms.
Product exploration explored 100000 steps with 121 reset in 87 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2940 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
BEST_FIRST walk for 35714 steps (213 resets) in 30 ms. (1152 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 204/204 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-22 03:28:09] [INFO ] Invariant cache hit.
[2024-05-22 03:28:09] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-22 03:28:09] [INFO ] Invariant cache hit.
[2024-05-22 03:28:09] [INFO ] State equation strengthened by 113 read => feed constraints.
[2024-05-22 03:28:09] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-05-22 03:28:09] [INFO ] Invariant cache hit.
[2024-05-22 03:28:09] [INFO ] State equation strengthened by 113 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 203/247 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 112/164 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-22 03:28:12] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 1/248 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/248 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 166 constraints, problems are : Problem set: 0 solved, 203 unsolved in 9274 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 44/44 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 203/247 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 112/165 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 203/368 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 1/248 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 369 constraints, problems are : Problem set: 0 solved, 203 unsolved in 22149 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 44/44 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 1/1 constraints]
After SMT, in 32097ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 32099ms
Finished structural reductions in LTL mode , in 1 iterations and 32373 ms. Remains : 44/44 places, 204/204 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 35228 steps (2662 resets) in 261 ms. (134 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 115 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 75 reset in 86 ms.
Product exploration explored 100000 steps with 190 reset in 102 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 204/204 transitions.
Applied a total of 0 rules in 9 ms. Remains 44 /44 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-22 03:28:43] [INFO ] Redundant transitions in 16 ms returned []
Running 203 sub problems to find dead transitions.
[2024-05-22 03:28:43] [INFO ] Invariant cache hit.
[2024-05-22 03:28:43] [INFO ] State equation strengthened by 113 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 203/247 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 112/164 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-22 03:28:46] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 1/248 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/248 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 166 constraints, problems are : Problem set: 0 solved, 203 unsolved in 9441 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 44/44 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 203/247 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 112/165 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 203/368 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 1/248 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 369 constraints, problems are : Problem set: 0 solved, 203 unsolved in 23026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 44/44 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 1/1 constraints]
After SMT, in 33309ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 33312ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33343 ms. Remains : 44/44 places, 204/204 transitions.
Support contains 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-22 03:29:16] [INFO ] Invariant cache hit.
[2024-05-22 03:29:16] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-22 03:29:16] [INFO ] Invariant cache hit.
[2024-05-22 03:29:16] [INFO ] State equation strengthened by 113 read => feed constraints.
[2024-05-22 03:29:16] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2024-05-22 03:29:16] [INFO ] Invariant cache hit.
[2024-05-22 03:29:16] [INFO ] State equation strengthened by 113 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 203/247 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 112/164 constraints. Problems are: Problem set: 0 solved, 203 unsolved
[2024-05-22 03:29:20] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 1/248 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (OVERLAPS) 0/248 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 166 constraints, problems are : Problem set: 0 solved, 203 unsolved in 9169 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 44/44 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 203/247 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 112/165 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 203/368 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 1/248 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 369 constraints, problems are : Problem set: 0 solved, 203 unsolved in 22356 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 44/44 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 1/1 constraints]
After SMT, in 32232ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 32236ms
Finished structural reductions in LTL mode , in 1 iterations and 32506 ms. Remains : 44/44 places, 204/204 transitions.
Treatment of property AutonomousCar-PT-06a-LTLFireability-00 finished in 133841 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((X((p0&&(p1 U p2)))&&G(p0))))'
Found a Shortening insensitive property : AutonomousCar-PT-06a-LTLFireability-06
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2)]
Support contains 8 out of 61 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 61/61 places, 244/244 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 61 transition count 238
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 55 transition count 236
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 53 transition count 236
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 53 transition count 235
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 52 transition count 235
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 22 place count 48 transition count 213
Iterating global reduction 3 with 4 rules applied. Total rules applied 26 place count 48 transition count 213
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 3 with 4 rules applied. Total rules applied 30 place count 46 transition count 211
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 45 transition count 211
Applied a total of 32 rules in 18 ms. Remains 45 /61 variables (removed 16) and now considering 211/244 (removed 33) transitions.
// Phase 1: matrix 211 rows 45 cols
[2024-05-22 03:29:49] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 03:29:49] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-22 03:29:49] [INFO ] Invariant cache hit.
[2024-05-22 03:29:50] [INFO ] State equation strengthened by 119 read => feed constraints.
[2024-05-22 03:29:50] [INFO ] Implicit Places using invariants and state equation in 964 ms returned []
Implicit Place search using SMT with State Equation took 1053 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2024-05-22 03:29:50] [INFO ] Invariant cache hit.
[2024-05-22 03:29:50] [INFO ] State equation strengthened by 119 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 210/255 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 118/171 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-22 03:29:54] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 1/256 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 173 constraints, problems are : Problem set: 0 solved, 210 unsolved in 10012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 210/255 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 118/172 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 210/382 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (OVERLAPS) 1/256 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 10 (OVERLAPS) 0/256 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 383 constraints, problems are : Problem set: 0 solved, 210 unsolved in 22394 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 1/1 constraints]
After SMT, in 33116ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 33119ms
Starting structural reductions in LI_LTL mode, iteration 1 : 45/61 places, 211/244 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 34192 ms. Remains : 45/61 places, 211/244 transitions.
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-06
Product exploration explored 100000 steps with 218 reset in 78 ms.
Product exploration explored 100000 steps with 51 reset in 80 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X p0), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 164 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
RANDOM walk for 40000 steps (2841 resets) in 443 ms. (90 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (214 resets) in 77 ms. (512 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (222 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (230 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
[2024-05-22 03:30:24] [INFO ] Invariant cache hit.
[2024-05-22 03:30:24] [INFO ] State equation strengthened by 119 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/41 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 208/249 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 118/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/255 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/256 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/256 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/256 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 172 constraints, problems are : Problem set: 0 solved, 3 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/41 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 208/249 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 118/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/255 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/256 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/256 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 175 constraints, problems are : Problem set: 0 solved, 3 unsolved in 504 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 750ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 260 ms.
Support contains 8 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 211/211 transitions.
Graph (complete) has 470 edges and 45 vertex of which 44 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 44 transition count 208
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 44 transition count 204
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 35 place count 40 transition count 180
Applied a total of 35 rules in 18 ms. Remains 40 /45 variables (removed 5) and now considering 180/211 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 40/45 places, 180/211 transitions.
RANDOM walk for 37710 steps (1003 resets) in 534 ms. (70 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X p0), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) p0))), (F (NOT (OR p1 p2 p0))), (F p1), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F p2), (F (NOT p0)), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 13 factoid took 483 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
[2024-05-22 03:30:26] [INFO ] Invariant cache hit.
[2024-05-22 03:30:26] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 03:30:26] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-22 03:30:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 03:30:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-22 03:30:26] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-22 03:30:26] [INFO ] State equation strengthened by 119 read => feed constraints.
[2024-05-22 03:30:26] [INFO ] [Nat]Added 119 Read/Feed constraints in 17 ms returned sat
[2024-05-22 03:30:26] [INFO ] Computed and/alt/rep : 4/6/4 causal constraints (skipped 206 transitions) in 35 ms.
[2024-05-22 03:30:26] [INFO ] Added : 0 causal constraints over 0 iterations in 56 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 8 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 211/211 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2024-05-22 03:30:26] [INFO ] Invariant cache hit.
[2024-05-22 03:30:26] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-22 03:30:26] [INFO ] Invariant cache hit.
[2024-05-22 03:30:27] [INFO ] State equation strengthened by 119 read => feed constraints.
[2024-05-22 03:30:27] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2024-05-22 03:30:27] [INFO ] Invariant cache hit.
[2024-05-22 03:30:27] [INFO ] State equation strengthened by 119 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 210/255 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 118/171 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-22 03:30:31] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 1/256 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 173 constraints, problems are : Problem set: 0 solved, 210 unsolved in 10295 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 210/255 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 118/172 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 210/382 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (OVERLAPS) 1/256 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 10 (OVERLAPS) 0/256 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 383 constraints, problems are : Problem set: 0 solved, 210 unsolved in 22210 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 1/1 constraints]
After SMT, in 33238ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 33241ms
Finished structural reductions in LTL mode , in 1 iterations and 33524 ms. Remains : 45/45 places, 211/211 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 157 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
RANDOM walk for 40000 steps (3017 resets) in 609 ms. (65 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40003 steps (233 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (222 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (219 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
[2024-05-22 03:31:00] [INFO ] Invariant cache hit.
[2024-05-22 03:31:00] [INFO ] State equation strengthened by 119 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/41 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 208/249 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 118/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/255 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/256 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/256 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/256 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 172 constraints, problems are : Problem set: 0 solved, 3 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/41 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 208/249 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 118/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/255 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/256 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/256 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/256 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 175 constraints, problems are : Problem set: 0 solved, 3 unsolved in 469 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 692ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 261 ms.
Support contains 8 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 211/211 transitions.
Graph (complete) has 470 edges and 45 vertex of which 44 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 44 transition count 208
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 44 transition count 204
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 35 place count 40 transition count 180
Applied a total of 35 rules in 15 ms. Remains 40 /45 variables (removed 5) and now considering 180/211 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 40/45 places, 180/211 transitions.
RANDOM walk for 40000 steps (1136 resets) in 755 ms. (52 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (258 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (256 resets) in 118 ms. (336 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (257 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 51155 steps, run visited all 3 properties in 285 ms. (steps per millisecond=179 )
Probabilistic random walk after 51155 steps, saw 9280 distinct states, run finished after 286 ms. (steps per millisecond=178 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p0), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) p0))), (F (NOT (OR p1 p2 p0))), (F p1), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F p2), (F (NOT p0)), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 13 factoid took 452 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
[2024-05-22 03:31:03] [INFO ] Invariant cache hit.
[2024-05-22 03:31:03] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 03:31:03] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-22 03:31:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 03:31:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 03:31:03] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-22 03:31:03] [INFO ] State equation strengthened by 119 read => feed constraints.
[2024-05-22 03:31:03] [INFO ] [Nat]Added 119 Read/Feed constraints in 15 ms returned sat
[2024-05-22 03:31:03] [INFO ] Computed and/alt/rep : 4/6/4 causal constraints (skipped 206 transitions) in 27 ms.
[2024-05-22 03:31:03] [INFO ] Added : 0 causal constraints over 0 iterations in 48 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 27 reset in 73 ms.
Product exploration explored 100000 steps with 8 reset in 77 ms.
Support contains 8 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 211/211 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2024-05-22 03:31:04] [INFO ] Invariant cache hit.
[2024-05-22 03:31:04] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-22 03:31:04] [INFO ] Invariant cache hit.
[2024-05-22 03:31:04] [INFO ] State equation strengthened by 119 read => feed constraints.
[2024-05-22 03:31:04] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2024-05-22 03:31:04] [INFO ] Invariant cache hit.
[2024-05-22 03:31:04] [INFO ] State equation strengthened by 119 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 210/255 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 118/171 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-22 03:31:09] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 1/256 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 173 constraints, problems are : Problem set: 0 solved, 210 unsolved in 14474 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 210/255 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 118/172 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 210/382 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (OVERLAPS) 1/256 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 10 (OVERLAPS) 0/256 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 383 constraints, problems are : Problem set: 0 solved, 210 unsolved in 25630 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 45/45 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 1/1 constraints]
After SMT, in 40745ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 40748ms
Finished structural reductions in LTL mode , in 1 iterations and 40993 ms. Remains : 45/45 places, 211/211 transitions.
Treatment of property AutonomousCar-PT-06a-LTLFireability-06 finished in 116523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X(X((F(p1)||G((!p0||X(!p2))))))))'
[2024-05-22 03:31:45] [INFO ] Flatten gal took : 43 ms
[2024-05-22 03:31:45] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-05-22 03:31:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 61 places, 244 transitions and 2067 arcs took 10 ms.
Total runtime 870778 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutonomousCar-PT-06a

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 2354
MODEL NAME: /home/mcc/execution/416/model
61 places, 244 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-06a-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-06a-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-06a-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716348711414

--------------------
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-06a"
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-06a, 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-171620166300300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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