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.r468-smll-171620167400284.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 ltsminxred
Input is AutonomousCar-PT-05a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167400284
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1717211748982

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-05a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 03:15:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 03:15:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 03:15:51] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2024-06-01 03:15:51] [INFO ] Transformed 57 places.
[2024-06-01 03:15:51] [INFO ] Transformed 289 transitions.
[2024-06-01 03:15:51] [INFO ] Found NUPN structural information;
[2024-06-01 03:15:51] [INFO ] Parsed PT model containing 57 places and 289 transitions and 2123 arcs in 309 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 113 transitions
Reduce redundant transitions removed 113 transitions.
FORMULA AutonomousCar-PT-05a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 176/176 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 56 transition count 175
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 56 transition count 175
Applied a total of 2 rules in 56 ms. Remains 56 /57 variables (removed 1) and now considering 175/176 (removed 1) transitions.
// Phase 1: matrix 175 rows 56 cols
[2024-06-01 03:15:52] [INFO ] Computed 9 invariants in 14 ms
[2024-06-01 03:15:52] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-06-01 03:15:52] [INFO ] Invariant cache hit.
[2024-06-01 03:15:52] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-06-01 03:15:52] [INFO ] Implicit Places using invariants and state equation in 292 ms returned [52, 54]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 645 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/57 places, 175/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 54 /54 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 747 ms. Remains : 54/57 places, 175/176 transitions.
Support contains 39 out of 54 places after structural reductions.
[2024-06-01 03:15:53] [INFO ] Flatten gal took : 105 ms
[2024-06-01 03:15:53] [INFO ] Flatten gal took : 50 ms
[2024-06-01 03:15:53] [INFO ] Input system was already deterministic with 175 transitions.
Support contains 37 out of 54 places (down from 39) after GAL structural reductions.
RANDOM walk for 40000 steps (2330 resets) in 3450 ms. (11 steps per ms) remains 3/29 properties
BEST_FIRST walk for 40004 steps (316 resets) in 147 ms. (270 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (325 resets) in 160 ms. (248 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (588 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
// Phase 1: matrix 175 rows 54 cols
[2024-06-01 03:15:54] [INFO ] Computed 7 invariants in 7 ms
[2024-06-01 03:15:54] [INFO ] State equation strengthened by 103 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 30/47 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 171/218 variables, 47/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 102/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 10/228 variables, 7/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/229 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/229 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 164 constraints, problems are : Problem set: 0 solved, 3 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 54/54 constraints, ReadFeed: 103/103 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/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 30/47 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 171/218 variables, 47/54 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 102/156 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 0/156 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/228 variables, 7/163 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 1/164 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/164 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/229 variables, 1/165 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/165 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/229 variables, 0/165 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 165 constraints, problems are : Problem set: 2 solved, 1 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 54/54 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 672ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 175/175 transitions.
Graph (complete) has 386 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 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 8 rules applied. Total rules applied 9 place count 53 transition count 166
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 47 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 46 transition count 165
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 22 place count 41 transition count 135
Iterating global reduction 3 with 5 rules applied. Total rules applied 27 place count 41 transition count 135
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 33 place count 38 transition count 132
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 37 place count 38 transition count 128
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 61 place count 34 transition count 108
Applied a total of 61 rules in 74 ms. Remains 34 /54 variables (removed 20) and now considering 108/175 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 34/54 places, 108/175 transitions.
RANDOM walk for 40000 steps (916 resets) in 254 ms. (156 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (347 resets) in 176 ms. (226 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 13607 steps, run visited all 1 properties in 59 ms. (steps per millisecond=230 )
Probabilistic random walk after 13607 steps, saw 3072 distinct states, run finished after 65 ms. (steps per millisecond=209 ) properties seen :1
FORMULA AutonomousCar-PT-05a-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA AutonomousCar-PT-05a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05a-LTLFireability-09 TRUE 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((p0 U p1))||G(p2)))'
Support contains 7 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 50 transition count 151
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 50 transition count 151
Applied a total of 8 rules in 6 ms. Remains 50 /54 variables (removed 4) and now considering 151/175 (removed 24) transitions.
// Phase 1: matrix 151 rows 50 cols
[2024-06-01 03:15:56] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 03:15:56] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-01 03:15:56] [INFO ] Invariant cache hit.
[2024-06-01 03:15:56] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-06-01 03:15:56] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-06-01 03:15:56] [INFO ] Invariant cache hit.
[2024-06-01 03:15:56] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 150/200 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 82/139 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-06-01 03:15:59] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 10 ms to minimize.
[2024-06-01 03:15:59] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 3 ms to minimize.
[2024-06-01 03:15:59] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 1/201 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 143 constraints, problems are : Problem set: 0 solved, 150 unsolved in 6291 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 150/200 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 82/142 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 150/292 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 1/201 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 293 constraints, problems are : Problem set: 0 solved, 150 unsolved in 8461 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 3/3 constraints]
After SMT, in 15302ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 15307ms
Starting structural reductions in LTL mode, iteration 1 : 50/54 places, 151/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15539 ms. Remains : 50/54 places, 151/175 transitions.
Stuttering acceptance computed with spot in 613 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-00 finished in 16232 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 50 transition count 151
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 50 transition count 151
Applied a total of 8 rules in 5 ms. Remains 50 /54 variables (removed 4) and now considering 151/175 (removed 24) transitions.
// Phase 1: matrix 151 rows 50 cols
[2024-06-01 03:16:12] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 03:16:12] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 03:16:12] [INFO ] Invariant cache hit.
[2024-06-01 03:16:12] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-06-01 03:16:12] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-06-01 03:16:12] [INFO ] Invariant cache hit.
[2024-06-01 03:16:12] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 150/200 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 82/139 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-06-01 03:16:14] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-06-01 03:16:14] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2024-06-01 03:16:15] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 1/201 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 143 constraints, problems are : Problem set: 0 solved, 150 unsolved in 6285 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 150/200 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 82/142 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 150/292 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 1/201 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 293 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9248 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 3/3 constraints]
After SMT, in 15810ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 15812ms
Starting structural reductions in LTL mode, iteration 1 : 50/54 places, 151/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16027 ms. Remains : 50/54 places, 151/175 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-01 finished in 16151 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 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 6 rules applied. Total rules applied 6 place count 52 transition count 169
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 47 transition count 167
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 45 transition count 167
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 45 transition count 166
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 17 place count 44 transition count 166
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 22 place count 39 transition count 136
Iterating global reduction 3 with 5 rules applied. Total rules applied 27 place count 39 transition count 136
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 3 with 4 rules applied. Total rules applied 31 place count 37 transition count 134
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 33 place count 36 transition count 134
Applied a total of 33 rules in 36 ms. Remains 36 /54 variables (removed 18) and now considering 134/175 (removed 41) transitions.
// Phase 1: matrix 134 rows 36 cols
[2024-06-01 03:16:28] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 03:16:28] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 03:16:28] [INFO ] Invariant cache hit.
[2024-06-01 03:16:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 03:16:28] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-06-01 03:16:28] [INFO ] Redundant transitions in 24 ms returned []
Running 133 sub problems to find dead transitions.
[2024-06-01 03:16:28] [INFO ] Invariant cache hit.
[2024-06-01 03:16:28] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 133/169 variables, 36/42 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-06-01 03:16:30] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 1/170 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 0/170 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 45 constraints, problems are : Problem set: 0 solved, 133 unsolved in 3486 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 36/36 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 133/169 variables, 36/43 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 133/177 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 1/170 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 0/170 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 178 constraints, problems are : Problem set: 0 solved, 133 unsolved in 7890 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 36/36 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 1/1 constraints]
After SMT, in 11641ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 11645ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/54 places, 134/175 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11896 ms. Remains : 36/54 places, 134/175 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-03
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-03 finished in 11993 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((!p1&&X(p0))||X(G(p0)))))'
Support contains 12 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 50 transition count 151
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 50 transition count 151
Applied a total of 8 rules in 8 ms. Remains 50 /54 variables (removed 4) and now considering 151/175 (removed 24) transitions.
// Phase 1: matrix 151 rows 50 cols
[2024-06-01 03:16:40] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 03:16:40] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 03:16:40] [INFO ] Invariant cache hit.
[2024-06-01 03:16:40] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-06-01 03:16:40] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-06-01 03:16:40] [INFO ] Invariant cache hit.
[2024-06-01 03:16:40] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 150/200 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 82/139 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-06-01 03:16:42] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-06-01 03:16:42] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-06-01 03:16:43] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 1/201 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 143 constraints, problems are : Problem set: 0 solved, 150 unsolved in 6034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 150/200 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 82/142 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 150/292 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 1/201 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 293 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10309 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 3/3 constraints]
After SMT, in 16612ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 16614ms
Starting structural reductions in LTL mode, iteration 1 : 50/54 places, 151/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16810 ms. Remains : 50/54 places, 151/175 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 672 ms.
Product exploration explored 100000 steps with 50000 reset in 546 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)), (X (NOT (AND p1 p0))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 25 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-05a-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-05a-LTLFireability-04 finished in 18190 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(F(p0))))'
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 49 transition count 145
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 49 transition count 145
Applied a total of 10 rules in 3 ms. Remains 49 /54 variables (removed 5) and now considering 145/175 (removed 30) transitions.
// Phase 1: matrix 145 rows 49 cols
[2024-06-01 03:16:58] [INFO ] Computed 7 invariants in 3 ms
[2024-06-01 03:16:59] [INFO ] Implicit Places using invariants in 132 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 135 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/54 places, 145/175 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139 ms. Remains : 48/54 places, 145/175 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-06
Product exploration explored 100000 steps with 33333 reset in 330 ms.
Product exploration explored 100000 steps with 33333 reset in 391 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-05a-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-05a-LTLFireability-06 finished in 1001 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((F(p0)&&!p0))) U p1))'
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 175/175 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 54 transition count 169
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 48 transition count 169
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 48 transition count 168
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 14 place count 47 transition count 168
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 43 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 43 transition count 144
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 26 place count 41 transition count 142
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 28 place count 40 transition count 142
Applied a total of 28 rules in 23 ms. Remains 40 /54 variables (removed 14) and now considering 142/175 (removed 33) transitions.
// Phase 1: matrix 142 rows 40 cols
[2024-06-01 03:16:59] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 03:16:59] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 03:16:59] [INFO ] Invariant cache hit.
[2024-06-01 03:17:00] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-06-01 03:17:00] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-06-01 03:17:00] [INFO ] Redundant transitions in 17 ms returned []
Running 141 sub problems to find dead transitions.
[2024-06-01 03:17:00] [INFO ] Invariant cache hit.
[2024-06-01 03:17:00] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 141/181 variables, 40/47 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 84/131 constraints. Problems are: Problem set: 0 solved, 141 unsolved
[2024-06-01 03:17:02] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 1/182 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (OVERLAPS) 0/182 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 133 constraints, problems are : Problem set: 0 solved, 141 unsolved in 5127 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 40/40 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (OVERLAPS) 141/181 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 84/132 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 141/273 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 1/182 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 274 constraints, problems are : Problem set: 0 solved, 141 unsolved in 9706 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 40/40 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 1/1 constraints]
After SMT, in 15146ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 15148ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/54 places, 142/175 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15389 ms. Remains : 40/54 places, 142/175 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p1), true, true]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-07
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-07 finished in 15581 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((X((G(p0)&&p1)) U p2)||!F(p0)) U p0))'
Support contains 7 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 50 transition count 151
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 50 transition count 151
Applied a total of 8 rules in 3 ms. Remains 50 /54 variables (removed 4) and now considering 151/175 (removed 24) transitions.
// Phase 1: matrix 151 rows 50 cols
[2024-06-01 03:17:15] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 03:17:15] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 03:17:15] [INFO ] Invariant cache hit.
[2024-06-01 03:17:15] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-06-01 03:17:15] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-06-01 03:17:15] [INFO ] Invariant cache hit.
[2024-06-01 03:17:15] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 150/200 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 82/139 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-06-01 03:17:17] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-06-01 03:17:17] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-06-01 03:17:17] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 1/201 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 143 constraints, problems are : Problem set: 0 solved, 150 unsolved in 6013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 150/200 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 82/142 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 150/292 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 1/201 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 293 constraints, problems are : Problem set: 0 solved, 150 unsolved in 8161 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 3/3 constraints]
After SMT, in 14427ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 14428ms
Starting structural reductions in LTL mode, iteration 1 : 50/54 places, 151/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14650 ms. Remains : 50/54 places, 151/175 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), true, (OR (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-10 finished in 14823 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 50 transition count 151
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 50 transition count 151
Applied a total of 8 rules in 3 ms. Remains 50 /54 variables (removed 4) and now considering 151/175 (removed 24) transitions.
// Phase 1: matrix 151 rows 50 cols
[2024-06-01 03:17:30] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 03:17:30] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 03:17:30] [INFO ] Invariant cache hit.
[2024-06-01 03:17:30] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-06-01 03:17:30] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-06-01 03:17:30] [INFO ] Invariant cache hit.
[2024-06-01 03:17:30] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 150/200 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 82/139 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-06-01 03:17:32] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-06-01 03:17:32] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-06-01 03:17:32] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 1/201 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 143 constraints, problems are : Problem set: 0 solved, 150 unsolved in 7388 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 150/200 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 82/142 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 150/292 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 1/201 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 293 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12148 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 3/3 constraints]
After SMT, in 19804ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 19806ms
Starting structural reductions in LTL mode, iteration 1 : 50/54 places, 151/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20032 ms. Remains : 50/54 places, 151/175 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-11
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-11 finished in 20135 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 (p1||G(p0))))))'
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 175/175 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 54 transition count 169
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 48 transition count 168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 47 transition count 168
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 47 transition count 167
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 16 place count 46 transition count 167
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 20 place count 42 transition count 143
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 42 transition count 143
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 3 with 4 rules applied. Total rules applied 28 place count 40 transition count 141
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 30 place count 39 transition count 141
Applied a total of 30 rules in 24 ms. Remains 39 /54 variables (removed 15) and now considering 141/175 (removed 34) transitions.
// Phase 1: matrix 141 rows 39 cols
[2024-06-01 03:17:50] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 03:17:50] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 03:17:50] [INFO ] Invariant cache hit.
[2024-06-01 03:17:50] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-06-01 03:17:50] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2024-06-01 03:17:50] [INFO ] Redundant transitions in 18 ms returned []
Running 140 sub problems to find dead transitions.
[2024-06-01 03:17:50] [INFO ] Invariant cache hit.
[2024-06-01 03:17:50] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 140/179 variables, 39/46 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 84/130 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 03:17:53] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 1/180 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/180 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 132 constraints, problems are : Problem set: 0 solved, 140 unsolved in 6974 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 39/39 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 140/179 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 84/131 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 140/271 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 1/180 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (OVERLAPS) 0/180 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 272 constraints, problems are : Problem set: 0 solved, 140 unsolved in 12953 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 39/39 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 1/1 constraints]
After SMT, in 20325ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 20327ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/54 places, 141/175 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20641 ms. Remains : 39/54 places, 141/175 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-12
Product exploration explored 100000 steps with 1179 reset in 302 ms.
Product exploration explored 100000 steps with 718 reset in 355 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 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 130 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 4969 steps (396 resets) in 42 ms. (115 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 238 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 141/141 transitions.
Applied a total of 0 rules in 7 ms. Remains 39 /39 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2024-06-01 03:18:12] [INFO ] Invariant cache hit.
[2024-06-01 03:18:12] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 03:18:12] [INFO ] Invariant cache hit.
[2024-06-01 03:18:12] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-06-01 03:18:12] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-06-01 03:18:12] [INFO ] Redundant transitions in 28 ms returned []
Running 140 sub problems to find dead transitions.
[2024-06-01 03:18:12] [INFO ] Invariant cache hit.
[2024-06-01 03:18:12] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 140/179 variables, 39/46 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 84/130 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 03:18:15] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 1/180 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/180 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 132 constraints, problems are : Problem set: 0 solved, 140 unsolved in 6218 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 39/39 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 140/179 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 84/131 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 140/271 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 1/180 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (OVERLAPS) 0/180 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 272 constraints, problems are : Problem set: 0 solved, 140 unsolved in 13623 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 39/39 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 1/1 constraints]
After SMT, in 20193ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 20194ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20455 ms. Remains : 39/39 places, 141/141 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 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (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 9 factoid took 131 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 7231 steps (512 resets) in 38 ms. (185 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (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 p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 326 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 72 reset in 81 ms.
Product exploration explored 100000 steps with 258 reset in 128 ms.
Support contains 5 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 141/141 transitions.
Applied a total of 0 rules in 14 ms. Remains 39 /39 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2024-06-01 03:18:34] [INFO ] Invariant cache hit.
[2024-06-01 03:18:34] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-01 03:18:34] [INFO ] Invariant cache hit.
[2024-06-01 03:18:34] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-06-01 03:18:34] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2024-06-01 03:18:34] [INFO ] Redundant transitions in 18 ms returned []
Running 140 sub problems to find dead transitions.
[2024-06-01 03:18:34] [INFO ] Invariant cache hit.
[2024-06-01 03:18:34] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 140/179 variables, 39/46 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 84/130 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 03:18:36] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 1/180 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/180 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 132 constraints, problems are : Problem set: 0 solved, 140 unsolved in 7506 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 39/39 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 140/179 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 84/131 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 140/271 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 1/180 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (OVERLAPS) 0/180 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 272 constraints, problems are : Problem set: 0 solved, 140 unsolved in 12612 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 39/39 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 1/1 constraints]
After SMT, in 20408ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 20409ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20752 ms. Remains : 39/39 places, 141/141 transitions.
Treatment of property AutonomousCar-PT-05a-LTLFireability-12 finished in 64440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||G(p1)))||(F(p2)&&X(p3))))'
Support contains 9 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 175/175 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 50 transition count 151
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 50 transition count 151
Applied a total of 8 rules in 2 ms. Remains 50 /54 variables (removed 4) and now considering 151/175 (removed 24) transitions.
// Phase 1: matrix 151 rows 50 cols
[2024-06-01 03:18:54] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 03:18:54] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 03:18:54] [INFO ] Invariant cache hit.
[2024-06-01 03:18:55] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-06-01 03:18:55] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-06-01 03:18:55] [INFO ] Invariant cache hit.
[2024-06-01 03:18:55] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 150/200 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 82/139 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-06-01 03:18:57] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 2 ms to minimize.
[2024-06-01 03:18:57] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 2 ms to minimize.
[2024-06-01 03:18:57] [INFO ] Deduced a trap composed of 7 places in 110 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 1/201 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 143 constraints, problems are : Problem set: 0 solved, 150 unsolved in 8770 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 150/200 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 82/142 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 150/292 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 1/201 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 293 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12223 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 3/3 constraints]
After SMT, in 21231ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 21234ms
Starting structural reductions in LTL mode, iteration 1 : 50/54 places, 151/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21405 ms. Remains : 50/54 places, 151/175 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-13
Product exploration explored 100000 steps with 92 reset in 96 ms.
Product exploration explored 100000 steps with 1 reset in 103 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) p2 p1 (NOT p3)), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p3))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 106 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2271 resets) in 206 ms. (193 steps per ms) remains 1/4 properties
BEST_FIRST walk for 37495 steps (262 resets) in 189 ms. (197 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p2 p1 (NOT p3)), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p3))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 15 factoid took 306 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 50 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 151/151 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 151/151 (removed 0) transitions.
[2024-06-01 03:19:17] [INFO ] Invariant cache hit.
[2024-06-01 03:19:17] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 03:19:17] [INFO ] Invariant cache hit.
[2024-06-01 03:19:17] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-06-01 03:19:17] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-06-01 03:19:17] [INFO ] Invariant cache hit.
[2024-06-01 03:19:17] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 150/200 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 82/139 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-06-01 03:19:21] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 4 ms to minimize.
[2024-06-01 03:19:21] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-06-01 03:19:21] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 1/201 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 143 constraints, problems are : Problem set: 0 solved, 150 unsolved in 9243 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 150/200 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 82/142 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 150/292 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 1/201 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 293 constraints, problems are : Problem set: 0 solved, 150 unsolved in 13583 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 3/3 constraints]
After SMT, in 23263ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 23269ms
Finished structural reductions in LTL mode , in 1 iterations and 23551 ms. Remains : 50/50 places, 151/151 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 p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 114 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 35735 steps (2008 resets) in 185 ms. (192 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 259 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 165 ms.
Product exploration explored 100000 steps with 27 reset in 178 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 151/151 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 50 transition count 151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 6 place count 50 transition count 153
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 50 transition count 153
Performed 2 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 2 rules applied. Total rules applied 9 place count 50 transition count 153
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 49 transition count 152
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 49 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 49 transition count 155
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 12 rules in 32 ms. Remains 49 /50 variables (removed 1) and now considering 155/151 (removed -4) transitions.
[2024-06-01 03:19:43] [INFO ] Redundant transitions in 26 ms returned []
Running 154 sub problems to find dead transitions.
// Phase 1: matrix 155 rows 49 cols
[2024-06-01 03:19:43] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 03:19:43] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-06-01 03:19:44] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 03:19:44] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 4 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-01 03:19:44] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 2 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-06-01 03:19:45] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-06-01 03:19:45] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 5/12 constraints. Problems are: Problem set: 5 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 5 solved, 149 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
At refinement iteration 4 (OVERLAPS) 154/203 variables, 49/61 constraints. Problems are: Problem set: 13 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 86/147 constraints. Problems are: Problem set: 13 solved, 141 unsolved
[2024-06-01 03:19:47] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 1/148 constraints. Problems are: Problem set: 13 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/148 constraints. Problems are: Problem set: 13 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 1/204 variables, 1/149 constraints. Problems are: Problem set: 13 solved, 141 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/149 constraints. Problems are: Problem set: 13 solved, 141 unsolved
At refinement iteration 10 (OVERLAPS) 0/204 variables, 0/149 constraints. Problems are: Problem set: 13 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 149 constraints, problems are : Problem set: 13 solved, 141 unsolved in 9598 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 49/49 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 13 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 6/45 variables, 7/7 constraints. Problems are: Problem set: 13 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 6/13 constraints. Problems are: Problem set: 13 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/13 constraints. Problems are: Problem set: 13 solved, 141 unsolved
At refinement iteration 4 (OVERLAPS) 153/198 variables, 45/58 constraints. Problems are: Problem set: 13 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 86/144 constraints. Problems are: Problem set: 13 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 141/285 constraints. Problems are: Problem set: 13 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/285 constraints. Problems are: Problem set: 13 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 5/203 variables, 4/289 constraints. Problems are: Problem set: 13 solved, 141 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/289 constraints. Problems are: Problem set: 13 solved, 141 unsolved
At refinement iteration 10 (OVERLAPS) 1/204 variables, 1/290 constraints. Problems are: Problem set: 13 solved, 141 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/204 variables, 0/290 constraints. Problems are: Problem set: 13 solved, 141 unsolved
At refinement iteration 12 (OVERLAPS) 0/204 variables, 0/290 constraints. Problems are: Problem set: 13 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 290 constraints, problems are : Problem set: 13 solved, 141 unsolved in 16557 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 49/49 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 141/154 constraints, Known Traps: 6/6 constraints]
After SMT, in 26594ms problems are : Problem set: 13 solved, 141 unsolved
Search for dead transitions found 13 dead transitions in 26599ms
Found 13 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 13 transitions
Dead transitions reduction (with SMT) removed 13 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 49/50 places, 142/151 transitions.
Graph (complete) has 380 edges and 49 vertex of which 40 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 40 /49 variables (removed 9) and now considering 142/142 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/50 places, 142/151 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26686 ms. Remains : 40/50 places, 142/151 transitions.
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 151/151 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 151/151 (removed 0) transitions.
// Phase 1: matrix 151 rows 50 cols
[2024-06-01 03:20:09] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 03:20:10] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-01 03:20:10] [INFO ] Invariant cache hit.
[2024-06-01 03:20:10] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-06-01 03:20:10] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-06-01 03:20:10] [INFO ] Invariant cache hit.
[2024-06-01 03:20:10] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 150/200 variables, 50/57 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 82/139 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-06-01 03:20:13] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 2 ms to minimize.
[2024-06-01 03:20:13] [INFO ] Deduced a trap composed of 14 places in 118 ms of which 2 ms to minimize.
[2024-06-01 03:20:13] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 1/201 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 143 constraints, problems are : Problem set: 0 solved, 150 unsolved in 7756 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 150/200 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 82/142 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 150/292 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 1/201 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 293 constraints, problems are : Problem set: 0 solved, 150 unsolved in 10655 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 3/3 constraints]
After SMT, in 18792ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 18795ms
Finished structural reductions in LTL mode , in 1 iterations and 19057 ms. Remains : 50/50 places, 151/151 transitions.
Treatment of property AutonomousCar-PT-05a-LTLFireability-13 finished in 94148 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 175/175 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 54 transition count 168
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 47 transition count 168
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 47 transition count 167
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 46 transition count 167
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 42 transition count 143
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 42 transition count 143
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 40 transition count 141
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 39 transition count 141
Applied a total of 30 rules in 26 ms. Remains 39 /54 variables (removed 15) and now considering 141/175 (removed 34) transitions.
// Phase 1: matrix 141 rows 39 cols
[2024-06-01 03:20:29] [INFO ] Computed 7 invariants in 9 ms
[2024-06-01 03:20:29] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 03:20:29] [INFO ] Invariant cache hit.
[2024-06-01 03:20:29] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-06-01 03:20:29] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2024-06-01 03:20:29] [INFO ] Redundant transitions in 17 ms returned []
Running 140 sub problems to find dead transitions.
[2024-06-01 03:20:29] [INFO ] Invariant cache hit.
[2024-06-01 03:20:29] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 140/179 variables, 39/46 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 84/130 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 03:20:31] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 1/180 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/180 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 132 constraints, problems are : Problem set: 0 solved, 140 unsolved in 6269 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 39/39 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 140/179 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 84/131 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 140/271 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 1/180 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (OVERLAPS) 0/180 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 272 constraints, problems are : Problem set: 0 solved, 140 unsolved in 13005 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 39/39 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 1/1 constraints]
After SMT, in 19732ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 19734ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/54 places, 141/175 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20013 ms. Remains : 39/54 places, 141/175 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-14
Product exploration explored 100000 steps with 14 reset in 65 ms.
Product exploration explored 100000 steps with 20 reset in 74 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 821 steps (63 resets) in 7 ms. (102 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 141/141 transitions.
Applied a total of 0 rules in 7 ms. Remains 39 /39 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2024-06-01 03:20:49] [INFO ] Invariant cache hit.
[2024-06-01 03:20:49] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-01 03:20:49] [INFO ] Invariant cache hit.
[2024-06-01 03:20:49] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-06-01 03:20:49] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-06-01 03:20:49] [INFO ] Redundant transitions in 18 ms returned []
Running 140 sub problems to find dead transitions.
[2024-06-01 03:20:49] [INFO ] Invariant cache hit.
[2024-06-01 03:20:49] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 140/179 variables, 39/46 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 84/130 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 03:20:52] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 1/180 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/180 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 132 constraints, problems are : Problem set: 0 solved, 140 unsolved in 7856 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 39/39 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 140/179 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 84/131 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 140/271 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 1/180 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (OVERLAPS) 0/180 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 272 constraints, problems are : Problem set: 0 solved, 140 unsolved in 11713 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 39/39 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 1/1 constraints]
After SMT, in 19865ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 19868ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20122 ms. Remains : 39/39 places, 141/141 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
RANDOM walk for 704 steps (50 resets) in 8 ms. (78 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 36 reset in 98 ms.
Stuttering criterion allowed to conclude after 270 steps with 15 reset in 2 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-14 finished in 41317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(F(!p0)&&G(p1)))))'
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 175/175 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 54 transition count 169
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 48 transition count 168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 47 transition count 168
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 47 transition count 167
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 16 place count 46 transition count 167
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 20 place count 42 transition count 143
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 42 transition count 143
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 26 place count 41 transition count 143
Applied a total of 26 rules in 22 ms. Remains 41 /54 variables (removed 13) and now considering 143/175 (removed 32) transitions.
// Phase 1: matrix 143 rows 41 cols
[2024-06-01 03:21:10] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 03:21:10] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-01 03:21:10] [INFO ] Invariant cache hit.
[2024-06-01 03:21:10] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-06-01 03:21:10] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2024-06-01 03:21:10] [INFO ] Redundant transitions in 17 ms returned []
Running 142 sub problems to find dead transitions.
[2024-06-01 03:21:10] [INFO ] Invariant cache hit.
[2024-06-01 03:21:10] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 142/183 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 84/132 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 1/184 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-01 03:21:15] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-06-01 03:21:16] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (OVERLAPS) 0/184 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 135 constraints, problems are : Problem set: 0 solved, 142 unsolved in 8068 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 41/41 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 142/183 variables, 41/50 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 84/134 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 142/276 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 1/184 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (OVERLAPS) 0/184 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 277 constraints, problems are : Problem set: 0 solved, 142 unsolved in 13461 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 41/41 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 2/2 constraints]
After SMT, in 21928ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 21932ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/54 places, 143/175 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22268 ms. Remains : 41/54 places, 143/175 transitions.
Stuttering acceptance computed with spot in 142 ms :[p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-15
Product exploration explored 100000 steps with 77 reset in 70 ms.
Product exploration explored 100000 steps with 6 reset in 123 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 (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 144 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[p0, (AND (NOT p1) p0), p0]
RANDOM walk for 291 steps (21 resets) in 10 ms. (26 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 7 factoid took 258 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 149 ms :[p0, (AND (NOT p1) p0), p0]
Support contains 5 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 143/143 transitions.
Applied a total of 0 rules in 8 ms. Remains 41 /41 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2024-06-01 03:21:33] [INFO ] Invariant cache hit.
[2024-06-01 03:21:33] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-01 03:21:33] [INFO ] Invariant cache hit.
[2024-06-01 03:21:34] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-06-01 03:21:34] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-06-01 03:21:34] [INFO ] Redundant transitions in 17 ms returned []
Running 142 sub problems to find dead transitions.
[2024-06-01 03:21:34] [INFO ] Invariant cache hit.
[2024-06-01 03:21:34] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 142/183 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 84/132 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 1/184 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-01 03:21:39] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-06-01 03:21:39] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (OVERLAPS) 0/184 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 135 constraints, problems are : Problem set: 0 solved, 142 unsolved in 6961 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 41/41 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 142/183 variables, 41/50 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 84/134 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 142/276 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 1/184 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (OVERLAPS) 0/184 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 277 constraints, problems are : Problem set: 0 solved, 142 unsolved in 14209 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 41/41 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 2/2 constraints]
After SMT, in 21576ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 21580ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 21905 ms. Remains : 41/41 places, 143/143 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 (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 137 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[p0, (AND (NOT p1) p0), p0]
RANDOM walk for 326 steps (16 resets) in 9 ms. (32 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 7 factoid took 235 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 152 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 152 ms :[p0, (AND (NOT p1) p0), p0]
Product exploration explored 100000 steps with 18 reset in 111 ms.
Product exploration explored 100000 steps with 27 reset in 134 ms.
Support contains 5 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 143/143 transitions.
Applied a total of 0 rules in 9 ms. Remains 41 /41 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2024-06-01 03:21:57] [INFO ] Invariant cache hit.
[2024-06-01 03:21:57] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-01 03:21:57] [INFO ] Invariant cache hit.
[2024-06-01 03:21:57] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-06-01 03:21:57] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2024-06-01 03:21:57] [INFO ] Redundant transitions in 14 ms returned []
Running 142 sub problems to find dead transitions.
[2024-06-01 03:21:57] [INFO ] Invariant cache hit.
[2024-06-01 03:21:57] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 142/183 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 84/132 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 1/184 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-06-01 03:22:01] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-06-01 03:22:01] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (OVERLAPS) 0/184 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 135 constraints, problems are : Problem set: 0 solved, 142 unsolved in 5770 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 41/41 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 142/183 variables, 41/50 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 84/134 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 142/276 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 1/184 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (OVERLAPS) 0/184 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 277 constraints, problems are : Problem set: 0 solved, 142 unsolved in 12051 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 41/41 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 2/2 constraints]
After SMT, in 18234ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 18238ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18575 ms. Remains : 41/41 places, 143/143 transitions.
Treatment of property AutonomousCar-PT-05a-LTLFireability-15 finished in 65305 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 (p1||G(p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0||G(p1)))||(F(p2)&&X(p3))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(F(!p0)&&G(p1)))))'
[2024-06-01 03:22:16] [INFO ] Flatten gal took : 24 ms
[2024-06-01 03:22:16] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-01 03:22:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 54 places, 175 transitions and 1288 arcs took 6 ms.
Total runtime 384702 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutonomousCar-PT-05a-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05a-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-05a-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717212138899

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
mcc2024
ltl formula name AutonomousCar-PT-05a-LTLFireability-12
ltl formula formula --ltl=/tmp/1581/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 54 places, 175 transitions and 1288 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1581/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1581/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1581/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1581/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 55 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 55, there are 183 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~22 levels ~10000 states ~16828 transitions
pnml2lts-mc( 0/ 4): ~24 levels ~20000 states ~32600 transitions
pnml2lts-mc( 0/ 4): ~42 levels ~40000 states ~66036 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~56!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 43768
pnml2lts-mc( 0/ 4): unique states count: 44078
pnml2lts-mc( 0/ 4): unique transitions count: 139300
pnml2lts-mc( 0/ 4): - self-loop count: 8795
pnml2lts-mc( 0/ 4): - claim dead count: 84676
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 44087
pnml2lts-mc( 0/ 4): - cum. max stack depth: 365
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 44087 states 139430 transitions, fanout: 3.163
pnml2lts-mc( 0/ 4): Total exploration time 0.370 sec (0.370 sec minimum, 0.370 sec on average)
pnml2lts-mc( 0/ 4): States per second: 119154, Transitions per second: 376838
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.4MB, 9.3 B/state, compr.: 4.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 175 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.4MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-05a-LTLFireability-13
ltl formula formula --ltl=/tmp/1581/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 54 places, 175 transitions and 1288 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.020 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1581/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1581/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1581/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1581/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 55 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 55, there are 2187 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~111 levels ~10000 states ~170812 transitions
pnml2lts-mc( 3/ 4): ~178 levels ~20000 states ~488684 transitions
pnml2lts-mc( 3/ 4): ~178 levels ~40000 states ~934324 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~139!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 43956
pnml2lts-mc( 0/ 4): unique states count: 44452
pnml2lts-mc( 0/ 4): unique transitions count: 1243933
pnml2lts-mc( 0/ 4): - self-loop count: 118254
pnml2lts-mc( 0/ 4): - claim dead count: 1068049
pnml2lts-mc( 0/ 4): - claim found count: 165
pnml2lts-mc( 0/ 4): - claim success count: 44465
pnml2lts-mc( 0/ 4): - cum. max stack depth: 616
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 44465 states 1244339 transitions, fanout: 27.985
pnml2lts-mc( 0/ 4): Total exploration time 0.640 sec (0.640 sec minimum, 0.640 sec on average)
pnml2lts-mc( 0/ 4): States per second: 69477, Transitions per second: 1944280
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.4MB, 8.8 B/state, compr.: 3.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 175 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.4MB (~256.0MB paged-in)
ltl formula name AutonomousCar-PT-05a-LTLFireability-15
ltl formula formula --ltl=/tmp/1581/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 54 places, 175 transitions and 1288 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1581/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1581/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1581/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1581/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 56 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 55, there are 185 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~105 levels ~10000 states ~37624 transitions
pnml2lts-mc( 3/ 4): ~110 levels ~20000 states ~82320 transitions
pnml2lts-mc( 0/ 4): ~171 levels ~40000 states ~165644 transitions
pnml2lts-mc( 0/ 4): ~309 levels ~80000 states ~373756 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~318!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 85953
pnml2lts-mc( 0/ 4): unique states count: 96562
pnml2lts-mc( 0/ 4): unique transitions count: 479060
pnml2lts-mc( 0/ 4): - self-loop count: 28290
pnml2lts-mc( 0/ 4): - claim dead count: 323362
pnml2lts-mc( 0/ 4): - claim found count: 29715
pnml2lts-mc( 0/ 4): - claim success count: 97084
pnml2lts-mc( 0/ 4): - cum. max stack depth: 867
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 97254 states 483158 transitions, fanout: 4.968
pnml2lts-mc( 0/ 4): Total exploration time 0.710 sec (0.710 sec minimum, 0.710 sec on average)
pnml2lts-mc( 0/ 4): States per second: 136977, Transitions per second: 680504
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.8MB, 8.4 B/state, compr.: 3.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 175 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.8MB (~256.0MB paged-in)

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-05a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is AutonomousCar-PT-05a, 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 r468-smll-171620167400284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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