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-171620167300227.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-01b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167300227
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 15K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 12 18:03 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 31K 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-01b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716319898160

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-01b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-21 19:31:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 19:31:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:31:41] [INFO ] Load time of PNML (sax parser for PT used): 229 ms
[2024-05-21 19:31:41] [INFO ] Transformed 119 places.
[2024-05-21 19:31:41] [INFO ] Transformed 132 transitions.
[2024-05-21 19:31:41] [INFO ] Found NUPN structural information;
[2024-05-21 19:31:41] [INFO ] Parsed PT model containing 119 places and 132 transitions and 339 arcs in 477 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA AutonomousCar-PT-01b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 132/132 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 109 transition count 122
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 109 transition count 122
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 106 transition count 119
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 106 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 105 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 105 transition count 118
Applied a total of 28 rules in 79 ms. Remains 105 /119 variables (removed 14) and now considering 118/132 (removed 14) transitions.
// Phase 1: matrix 118 rows 105 cols
[2024-05-21 19:31:41] [INFO ] Computed 6 invariants in 16 ms
[2024-05-21 19:31:41] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-21 19:31:41] [INFO ] Invariant cache hit.
[2024-05-21 19:31:42] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-21 19:31:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-21 19:31:43] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 24 ms to minimize.
[2024-05-21 19:31:43] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 3 ms to minimize.
[2024-05-21 19:31:43] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 2 ms to minimize.
[2024-05-21 19:31:44] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
[2024-05-21 19:31:44] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-05-21 19:31:44] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-05-21 19:31:44] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-21 19:31:44] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-05-21 19:31:44] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:31:44] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-21 19:31:44] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
[2024-05-21 19:31:44] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-21 19:31:44] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-21 19:31:44] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 2 ms to minimize.
[2024-05-21 19:31:45] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-21 19:31:45] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-21 19:31:45] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 3 ms to minimize.
[2024-05-21 19:31:45] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 5 ms to minimize.
[2024-05-21 19:31:45] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 2 ms to minimize.
[2024-05-21 19:31:45] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 2 ms to minimize.
[2024-05-21 19:31:45] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-21 19:31:46] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 2 ms to minimize.
[2024-05-21 19:31:46] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 117 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD111 is UNSAT
At refinement iteration 6 (OVERLAPS) 118/223 variables, 105/134 constraints. Problems are: Problem set: 2 solved, 115 unsolved
[2024-05-21 19:31:48] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 1/135 constraints. Problems are: Problem set: 2 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/135 constraints. Problems are: Problem set: 2 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 0/223 variables, 0/135 constraints. Problems are: Problem set: 2 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 135 constraints, problems are : Problem set: 2 solved, 115 unsolved in 8562 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 2 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 2/105 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 24/30 constraints. Problems are: Problem set: 2 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 118/223 variables, 105/135 constraints. Problems are: Problem set: 2 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 115/250 constraints. Problems are: Problem set: 2 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/250 constraints. Problems are: Problem set: 2 solved, 115 unsolved
[2024-05-21 19:31:53] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/223 variables, 1/251 constraints. Problems are: Problem set: 2 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/251 constraints. Problems are: Problem set: 2 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 0/223 variables, 0/251 constraints. Problems are: Problem set: 2 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 251 constraints, problems are : Problem set: 2 solved, 115 unsolved in 6462 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 115/117 constraints, Known Traps: 25/25 constraints]
After SMT, in 15172ms problems are : Problem set: 2 solved, 115 unsolved
Search for dead transitions found 2 dead transitions in 15200ms
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 : 105/119 places, 116/132 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 116
Applied a total of 1 rules in 14 ms. Remains 104 /105 variables (removed 1) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 104 cols
[2024-05-21 19:31:57] [INFO ] Computed 6 invariants in 4 ms
[2024-05-21 19:31:57] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 19:31:57] [INFO ] Invariant cache hit.
[2024-05-21 19:31:57] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 104/119 places, 116/132 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16230 ms. Remains : 104/119 places, 116/132 transitions.
Support contains 28 out of 104 places after structural reductions.
[2024-05-21 19:31:57] [INFO ] Flatten gal took : 65 ms
[2024-05-21 19:31:58] [INFO ] Flatten gal took : 27 ms
[2024-05-21 19:31:58] [INFO ] Input system was already deterministic with 116 transitions.
Support contains 24 out of 104 places (down from 28) after GAL structural reductions.
RANDOM walk for 40000 steps (15 resets) in 2078 ms. (19 steps per ms) remains 1/16 properties
BEST_FIRST walk for 27519 steps (9 resets) in 384 ms. (71 steps per ms) remains 0/1 properties
Computed a total of 27 stabilizing places and 27 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((G(p0)&&F(p1)))))'
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 116/116 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 96 transition count 108
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 96 transition count 108
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 96 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 95 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 95 transition count 103
Applied a total of 22 rules in 21 ms. Remains 95 /104 variables (removed 9) and now considering 103/116 (removed 13) transitions.
// Phase 1: matrix 103 rows 95 cols
[2024-05-21 19:31:59] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 19:31:59] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 19:31:59] [INFO ] Invariant cache hit.
[2024-05-21 19:31:59] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-21 19:31:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 19:32:00] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-21 19:32:00] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 3 ms to minimize.
[2024-05-21 19:32:00] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
[2024-05-21 19:32:00] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-21 19:32:00] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
[2024-05-21 19:32:00] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
[2024-05-21 19:32:00] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
[2024-05-21 19:32:00] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-21 19:32:01] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 3 ms to minimize.
[2024-05-21 19:32:01] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 10 ms to minimize.
[2024-05-21 19:32:01] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-21 19:32:01] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 2 ms to minimize.
[2024-05-21 19:32:01] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 19:32:01] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 2 ms to minimize.
[2024-05-21 19:32:01] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 4 ms to minimize.
[2024-05-21 19:32:02] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:32:02] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 2 ms to minimize.
[2024-05-21 19:32:02] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 19:32:02] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 19:32:03] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 103/198 variables, 95/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 121 constraints, problems are : Problem set: 0 solved, 102 unsolved in 7083 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 103/198 variables, 95/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 102/223 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 19:32:09] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/198 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 224 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6100 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 21/21 constraints]
After SMT, in 13206ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 13209ms
Starting structural reductions in LTL mode, iteration 1 : 95/104 places, 103/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13369 ms. Remains : 95/104 places, 103/116 transitions.
Stuttering acceptance computed with spot in 333 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 384 ms.
Product exploration explored 100000 steps with 2 reset in 255 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 129 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 13779 steps (11 resets) in 49 ms. (275 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 217 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 95 /95 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-21 19:32:14] [INFO ] Invariant cache hit.
[2024-05-21 19:32:14] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 19:32:14] [INFO ] Invariant cache hit.
[2024-05-21 19:32:14] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-05-21 19:32:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 19:32:15] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2024-05-21 19:32:15] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-21 19:32:15] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
[2024-05-21 19:32:15] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 2 ms to minimize.
[2024-05-21 19:32:16] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 3 ms to minimize.
[2024-05-21 19:32:16] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-21 19:32:16] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:32:16] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-05-21 19:32:16] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-05-21 19:32:16] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 2 ms to minimize.
[2024-05-21 19:32:16] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:32:16] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 2 ms to minimize.
[2024-05-21 19:32:16] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 19:32:16] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-21 19:32:17] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
[2024-05-21 19:32:17] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:32:17] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-21 19:32:17] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 19:32:17] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 19:32:18] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 103/198 variables, 95/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 121 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6546 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 103/198 variables, 95/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 102/223 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-21 19:32:23] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/198 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 224 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6184 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 21/21 constraints]
After SMT, in 12755ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 12757ms
Finished structural reductions in LTL mode , in 1 iterations and 12950 ms. Remains : 95/95 places, 103/103 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 135 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 3626 steps (3 resets) in 9 ms. (362 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 199 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 72 ms.
Product exploration explored 100000 steps with 0 reset in 130 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 103/103 transitions.
Graph (trivial) has 85 edges and 95 vertex of which 4 / 95 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.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 93 transition count 101
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 42 place count 93 transition count 96
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 42 place count 93 transition count 96
Deduced a syphon composed of 46 places in 1 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 52 place count 93 transition count 96
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 83 place count 62 transition count 65
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 114 place count 62 transition count 65
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 136 place count 62 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 137 place count 62 transition count 69
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 155 place count 44 transition count 50
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 3 with 18 rules applied. Total rules applied 173 place count 44 transition count 50
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 176 place count 44 transition count 47
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 177 place count 43 transition count 46
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 178 place count 43 transition count 46
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 180 place count 43 transition count 52
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 180 rules in 54 ms. Remains 43 /95 variables (removed 52) and now considering 52/103 (removed 51) transitions.
[2024-05-21 19:32:29] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
// Phase 1: matrix 52 rows 43 cols
[2024-05-21 19:32:29] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 19:32:29] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-21 19:32:30] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:32:30] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:32:30] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-21 19:32:30] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-21 19:32:30] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-21 19:32:30] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
[2024-05-21 19:32:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
[2024-05-21 19:32:30] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
[2024-05-21 19:32:30] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 9/14 constraints. Problems are: Problem set: 20 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 20 solved, 31 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 4 (OVERLAPS) 51/94 variables, 43/57 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 10/67 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/67 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/95 variables, 1/68 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 0/68 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/95 variables, 0/68 constraints. Problems are: Problem set: 33 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 68 constraints, problems are : Problem set: 33 solved, 18 unsolved in 1242 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 33 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 25/43 variables, 5/5 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 9/14 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 51/94 variables, 43/57 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 10/67 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 18/85 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/85 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 1/95 variables, 1/86 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/95 variables, 0/86 constraints. Problems are: Problem set: 33 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/95 variables, 0/86 constraints. Problems are: Problem set: 33 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/95 variables, and 86 constraints, problems are : Problem set: 33 solved, 18 unsolved in 636 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 18/51 constraints, Known Traps: 9/9 constraints]
After SMT, in 1904ms problems are : Problem set: 33 solved, 18 unsolved
Search for dead transitions found 33 dead transitions in 1905ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 43/95 places, 19/103 transitions.
Graph (complete) has 74 edges and 43 vertex of which 19 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 19 /43 variables (removed 24) and now considering 19/19 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/95 places, 19/103 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1982 ms. Remains : 19/95 places, 19/103 transitions.
Built C files in :
/tmp/ltsmin6395849137062185354
[2024-05-21 19:32:31] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6395849137062185354
Running compilation step : cd /tmp/ltsmin6395849137062185354;'/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 561 ms.
Running link step : cd /tmp/ltsmin6395849137062185354;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin6395849137062185354;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7123302279177897154.hoa' '--buchi-type=spotba'
LTSmin run took 236 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-01b-LTLCardinality-00 finished in 33243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 116/116 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 95 transition count 107
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 95 transition count 107
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 95 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 94 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 94 transition count 102
Applied a total of 24 rules in 5 ms. Remains 94 /104 variables (removed 10) and now considering 102/116 (removed 14) transitions.
// Phase 1: matrix 102 rows 94 cols
[2024-05-21 19:32:32] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:32:32] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 19:32:32] [INFO ] Invariant cache hit.
[2024-05-21 19:32:32] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-21 19:32:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-21 19:32:33] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 3 ms to minimize.
[2024-05-21 19:32:33] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:32:33] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-21 19:32:33] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-21 19:32:33] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-21 19:32:33] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-21 19:32:33] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-21 19:32:33] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-21 19:32:34] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 2 ms to minimize.
[2024-05-21 19:32:34] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 19:32:34] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-21 19:32:34] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-21 19:32:34] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-21 19:32:34] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-21 19:32:34] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 2 ms to minimize.
[2024-05-21 19:32:34] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-21 19:32:34] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-21 19:32:34] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-21 19:32:34] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 119 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4408 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-21 19:32:37] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/120 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 101/221 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-21 19:32:38] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 222 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5154 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 21/21 constraints]
After SMT, in 9581ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 9583ms
Starting structural reductions in LTL mode, iteration 1 : 94/104 places, 102/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9756 ms. Remains : 94/104 places, 102/116 transitions.
Stuttering acceptance computed with spot in 268 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-01
Product exploration explored 100000 steps with 1 reset in 97 ms.
Entered a terminal (fully accepting) state of product in 147 steps with 2 reset in 1 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLCardinality-01 finished in 10138 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(G(p2))||p1))))))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 116/116 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 98 transition count 110
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 98 transition count 110
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 97 transition count 109
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 97 transition count 109
Applied a total of 14 rules in 9 ms. Remains 97 /104 variables (removed 7) and now considering 109/116 (removed 7) transitions.
// Phase 1: matrix 109 rows 97 cols
[2024-05-21 19:32:42] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:32:42] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 19:32:42] [INFO ] Invariant cache hit.
[2024-05-21 19:32:42] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-05-21 19:32:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-21 19:32:43] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-05-21 19:32:43] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-05-21 19:32:44] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-05-21 19:32:44] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
[2024-05-21 19:32:44] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-21 19:32:44] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-05-21 19:32:44] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-05-21 19:32:44] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-21 19:32:44] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
[2024-05-21 19:32:44] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:32:44] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 2 ms to minimize.
[2024-05-21 19:32:44] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 2 ms to minimize.
[2024-05-21 19:32:44] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
[2024-05-21 19:32:45] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2024-05-21 19:32:45] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-21 19:32:45] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
[2024-05-21 19:32:45] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-21 19:32:45] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:32:45] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-21 19:32:45] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
[2024-05-21 19:32:45] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-05-21 19:32:46] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
[2024-05-21 19:32:46] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-21 19:32:46] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-21 19:32:47] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 109/206 variables, 97/128 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/206 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 128 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7860 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/206 variables, 97/128 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 108/236 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-21 19:32:52] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/206 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 237 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6215 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 26/26 constraints]
After SMT, in 14103ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 14106ms
Starting structural reductions in LTL mode, iteration 1 : 97/104 places, 109/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14341 ms. Remains : 97/104 places, 109/116 transitions.
Stuttering acceptance computed with spot in 239 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-02
Product exploration explored 100000 steps with 6 reset in 190 ms.
Product exploration explored 100000 steps with 1 reset in 259 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 141 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[true, (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (15 resets) in 186 ms. (213 steps per ms) remains 4/6 properties
BEST_FIRST walk for 30211 steps (12 resets) in 318 ms. (94 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p2)))), (F p2), (F (NOT (AND p1 p0))), (F (NOT (OR p1 (NOT p0))))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 6 factoid took 184 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-01b-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-01b-LTLCardinality-02 finished in 15852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 116/116 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 95 transition count 107
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 95 transition count 107
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 95 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 94 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 94 transition count 102
Applied a total of 24 rules in 10 ms. Remains 94 /104 variables (removed 10) and now considering 102/116 (removed 14) transitions.
// Phase 1: matrix 102 rows 94 cols
[2024-05-21 19:32:58] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 19:32:58] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 19:32:58] [INFO ] Invariant cache hit.
[2024-05-21 19:32:58] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-21 19:32:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-21 19:32:59] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-05-21 19:32:59] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-21 19:32:59] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-05-21 19:32:59] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2024-05-21 19:32:59] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-21 19:33:00] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-21 19:33:00] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-05-21 19:33:00] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-05-21 19:33:00] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 2 ms to minimize.
[2024-05-21 19:33:00] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
[2024-05-21 19:33:00] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-05-21 19:33:00] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 3 ms to minimize.
[2024-05-21 19:33:00] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
[2024-05-21 19:33:00] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 2 ms to minimize.
[2024-05-21 19:33:00] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-21 19:33:00] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-21 19:33:01] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:33:01] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-21 19:33:01] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 119 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5454 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-21 19:33:05] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/120 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 101/221 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-21 19:33:06] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 222 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5644 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 21/21 constraints]
After SMT, in 11119ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 11122ms
Starting structural reductions in LTL mode, iteration 1 : 94/104 places, 102/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11341 ms. Remains : 94/104 places, 102/116 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-03
Product exploration explored 100000 steps with 20000 reset in 248 ms.
Product exploration explored 100000 steps with 20000 reset in 196 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 121 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (15 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 16842 steps (17 resets) in 41 ms. (401 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 118 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-21 19:33:11] [INFO ] Invariant cache hit.
[2024-05-21 19:33:11] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-21 19:33:11] [INFO ] Invariant cache hit.
[2024-05-21 19:33:11] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-21 19:33:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-21 19:33:12] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-21 19:33:12] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-21 19:33:13] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 3 ms to minimize.
[2024-05-21 19:33:13] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-05-21 19:33:13] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 2 ms to minimize.
[2024-05-21 19:33:13] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-05-21 19:33:13] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-05-21 19:33:13] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-21 19:33:13] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 2 ms to minimize.
[2024-05-21 19:33:13] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 2 ms to minimize.
[2024-05-21 19:33:13] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-05-21 19:33:13] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-05-21 19:33:13] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-05-21 19:33:14] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 2 ms to minimize.
[2024-05-21 19:33:14] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 2 ms to minimize.
[2024-05-21 19:33:14] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:33:14] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 2 ms to minimize.
[2024-05-21 19:33:14] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-21 19:33:14] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 119 constraints, problems are : Problem set: 0 solved, 101 unsolved in 6232 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-21 19:33:18] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/120 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 101/221 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-21 19:33:20] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 222 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5458 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 21/21 constraints]
After SMT, in 11713ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 11714ms
Finished structural reductions in LTL mode , in 1 iterations and 11898 ms. Remains : 94/94 places, 102/102 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 30107 steps (12 resets) in 63 ms. (470 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 135 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 109 ms.
Product exploration explored 100000 steps with 20000 reset in 134 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 102/102 transitions.
Graph (trivial) has 86 edges and 94 vertex of which 4 / 94 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.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 92 transition count 100
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 42 place count 92 transition count 95
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 42 place count 92 transition count 96
Deduced a syphon composed of 47 places in 1 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 53 place count 92 transition count 96
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 84 place count 61 transition count 65
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 2 with 31 rules applied. Total rules applied 115 place count 61 transition count 65
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 37 places in 1 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 135 place count 61 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 137 place count 61 transition count 65
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 152 place count 46 transition count 49
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 3 with 15 rules applied. Total rules applied 167 place count 46 transition count 49
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 169 place count 46 transition count 47
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 170 place count 45 transition count 46
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 171 place count 45 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 172 place count 45 transition count 46
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 174 place count 43 transition count 44
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 176 place count 43 transition count 44
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 179 place count 43 transition count 56
Deduced a syphon composed of 25 places in 0 ms
Applied a total of 179 rules in 49 ms. Remains 43 /94 variables (removed 51) and now considering 56/102 (removed 46) transitions.
[2024-05-21 19:33:25] [INFO ] Redundant transitions in 1 ms returned []
Running 55 sub problems to find dead transitions.
// Phase 1: matrix 56 rows 43 cols
[2024-05-21 19:33:25] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 19:33:25] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-21 19:33:25] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:33:25] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-05-21 19:33:25] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-05-21 19:33:25] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
[2024-05-21 19:33:25] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
[2024-05-21 19:33:26] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:33:26] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-21 19:33:26] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
[2024-05-21 19:33:26] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD33 is UNSAT
[2024-05-21 19:33:26] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 10/15 constraints. Problems are: Problem set: 22 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 22 solved, 33 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
At refinement iteration 4 (OVERLAPS) 55/98 variables, 43/58 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 15/73 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/73 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 1/99 variables, 1/74 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/74 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/99 variables, 0/74 constraints. Problems are: Problem set: 38 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 74 constraints, problems are : Problem set: 38 solved, 17 unsolved in 1541 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 38 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 26/43 variables, 5/5 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 10/15 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 55/98 variables, 43/58 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 15/73 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 17/90 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/90 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/99 variables, 1/91 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/91 constraints. Problems are: Problem set: 38 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/99 variables, 0/91 constraints. Problems are: Problem set: 38 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 91 constraints, problems are : Problem set: 38 solved, 17 unsolved in 722 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 43/43 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 17/55 constraints, Known Traps: 10/10 constraints]
After SMT, in 2289ms problems are : Problem set: 38 solved, 17 unsolved
Search for dead transitions found 38 dead transitions in 2292ms
Found 38 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 38 transitions
Dead transitions reduction (with SMT) removed 38 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 43/94 places, 18/102 transitions.
Graph (complete) has 79 edges and 43 vertex of which 18 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 18 /43 variables (removed 25) and now considering 18/18 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/94 places, 18/102 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2360 ms. Remains : 18/94 places, 18/102 transitions.
Built C files in :
/tmp/ltsmin14892252142498826491
[2024-05-21 19:33:27] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14892252142498826491
Running compilation step : cd /tmp/ltsmin14892252142498826491;'/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 482 ms.
Running link step : cd /tmp/ltsmin14892252142498826491;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin14892252142498826491;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16174389246630005433.hoa' '--buchi-type=spotba'
LTSmin run took 135 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-01b-LTLCardinality-03 finished in 29913 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 116/116 transitions.
Graph (trivial) has 93 edges and 104 vertex of which 4 / 104 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 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 101 transition count 72
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 49 rules applied. Total rules applied 91 place count 60 transition count 64
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 96 place count 56 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 97 place count 55 transition count 63
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 97 place count 55 transition count 56
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 111 place count 48 transition count 56
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 119 place count 40 transition count 48
Iterating global reduction 4 with 8 rules applied. Total rules applied 127 place count 40 transition count 48
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 131 place count 40 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 131 place count 40 transition count 43
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 133 place count 39 transition count 43
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 135 place count 37 transition count 41
Iterating global reduction 5 with 2 rules applied. Total rules applied 137 place count 37 transition count 41
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 139 place count 37 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 140 place count 36 transition count 39
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 168 place count 22 transition count 24
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 169 place count 21 transition count 22
Iterating global reduction 7 with 1 rules applied. Total rules applied 170 place count 21 transition count 22
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 171 place count 21 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 173 place count 19 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 174 place count 18 transition count 20
Applied a total of 174 rules in 47 ms. Remains 18 /104 variables (removed 86) and now considering 20/116 (removed 96) transitions.
// Phase 1: matrix 20 rows 18 cols
[2024-05-21 19:33:28] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 19:33:28] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 19:33:28] [INFO ] Invariant cache hit.
[2024-05-21 19:33:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:33:28] [INFO ] Implicit Places using invariants and state equation in 64 ms returned [14, 17]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 107 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/104 places, 20/116 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 15 transition count 19
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 14 transition count 20
Applied a total of 4 rules in 5 ms. Remains 14 /16 variables (removed 2) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 14 cols
[2024-05-21 19:33:28] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:33:28] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-21 19:33:28] [INFO ] Invariant cache hit.
[2024-05-21 19:33:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:33:28] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/104 places, 20/116 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 249 ms. Remains : 14/104 places, 20/116 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-04
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLCardinality-04 finished in 319 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 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 116/116 transitions.
Graph (trivial) has 95 edges and 104 vertex of which 4 / 104 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 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 101 transition count 70
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 54 rules applied. Total rules applied 98 place count 58 transition count 59
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 104 place count 52 transition count 59
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 104 place count 52 transition count 53
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 116 place count 46 transition count 53
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 123 place count 39 transition count 46
Iterating global reduction 3 with 7 rules applied. Total rules applied 130 place count 39 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 134 place count 39 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 134 place count 39 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 136 place count 38 transition count 41
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 137 place count 37 transition count 40
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 37 transition count 40
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 140 place count 37 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 141 place count 36 transition count 38
Performed 13 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 167 place count 23 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 168 place count 23 transition count 23
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 169 place count 22 transition count 21
Iterating global reduction 7 with 1 rules applied. Total rules applied 170 place count 22 transition count 21
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 172 place count 21 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 174 place count 20 transition count 20
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 176 place count 18 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 177 place count 17 transition count 18
Applied a total of 177 rules in 23 ms. Remains 17 /104 variables (removed 87) and now considering 18/116 (removed 98) transitions.
// Phase 1: matrix 18 rows 17 cols
[2024-05-21 19:33:28] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 19:33:28] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-21 19:33:28] [INFO ] Invariant cache hit.
[2024-05-21 19:33:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:33:28] [INFO ] Implicit Places using invariants and state equation in 64 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 109 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/104 places, 18/116 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 15 transition count 17
Applied a total of 2 rules in 2 ms. Remains 15 /16 variables (removed 1) and now considering 17/18 (removed 1) transitions.
// Phase 1: matrix 17 rows 15 cols
[2024-05-21 19:33:28] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 19:33:28] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-21 19:33:28] [INFO ] Invariant cache hit.
[2024-05-21 19:33:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:33:28] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/104 places, 17/116 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 227 ms. Remains : 15/104 places, 17/116 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-06
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLCardinality-06 finished in 291 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(p1&&X(X(G(!p0))))))))'
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 116/116 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 97 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 97 transition count 109
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 97 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 96 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 96 transition count 104
Applied a total of 20 rules in 7 ms. Remains 96 /104 variables (removed 8) and now considering 104/116 (removed 12) transitions.
// Phase 1: matrix 104 rows 96 cols
[2024-05-21 19:33:28] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 19:33:29] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 19:33:29] [INFO ] Invariant cache hit.
[2024-05-21 19:33:29] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-05-21 19:33:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-21 19:33:30] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
[2024-05-21 19:33:30] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 3 ms to minimize.
[2024-05-21 19:33:30] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-05-21 19:33:30] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-05-21 19:33:30] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-05-21 19:33:30] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-21 19:33:30] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-05-21 19:33:30] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-21 19:33:31] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-05-21 19:33:31] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-21 19:33:31] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 2 ms to minimize.
[2024-05-21 19:33:31] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 2 ms to minimize.
[2024-05-21 19:33:31] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-05-21 19:33:31] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-05-21 19:33:31] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-05-21 19:33:31] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 2 ms to minimize.
[2024-05-21 19:33:31] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
[2024-05-21 19:33:31] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-21 19:33:32] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 104/200 variables, 96/121 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 121 constraints, problems are : Problem set: 0 solved, 103 unsolved in 6069 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-21 19:33:36] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-05-21 19:33:36] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 104/200 variables, 96/123 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 103/226 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-21 19:33:38] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/200 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-21 19:33:40] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 0/200 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 228 constraints, problems are : Problem set: 0 solved, 103 unsolved in 8316 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 23/23 constraints]
After SMT, in 14404ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 14410ms
Starting structural reductions in LTL mode, iteration 1 : 96/104 places, 104/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14635 ms. Remains : 96/104 places, 104/116 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) (NOT p0)), false, false, false, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 91 ms.
Product exploration explored 100000 steps with 4 reset in 181 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 154 ms. Reduced automaton from 5 states, 17 edges and 2 AP (stutter sensitive) to 5 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (15 resets) in 170 ms. (233 steps per ms) remains 1/6 properties
BEST_FIRST walk for 21519 steps (14 resets) in 24 ms. (860 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 355 ms. Reduced automaton from 5 states, 17 edges and 2 AP (stutter sensitive) to 5 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p1))]
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 104/104 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-05-21 19:33:45] [INFO ] Invariant cache hit.
[2024-05-21 19:33:45] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 19:33:45] [INFO ] Invariant cache hit.
[2024-05-21 19:33:45] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-05-21 19:33:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-21 19:33:46] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
[2024-05-21 19:33:46] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-05-21 19:33:46] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 2 ms to minimize.
[2024-05-21 19:33:46] [INFO ] Deduced a trap composed of 40 places in 28 ms of which 1 ms to minimize.
[2024-05-21 19:33:46] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:33:46] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-21 19:33:46] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:33:46] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-21 19:33:47] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 2 ms to minimize.
[2024-05-21 19:33:47] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-21 19:33:47] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-21 19:33:47] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 19:33:47] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 19:33:47] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-21 19:33:47] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-21 19:33:47] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-05-21 19:33:47] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-21 19:33:47] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-21 19:33:47] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 104/200 variables, 96/121 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 121 constraints, problems are : Problem set: 0 solved, 103 unsolved in 4923 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-21 19:33:51] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
[2024-05-21 19:33:51] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 104/200 variables, 96/123 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 103/226 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-21 19:33:53] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/200 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-21 19:33:55] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 0/200 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 228 constraints, problems are : Problem set: 0 solved, 103 unsolved in 8581 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 23/23 constraints]
After SMT, in 13523ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 13525ms
Finished structural reductions in LTL mode , in 1 iterations and 13738 ms. Remains : 96/96 places, 104/104 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 286 ms. Reduced automaton from 5 states, 17 edges and 2 AP (stutter sensitive) to 5 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (22 resets) in 208 ms. (191 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40001 steps (25 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
[2024-05-21 19:33:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/96 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 19:33:59] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 104/200 variables, 96/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 19:34:00] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/200 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/96 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 104/200 variables, 96/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/200 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 105 constraints, problems are : Problem set: 0 solved, 1 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 454ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 104/104 transitions.
Graph (trivial) has 84 edges and 96 vertex of which 4 / 96 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 168 edges and 94 vertex of which 92 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 92 transition count 60
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 50 rules applied. Total rules applied 92 place count 54 transition count 48
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 99 place count 47 transition count 48
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 99 place count 47 transition count 42
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 111 place count 41 transition count 42
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 147 place count 23 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 148 place count 23 transition count 23
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 150 place count 21 transition count 21
Iterating global reduction 4 with 2 rules applied. Total rules applied 152 place count 21 transition count 21
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 153 place count 21 transition count 20
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 5 with 2 rules applied. Total rules applied 155 place count 20 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 156 place count 20 transition count 18
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 157 place count 20 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 158 place count 19 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 159 place count 18 transition count 17
Applied a total of 159 rules in 23 ms. Remains 18 /96 variables (removed 78) and now considering 17/104 (removed 87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 18/96 places, 17/104 transitions.
RANDOM walk for 814 steps (96 resets) in 13 ms. (58 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 533 ms. Reduced automaton from 5 states, 17 edges and 2 AP (stutter sensitive) to 5 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1)), false, false, false, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 122 ms.
Product exploration explored 100000 steps with 3 reset in 146 ms.
Built C files in :
/tmp/ltsmin15815457189806400104
[2024-05-21 19:34:01] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15815457189806400104
Running compilation step : cd /tmp/ltsmin15815457189806400104;'/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 398 ms.
Running link step : cd /tmp/ltsmin15815457189806400104;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin15815457189806400104;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10445500117744014431.hoa' '--buchi-type=spotba'
LTSmin run took 386 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-01b-LTLCardinality-07 finished in 33820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 116/116 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 95 transition count 107
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 95 transition count 107
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 95 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 94 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 94 transition count 102
Applied a total of 24 rules in 9 ms. Remains 94 /104 variables (removed 10) and now considering 102/116 (removed 14) transitions.
// Phase 1: matrix 102 rows 94 cols
[2024-05-21 19:34:02] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 19:34:02] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 19:34:02] [INFO ] Invariant cache hit.
[2024-05-21 19:34:02] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-21 19:34:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-21 19:34:03] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
[2024-05-21 19:34:04] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-21 19:34:04] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-21 19:34:04] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-21 19:34:04] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-05-21 19:34:04] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 2 ms to minimize.
[2024-05-21 19:34:04] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-21 19:34:04] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
[2024-05-21 19:34:04] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:34:04] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:34:04] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-21 19:34:04] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:34:04] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-21 19:34:04] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-21 19:34:04] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-21 19:34:04] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-21 19:34:05] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-21 19:34:05] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 18/24 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-21 19:34:05] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 119 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5487 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-21 19:34:09] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/120 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 101/221 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-21 19:34:10] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 222 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5099 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 21/21 constraints]
After SMT, in 10609ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 10613ms
Starting structural reductions in LTL mode, iteration 1 : 94/104 places, 102/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10821 ms. Remains : 94/104 places, 102/116 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-09
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLCardinality-09 finished in 10939 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 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 116/116 transitions.
Graph (trivial) has 87 edges and 104 vertex of which 4 / 104 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 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 101 transition count 75
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 42 rules applied. Total rules applied 81 place count 63 transition count 71
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 86 place count 61 transition count 68
Reduce places removed 3 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 5 rules applied. Total rules applied 91 place count 58 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 92 place count 57 transition count 66
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 92 place count 57 transition count 59
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 106 place count 50 transition count 59
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 114 place count 42 transition count 51
Iterating global reduction 5 with 8 rules applied. Total rules applied 122 place count 42 transition count 51
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 126 place count 42 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 126 place count 42 transition count 46
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 128 place count 41 transition count 46
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 130 place count 39 transition count 44
Iterating global reduction 6 with 2 rules applied. Total rules applied 132 place count 39 transition count 44
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 156 place count 27 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 157 place count 27 transition count 30
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 158 place count 26 transition count 28
Iterating global reduction 7 with 1 rules applied. Total rules applied 159 place count 26 transition count 28
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 161 place count 25 transition count 27
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 162 place count 25 transition count 26
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 165 place count 25 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 167 place count 23 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 168 place count 22 transition count 24
Applied a total of 168 rules in 35 ms. Remains 22 /104 variables (removed 82) and now considering 24/116 (removed 92) transitions.
// Phase 1: matrix 24 rows 22 cols
[2024-05-21 19:34:13] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 19:34:13] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 19:34:13] [INFO ] Invariant cache hit.
[2024-05-21 19:34:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:34:13] [INFO ] Implicit Places using invariants and state equation in 68 ms returned [18, 21]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 117 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/104 places, 24/116 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 18 transition count 22
Applied a total of 4 rules in 2 ms. Remains 18 /20 variables (removed 2) and now considering 22/24 (removed 2) transitions.
// Phase 1: matrix 22 rows 18 cols
[2024-05-21 19:34:13] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 19:34:13] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-21 19:34:13] [INFO ] Invariant cache hit.
[2024-05-21 19:34:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:34:13] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/104 places, 22/116 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 262 ms. Remains : 18/104 places, 22/116 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-11
Product exploration explored 100000 steps with 1 reset in 87 ms.
Stuttering criterion allowed to conclude after 36 steps with 3 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLCardinality-11 finished in 512 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((G(F(p0)) U !p1)))))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 116/116 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 96 transition count 108
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 96 transition count 108
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 96 transition count 104
Applied a total of 20 rules in 3 ms. Remains 96 /104 variables (removed 8) and now considering 104/116 (removed 12) transitions.
// Phase 1: matrix 104 rows 96 cols
[2024-05-21 19:34:14] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 19:34:14] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 19:34:14] [INFO ] Invariant cache hit.
[2024-05-21 19:34:14] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-05-21 19:34:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-21 19:34:15] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-21 19:34:15] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-05-21 19:34:15] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-21 19:34:15] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
[2024-05-21 19:34:15] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 4 ms to minimize.
[2024-05-21 19:34:15] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
[2024-05-21 19:34:16] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 2 ms to minimize.
[2024-05-21 19:34:16] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
[2024-05-21 19:34:16] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-05-21 19:34:16] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-21 19:34:16] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-05-21 19:34:16] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 7 ms to minimize.
[2024-05-21 19:34:16] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2024-05-21 19:34:16] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 2 ms to minimize.
[2024-05-21 19:34:16] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-21 19:34:16] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
[2024-05-21 19:34:17] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 2 ms to minimize.
[2024-05-21 19:34:17] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-21 19:34:18] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 104/200 variables, 96/121 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 121 constraints, problems are : Problem set: 0 solved, 103 unsolved in 6481 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/200 variables, 96/121 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 103/224 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-21 19:34:22] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 225 constraints, problems are : Problem set: 0 solved, 103 unsolved in 5002 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 20/20 constraints]
After SMT, in 11503ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 11505ms
Starting structural reductions in LTL mode, iteration 1 : 96/104 places, 104/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11720 ms. Remains : 96/104 places, 104/116 transitions.
Stuttering acceptance computed with spot in 370 ms :[p1, p1, p1, (NOT p0), (NOT p0), p1]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-13
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLCardinality-13 finished in 12116 ms.
All properties solved by simple procedures.
Total runtime 165780 ms.

BK_STOP 1716320066419

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-01b"
export BK_EXAMINATION="LTLCardinality"
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-01b, examination is LTLCardinality"
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-171620167300227"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-01b.tgz
mv AutonomousCar-PT-01b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;