Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Apr 12 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 12 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 75K 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-03b-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-03b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716322029852

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 20:07:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 20:07:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:07:12] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2024-05-21 20:07:12] [INFO ] Transformed 190 places.
[2024-05-21 20:07:12] [INFO ] Transformed 273 transitions.
[2024-05-21 20:07:12] [INFO ] Found NUPN structural information;
[2024-05-21 20:07:12] [INFO ] Parsed PT model containing 190 places and 273 transitions and 1051 arcs in 412 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA AutonomousCar-PT-03b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 273/273 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 169 transition count 252
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 169 transition count 252
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 165 transition count 248
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 165 transition count 248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 164 transition count 247
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 164 transition count 247
Applied a total of 52 rules in 133 ms. Remains 164 /190 variables (removed 26) and now considering 247/273 (removed 26) transitions.
// Phase 1: matrix 247 rows 164 cols
[2024-05-21 20:07:13] [INFO ] Computed 8 invariants in 39 ms
[2024-05-21 20:07:13] [INFO ] Implicit Places using invariants in 450 ms returned []
[2024-05-21 20:07:13] [INFO ] Invariant cache hit.
[2024-05-21 20:07:14] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 938 ms to find 0 implicit places.
Running 246 sub problems to find dead transitions.
[2024-05-21 20:07:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-21 20:07:18] [INFO ] Deduced a trap composed of 19 places in 225 ms of which 37 ms to minimize.
[2024-05-21 20:07:18] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 4 ms to minimize.
[2024-05-21 20:07:19] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 3 ms to minimize.
[2024-05-21 20:07:19] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 4 ms to minimize.
[2024-05-21 20:07:19] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 3 ms to minimize.
[2024-05-21 20:07:19] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 3 ms to minimize.
[2024-05-21 20:07:20] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 3 ms to minimize.
[2024-05-21 20:07:20] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 3 ms to minimize.
[2024-05-21 20:07:20] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 4 ms to minimize.
[2024-05-21 20:07:20] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 2 ms to minimize.
[2024-05-21 20:07:20] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 8 ms to minimize.
[2024-05-21 20:07:20] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 3 ms to minimize.
[2024-05-21 20:07:21] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 3 ms to minimize.
[2024-05-21 20:07:21] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 3 ms to minimize.
[2024-05-21 20:07:21] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 3 ms to minimize.
[2024-05-21 20:07:21] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 3 ms to minimize.
[2024-05-21 20:07:21] [INFO ] Deduced a trap composed of 43 places in 108 ms of which 2 ms to minimize.
[2024-05-21 20:07:21] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 2 ms to minimize.
[2024-05-21 20:07:22] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 2 ms to minimize.
[2024-05-21 20:07:22] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-21 20:07:22] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 3 ms to minimize.
[2024-05-21 20:07:23] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 3 ms to minimize.
[2024-05-21 20:07:23] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 2 ms to minimize.
[2024-05-21 20:07:23] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 3 ms to minimize.
[2024-05-21 20:07:23] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 3 ms to minimize.
[2024-05-21 20:07:23] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 2 ms to minimize.
[2024-05-21 20:07:23] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-05-21 20:07:23] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 3 ms to minimize.
[2024-05-21 20:07:24] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 3 ms to minimize.
[2024-05-21 20:07:24] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-05-21 20:07:24] [INFO ] Deduced a trap composed of 53 places in 104 ms of which 2 ms to minimize.
[2024-05-21 20:07:24] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 3 ms to minimize.
[2024-05-21 20:07:24] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 2 ms to minimize.
[2024-05-21 20:07:25] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 4 ms to minimize.
[2024-05-21 20:07:25] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 4 ms to minimize.
[2024-05-21 20:07:25] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 3 ms to minimize.
[2024-05-21 20:07:25] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 2 ms to minimize.
[2024-05-21 20:07:25] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2024-05-21 20:07:28] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 246 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD231 is UNSAT
At refinement iteration 6 (OVERLAPS) 247/411 variables, 164/211 constraints. Problems are: Problem set: 2 solved, 244 unsolved
[2024-05-21 20:07:34] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 4 ms to minimize.
[2024-05-21 20:07:35] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 2 ms to minimize.
[2024-05-21 20:07:35] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 2 ms to minimize.
[2024-05-21 20:07:35] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 4/215 constraints. Problems are: Problem set: 2 solved, 244 unsolved
[2024-05-21 20:07:37] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 1/216 constraints. Problems are: Problem set: 2 solved, 244 unsolved
[2024-05-21 20:07:40] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 3 ms to minimize.
[2024-05-21 20:07:40] [INFO ] Deduced a trap composed of 36 places in 184 ms of which 3 ms to minimize.
[2024-05-21 20:07:40] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 3/219 constraints. Problems are: Problem set: 2 solved, 244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 411/411 variables, and 219 constraints, problems are : Problem set: 2 solved, 244 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 2 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 244 unsolved
At refinement iteration 1 (OVERLAPS) 2/164 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 47/55 constraints. Problems are: Problem set: 2 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/55 constraints. Problems are: Problem set: 2 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 247/411 variables, 164/219 constraints. Problems are: Problem set: 2 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 244/463 constraints. Problems are: Problem set: 2 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/463 constraints. Problems are: Problem set: 2 solved, 244 unsolved
At refinement iteration 7 (OVERLAPS) 0/411 variables, 0/463 constraints. Problems are: Problem set: 2 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 463 constraints, problems are : Problem set: 2 solved, 244 unsolved in 21250 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 244/246 constraints, Known Traps: 47/47 constraints]
After SMT, in 51904ms problems are : Problem set: 2 solved, 244 unsolved
Search for dead transitions found 2 dead transitions in 51949ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 164/190 places, 245/273 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 163 transition count 245
Applied a total of 1 rules in 14 ms. Remains 163 /164 variables (removed 1) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 163 cols
[2024-05-21 20:08:06] [INFO ] Computed 8 invariants in 6 ms
[2024-05-21 20:08:06] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-21 20:08:06] [INFO ] Invariant cache hit.
[2024-05-21 20:08:06] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 163/190 places, 245/273 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53512 ms. Remains : 163/190 places, 245/273 transitions.
Support contains 33 out of 163 places after structural reductions.
[2024-05-21 20:08:07] [INFO ] Flatten gal took : 117 ms
[2024-05-21 20:08:07] [INFO ] Flatten gal took : 48 ms
[2024-05-21 20:08:07] [INFO ] Input system was already deterministic with 245 transitions.
Support contains 31 out of 163 places (down from 33) after GAL structural reductions.
RANDOM walk for 40000 steps (17 resets) in 1778 ms. (22 steps per ms) remains 0/26 properties
FORMULA AutonomousCar-PT-03b-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 33 stabilizing places and 33 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(p1)&&p0)))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 245/245 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 154 transition count 236
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 154 transition count 236
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 54 place count 154 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 153 transition count 199
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 153 transition count 199
Applied a total of 56 rules in 23 ms. Remains 153 /163 variables (removed 10) and now considering 199/245 (removed 46) transitions.
// Phase 1: matrix 199 rows 153 cols
[2024-05-21 20:08:08] [INFO ] Computed 8 invariants in 4 ms
[2024-05-21 20:08:08] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-21 20:08:08] [INFO ] Invariant cache hit.
[2024-05-21 20:08:09] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-21 20:08:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:08:11] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 2 ms to minimize.
[2024-05-21 20:08:12] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 3 ms to minimize.
[2024-05-21 20:08:12] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 3 ms to minimize.
[2024-05-21 20:08:12] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 4 ms to minimize.
[2024-05-21 20:08:12] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 2 ms to minimize.
[2024-05-21 20:08:12] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
[2024-05-21 20:08:12] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 2 ms to minimize.
[2024-05-21 20:08:13] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 3 ms to minimize.
[2024-05-21 20:08:13] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-21 20:08:13] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 3 ms to minimize.
[2024-05-21 20:08:13] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 3 ms to minimize.
[2024-05-21 20:08:13] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 3 ms to minimize.
[2024-05-21 20:08:13] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 3 ms to minimize.
[2024-05-21 20:08:14] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2024-05-21 20:08:14] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-05-21 20:08:14] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 3 ms to minimize.
[2024-05-21 20:08:14] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 4 ms to minimize.
[2024-05-21 20:08:15] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 3 ms to minimize.
[2024-05-21 20:08:15] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 3 ms to minimize.
[2024-05-21 20:08:15] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:08:15] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 3 ms to minimize.
[2024-05-21 20:08:15] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 3 ms to minimize.
[2024-05-21 20:08:15] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 2 ms to minimize.
[2024-05-21 20:08:16] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 3 ms to minimize.
[2024-05-21 20:08:16] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 2 ms to minimize.
[2024-05-21 20:08:16] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2024-05-21 20:08:16] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 2 ms to minimize.
[2024-05-21 20:08:16] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
[2024-05-21 20:08:16] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-05-21 20:08:16] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 2 ms to minimize.
[2024-05-21 20:08:17] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-05-21 20:08:17] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:08:19] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 2 ms to minimize.
[2024-05-21 20:08:19] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 18 ms to minimize.
[2024-05-21 20:08:19] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 2 ms to minimize.
[2024-05-21 20:08:20] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-21 20:08:20] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 199/352 variables, 153/198 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:08:23] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/352 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 199 constraints, problems are : Problem set: 0 solved, 198 unsolved in 22576 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:08:33] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:08:35] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 199/352 variables, 153/201 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 198/399 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:08:37] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/352 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 400 constraints, problems are : Problem set: 0 solved, 198 unsolved in 16377 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 41/41 constraints]
After SMT, in 39119ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 39125ms
Starting structural reductions in LTL mode, iteration 1 : 153/163 places, 199/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39563 ms. Remains : 153/163 places, 199/245 transitions.
Stuttering acceptance computed with spot in 394 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-00 finished in 40060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p0))||G(p1))))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 245/245 transitions.
Graph (trivial) has 150 edges and 163 vertex of which 4 / 163 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 160 transition count 178
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 84 rules applied. Total rules applied 149 place count 96 transition count 158
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 160 place count 85 transition count 158
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 160 place count 85 transition count 152
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 172 place count 79 transition count 152
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 178 place count 73 transition count 146
Iterating global reduction 3 with 6 rules applied. Total rules applied 184 place count 73 transition count 146
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 220 place count 73 transition count 110
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 220 place count 73 transition count 109
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 222 place count 72 transition count 109
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 223 place count 71 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 224 place count 71 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 2 rules applied. Total rules applied 226 place count 71 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 227 place count 70 transition count 104
Performed 29 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 285 place count 41 transition count 74
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 291 place count 35 transition count 55
Iterating global reduction 6 with 6 rules applied. Total rules applied 297 place count 35 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 298 place count 35 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 300 place count 34 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 304 place count 32 transition count 71
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 306 place count 30 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 307 place count 29 transition count 69
Applied a total of 307 rules in 102 ms. Remains 29 /163 variables (removed 134) and now considering 69/245 (removed 176) transitions.
// Phase 1: matrix 69 rows 29 cols
[2024-05-21 20:08:48] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 20:08:48] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 20:08:48] [INFO ] Invariant cache hit.
[2024-05-21 20:08:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:08:48] [INFO ] Implicit Places using invariants and state equation in 110 ms returned [25, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 199 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/163 places, 69/245 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 25 transition count 69
Applied a total of 4 rules in 10 ms. Remains 25 /27 variables (removed 2) and now considering 69/69 (removed 0) transitions.
// Phase 1: matrix 69 rows 25 cols
[2024-05-21 20:08:48] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 20:08:48] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 20:08:48] [INFO ] Invariant cache hit.
[2024-05-21 20:08:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:08:49] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/163 places, 69/245 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 476 ms. Remains : 25/163 places, 69/245 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-01
Product exploration explored 100000 steps with 16 reset in 368 ms.
Product exploration explored 100000 steps with 0 reset in 196 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 1328 steps (138 resets) in 47 ms. (27 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 69/69 transitions.
Applied a total of 0 rules in 7 ms. Remains 25 /25 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2024-05-21 20:08:50] [INFO ] Invariant cache hit.
[2024-05-21 20:08:50] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 20:08:50] [INFO ] Invariant cache hit.
[2024-05-21 20:08:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:08:50] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-05-21 20:08:50] [INFO ] Redundant transitions in 20 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-21 20:08:50] [INFO ] Invariant cache hit.
[2024-05-21 20:08:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 68/93 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-21 20:08:51] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 1/94 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/94 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/94 variables, and 31 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1685 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 68/93 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 60/90 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/94 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/94 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/94 variables, and 91 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1903 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 1/1 constraints]
After SMT, in 3687ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3689ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3889 ms. Remains : 25/25 places, 69/69 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 2334 steps (266 resets) in 22 ms. (101 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 34 reset in 373 ms.
Product exploration explored 100000 steps with 0 reset in 175 ms.
Built C files in :
/tmp/ltsmin14946200931389315026
[2024-05-21 20:08:55] [INFO ] Computing symmetric may disable matrix : 69 transitions.
[2024-05-21 20:08:55] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:08:55] [INFO ] Computing symmetric may enable matrix : 69 transitions.
[2024-05-21 20:08:55] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:08:55] [INFO ] Computing Do-Not-Accords matrix : 69 transitions.
[2024-05-21 20:08:55] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:08:55] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14946200931389315026
Running compilation step : cd /tmp/ltsmin14946200931389315026;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 818 ms.
Running link step : cd /tmp/ltsmin14946200931389315026;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin14946200931389315026;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5770587982829903161.hoa' '--buchi-type=spotba'
LTSmin run took 285 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-03b-LTLFireability-01 finished in 8555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 245/245 transitions.
Graph (trivial) has 151 edges and 163 vertex of which 4 / 163 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 160 transition count 176
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 90 rules applied. Total rules applied 157 place count 94 transition count 152
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 15 rules applied. Total rules applied 172 place count 80 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 173 place count 79 transition count 151
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 173 place count 79 transition count 146
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 183 place count 74 transition count 146
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 189 place count 68 transition count 140
Iterating global reduction 4 with 6 rules applied. Total rules applied 195 place count 68 transition count 140
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 231 place count 68 transition count 104
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 231 place count 68 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 233 place count 67 transition count 103
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 234 place count 66 transition count 100
Iterating global reduction 5 with 1 rules applied. Total rules applied 235 place count 66 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 5 with 2 rules applied. Total rules applied 237 place count 66 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 238 place count 65 transition count 98
Performed 28 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 294 place count 37 transition count 69
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 300 place count 31 transition count 50
Iterating global reduction 7 with 6 rules applied. Total rules applied 306 place count 31 transition count 50
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 308 place count 31 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 310 place count 30 transition count 47
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 314 place count 28 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 316 place count 26 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 317 place count 25 transition count 63
Applied a total of 317 rules in 58 ms. Remains 25 /163 variables (removed 138) and now considering 63/245 (removed 182) transitions.
// Phase 1: matrix 63 rows 25 cols
[2024-05-21 20:08:57] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 20:08:57] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 20:08:57] [INFO ] Invariant cache hit.
[2024-05-21 20:08:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:08:57] [INFO ] Implicit Places using invariants and state equation in 95 ms returned [21, 24]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 157 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/163 places, 63/245 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 61
Applied a total of 4 rules in 6 ms. Remains 21 /23 variables (removed 2) and now considering 61/63 (removed 2) transitions.
// Phase 1: matrix 61 rows 21 cols
[2024-05-21 20:08:57] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 20:08:57] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 20:08:57] [INFO ] Invariant cache hit.
[2024-05-21 20:08:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:08:57] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/163 places, 61/245 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 350 ms. Remains : 21/163 places, 61/245 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-02
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-02 finished in 422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 245/245 transitions.
Graph (trivial) has 149 edges and 163 vertex of which 4 / 163 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 160 transition count 179
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 81 rules applied. Total rules applied 145 place count 97 transition count 161
Reduce places removed 10 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 12 rules applied. Total rules applied 157 place count 87 transition count 159
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 161 place count 85 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 162 place count 84 transition count 157
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 162 place count 84 transition count 151
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 174 place count 78 transition count 151
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 180 place count 72 transition count 145
Iterating global reduction 5 with 6 rules applied. Total rules applied 186 place count 72 transition count 145
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 5 with 36 rules applied. Total rules applied 222 place count 72 transition count 109
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 222 place count 72 transition count 108
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 224 place count 71 transition count 108
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 225 place count 70 transition count 105
Iterating global reduction 6 with 1 rules applied. Total rules applied 226 place count 70 transition count 105
Performed 29 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 284 place count 41 transition count 75
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 290 place count 35 transition count 56
Iterating global reduction 6 with 6 rules applied. Total rules applied 296 place count 35 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 298 place count 35 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 300 place count 34 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 304 place count 32 transition count 71
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 305 place count 32 transition count 70
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 306 place count 32 transition count 70
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 308 place count 30 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 309 place count 29 transition count 68
Applied a total of 309 rules in 75 ms. Remains 29 /163 variables (removed 134) and now considering 68/245 (removed 177) transitions.
// Phase 1: matrix 68 rows 29 cols
[2024-05-21 20:08:57] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 20:08:57] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 20:08:57] [INFO ] Invariant cache hit.
[2024-05-21 20:08:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:08:57] [INFO ] Implicit Places using invariants and state equation in 101 ms returned [25, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 173 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/163 places, 68/245 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 27 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 26 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 25 transition count 66
Applied a total of 4 rules in 14 ms. Remains 25 /27 variables (removed 2) and now considering 66/68 (removed 2) transitions.
// Phase 1: matrix 66 rows 25 cols
[2024-05-21 20:08:57] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 20:08:57] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 20:08:57] [INFO ] Invariant cache hit.
[2024-05-21 20:08:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:08:57] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/163 places, 66/245 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 391 ms. Remains : 25/163 places, 66/245 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-04
Product exploration explored 100000 steps with 5 reset in 413 ms.
Product exploration explored 100000 steps with 9 reset in 388 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 57 steps (6 resets) in 7 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 66/66 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2024-05-21 20:08:59] [INFO ] Invariant cache hit.
[2024-05-21 20:08:59] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 20:08:59] [INFO ] Invariant cache hit.
[2024-05-21 20:08:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:08:59] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-21 20:08:59] [INFO ] Redundant transitions in 1 ms returned []
Running 57 sub problems to find dead transitions.
[2024-05-21 20:08:59] [INFO ] Invariant cache hit.
[2024-05-21 20:08:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 65/90 variables, 25/29 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-21 20:08:59] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 1/91 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 31 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1687 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 65/90 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 57/87 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 1/91 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-21 20:09:02] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (OVERLAPS) 0/91 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 89 constraints, problems are : Problem set: 0 solved, 57 unsolved in 2689 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 25/25 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 2/2 constraints]
After SMT, in 4461ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 4462ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4603 ms. Remains : 25/25 places, 66/66 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
RANDOM walk for 51 steps (4 resets) in 4 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1 reset in 101 ms.
Product exploration explored 100000 steps with 19 reset in 248 ms.
Built C files in :
/tmp/ltsmin12116345239533053921
[2024-05-21 20:09:04] [INFO ] Computing symmetric may disable matrix : 66 transitions.
[2024-05-21 20:09:04] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:09:04] [INFO ] Computing symmetric may enable matrix : 66 transitions.
[2024-05-21 20:09:04] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:09:04] [INFO ] Computing Do-Not-Accords matrix : 66 transitions.
[2024-05-21 20:09:04] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:09:04] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12116345239533053921
Running compilation step : cd /tmp/ltsmin12116345239533053921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 436 ms.
Running link step : cd /tmp/ltsmin12116345239533053921;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12116345239533053921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5336289949905216920.hoa' '--buchi-type=spotba'
LTSmin run took 367 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-03b-LTLFireability-04 finished in 7839 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 245/245 transitions.
Graph (trivial) has 146 edges and 163 vertex of which 4 / 163 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 160 transition count 179
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 87 rules applied. Total rules applied 151 place count 97 transition count 155
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 16 rules applied. Total rules applied 167 place count 83 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 169 place count 81 transition count 153
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 169 place count 81 transition count 147
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 181 place count 75 transition count 147
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 187 place count 69 transition count 141
Iterating global reduction 4 with 6 rules applied. Total rules applied 193 place count 69 transition count 141
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 229 place count 69 transition count 105
Performed 27 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 283 place count 42 transition count 77
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 289 place count 36 transition count 58
Iterating global reduction 5 with 6 rules applied. Total rules applied 295 place count 36 transition count 58
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 297 place count 36 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 299 place count 35 transition count 55
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 303 place count 33 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 305 place count 31 transition count 71
Applied a total of 305 rules in 31 ms. Remains 31 /163 variables (removed 132) and now considering 71/245 (removed 174) transitions.
// Phase 1: matrix 71 rows 31 cols
[2024-05-21 20:09:05] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 20:09:05] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 20:09:05] [INFO ] Invariant cache hit.
[2024-05-21 20:09:05] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-21 20:09:05] [INFO ] Implicit Places using invariants and state equation in 95 ms returned [27, 30]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 146 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/163 places, 71/245 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 27 transition count 69
Applied a total of 4 rules in 5 ms. Remains 27 /29 variables (removed 2) and now considering 69/71 (removed 2) transitions.
// Phase 1: matrix 69 rows 27 cols
[2024-05-21 20:09:05] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 20:09:05] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 20:09:05] [INFO ] Invariant cache hit.
[2024-05-21 20:09:05] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-21 20:09:05] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/163 places, 69/245 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 327 ms. Remains : 27/163 places, 69/245 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-05
Stuttering criterion allowed to conclude after 86 steps with 13 reset in 1 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-05 finished in 582 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 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 245/245 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 154 transition count 236
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 154 transition count 236
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 54 place count 154 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 153 transition count 199
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 153 transition count 199
Applied a total of 56 rules in 9 ms. Remains 153 /163 variables (removed 10) and now considering 199/245 (removed 46) transitions.
// Phase 1: matrix 199 rows 153 cols
[2024-05-21 20:09:06] [INFO ] Computed 8 invariants in 3 ms
[2024-05-21 20:09:06] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-21 20:09:06] [INFO ] Invariant cache hit.
[2024-05-21 20:09:06] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-21 20:09:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:09:09] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 3 ms to minimize.
[2024-05-21 20:09:09] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 3 ms to minimize.
[2024-05-21 20:09:09] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-05-21 20:09:09] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 3 ms to minimize.
[2024-05-21 20:09:09] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 2 ms to minimize.
[2024-05-21 20:09:09] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 2 ms to minimize.
[2024-05-21 20:09:10] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 2 ms to minimize.
[2024-05-21 20:09:10] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 3 ms to minimize.
[2024-05-21 20:09:10] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 3 ms to minimize.
[2024-05-21 20:09:10] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-05-21 20:09:10] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 2 ms to minimize.
[2024-05-21 20:09:10] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 3 ms to minimize.
[2024-05-21 20:09:11] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 2 ms to minimize.
[2024-05-21 20:09:11] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2024-05-21 20:09:11] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-21 20:09:11] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-05-21 20:09:11] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 2 ms to minimize.
[2024-05-21 20:09:12] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 3 ms to minimize.
[2024-05-21 20:09:12] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 3 ms to minimize.
[2024-05-21 20:09:12] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:09:12] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 2 ms to minimize.
[2024-05-21 20:09:13] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 2 ms to minimize.
[2024-05-21 20:09:13] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 3 ms to minimize.
[2024-05-21 20:09:13] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 3 ms to minimize.
[2024-05-21 20:09:13] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
[2024-05-21 20:09:13] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-05-21 20:09:13] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2024-05-21 20:09:13] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 3 ms to minimize.
[2024-05-21 20:09:13] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 2 ms to minimize.
[2024-05-21 20:09:14] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 2 ms to minimize.
[2024-05-21 20:09:14] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 2 ms to minimize.
[2024-05-21 20:09:14] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:09:16] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
[2024-05-21 20:09:16] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 3 ms to minimize.
[2024-05-21 20:09:17] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-05-21 20:09:17] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 2 ms to minimize.
[2024-05-21 20:09:17] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 199/352 variables, 153/198 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:09:21] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/352 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 199 constraints, problems are : Problem set: 0 solved, 198 unsolved in 22882 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:09:30] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:09:32] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 199/352 variables, 153/201 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 198/399 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-21 20:09:35] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (OVERLAPS) 0/352 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 400 constraints, problems are : Problem set: 0 solved, 198 unsolved in 16745 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 41/41 constraints]
After SMT, in 39729ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 39734ms
Starting structural reductions in LTL mode, iteration 1 : 153/163 places, 199/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40107 ms. Remains : 153/163 places, 199/245 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-06 finished in 40232 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&(p1 U p2))))))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 245/245 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 155 transition count 237
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 155 transition count 237
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 52 place count 155 transition count 201
Applied a total of 52 rules in 5 ms. Remains 155 /163 variables (removed 8) and now considering 201/245 (removed 44) transitions.
// Phase 1: matrix 201 rows 155 cols
[2024-05-21 20:09:46] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 20:09:46] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 20:09:46] [INFO ] Invariant cache hit.
[2024-05-21 20:09:46] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-21 20:09:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 20:09:48] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 3 ms to minimize.
[2024-05-21 20:09:48] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-05-21 20:09:48] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 3 ms to minimize.
[2024-05-21 20:09:48] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 3 ms to minimize.
[2024-05-21 20:09:48] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 2 ms to minimize.
[2024-05-21 20:09:48] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 2 ms to minimize.
[2024-05-21 20:09:49] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-05-21 20:09:49] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-05-21 20:09:49] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 2 ms to minimize.
[2024-05-21 20:09:49] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-05-21 20:09:49] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 2 ms to minimize.
[2024-05-21 20:09:49] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-05-21 20:09:49] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 3 ms to minimize.
[2024-05-21 20:09:49] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 3 ms to minimize.
[2024-05-21 20:09:49] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 3 ms to minimize.
[2024-05-21 20:09:50] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-05-21 20:09:50] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-21 20:09:50] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 2 ms to minimize.
[2024-05-21 20:09:50] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 3 ms to minimize.
[2024-05-21 20:09:50] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 20:09:50] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 4 ms to minimize.
[2024-05-21 20:09:51] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-21 20:09:51] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 2 ms to minimize.
[2024-05-21 20:09:51] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 2 ms to minimize.
[2024-05-21 20:09:51] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 2 ms to minimize.
[2024-05-21 20:09:51] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-05-21 20:09:51] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 2 ms to minimize.
[2024-05-21 20:09:51] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 2 ms to minimize.
[2024-05-21 20:09:51] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 2 ms to minimize.
[2024-05-21 20:09:52] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 2 ms to minimize.
[2024-05-21 20:09:52] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2024-05-21 20:09:52] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 3 ms to minimize.
[2024-05-21 20:09:52] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 2 ms to minimize.
[2024-05-21 20:09:52] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 2 ms to minimize.
[2024-05-21 20:09:52] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 15/43 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 20:09:54] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 2 ms to minimize.
[2024-05-21 20:09:54] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 3 ms to minimize.
[2024-05-21 20:09:54] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-05-21 20:09:54] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 201/356 variables, 155/202 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 0/356 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 202 constraints, problems are : Problem set: 0 solved, 200 unsolved in 13375 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 20:10:01] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-05-21 20:10:02] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 201/356 variables, 155/204 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 200/404 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 20:10:04] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (OVERLAPS) 0/356 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 356/356 variables, and 405 constraints, problems are : Problem set: 0 solved, 200 unsolved in 20199 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 42/42 constraints]
After SMT, in 33656ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 33660ms
Starting structural reductions in LTL mode, iteration 1 : 155/163 places, 201/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33912 ms. Remains : 155/163 places, 201/245 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-07 finished in 34159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1||F(p2)))))))'
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 245/245 transitions.
Graph (trivial) has 143 edges and 163 vertex of which 4 / 163 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 160 transition count 180
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 81 rules applied. Total rules applied 144 place count 98 transition count 161
Reduce places removed 11 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 14 rules applied. Total rules applied 158 place count 87 transition count 158
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 7 rules applied. Total rules applied 165 place count 84 transition count 154
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 167 place count 82 transition count 154
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 167 place count 82 transition count 148
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 179 place count 76 transition count 148
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 185 place count 70 transition count 142
Iterating global reduction 5 with 6 rules applied. Total rules applied 191 place count 70 transition count 142
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 5 with 36 rules applied. Total rules applied 227 place count 70 transition count 106
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 228 place count 69 transition count 103
Iterating global reduction 6 with 1 rules applied. Total rules applied 229 place count 69 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 6 with 2 rules applied. Total rules applied 231 place count 69 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 232 place count 68 transition count 101
Performed 26 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 8 with 52 rules applied. Total rules applied 284 place count 42 transition count 74
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 289 place count 37 transition count 59
Iterating global reduction 8 with 5 rules applied. Total rules applied 294 place count 37 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 296 place count 37 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 298 place count 36 transition count 56
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 302 place count 34 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 303 place count 33 transition count 73
Applied a total of 303 rules in 40 ms. Remains 33 /163 variables (removed 130) and now considering 73/245 (removed 172) transitions.
// Phase 1: matrix 73 rows 33 cols
[2024-05-21 20:10:20] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 20:10:20] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 20:10:20] [INFO ] Invariant cache hit.
[2024-05-21 20:10:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 20:10:20] [INFO ] Implicit Places using invariants and state equation in 91 ms returned [29, 32]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 157 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/163 places, 73/245 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 30 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 29 transition count 71
Applied a total of 4 rules in 6 ms. Remains 29 /31 variables (removed 2) and now considering 71/73 (removed 2) transitions.
// Phase 1: matrix 71 rows 29 cols
[2024-05-21 20:10:20] [INFO ] Computed 5 invariants in 6 ms
[2024-05-21 20:10:20] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 20:10:20] [INFO ] Invariant cache hit.
[2024-05-21 20:10:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:10:20] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 29/163 places, 71/245 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 366 ms. Remains : 29/163 places, 71/245 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-09
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-09 finished in 520 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&&X(X((F(p1) U p2)))))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 245/245 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 156 transition count 238
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 156 transition count 238
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 50 place count 156 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 155 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 155 transition count 201
Applied a total of 52 rules in 8 ms. Remains 155 /163 variables (removed 8) and now considering 201/245 (removed 44) transitions.
// Phase 1: matrix 201 rows 155 cols
[2024-05-21 20:10:20] [INFO ] Computed 8 invariants in 4 ms
[2024-05-21 20:10:21] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-21 20:10:21] [INFO ] Invariant cache hit.
[2024-05-21 20:10:21] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2024-05-21 20:10:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 20:10:23] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 3 ms to minimize.
[2024-05-21 20:10:23] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-05-21 20:10:23] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-21 20:10:23] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
[2024-05-21 20:10:23] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 3 ms to minimize.
[2024-05-21 20:10:24] [INFO ] Deduced a trap composed of 32 places in 123 ms of which 3 ms to minimize.
[2024-05-21 20:10:24] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 3 ms to minimize.
[2024-05-21 20:10:24] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 3 ms to minimize.
[2024-05-21 20:10:24] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-05-21 20:10:24] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 3 ms to minimize.
[2024-05-21 20:10:24] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2024-05-21 20:10:24] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 3 ms to minimize.
[2024-05-21 20:10:25] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 3 ms to minimize.
[2024-05-21 20:10:25] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 3 ms to minimize.
[2024-05-21 20:10:25] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 3 ms to minimize.
[2024-05-21 20:10:25] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-05-21 20:10:25] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 2 ms to minimize.
[2024-05-21 20:10:25] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 3 ms to minimize.
[2024-05-21 20:10:25] [INFO ] Deduced a trap composed of 43 places in 141 ms of which 3 ms to minimize.
[2024-05-21 20:10:26] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 20:10:26] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 3 ms to minimize.
[2024-05-21 20:10:26] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 3 ms to minimize.
[2024-05-21 20:10:26] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 3 ms to minimize.
[2024-05-21 20:10:26] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 3 ms to minimize.
[2024-05-21 20:10:27] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-05-21 20:10:27] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 3 ms to minimize.
[2024-05-21 20:10:27] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2024-05-21 20:10:27] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 2 ms to minimize.
[2024-05-21 20:10:27] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 2 ms to minimize.
[2024-05-21 20:10:27] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 2 ms to minimize.
[2024-05-21 20:10:27] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 2 ms to minimize.
[2024-05-21 20:10:28] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 2 ms to minimize.
[2024-05-21 20:10:28] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 2 ms to minimize.
[2024-05-21 20:10:28] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 3 ms to minimize.
[2024-05-21 20:10:28] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 15/43 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 20:10:30] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
[2024-05-21 20:10:30] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 3 ms to minimize.
[2024-05-21 20:10:31] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 2 ms to minimize.
[2024-05-21 20:10:31] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 201/356 variables, 155/202 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 0/356 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 202 constraints, problems are : Problem set: 0 solved, 200 unsolved in 18600 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-21 20:10:42] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 2 ms to minimize.
[2024-05-21 20:10:42] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-05-21 20:10:42] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (OVERLAPS) 201/356 variables, 155/205 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 200/405 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 0/356 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 356/356 variables, and 405 constraints, problems are : Problem set: 0 solved, 200 unsolved in 16825 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 42/42 constraints]
After SMT, in 35513ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 35517ms
Starting structural reductions in LTL mode, iteration 1 : 155/163 places, 201/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35867 ms. Remains : 155/163 places, 201/245 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-11 finished in 36096 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||X(G(p1))))&&F(p2))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 245/245 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 156 transition count 238
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 156 transition count 238
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 50 place count 156 transition count 202
Applied a total of 50 rules in 4 ms. Remains 156 /163 variables (removed 7) and now considering 202/245 (removed 43) transitions.
// Phase 1: matrix 202 rows 156 cols
[2024-05-21 20:10:57] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 20:10:57] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 20:10:57] [INFO ] Invariant cache hit.
[2024-05-21 20:10:57] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2024-05-21 20:10:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 20:10:59] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2024-05-21 20:10:59] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 2 ms to minimize.
[2024-05-21 20:10:59] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-21 20:10:59] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-05-21 20:11:00] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 3 ms to minimize.
[2024-05-21 20:11:00] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-05-21 20:11:00] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 2 ms to minimize.
[2024-05-21 20:11:00] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 1 ms to minimize.
[2024-05-21 20:11:00] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-21 20:11:00] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2024-05-21 20:11:00] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-05-21 20:11:00] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 3 ms to minimize.
[2024-05-21 20:11:01] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 2 ms to minimize.
[2024-05-21 20:11:01] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-21 20:11:01] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 3 ms to minimize.
[2024-05-21 20:11:01] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 3 ms to minimize.
[2024-05-21 20:11:01] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 3 ms to minimize.
[2024-05-21 20:11:01] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 3 ms to minimize.
[2024-05-21 20:11:01] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 3 ms to minimize.
[2024-05-21 20:11:02] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 20:11:02] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 3 ms to minimize.
[2024-05-21 20:11:02] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 2 ms to minimize.
[2024-05-21 20:11:02] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 2 ms to minimize.
[2024-05-21 20:11:03] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 3 ms to minimize.
[2024-05-21 20:11:03] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 3 ms to minimize.
[2024-05-21 20:11:03] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 2 ms to minimize.
[2024-05-21 20:11:03] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 2 ms to minimize.
[2024-05-21 20:11:04] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 20:11:05] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2024-05-21 20:11:06] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 20:11:07] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 2 ms to minimize.
[2024-05-21 20:11:07] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
[2024-05-21 20:11:07] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 3 ms to minimize.
[2024-05-21 20:11:08] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 3 ms to minimize.
[2024-05-21 20:11:08] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 3 ms to minimize.
[2024-05-21 20:11:08] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 7 (OVERLAPS) 202/358 variables, 156/200 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 20:11:14] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/358 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 11 (OVERLAPS) 0/358 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 201 constraints, problems are : Problem set: 0 solved, 201 unsolved in 22796 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 20:11:21] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (OVERLAPS) 202/358 variables, 156/202 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 201/403 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 20:11:25] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 3 ms to minimize.
[2024-05-21 20:11:25] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 201 unsolved
[2024-05-21 20:11:30] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 10 (OVERLAPS) 0/358 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 201 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 406 constraints, problems are : Problem set: 0 solved, 201 unsolved in 25454 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 41/41 constraints]
After SMT, in 48304ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 48309ms
Starting structural reductions in LTL mode, iteration 1 : 156/163 places, 202/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48561 ms. Remains : 156/163 places, 202/245 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-12 finished in 48808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 245/245 transitions.
Graph (trivial) has 151 edges and 163 vertex of which 4 / 163 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 160 transition count 180
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 86 rules applied. Total rules applied 149 place count 98 transition count 156
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 15 rules applied. Total rules applied 164 place count 84 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 165 place count 83 transition count 155
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 165 place count 83 transition count 148
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 179 place count 76 transition count 148
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 185 place count 70 transition count 142
Iterating global reduction 4 with 6 rules applied. Total rules applied 191 place count 70 transition count 142
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 227 place count 70 transition count 106
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 227 place count 70 transition count 105
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 229 place count 69 transition count 105
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 230 place count 68 transition count 102
Iterating global reduction 5 with 1 rules applied. Total rules applied 231 place count 68 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 5 with 2 rules applied. Total rules applied 233 place count 68 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 234 place count 67 transition count 100
Performed 26 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 7 with 52 rules applied. Total rules applied 286 place count 41 transition count 73
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 292 place count 35 transition count 54
Iterating global reduction 7 with 6 rules applied. Total rules applied 298 place count 35 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 300 place count 35 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 302 place count 34 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 306 place count 32 transition count 69
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 308 place count 30 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 309 place count 29 transition count 67
Applied a total of 309 rules in 29 ms. Remains 29 /163 variables (removed 134) and now considering 67/245 (removed 178) transitions.
// Phase 1: matrix 67 rows 29 cols
[2024-05-21 20:11:45] [INFO ] Computed 6 invariants in 0 ms
[2024-05-21 20:11:45] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 20:11:45] [INFO ] Invariant cache hit.
[2024-05-21 20:11:45] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-21 20:11:45] [INFO ] Implicit Places using invariants and state equation in 81 ms returned [25, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 152 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/163 places, 67/245 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 25 transition count 65
Applied a total of 4 rules in 3 ms. Remains 25 /27 variables (removed 2) and now considering 65/67 (removed 2) transitions.
// Phase 1: matrix 65 rows 25 cols
[2024-05-21 20:11:46] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 20:11:46] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 20:11:46] [INFO ] Invariant cache hit.
[2024-05-21 20:11:46] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-21 20:11:46] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/163 places, 65/245 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 324 ms. Remains : 25/163 places, 65/245 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03b-LTLFireability-13
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03b-LTLFireability-13 finished in 382 ms.
All properties solved by simple procedures.
Total runtime 273707 ms.

BK_STOP 1716322306269

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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