Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r025-smll-171620166300268.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is AutonomousCar-PT-04a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166300268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 12K Apr 12 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 12 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 12 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 17:50 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 72K 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-04a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716345169170

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-04a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 02:32:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 02:32:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 02:32:51] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2024-05-22 02:32:51] [INFO ] Transformed 49 places.
[2024-05-22 02:32:51] [INFO ] Transformed 193 transitions.
[2024-05-22 02:32:51] [INFO ] Found NUPN structural information;
[2024-05-22 02:32:51] [INFO ] Parsed PT model containing 49 places and 193 transitions and 1306 arcs in 288 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 75 transitions
Reduce redundant transitions removed 75 transitions.
FORMULA AutonomousCar-PT-04a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 118/118 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 48 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 117
Applied a total of 2 rules in 31 ms. Remains 48 /49 variables (removed 1) and now considering 117/118 (removed 1) transitions.
// Phase 1: matrix 117 rows 48 cols
[2024-05-22 02:32:51] [INFO ] Computed 8 invariants in 16 ms
[2024-05-22 02:32:51] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-05-22 02:32:51] [INFO ] Invariant cache hit.
[2024-05-22 02:32:52] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-22 02:32:52] [INFO ] Implicit Places using invariants and state equation in 163 ms returned [44, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 487 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/49 places, 117/118 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 549 ms. Remains : 46/49 places, 117/118 transitions.
Support contains 29 out of 46 places after structural reductions.
[2024-05-22 02:32:52] [INFO ] Flatten gal took : 62 ms
[2024-05-22 02:32:52] [INFO ] Flatten gal took : 25 ms
[2024-05-22 02:32:52] [INFO ] Input system was already deterministic with 117 transitions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (2297 resets) in 1640 ms. (24 steps per ms) remains 2/28 properties
BEST_FIRST walk for 40002 steps (373 resets) in 329 ms. (121 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (376 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
// Phase 1: matrix 117 rows 46 cols
[2024-05-22 02:32:53] [INFO ] Computed 6 invariants in 7 ms
[2024-05-22 02:32:53] [INFO ] State equation strengthened by 67 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 1 (OVERLAPS) 22/30 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/37 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 108/145 variables, 37/43 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 66/109 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 13/158 variables, 5/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/162 variables, 4/118 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/118 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/163 variables, 1/119 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/163 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 119 constraints, problems are : Problem set: 1 solved, 1 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 46/46 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp18 is UNSAT
After SMT solving in domain Int declared 23/163 variables, and 4 constraints, problems are : Problem set: 2 solved, 0 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 4/6 constraints, State Equation: 0/46 constraints, ReadFeed: 0/67 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 346ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA AutonomousCar-PT-04a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04a-LTLFireability-10 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(F((X(G(p1))&&p0))))'
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 117/117 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 43 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 43 transition count 102
Applied a total of 6 rules in 6 ms. Remains 43 /46 variables (removed 3) and now considering 102/117 (removed 15) transitions.
// Phase 1: matrix 102 rows 43 cols
[2024-05-22 02:32:54] [INFO ] Computed 6 invariants in 5 ms
[2024-05-22 02:32:54] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-22 02:32:54] [INFO ] Invariant cache hit.
[2024-05-22 02:32:54] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-22 02:32:54] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-22 02:32:54] [INFO ] Invariant cache hit.
[2024-05-22 02:32:54] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 101/144 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 54/103 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-22 02:32:56] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 12 ms to minimize.
[2024-05-22 02:32:56] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-22 02:32:56] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 1/145 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 107 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4005 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 101/144 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 54/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 101/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 1/145 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 208 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4744 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
After SMT, in 9059ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 9064ms
Starting structural reductions in LTL mode, iteration 1 : 43/46 places, 102/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9286 ms. Remains : 43/46 places, 102/117 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-00
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-00 finished in 9654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 117/117 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 5 rules applied. Total rules applied 5 place count 46 transition count 112
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 41 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 40 transition count 111
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 40 transition count 110
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 14 place count 39 transition count 110
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 17 place count 36 transition count 95
Iterating global reduction 3 with 3 rules applied. Total rules applied 20 place count 36 transition count 95
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 24 place count 34 transition count 93
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 33 transition count 93
Applied a total of 26 rules in 44 ms. Remains 33 /46 variables (removed 13) and now considering 93/117 (removed 24) transitions.
// Phase 1: matrix 93 rows 33 cols
[2024-05-22 02:33:03] [INFO ] Computed 6 invariants in 2 ms
[2024-05-22 02:33:03] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-22 02:33:03] [INFO ] Invariant cache hit.
[2024-05-22 02:33:03] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-22 02:33:03] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-05-22 02:33:04] [INFO ] Redundant transitions in 17 ms returned []
Running 92 sub problems to find dead transitions.
[2024-05-22 02:33:04] [INFO ] Invariant cache hit.
[2024-05-22 02:33:04] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/33 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 92/125 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 56/95 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-22 02:33:05] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 0/126 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 97 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2740 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/33 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 92/125 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 56/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 92/188 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 1/126 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 189 constraints, problems are : Problem set: 0 solved, 92 unsolved in 3926 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 1/1 constraints]
After SMT, in 6818ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 6821ms
Starting structural reductions in SI_LTL mode, iteration 1 : 33/46 places, 93/117 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7042 ms. Remains : 33/46 places, 93/117 transitions.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-01
Product exploration explored 100000 steps with 1 reset in 307 ms.
Stuttering criterion allowed to conclude after 291 steps with 19 reset in 2 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-01 finished in 7407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0||X(F(p1))))))))'
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 117/117 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 43 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 43 transition count 102
Applied a total of 6 rules in 3 ms. Remains 43 /46 variables (removed 3) and now considering 102/117 (removed 15) transitions.
// Phase 1: matrix 102 rows 43 cols
[2024-05-22 02:33:11] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 02:33:11] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 02:33:11] [INFO ] Invariant cache hit.
[2024-05-22 02:33:11] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-22 02:33:11] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-22 02:33:11] [INFO ] Invariant cache hit.
[2024-05-22 02:33:11] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 101/144 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 54/103 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-22 02:33:12] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:33:12] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:33:12] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 1/145 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 107 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3420 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 101/144 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 54/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 101/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 1/145 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 208 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4775 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
After SMT, in 8319ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 8321ms
Starting structural reductions in LTL mode, iteration 1 : 43/46 places, 102/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8481 ms. Remains : 43/46 places, 102/117 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-02
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-02 finished in 8695 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(((F((G(!p0)||X(p1)))&&X(p2))||G(F((p1||G(!p0)))))))'
Support contains 7 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 117/117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 44 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 44 transition count 107
Applied a total of 4 rules in 3 ms. Remains 44 /46 variables (removed 2) and now considering 107/117 (removed 10) transitions.
// Phase 1: matrix 107 rows 44 cols
[2024-05-22 02:33:19] [INFO ] Computed 6 invariants in 3 ms
[2024-05-22 02:33:19] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-22 02:33:19] [INFO ] Invariant cache hit.
[2024-05-22 02:33:20] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-22 02:33:20] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-05-22 02:33:20] [INFO ] Invariant cache hit.
[2024-05-22 02:33:20] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 106/150 variables, 44/50 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 58/108 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-22 02:33:21] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 2 ms to minimize.
[2024-05-22 02:33:21] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:33:21] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 1/151 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/151 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 112 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3973 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 106/150 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 58/111 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 106/217 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 1/151 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/151 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 218 constraints, problems are : Problem set: 0 solved, 106 unsolved in 5138 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 3/3 constraints]
After SMT, in 9236ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 9238ms
Starting structural reductions in LTL mode, iteration 1 : 44/46 places, 107/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9420 ms. Remains : 44/46 places, 107/117 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-03
Product exploration explored 100000 steps with 36 reset in 177 ms.
Product exploration explored 100000 steps with 13 reset in 270 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 p1) (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 149 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false]
RANDOM walk for 40000 steps (2300 resets) in 201 ms. (198 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (352 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
[2024-05-22 02:33:30] [INFO ] Invariant cache hit.
[2024-05-22 02:33:30] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 22/151 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 4/6 constraints, State Equation: 0/44 constraints, ReadFeed: 0/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 37ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 18 factoid took 318 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[p0, p0, false]
Stuttering acceptance computed with spot in 111 ms :[p0, p0, false]
Support contains 6 out of 44 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 107/107 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 5 rules applied. Total rules applied 5 place count 44 transition count 102
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 39 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 38 transition count 101
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 38 transition count 100
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 14 place count 37 transition count 100
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 18 place count 35 transition count 98
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 20 place count 34 transition count 98
Applied a total of 20 rules in 19 ms. Remains 34 /44 variables (removed 10) and now considering 98/107 (removed 9) transitions.
// Phase 1: matrix 98 rows 34 cols
[2024-05-22 02:33:30] [INFO ] Computed 6 invariants in 0 ms
[2024-05-22 02:33:31] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-22 02:33:31] [INFO ] Invariant cache hit.
[2024-05-22 02:33:31] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-22 02:33:31] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-22 02:33:31] [INFO ] Redundant transitions in 16 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-22 02:33:31] [INFO ] Invariant cache hit.
[2024-05-22 02:33:31] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 97/131 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 60/100 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-22 02:33:32] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 1/132 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 102 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3078 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 97/131 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 60/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 97/198 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 1/132 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 199 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 1/1 constraints]
After SMT, in 8253ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 8255ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/44 places, 98/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8443 ms. Remains : 34/44 places, 98/107 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 p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 107 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[p0, p0, false]
RANDOM walk for 8422 steps (662 resets) in 65 ms. (127 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 237 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[p0, p0, false]
Stuttering acceptance computed with spot in 121 ms :[p0, p0, false]
Stuttering acceptance computed with spot in 112 ms :[p0, p0, false]
Product exploration explored 100000 steps with 6 reset in 253 ms.
Product exploration explored 100000 steps with 15 reset in 103 ms.
Support contains 6 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 33 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 33 transition count 93
Applied a total of 2 rules in 10 ms. Remains 33 /34 variables (removed 1) and now considering 93/98 (removed 5) transitions.
// Phase 1: matrix 93 rows 33 cols
[2024-05-22 02:33:40] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 02:33:40] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-22 02:33:40] [INFO ] Invariant cache hit.
[2024-05-22 02:33:40] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-22 02:33:40] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-22 02:33:40] [INFO ] Redundant transitions in 15 ms returned []
Running 92 sub problems to find dead transitions.
[2024-05-22 02:33:40] [INFO ] Invariant cache hit.
[2024-05-22 02:33:40] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/33 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 92/125 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 56/95 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-22 02:33:42] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 0/126 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 97 constraints, problems are : Problem set: 0 solved, 92 unsolved in 3134 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/33 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 92/125 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 56/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 92/188 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 1/126 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 189 constraints, problems are : Problem set: 0 solved, 92 unsolved in 4383 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 1/1 constraints]
After SMT, in 7647ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 7648ms
Starting structural reductions in SI_LTL mode, iteration 1 : 33/34 places, 93/98 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7832 ms. Remains : 33/34 places, 93/98 transitions.
Treatment of property AutonomousCar-PT-04a-LTLFireability-03 finished in 28671 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)))))'
Support contains 7 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 117/117 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 43 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 43 transition count 102
Applied a total of 6 rules in 2 ms. Remains 43 /46 variables (removed 3) and now considering 102/117 (removed 15) transitions.
// Phase 1: matrix 102 rows 43 cols
[2024-05-22 02:33:48] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 02:33:48] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 02:33:48] [INFO ] Invariant cache hit.
[2024-05-22 02:33:48] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-22 02:33:48] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-22 02:33:48] [INFO ] Invariant cache hit.
[2024-05-22 02:33:48] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 101/144 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 54/103 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-22 02:33:49] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:33:49] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:33:50] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 1/145 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 107 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3467 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 101/144 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 54/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 101/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 1/145 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 208 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4394 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
After SMT, in 7973ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 7975ms
Starting structural reductions in LTL mode, iteration 1 : 43/46 places, 102/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8143 ms. Remains : 43/46 places, 102/117 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-04 finished in 8312 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 ((X(!p0)&&(!p1||F(p2)))||X(G(!p0)))))'
Support contains 10 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 117/117 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 97
Applied a total of 8 rules in 3 ms. Remains 42 /46 variables (removed 4) and now considering 97/117 (removed 20) transitions.
// Phase 1: matrix 97 rows 42 cols
[2024-05-22 02:33:56] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 02:33:56] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 02:33:56] [INFO ] Invariant cache hit.
[2024-05-22 02:33:56] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-22 02:33:57] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-22 02:33:57] [INFO ] Invariant cache hit.
[2024-05-22 02:33:57] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 96/138 variables, 42/48 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 50/98 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-22 02:33:58] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 4 ms to minimize.
[2024-05-22 02:33:58] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:33:58] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 1/139 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/139 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 102 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3316 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 42/42 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 96/138 variables, 42/51 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 50/101 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 96/197 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 1/139 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 198 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3749 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 42/42 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 3/3 constraints]
After SMT, in 7181ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 7183ms
Starting structural reductions in LTL mode, iteration 1 : 42/46 places, 97/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7324 ms. Remains : 42/46 places, 97/117 transitions.
Stuttering acceptance computed with spot in 214 ms :[p0, p0, (AND p0 (NOT p2)), true, (AND (NOT p2) p0), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 268 ms.
Product exploration explored 100000 steps with 50000 reset in 283 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 p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 16 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-04a-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-04a-LTLFireability-08 finished in 8133 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 1 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 117/117 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 97
Applied a total of 8 rules in 2 ms. Remains 42 /46 variables (removed 4) and now considering 97/117 (removed 20) transitions.
[2024-05-22 02:34:04] [INFO ] Invariant cache hit.
[2024-05-22 02:34:05] [INFO ] Implicit Places using invariants in 91 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 41/46 places, 97/117 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 96 ms. Remains : 41/46 places, 97/117 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-09 finished in 193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&G(p1)) U X(p2)))'
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 117/117 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 44 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 44 transition count 107
Applied a total of 4 rules in 2 ms. Remains 44 /46 variables (removed 2) and now considering 107/117 (removed 10) transitions.
// Phase 1: matrix 107 rows 44 cols
[2024-05-22 02:34:05] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 02:34:05] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-22 02:34:05] [INFO ] Invariant cache hit.
[2024-05-22 02:34:05] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-22 02:34:05] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-05-22 02:34:05] [INFO ] Invariant cache hit.
[2024-05-22 02:34:05] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 106/150 variables, 44/50 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 58/108 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-22 02:34:06] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:34:06] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:34:06] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:34:07] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 1/151 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/151 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 113 constraints, problems are : Problem set: 0 solved, 106 unsolved in 3997 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 106/150 variables, 44/54 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 58/112 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 106/218 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 1/151 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/151 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 219 constraints, problems are : Problem set: 0 solved, 106 unsolved in 5372 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 4/4 constraints]
After SMT, in 9475ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 9477ms
Starting structural reductions in LTL mode, iteration 1 : 44/46 places, 107/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9630 ms. Remains : 44/46 places, 107/117 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-11 finished in 9817 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(F(p1)))))'
Support contains 9 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 117/117 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 43 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 43 transition count 102
Applied a total of 6 rules in 2 ms. Remains 43 /46 variables (removed 3) and now considering 102/117 (removed 15) transitions.
// Phase 1: matrix 102 rows 43 cols
[2024-05-22 02:34:15] [INFO ] Computed 6 invariants in 0 ms
[2024-05-22 02:34:15] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-22 02:34:15] [INFO ] Invariant cache hit.
[2024-05-22 02:34:15] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-22 02:34:15] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-22 02:34:15] [INFO ] Invariant cache hit.
[2024-05-22 02:34:15] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 101/144 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 54/103 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-22 02:34:16] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:34:16] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:34:16] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 1/145 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 107 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3599 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 101/144 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 54/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 101/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 1/145 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 208 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4857 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
After SMT, in 8552ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 8553ms
Starting structural reductions in LTL mode, iteration 1 : 43/46 places, 102/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8692 ms. Remains : 43/46 places, 102/117 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-12
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-12 finished in 8860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 117/117 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 44 transition count 111
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 39 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 38 transition count 110
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 13 place count 38 transition count 109
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 15 place count 37 transition count 109
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 19 place count 33 transition count 89
Iterating global reduction 3 with 4 rules applied. Total rules applied 23 place count 33 transition count 89
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 27 place count 31 transition count 87
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 29 place count 30 transition count 87
Applied a total of 29 rules in 19 ms. Remains 30 /46 variables (removed 16) and now considering 87/117 (removed 30) transitions.
// Phase 1: matrix 87 rows 30 cols
[2024-05-22 02:34:23] [INFO ] Computed 5 invariants in 1 ms
[2024-05-22 02:34:23] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 02:34:23] [INFO ] Invariant cache hit.
[2024-05-22 02:34:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 02:34:24] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-05-22 02:34:24] [INFO ] Redundant transitions in 16 ms returned []
Running 86 sub problems to find dead transitions.
[2024-05-22 02:34:24] [INFO ] Invariant cache hit.
[2024-05-22 02:34:24] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 86/116 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 86 unsolved
[2024-05-22 02:34:24] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 1/117 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 38 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1833 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 86/116 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 86/123 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 1/117 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 124 constraints, problems are : Problem set: 0 solved, 86 unsolved in 3263 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 1/1 constraints]
After SMT, in 5196ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 5197ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/46 places, 87/117 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5374 ms. Remains : 30/46 places, 87/117 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 329 ms.
Product exploration explored 100000 steps with 50000 reset in 257 ms.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 13 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-04a-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-04a-LTLFireability-13 finished in 6028 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)&&p0))))'
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 117/117 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 43 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 43 transition count 102
Applied a total of 6 rules in 2 ms. Remains 43 /46 variables (removed 3) and now considering 102/117 (removed 15) transitions.
// Phase 1: matrix 102 rows 43 cols
[2024-05-22 02:34:29] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 02:34:29] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-22 02:34:29] [INFO ] Invariant cache hit.
[2024-05-22 02:34:30] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-22 02:34:30] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-22 02:34:30] [INFO ] Invariant cache hit.
[2024-05-22 02:34:30] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 101/144 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 54/103 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-22 02:34:31] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 3 ms to minimize.
[2024-05-22 02:34:31] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:34:31] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 1/145 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 107 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3662 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 101/144 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 54/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 101/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 1/145 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 208 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4925 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
After SMT, in 8688ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 8690ms
Starting structural reductions in LTL mode, iteration 1 : 43/46 places, 102/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8864 ms. Remains : 43/46 places, 102/117 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-14
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-14 finished in 9010 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&&G(F((p1 U (G(p1)||(p1&&G(!p2)))))))))'
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 117/117 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 97
Applied a total of 8 rules in 2 ms. Remains 42 /46 variables (removed 4) and now considering 97/117 (removed 20) transitions.
// Phase 1: matrix 97 rows 42 cols
[2024-05-22 02:34:38] [INFO ] Computed 6 invariants in 3 ms
[2024-05-22 02:34:38] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-22 02:34:38] [INFO ] Invariant cache hit.
[2024-05-22 02:34:39] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-22 02:34:39] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-22 02:34:39] [INFO ] Invariant cache hit.
[2024-05-22 02:34:39] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 96/138 variables, 42/48 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 50/98 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-22 02:34:40] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 2 ms to minimize.
[2024-05-22 02:34:40] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 2 ms to minimize.
[2024-05-22 02:34:40] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 1/139 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 0/139 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 102 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3269 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 42/42 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 96/138 variables, 42/51 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 50/101 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 96/197 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 1/139 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 198 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3685 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 42/42 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 3/3 constraints]
After SMT, in 7041ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 7043ms
Starting structural reductions in LTL mode, iteration 1 : 42/46 places, 97/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7206 ms. Remains : 42/46 places, 97/117 transitions.
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1), (AND p2 (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-15
Product exploration explored 100000 steps with 27 reset in 92 ms.
Product exploration explored 100000 steps with 26 reset in 91 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X p0), (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1))))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 (NOT p1)))), (X (X (AND p2 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 130 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p1), (AND p2 (NOT p1))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (2317 resets) in 94 ms. (421 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (554 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
[2024-05-22 02:34:46] [INFO ] Invariant cache hit.
[2024-05-22 02:34:46] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 7/139 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/6 constraints, State Equation: 0/42 constraints, ReadFeed: 0/51 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 27ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X p0), (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1))))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p2 (NOT p1)))), (X (X (AND p2 p1))), (X (X p1)), (G (OR (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) p1))), (F (NOT p1)), (F (NOT (OR p2 p1))), (F p2), (F (NOT (AND (NOT p2) p1)))]
Knowledge based reduction with 11 factoid took 372 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (AND p2 (NOT p1))]
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p1), (AND p2 (NOT p1))]
Support contains 2 out of 42 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 97/97 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 93
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 38 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 38 transition count 92
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 10 place count 37 transition count 92
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 14 place count 35 transition count 90
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 16 place count 34 transition count 90
Applied a total of 16 rules in 16 ms. Remains 34 /42 variables (removed 8) and now considering 90/97 (removed 7) transitions.
// Phase 1: matrix 90 rows 34 cols
[2024-05-22 02:34:47] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 02:34:47] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-22 02:34:47] [INFO ] Invariant cache hit.
[2024-05-22 02:34:47] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-22 02:34:47] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-05-22 02:34:47] [INFO ] Redundant transitions in 16 ms returned []
Running 89 sub problems to find dead transitions.
[2024-05-22 02:34:47] [INFO ] Invariant cache hit.
[2024-05-22 02:34:47] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 89/123 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 52/92 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-22 02:34:48] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 1/124 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 0/124 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 94 constraints, problems are : Problem set: 0 solved, 89 unsolved in 2938 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 89/123 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 52/93 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 89/182 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 183 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4192 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 1/1 constraints]
After SMT, in 7229ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 7230ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/42 places, 90/97 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7433 ms. Remains : 34/42 places, 90/97 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 p2) p1), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND p2 p1))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 133 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (2943 resets) in 96 ms. (412 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (687 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
[2024-05-22 02:34:55] [INFO ] Invariant cache hit.
[2024-05-22 02:34:55] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 7/124 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 1/6 constraints, State Equation: 0/34 constraints, ReadFeed: 0/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 24ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p2) p1)), (X (NOT (AND p2 p1))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (G (OR p1 (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT p1)), (F (NOT (AND p1 (NOT p2)))), (F p2), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 12 factoid took 379 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 21 reset in 87 ms.
Product exploration explored 100000 steps with 23 reset in 100 ms.
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 90/90 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 88
Applied a total of 3 rules in 7 ms. Remains 31 /34 variables (removed 3) and now considering 88/90 (removed 2) transitions.
// Phase 1: matrix 88 rows 31 cols
[2024-05-22 02:34:56] [INFO ] Computed 5 invariants in 0 ms
[2024-05-22 02:34:56] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 02:34:56] [INFO ] Invariant cache hit.
[2024-05-22 02:34:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 02:34:56] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-05-22 02:34:56] [INFO ] Redundant transitions in 17 ms returned []
Running 87 sub problems to find dead transitions.
[2024-05-22 02:34:56] [INFO ] Invariant cache hit.
[2024-05-22 02:34:56] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 87/118 variables, 31/36 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-22 02:34:57] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 1/119 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 39 constraints, problems are : Problem set: 0 solved, 87 unsolved in 1961 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 31/31 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 87/118 variables, 31/37 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 87/125 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 1/119 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/119 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 126 constraints, problems are : Problem set: 0 solved, 87 unsolved in 3601 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 31/31 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 1/1 constraints]
After SMT, in 5651ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 5652ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/34 places, 88/90 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5829 ms. Remains : 31/34 places, 88/90 transitions.
Treatment of property AutonomousCar-PT-04a-LTLFireability-15 finished in 23189 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(((F((G(!p0)||X(p1)))&&X(p2))||G(F((p1||G(!p0)))))))'
Found a Shortening insensitive property : AutonomousCar-PT-04a-LTLFireability-03
Stuttering acceptance computed with spot in 154 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2))]
Support contains 7 out of 46 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 46/46 places, 117/117 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 5 rules applied. Total rules applied 5 place count 46 transition count 112
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 41 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 40 transition count 111
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 40 transition count 110
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 14 place count 39 transition count 110
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 16 place count 37 transition count 100
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 37 transition count 100
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 22 place count 35 transition count 98
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 24 place count 34 transition count 98
Applied a total of 24 rules in 11 ms. Remains 34 /46 variables (removed 12) and now considering 98/117 (removed 19) transitions.
// Phase 1: matrix 98 rows 34 cols
[2024-05-22 02:35:02] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 02:35:02] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-22 02:35:02] [INFO ] Invariant cache hit.
[2024-05-22 02:35:02] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-22 02:35:02] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-22 02:35:02] [INFO ] Invariant cache hit.
[2024-05-22 02:35:02] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 97/131 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 60/100 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-22 02:35:04] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 1/132 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 102 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3105 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 97/131 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 60/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 97/198 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 1/132 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 199 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5150 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 1/1 constraints]
After SMT, in 8376ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 8377ms
Starting structural reductions in LI_LTL mode, iteration 1 : 34/46 places, 98/117 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 8544 ms. Remains : 34/46 places, 98/117 transitions.
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-03
Product exploration explored 100000 steps with 30 reset in 108 ms.
Product exploration explored 100000 steps with 53 reset in 112 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) p2), (X p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 135 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false]
RANDOM walk for 40000 steps (3020 resets) in 120 ms. (330 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (438 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
[2024-05-22 02:35:11] [INFO ] Invariant cache hit.
[2024-05-22 02:35:11] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 19/132 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 4/6 constraints, State Equation: 0/34 constraints, ReadFeed: 0/61 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 29ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 18 factoid took 320 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[p0, p0, false]
Stuttering acceptance computed with spot in 109 ms :[p0, p0, false]
Support contains 6 out of 34 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 98/98 transitions.
Applied a total of 0 rules in 5 ms. Remains 34 /34 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-22 02:35:12] [INFO ] Invariant cache hit.
[2024-05-22 02:35:12] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 02:35:12] [INFO ] Invariant cache hit.
[2024-05-22 02:35:12] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-22 02:35:12] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-05-22 02:35:12] [INFO ] Redundant transitions in 40 ms returned []
Running 97 sub problems to find dead transitions.
[2024-05-22 02:35:12] [INFO ] Invariant cache hit.
[2024-05-22 02:35:12] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 97/131 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 60/100 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-22 02:35:13] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 1/132 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 102 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3245 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 97/131 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 60/101 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 97/198 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 1/132 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 199 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5162 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 1/1 constraints]
After SMT, in 8547ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 8548ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8754 ms. Remains : 34/34 places, 98/98 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 p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 106 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[p0, p0, false]
RANDOM walk for 9169 steps (703 resets) in 43 ms. (208 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 226 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[p0, p0, false]
Stuttering acceptance computed with spot in 109 ms :[p0, p0, false]
Stuttering acceptance computed with spot in 109 ms :[p0, p0, false]
Product exploration explored 100000 steps with 5 reset in 80 ms.
Product exploration explored 100000 steps with 18 reset in 85 ms.
Support contains 6 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 33 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 33 transition count 93
Applied a total of 2 rules in 7 ms. Remains 33 /34 variables (removed 1) and now considering 93/98 (removed 5) transitions.
// Phase 1: matrix 93 rows 33 cols
[2024-05-22 02:35:22] [INFO ] Computed 6 invariants in 0 ms
[2024-05-22 02:35:22] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-22 02:35:22] [INFO ] Invariant cache hit.
[2024-05-22 02:35:22] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-22 02:35:22] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-22 02:35:22] [INFO ] Redundant transitions in 15 ms returned []
Running 92 sub problems to find dead transitions.
[2024-05-22 02:35:22] [INFO ] Invariant cache hit.
[2024-05-22 02:35:22] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/33 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 92/125 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 56/95 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-22 02:35:23] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 0/126 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 97 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2966 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/33 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 92/125 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 56/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 92/188 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 1/126 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 189 constraints, problems are : Problem set: 0 solved, 92 unsolved in 4465 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 1/1 constraints]
After SMT, in 7545ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 7548ms
Starting structural reductions in SI_LTL mode, iteration 1 : 33/34 places, 93/98 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7713 ms. Remains : 33/34 places, 93/98 transitions.
Treatment of property AutonomousCar-PT-04a-LTLFireability-03 finished in 27710 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&&G(F((p1 U (G(p1)||(p1&&G(!p2)))))))))'
[2024-05-22 02:35:29] [INFO ] Flatten gal took : 19 ms
[2024-05-22 02:35:29] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-22 02:35:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 46 places, 117 transitions and 763 arcs took 8 ms.
Total runtime 159050 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutonomousCar-PT-04a

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1624
MODEL NAME: /home/mcc/execution/416/model
46 places, 117 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA AutonomousCar-PT-04a-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-04a-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716345332880

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-04a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is AutonomousCar-PT-04a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r025-smll-171620166300268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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