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.r026-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 itstools
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 r026-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 1716324335352

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-05a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 20:45:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 20:45:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:45:38] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2024-05-21 20:45:38] [INFO ] Transformed 57 places.
[2024-05-21 20:45:38] [INFO ] Transformed 289 transitions.
[2024-05-21 20:45:38] [INFO ] Found NUPN structural information;
[2024-05-21 20:45:38] [INFO ] Parsed PT model containing 57 places and 289 transitions and 2123 arcs in 421 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 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 41 ms. Remains 56 /57 variables (removed 1) and now considering 175/176 (removed 1) transitions.
// Phase 1: matrix 175 rows 56 cols
[2024-05-21 20:45:38] [INFO ] Computed 9 invariants in 18 ms
[2024-05-21 20:45:39] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-21 20:45:39] [INFO ] Invariant cache hit.
[2024-05-21 20:45:39] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-05-21 20:45:39] [INFO ] Implicit Places using invariants and state equation in 290 ms returned [52, 54]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 615 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 690 ms. Remains : 54/57 places, 175/176 transitions.
Support contains 39 out of 54 places after structural reductions.
[2024-05-21 20:45:39] [INFO ] Flatten gal took : 122 ms
[2024-05-21 20:45:39] [INFO ] Flatten gal took : 58 ms
[2024-05-21 20:45:40] [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 (2347 resets) in 2200 ms. (18 steps per ms) remains 3/29 properties
BEST_FIRST walk for 40002 steps (319 resets) in 600 ms. (66 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (326 resets) in 364 ms. (109 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (588 resets) in 184 ms. (216 steps per ms) remains 3/3 properties
// Phase 1: matrix 175 rows 54 cols
[2024-05-21 20:45:41] [INFO ] Computed 7 invariants in 6 ms
[2024-05-21 20:45:41] [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 379 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 414 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 893ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 86 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.4 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 1 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 110 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 110 ms. Remains : 34/54 places, 108/175 transitions.
RANDOM walk for 40000 steps (909 resets) in 432 ms. (92 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (333 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 13607 steps, run visited all 1 properties in 79 ms. (steps per millisecond=172 )
Probabilistic random walk after 13607 steps, saw 3072 distinct states, run finished after 88 ms. (steps per millisecond=154 ) 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 7 ms. Remains 50 /54 variables (removed 4) and now considering 151/175 (removed 24) transitions.
// Phase 1: matrix 151 rows 50 cols
[2024-05-21 20:45:43] [INFO ] Computed 7 invariants in 4 ms
[2024-05-21 20:45:43] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-21 20:45:43] [INFO ] Invariant cache hit.
[2024-05-21 20:45:43] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-21 20:45:43] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-21 20:45:43] [INFO ] Invariant cache hit.
[2024-05-21 20:45:43] [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-05-21 20:45:46] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 14 ms to minimize.
[2024-05-21 20:45:47] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 4 ms to minimize.
[2024-05-21 20:45:47] [INFO ] Deduced a trap composed of 7 places in 106 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 9607 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 9799 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 20144ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 20151ms
Starting structural reductions in LTL mode, iteration 1 : 50/54 places, 151/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20450 ms. Remains : 50/54 places, 151/175 transitions.
Stuttering acceptance computed with spot in 624 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 2 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-00 finished in 21167 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 6 ms. Remains 50 /54 variables (removed 4) and now considering 151/175 (removed 24) transitions.
// Phase 1: matrix 151 rows 50 cols
[2024-05-21 20:46:04] [INFO ] Computed 7 invariants in 4 ms
[2024-05-21 20:46:04] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 20:46:04] [INFO ] Invariant cache hit.
[2024-05-21 20:46:04] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-21 20:46:04] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-21 20:46:04] [INFO ] Invariant cache hit.
[2024-05-21 20:46:04] [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-05-21 20:46:07] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 2 ms to minimize.
[2024-05-21 20:46:07] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 2 ms to minimize.
[2024-05-21 20:46:07] [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 8939 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 12464 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 21875ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 21880ms
Starting structural reductions in LTL mode, iteration 1 : 50/54 places, 151/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22149 ms. Remains : 50/54 places, 151/175 transitions.
Stuttering acceptance computed with spot in 132 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 22297 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 51 ms. Remains 36 /54 variables (removed 18) and now considering 134/175 (removed 41) transitions.
// Phase 1: matrix 134 rows 36 cols
[2024-05-21 20:46:26] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 20:46:26] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-21 20:46:26] [INFO ] Invariant cache hit.
[2024-05-21 20:46:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:46:26] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2024-05-21 20:46:26] [INFO ] Redundant transitions in 28 ms returned []
Running 133 sub problems to find dead transitions.
[2024-05-21 20:46:26] [INFO ] Invariant cache hit.
[2024-05-21 20:46:26] [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-05-21 20:46:29] [INFO ] Deduced a trap composed of 12 places in 62 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 3777 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 9335 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 13628ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 13632ms
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 13972 ms. Remains : 36/54 places, 134/175 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-03
Stuttering criterion allowed to conclude after 22 steps with 3 reset in 1 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-03 finished in 14072 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 3 ms. Remains 50 /54 variables (removed 4) and now considering 151/175 (removed 24) transitions.
// Phase 1: matrix 151 rows 50 cols
[2024-05-21 20:46:40] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 20:46:40] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 20:46:40] [INFO ] Invariant cache hit.
[2024-05-21 20:46:40] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-21 20:46:40] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-21 20:46:40] [INFO ] Invariant cache hit.
[2024-05-21 20:46: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-05-21 20:46:43] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 3 ms to minimize.
[2024-05-21 20:46:43] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-21 20:46:44] [INFO ] Deduced a trap composed of 7 places in 151 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 9038 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 14690 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 24082ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 24085ms
Starting structural reductions in LTL mode, iteration 1 : 50/54 places, 151/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24267 ms. Remains : 50/54 places, 151/175 transitions.
Stuttering acceptance computed with spot in 97 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 834 ms.
Product exploration explored 100000 steps with 50000 reset in 761 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 26 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 26015 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-05-21 20:47:06] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 20:47:06] [INFO ] Implicit Places using invariants in 107 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 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 113 ms. Remains : 48/54 places, 145/175 transitions.
Stuttering acceptance computed with spot in 106 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 423 ms.
Product exploration explored 100000 steps with 33333 reset in 434 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 14 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 1112 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 1 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-05-21 20:47:07] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 20:47:07] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 20:47:07] [INFO ] Invariant cache hit.
[2024-05-21 20:47:07] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-21 20:47:07] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-21 20:47:07] [INFO ] Redundant transitions in 19 ms returned []
Running 141 sub problems to find dead transitions.
[2024-05-21 20:47:07] [INFO ] Invariant cache hit.
[2024-05-21 20:47:07] [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-05-21 20:47:10] [INFO ] Deduced a trap composed of 13 places in 89 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 7795 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 12102 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 20309ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 20311ms
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 20541 ms. Remains : 40/54 places, 142/175 transitions.
Stuttering acceptance computed with spot in 148 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 16 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 20710 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 2 ms. Remains 50 /54 variables (removed 4) and now considering 151/175 (removed 24) transitions.
// Phase 1: matrix 151 rows 50 cols
[2024-05-21 20:47:28] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 20:47:28] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 20:47:28] [INFO ] Invariant cache hit.
[2024-05-21 20:47:28] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-21 20:47:28] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-21 20:47:28] [INFO ] Invariant cache hit.
[2024-05-21 20:47:28] [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-05-21 20:47:31] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 1 ms to minimize.
[2024-05-21 20:47:31] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 3 ms to minimize.
[2024-05-21 20:47:31] [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 9508 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 10003 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 19894ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 19897ms
Starting structural reductions in LTL mode, iteration 1 : 50/54 places, 151/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20173 ms. Remains : 50/54 places, 151/175 transitions.
Stuttering acceptance computed with spot in 130 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 20329 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-05-21 20:47:48] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 20:47:48] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 20:47:48] [INFO ] Invariant cache hit.
[2024-05-21 20:47:48] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-21 20:47:48] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-21 20:47:48] [INFO ] Invariant cache hit.
[2024-05-21 20:47:48] [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-05-21 20:47:51] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
[2024-05-21 20:47:51] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2024-05-21 20:47:51] [INFO ] Deduced a trap composed of 7 places in 89 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 7014 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 9721 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 17115ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 17117ms
Starting structural reductions in LTL mode, iteration 1 : 50/54 places, 151/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17320 ms. Remains : 50/54 places, 151/175 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-11
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-11 finished in 17431 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 1 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 0 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 1 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 37 ms. Remains 39 /54 variables (removed 15) and now considering 141/175 (removed 34) transitions.
// Phase 1: matrix 141 rows 39 cols
[2024-05-21 20:48:06] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 20:48:06] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-21 20:48:06] [INFO ] Invariant cache hit.
[2024-05-21 20:48:06] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-21 20:48:06] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2024-05-21 20:48:06] [INFO ] Redundant transitions in 25 ms returned []
Running 140 sub problems to find dead transitions.
[2024-05-21 20:48:06] [INFO ] Invariant cache hit.
[2024-05-21 20:48:06] [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-05-21 20:48:08] [INFO ] Deduced a trap composed of 13 places in 54 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 7194 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 11064 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 18546ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 18548ms
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 18889 ms. Remains : 39/54 places, 141/175 transitions.
Stuttering acceptance computed with spot in 87 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 31 reset in 205 ms.
Product exploration explored 100000 steps with 131 reset in 295 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 159 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 102 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 2888 steps (218 resets) in 39 ms. (72 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 245 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 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 154 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 12 ms. Remains 39 /39 variables (removed 0) and now considering 141/141 (removed 0) transitions.
[2024-05-21 20:48:26] [INFO ] Invariant cache hit.
[2024-05-21 20:48:26] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 20:48:26] [INFO ] Invariant cache hit.
[2024-05-21 20:48:26] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-21 20:48:26] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2024-05-21 20:48:26] [INFO ] Redundant transitions in 39 ms returned []
Running 140 sub problems to find dead transitions.
[2024-05-21 20:48:26] [INFO ] Invariant cache hit.
[2024-05-21 20:48:26] [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-05-21 20:48:29] [INFO ] Deduced a trap composed of 13 places in 67 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 7931 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 10967 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 19392ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 19395ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19711 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 148 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 139 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 7154 steps (518 resets) in 38 ms. (183 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 300 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 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 215 reset in 96 ms.
Product exploration explored 100000 steps with 214 reset in 202 ms.
Built C files in :
/tmp/ltsmin14326628965763462797
[2024-05-21 20:48:47] [INFO ] Computing symmetric may disable matrix : 141 transitions.
[2024-05-21 20:48:47] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:48:47] [INFO ] Computing symmetric may enable matrix : 141 transitions.
[2024-05-21 20:48:47] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:48:47] [INFO ] Computing Do-Not-Accords matrix : 141 transitions.
[2024-05-21 20:48:47] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:48:47] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14326628965763462797
Running compilation step : cd /tmp/ltsmin14326628965763462797;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1215 ms.
Running link step : cd /tmp/ltsmin14326628965763462797;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin14326628965763462797;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16749325819871963746.hoa' '--buchi-type=spotba'
LTSmin run took 815 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-05a-LTLFireability-12 finished in 43515 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 4 ms. Remains 50 /54 variables (removed 4) and now considering 151/175 (removed 24) transitions.
// Phase 1: matrix 151 rows 50 cols
[2024-05-21 20:48:49] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 20:48:49] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 20:48:49] [INFO ] Invariant cache hit.
[2024-05-21 20:48:49] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-21 20:48:49] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-21 20:48:49] [INFO ] Invariant cache hit.
[2024-05-21 20:48:49] [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-05-21 20:48:52] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
[2024-05-21 20:48:53] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 1 ms to minimize.
[2024-05-21 20:48:53] [INFO ] Deduced a trap composed of 7 places in 97 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 9142 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 11264 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 20863ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 20867ms
Starting structural reductions in LTL mode, iteration 1 : 50/54 places, 151/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21117 ms. Remains : 50/54 places, 151/175 transitions.
Stuttering acceptance computed with spot in 179 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 46 reset in 176 ms.
Product exploration explored 100000 steps with 28 reset in 218 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 159 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 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 27030 steps (1531 resets) in 139 ms. (193 steps per ms) remains 0/4 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 279 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 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 136 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-05-21 20:49:12] [INFO ] Invariant cache hit.
[2024-05-21 20:49:12] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 20:49:12] [INFO ] Invariant cache hit.
[2024-05-21 20:49:12] [INFO ] State equation strengthened by 83 read => feed constraints.
[2024-05-21 20:49:12] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-21 20:49:12] [INFO ] Invariant cache hit.
[2024-05-21 20:49: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-05-21 20:49:15] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-21 20:49:15] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-05-21 20:49:15] [INFO ] Deduced a trap composed of 7 places in 87 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 8973 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 10707 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 19921ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 19924ms
Finished structural reductions in LTL mode , in 1 iterations and 20177 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 85 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 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2358 resets) in 108 ms. (366 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (290 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
[2024-05-21 20:49:32] [INFO ] Invariant cache hit.
[2024-05-21 20:49:32] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/41 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 142/183 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 82/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 13/196 variables, 5/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/200 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/201 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/201 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/201 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 140 constraints, problems are : Problem set: 0 solved, 1 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/41 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 142/183 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 82/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 13/196 variables, 5/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/200 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/201 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/201 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/201 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 141 constraints, problems are : Problem set: 0 solved, 1 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 341ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 158 ms.
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 151/151 transitions.
Graph (complete) has 358 edges and 50 vertex of which 49 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 49 transition count 141
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 43 transition count 141
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 43 transition count 140
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 18 place count 42 transition count 140
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 40 transition count 133
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 40 transition count 133
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 2 with 6 rules applied. Total rules applied 28 place count 37 transition count 130
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 33 place count 37 transition count 125
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 58 place count 32 transition count 105
Applied a total of 58 rules in 23 ms. Remains 32 /50 variables (removed 18) and now considering 105/151 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 32/50 places, 105/151 transitions.
RANDOM walk for 21322 steps (171 resets) in 132 ms. (160 steps per ms) remains 0/1 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 206 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 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 11 reset in 97 ms.
Product exploration explored 100000 steps with 58 reset in 102 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 122 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-05-21 20:49:34] [INFO ] Redundant transitions in 20 ms returned []
Running 154 sub problems to find dead transitions.
// Phase 1: matrix 155 rows 49 cols
[2024-05-21 20:49:34] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 20:49:34] [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-05-21 20:49:35] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-21 20:49:36] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-21 20:49:36] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-05-21 20:49:36] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 4 ms to minimize.
Problem TDEAD19 is UNSAT
[2024-05-21 20:49:36] [INFO ] Deduced a trap composed of 7 places in 39 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-05-21 20:49:38] [INFO ] Deduced a trap composed of 13 places in 70 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 9209 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 18005 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 27711ms problems are : Problem set: 13 solved, 141 unsolved
Search for dead transitions found 13 dead transitions in 27715ms
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.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 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 27782 ms. Remains : 40/50 places, 142/151 transitions.
Built C files in :
/tmp/ltsmin10905940555796993331
[2024-05-21 20:50:02] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10905940555796993331
Running compilation step : cd /tmp/ltsmin10905940555796993331;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 546 ms.
Running link step : cd /tmp/ltsmin10905940555796993331;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10905940555796993331;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15431459370890004626.hoa' '--buchi-type=spotba'
LTSmin run took 247 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-05a-LTLFireability-13 finished in 73483 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 1 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 31 ms. Remains 39 /54 variables (removed 15) and now considering 141/175 (removed 34) transitions.
// Phase 1: matrix 141 rows 39 cols
[2024-05-21 20:50:03] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 20:50:03] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 20:50:03] [INFO ] Invariant cache hit.
[2024-05-21 20:50:03] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-21 20:50:03] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2024-05-21 20:50:03] [INFO ] Redundant transitions in 21 ms returned []
Running 140 sub problems to find dead transitions.
[2024-05-21 20:50:03] [INFO ] Invariant cache hit.
[2024-05-21 20:50:03] [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-05-21 20:50:06] [INFO ] Deduced a trap composed of 13 places in 90 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 7890 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 11516 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 19942ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 19946ms
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 20294 ms. Remains : 39/54 places, 141/175 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-05a-LTLFireability-14
Stuttering criterion allowed to conclude after 1562 steps with 126 reset in 5 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-05a-LTLFireability-14 finished in 20362 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 16 ms. Remains 41 /54 variables (removed 13) and now considering 143/175 (removed 32) transitions.
// Phase 1: matrix 143 rows 41 cols
[2024-05-21 20:50:23] [INFO ] Computed 7 invariants in 3 ms
[2024-05-21 20:50:23] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 20:50:23] [INFO ] Invariant cache hit.
[2024-05-21 20:50:23] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-21 20:50:23] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-05-21 20:50:23] [INFO ] Redundant transitions in 17 ms returned []
Running 142 sub problems to find dead transitions.
[2024-05-21 20:50:23] [INFO ] Invariant cache hit.
[2024-05-21 20:50:23] [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-05-21 20:50:27] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-05-21 20:50:27] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 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 6857 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 13757 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 20906ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 20908ms
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 21146 ms. Remains : 41/54 places, 143/175 transitions.
Stuttering acceptance computed with spot in 165 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 56 reset in 114 ms.
Product exploration explored 100000 steps with 2 reset in 126 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 136 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 146 ms :[p0, (AND (NOT p1) p0), p0]
RANDOM walk for 214 steps (13 resets) in 6 ms. (30 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 255 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 159 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 9 ms. Remains 41 /41 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2024-05-21 20:50:45] [INFO ] Invariant cache hit.
[2024-05-21 20:50:46] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 20:50:46] [INFO ] Invariant cache hit.
[2024-05-21 20:50:46] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-21 20:50:46] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2024-05-21 20:50:46] [INFO ] Redundant transitions in 17 ms returned []
Running 142 sub problems to find dead transitions.
[2024-05-21 20:50:46] [INFO ] Invariant cache hit.
[2024-05-21 20:50:46] [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-05-21 20:50:51] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-05-21 20:50:51] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 2 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 8007 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 13785 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 22182ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 22186ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 22485 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 89 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 100 ms :[p0, (AND (NOT p1) p0), p0]
RANDOM walk for 370 steps (20 resets) in 9 ms. (37 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 165 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 97 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 144 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 145 ms :[p0, (AND (NOT p1) p0), p0]
Product exploration explored 100000 steps with 52 reset in 114 ms.
Product exploration explored 100000 steps with 34 reset in 121 ms.
Built C files in :
/tmp/ltsmin3542034194374072806
[2024-05-21 20:51:09] [INFO ] Computing symmetric may disable matrix : 143 transitions.
[2024-05-21 20:51:09] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:51:09] [INFO ] Computing symmetric may enable matrix : 143 transitions.
[2024-05-21 20:51:09] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:51:09] [INFO ] Computing Do-Not-Accords matrix : 143 transitions.
[2024-05-21 20:51:09] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:51:09] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3542034194374072806
Running compilation step : cd /tmp/ltsmin3542034194374072806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1000 ms.
Running link step : cd /tmp/ltsmin3542034194374072806;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin3542034194374072806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17691171092705751716.hoa' '--buchi-type=spotba'
LTSmin run took 889 ms.
FORMULA AutonomousCar-PT-05a-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-05a-LTLFireability-15 finished in 47936 ms.
All properties solved by simple procedures.
Total runtime 333538 ms.

BK_STOP 1716324671492

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r026-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 ;