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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 49K 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-02b-CTLCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2023-12
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2023-13
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2023-14
FORMULA_NAME AutonomousCar-PT-02b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716320276048

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 19:37:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 19:37:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:37:58] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2024-05-21 19:37:58] [INFO ] Transformed 155 places.
[2024-05-21 19:37:58] [INFO ] Transformed 194 transitions.
[2024-05-21 19:37:58] [INFO ] Found NUPN structural information;
[2024-05-21 19:37:58] [INFO ] Parsed PT model containing 155 places and 194 transitions and 620 arcs in 375 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 33 ms.
FORMULA AutonomousCar-PT-02b-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-02b-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 194/194 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 144 transition count 183
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 144 transition count 183
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 142 transition count 181
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 142 transition count 181
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 141 transition count 180
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 141 transition count 180
Applied a total of 28 rules in 85 ms. Remains 141 /155 variables (removed 14) and now considering 180/194 (removed 14) transitions.
// Phase 1: matrix 180 rows 141 cols
[2024-05-21 19:37:59] [INFO ] Computed 7 invariants in 24 ms
[2024-05-21 19:37:59] [INFO ] Implicit Places using invariants in 417 ms returned []
[2024-05-21 19:37:59] [INFO ] Invariant cache hit.
[2024-05-21 19:37:59] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2024-05-21 19:37:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 19:38:02] [INFO ] Deduced a trap composed of 15 places in 246 ms of which 39 ms to minimize.
[2024-05-21 19:38:02] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 4 ms to minimize.
[2024-05-21 19:38:02] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 4 ms to minimize.
[2024-05-21 19:38:03] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2024-05-21 19:38:03] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 2 ms to minimize.
[2024-05-21 19:38:03] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 2 ms to minimize.
[2024-05-21 19:38:03] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 2 ms to minimize.
[2024-05-21 19:38:03] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-21 19:38:03] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 3 ms to minimize.
[2024-05-21 19:38:03] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-05-21 19:38:04] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-05-21 19:38:04] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-05-21 19:38:04] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-05-21 19:38:04] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:38:04] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:38:04] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 2 ms to minimize.
[2024-05-21 19:38:04] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 2 ms to minimize.
[2024-05-21 19:38:04] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
[2024-05-21 19:38:05] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 3 ms to minimize.
[2024-05-21 19:38:05] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 19:38:05] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-05-21 19:38:05] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-21 19:38:06] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-21 19:38:06] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 3 ms to minimize.
[2024-05-21 19:38:06] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 19:38:07] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 2 ms to minimize.
[2024-05-21 19:38:07] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 3 ms to minimize.
[2024-05-21 19:38:08] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 3 ms to minimize.
[2024-05-21 19:38:08] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
[2024-05-21 19:38:08] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 3 ms to minimize.
[2024-05-21 19:38:08] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD169 is UNSAT
At refinement iteration 6 (OVERLAPS) 180/321 variables, 141/179 constraints. Problems are: Problem set: 2 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/179 constraints. Problems are: Problem set: 2 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/321 variables, 0/179 constraints. Problems are: Problem set: 2 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 179 constraints, problems are : Problem set: 2 solved, 177 unsolved in 15089 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 2 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 2/141 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 31/38 constraints. Problems are: Problem set: 2 solved, 177 unsolved
[2024-05-21 19:38:16] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-05-21 19:38:16] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 3 ms to minimize.
[2024-05-21 19:38:17] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/41 constraints. Problems are: Problem set: 2 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 180/321 variables, 141/182 constraints. Problems are: Problem set: 2 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 177/359 constraints. Problems are: Problem set: 2 solved, 177 unsolved
[2024-05-21 19:38:19] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 4 ms to minimize.
[2024-05-21 19:38:20] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 2/361 constraints. Problems are: Problem set: 2 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/361 constraints. Problems are: Problem set: 2 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 0/321 variables, 0/361 constraints. Problems are: Problem set: 2 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 361 constraints, problems are : Problem set: 2 solved, 177 unsolved in 16218 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 177/179 constraints, Known Traps: 36/36 constraints]
After SMT, in 31549ms problems are : Problem set: 2 solved, 177 unsolved
Search for dead transitions found 2 dead transitions in 31579ms
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 : 141/155 places, 178/194 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 140 transition count 178
Applied a total of 1 rules in 9 ms. Remains 140 /141 variables (removed 1) and now considering 178/178 (removed 0) transitions.
// Phase 1: matrix 178 rows 140 cols
[2024-05-21 19:38:31] [INFO ] Computed 7 invariants in 3 ms
[2024-05-21 19:38:31] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 19:38:31] [INFO ] Invariant cache hit.
[2024-05-21 19:38:31] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 140/155 places, 178/194 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32726 ms. Remains : 140/155 places, 178/194 transitions.
Support contains 57 out of 140 places after structural reductions.
[2024-05-21 19:38:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 19:38:31] [INFO ] Flatten gal took : 67 ms
FORMULA AutonomousCar-PT-02b-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 19:38:31] [INFO ] Flatten gal took : 25 ms
[2024-05-21 19:38:31] [INFO ] Input system was already deterministic with 178 transitions.
Support contains 48 out of 140 places (down from 57) after GAL structural reductions.
RANDOM walk for 40000 steps (10 resets) in 2811 ms. (14 steps per ms) remains 5/40 properties
BEST_FIRST walk for 40000 steps (20 resets) in 93 ms. (425 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40000 steps (19 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
[2024-05-21 19:38:33] [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) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 85/140 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 19:38:33] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
[2024-05-21 19:38:33] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-05-21 19:38:33] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp25 is UNSAT
After SMT solving in domain Real declared 318/318 variables, and 150 constraints, problems are : Problem set: 1 solved, 0 unsolved in 412 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 419ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2024-05-21 19:38:33] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 19:38:33] [INFO ] Flatten gal took : 22 ms
FORMULA AutonomousCar-PT-02b-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 19:38:33] [INFO ] Flatten gal took : 21 ms
[2024-05-21 19:38:33] [INFO ] Input system was already deterministic with 178 transitions.
Computed a total of 32 stabilizing places and 32 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 140/140 places, 178/178 transitions.
Graph (trivial) has 130 edges and 140 vertex of which 4 / 140 are part of one of the 2 SCC in 4 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 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 137 transition count 114
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 78 rules applied. Total rules applied 140 place count 76 transition count 97
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 150 place count 66 transition count 97
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 150 place count 66 transition count 91
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 162 place count 60 transition count 91
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 169 place count 53 transition count 84
Iterating global reduction 3 with 7 rules applied. Total rules applied 176 place count 53 transition count 84
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 192 place count 53 transition count 68
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 192 place count 53 transition count 66
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 196 place count 51 transition count 66
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 198 place count 49 transition count 63
Iterating global reduction 4 with 2 rules applied. Total rules applied 200 place count 49 transition count 63
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 202 place count 49 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 203 place count 48 transition count 61
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 235 place count 32 transition count 45
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 238 place count 29 transition count 37
Iterating global reduction 6 with 3 rules applied. Total rules applied 241 place count 29 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 242 place count 29 transition count 36
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 243 place count 29 transition count 35
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 244 place count 29 transition count 35
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 246 place count 27 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 247 place count 26 transition count 33
Applied a total of 247 rules in 74 ms. Remains 26 /140 variables (removed 114) and now considering 33/178 (removed 145) transitions.
// Phase 1: matrix 33 rows 26 cols
[2024-05-21 19:38:33] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 19:38:33] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 19:38:33] [INFO ] Invariant cache hit.
[2024-05-21 19:38:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:38:33] [INFO ] Implicit Places using invariants and state equation in 74 ms returned [20, 25]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 125 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 24/140 places, 33/178 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 23 transition count 32
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 23 transition count 31
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 22 transition count 31
Applied a total of 4 rules in 3 ms. Remains 22 /24 variables (removed 2) and now considering 31/33 (removed 2) transitions.
// Phase 1: matrix 31 rows 22 cols
[2024-05-21 19:38:33] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 19:38:33] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-21 19:38:33] [INFO ] Invariant cache hit.
[2024-05-21 19:38:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:38:33] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 22/140 places, 31/178 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 272 ms. Remains : 22/140 places, 31/178 transitions.
[2024-05-21 19:38:34] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:38:34] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:38:34] [INFO ] Input system was already deterministic with 31 transitions.
[2024-05-21 19:38:34] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:38:34] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:38:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality3603839547081664992.gal : 1 ms
[2024-05-21 19:38:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality12879741967569352520.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3603839547081664992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12879741967569352520.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,970,0.02154,3396,2,96,5,863,6,0,118,945,0


Converting to forward existential form...Done !
original formula: AF((p70==1))
=> equivalent forward existential formula: [FwdG(Init,!((p70==1)))] = FALSE
Hit Full ! (commute/partial/dont) 29/0/2
(forward)formula 0,0,0.033271,3744,1,0,8,2604,20,4,657,2374,8
FORMULA AutonomousCar-PT-02b-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 140/140 places, 178/178 transitions.
Graph (trivial) has 125 edges and 140 vertex of which 4 / 140 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 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 137 transition count 119
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 71 rules applied. Total rules applied 128 place count 81 transition count 104
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 136 place count 73 transition count 104
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 136 place count 73 transition count 97
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 150 place count 66 transition count 97
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 157 place count 59 transition count 90
Iterating global reduction 3 with 7 rules applied. Total rules applied 164 place count 59 transition count 90
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 180 place count 59 transition count 74
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 180 place count 59 transition count 72
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 184 place count 57 transition count 72
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 185 place count 56 transition count 70
Iterating global reduction 4 with 1 rules applied. Total rules applied 186 place count 56 transition count 70
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 188 place count 56 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 189 place count 55 transition count 68
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 217 place count 41 transition count 54
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 219 place count 39 transition count 48
Iterating global reduction 6 with 2 rules applied. Total rules applied 221 place count 39 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 222 place count 39 transition count 47
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 224 place count 37 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 225 place count 36 transition count 45
Applied a total of 225 rules in 28 ms. Remains 36 /140 variables (removed 104) and now considering 45/178 (removed 133) transitions.
// Phase 1: matrix 45 rows 36 cols
[2024-05-21 19:38:34] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 19:38:34] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 19:38:34] [INFO ] Invariant cache hit.
[2024-05-21 19:38:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:38:34] [INFO ] Implicit Places using invariants and state equation in 64 ms returned [28, 35]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 105 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 34/140 places, 45/178 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 34 transition count 44
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 33 transition count 44
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 32 transition count 43
Applied a total of 4 rules in 5 ms. Remains 32 /34 variables (removed 2) and now considering 43/45 (removed 2) transitions.
// Phase 1: matrix 43 rows 32 cols
[2024-05-21 19:38:34] [INFO ] Computed 3 invariants in 2 ms
[2024-05-21 19:38:34] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-21 19:38:34] [INFO ] Invariant cache hit.
[2024-05-21 19:38:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:38:34] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 32/140 places, 43/178 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 223 ms. Remains : 32/140 places, 43/178 transitions.
[2024-05-21 19:38:34] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:38:34] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:38:34] [INFO ] Input system was already deterministic with 43 transitions.
[2024-05-21 19:38:34] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:38:34] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:38:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality11273950022274309602.gal : 1 ms
[2024-05-21 19:38:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality1532412779406536892.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11273950022274309602.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1532412779406536892.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1593,0.013489,3652,2,182,5,1127,6,0,168,1057,0


Converting to forward existential form...Done !
original formula: EG((AG((p54==1)) + (EF(((p141==0)&&(p18==1))) * EF(((p93==0)||(p60==1))))))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !((p54==1)))) + (E(TRUE U ((p141==0)&&(p18==1))) * E(TRUE U ((p93==0)||(p60==1))))))] != ...160
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t6, t8, t14, t16, t21, t22, t24, t25, t39, t41, t42, Intersection with reachable at ...221
(forward)formula 0,0,0.071349,5552,1,0,123,10345,115,56,1215,10315,142
FORMULA AutonomousCar-PT-02b-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 140/140 places, 178/178 transitions.
Graph (trivial) has 129 edges and 140 vertex of which 4 / 140 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 137 transition count 115
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 79 rules applied. Total rules applied 140 place count 77 transition count 96
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 152 place count 66 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 153 place count 65 transition count 95
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 153 place count 65 transition count 90
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 163 place count 60 transition count 90
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 170 place count 53 transition count 83
Iterating global reduction 4 with 7 rules applied. Total rules applied 177 place count 53 transition count 83
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 193 place count 53 transition count 67
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 193 place count 53 transition count 65
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 197 place count 51 transition count 65
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 198 place count 50 transition count 64
Iterating global reduction 5 with 1 rules applied. Total rules applied 199 place count 50 transition count 64
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 229 place count 35 transition count 49
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 232 place count 32 transition count 41
Iterating global reduction 5 with 3 rules applied. Total rules applied 235 place count 32 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 237 place count 32 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 238 place count 31 transition count 39
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 239 place count 31 transition count 38
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 240 place count 31 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 242 place count 29 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 243 place count 28 transition count 36
Applied a total of 243 rules in 26 ms. Remains 28 /140 variables (removed 112) and now considering 36/178 (removed 142) transitions.
// Phase 1: matrix 36 rows 28 cols
[2024-05-21 19:38:34] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 19:38:34] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-21 19:38:34] [INFO ] Invariant cache hit.
[2024-05-21 19:38:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:38:34] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [22, 27]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 90 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 26/140 places, 36/178 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 25 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 25 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 24 transition count 34
Applied a total of 4 rules in 2 ms. Remains 24 /26 variables (removed 2) and now considering 34/36 (removed 2) transitions.
// Phase 1: matrix 34 rows 24 cols
[2024-05-21 19:38:34] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 19:38:34] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-21 19:38:34] [INFO ] Invariant cache hit.
[2024-05-21 19:38:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:38:34] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 24/140 places, 34/178 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 197 ms. Remains : 24/140 places, 34/178 transitions.
[2024-05-21 19:38:34] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:38:34] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:38:34] [INFO ] Input system was already deterministic with 34 transitions.
[2024-05-21 19:38:34] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:38:34] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:38:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality3662973775230158932.gal : 1 ms
[2024-05-21 19:38:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality14410685165470142772.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3662973775230158932.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14410685165470142772.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,972,0.013176,3600,2,128,5,1018,6,0,128,1219,0


Converting to forward existential form...Done !
original formula: AF(AG(((p23==1)&&(p41==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((p23==1)&&(p41==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t5, t7, t9, t11, t27, t32, Intersection with reachable at each step enabled....203
(forward)formula 0,0,0.042358,4444,1,0,85,4614,93,40,1012,5303,87
FORMULA AutonomousCar-PT-02b-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 178/178 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 130 transition count 168
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 130 transition count 168
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 36 place count 130 transition count 152
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 128 transition count 150
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 128 transition count 150
Applied a total of 40 rules in 18 ms. Remains 128 /140 variables (removed 12) and now considering 150/178 (removed 28) transitions.
// Phase 1: matrix 150 rows 128 cols
[2024-05-21 19:38:34] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 19:38:34] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 19:38:34] [INFO ] Invariant cache hit.
[2024-05-21 19:38:34] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2024-05-21 19:38:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 19:38:36] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 3 ms to minimize.
[2024-05-21 19:38:36] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-05-21 19:38:36] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-21 19:38:36] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-05-21 19:38:37] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
[2024-05-21 19:38:37] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-21 19:38:37] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-05-21 19:38:37] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2024-05-21 19:38:37] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2024-05-21 19:38:37] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2024-05-21 19:38:37] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 5 ms to minimize.
[2024-05-21 19:38:38] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2024-05-21 19:38:38] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-05-21 19:38:38] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 2 ms to minimize.
[2024-05-21 19:38:38] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 19:38:38] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-05-21 19:38:38] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 2 ms to minimize.
[2024-05-21 19:38:39] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 13 ms to minimize.
[2024-05-21 19:38:39] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-21 19:38:39] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 19:38:40] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 150/278 variables, 128/156 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 19:38:42] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-05-21 19:38:43] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 19:38:44] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 10 (OVERLAPS) 0/278 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 159 constraints, problems are : Problem set: 0 solved, 149 unsolved in 12722 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 150/278 variables, 128/159 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 149/308 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 19:38:49] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (OVERLAPS) 0/278 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 278/278 variables, and 309 constraints, problems are : Problem set: 0 solved, 149 unsolved in 10146 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 25/25 constraints]
After SMT, in 22916ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 22919ms
Starting structural reductions in LTL mode, iteration 1 : 128/140 places, 150/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23132 ms. Remains : 128/140 places, 150/178 transitions.
[2024-05-21 19:38:57] [INFO ] Flatten gal took : 12 ms
[2024-05-21 19:38:57] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:38:57] [INFO ] Input system was already deterministic with 150 transitions.
[2024-05-21 19:38:57] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:38:57] [INFO ] Flatten gal took : 12 ms
[2024-05-21 19:38:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality15357410459391722407.gal : 4 ms
[2024-05-21 19:38:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality14078489357804125891.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15357410459391722407.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14078489357804125891.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.93098e+06,0.264366,10156,2,2684,5,26334,6,0,664,30042,0


Converting to forward existential form...Done !
original formula: AG(E(((AX(((p57==0)||(p64==1))) * (p133!=1)) * ((p6==0)||(p106==1))) U A(((p23==1)&&((p140==0)||(p127==1))) U (p66!=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((!(EX(!(((p57==0)||(p64==1))))) * (p133!=1)) * ((p6==0)||(p106==1))) U !((E(!((p66!=1))...244
Reverse transition relation is NOT exact ! Due to transitions t10, t17, t18, t25, t34, t39, t40, t64, t65, t68, t69, t71, t85, t90, t91, t94, t95, t97, t11...300
(forward)formula 0,0,4.43367,134076,1,0,578,744165,334,234,4066,669778,690
FORMULA AutonomousCar-PT-02b-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 140/140 places, 178/178 transitions.
Graph (trivial) has 122 edges and 140 vertex of which 4 / 140 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 137 transition count 121
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 68 rules applied. Total rules applied 123 place count 83 transition count 107
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 132 place count 75 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 133 place count 74 transition count 106
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 133 place count 74 transition count 99
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 147 place count 67 transition count 99
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 153 place count 61 transition count 93
Iterating global reduction 4 with 6 rules applied. Total rules applied 159 place count 61 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 160 place count 61 transition count 92
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 163 place count 58 transition count 86
Iterating global reduction 5 with 3 rules applied. Total rules applied 166 place count 58 transition count 86
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 5 with 36 rules applied. Total rules applied 202 place count 40 transition count 68
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 205 place count 37 transition count 54
Iterating global reduction 5 with 3 rules applied. Total rules applied 208 place count 37 transition count 54
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 210 place count 37 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 211 place count 36 transition count 52
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 213 place count 36 transition count 50
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 7 with 1 rules applied. Total rules applied 214 place count 36 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 215 place count 35 transition count 49
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 217 place count 33 transition count 47
Applied a total of 217 rules in 27 ms. Remains 33 /140 variables (removed 107) and now considering 47/178 (removed 131) transitions.
// Phase 1: matrix 47 rows 33 cols
[2024-05-21 19:39:02] [INFO ] Computed 6 invariants in 0 ms
[2024-05-21 19:39:02] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 19:39:02] [INFO ] Invariant cache hit.
[2024-05-21 19:39:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:39:02] [INFO ] Implicit Places using invariants and state equation in 68 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 107 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 32/140 places, 47/178 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 31 transition count 46
Applied a total of 2 rules in 4 ms. Remains 31 /32 variables (removed 1) and now considering 46/47 (removed 1) transitions.
// Phase 1: matrix 46 rows 31 cols
[2024-05-21 19:39:02] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 19:39:02] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-21 19:39:02] [INFO ] Invariant cache hit.
[2024-05-21 19:39:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 19:39:02] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 31/140 places, 46/178 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 236 ms. Remains : 31/140 places, 46/178 transitions.
[2024-05-21 19:39:02] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:39:02] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:39:02] [INFO ] Input system was already deterministic with 46 transitions.
[2024-05-21 19:39:02] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:39:02] [INFO ] Flatten gal took : 3 ms
[2024-05-21 19:39:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality18069372853706747580.gal : 1 ms
[2024-05-21 19:39:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality2028185272492513278.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18069372853706747580.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2028185272492513278.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3778,0.024637,4092,2,301,5,2780,6,0,166,2808,0


Converting to forward existential form...Done !
original formula: !(E((p4==0) U !(A((p130==0) U (AF((p113==1)) * !(((p50==1)||(p31==1))))))))
=> equivalent forward existential formula: (([FwdG((FwdU(FwdU(Init,(p4==0)),!((!(EG(!((p113==1)))) * !(((p50==1)||(p31==1)))))) * !((p130==0))),!((p113==1)...386
Hit Full ! (commute/partial/dont) 37/0/9
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t5, t8, t10, t12, t14, t20, t22, t23, t24, t45, Intersection with reachable ...224
(forward)formula 0,0,0.228445,11220,1,0,241,39312,127,96,1422,46644,257
FORMULA AutonomousCar-PT-02b-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 178/178 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 127 transition count 165
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 127 transition count 165
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 42 place count 127 transition count 149
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 124 transition count 146
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 124 transition count 146
Applied a total of 48 rules in 6 ms. Remains 124 /140 variables (removed 16) and now considering 146/178 (removed 32) transitions.
// Phase 1: matrix 146 rows 124 cols
[2024-05-21 19:39:02] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 19:39:02] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 19:39:02] [INFO ] Invariant cache hit.
[2024-05-21 19:39:03] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2024-05-21 19:39:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:39:04] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 3 ms to minimize.
[2024-05-21 19:39:04] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2024-05-21 19:39:04] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2024-05-21 19:39:05] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-05-21 19:39:05] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-05-21 19:39:05] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-05-21 19:39:05] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-05-21 19:39:05] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 2 ms to minimize.
[2024-05-21 19:39:05] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 3 ms to minimize.
[2024-05-21 19:39:05] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-21 19:39:05] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
[2024-05-21 19:39:05] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 2 ms to minimize.
[2024-05-21 19:39:06] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-05-21 19:39:06] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 3 ms to minimize.
[2024-05-21 19:39:06] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 3 ms to minimize.
[2024-05-21 19:39:06] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 2 ms to minimize.
[2024-05-21 19:39:06] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-21 19:39:06] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:39:07] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:39:08] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/270 variables, 124/151 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:39:12] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 152 constraints, problems are : Problem set: 0 solved, 145 unsolved in 12934 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 21/28 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/270 variables, 124/152 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 145/297 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:39:18] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 2 ms to minimize.
[2024-05-21 19:39:19] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-21 19:39:21] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 300 constraints, problems are : Problem set: 0 solved, 145 unsolved in 11492 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 24/24 constraints]
After SMT, in 24479ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 24485ms
Starting structural reductions in LTL mode, iteration 1 : 124/140 places, 146/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24749 ms. Remains : 124/140 places, 146/178 transitions.
[2024-05-21 19:39:27] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:39:27] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:39:27] [INFO ] Input system was already deterministic with 146 transitions.
[2024-05-21 19:39:27] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:39:27] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:39:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality3105031499170158725.gal : 3 ms
[2024-05-21 19:39:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality11215801071593961594.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3105031499170158725.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11215801071593961594.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.72657e+06,0.195953,9604,2,2580,5,24320,6,0,644,28437,0


Converting to forward existential form...Done !
original formula: (AG(E(A((p147==1) U (EG((p119==1)) * (p91!=1))) U !(EG((p121==1))))) * AX((p8==0)))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(!((E(!((EG((p119==1)) * (p91!=1))) U (!((p147==1)) * !((EG((p119==1)) * (p91!=1))))) + ...258
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t61, t62, t65, t66, t68, t81, t86, t87, t90, t91, t93...305
(forward)formula 0,0,13.1365,359024,1,0,1415,2.4014e+06,333,608,4124,1.9047e+06,1657
FORMULA AutonomousCar-PT-02b-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 178/178 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 128 transition count 166
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 128 transition count 166
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 40 place count 128 transition count 150
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 126 transition count 148
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 126 transition count 148
Applied a total of 44 rules in 8 ms. Remains 126 /140 variables (removed 14) and now considering 148/178 (removed 30) transitions.
// Phase 1: matrix 148 rows 126 cols
[2024-05-21 19:39:40] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 19:39:40] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 19:39:40] [INFO ] Invariant cache hit.
[2024-05-21 19:39:41] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2024-05-21 19:39:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-21 19:39:42] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-21 19:39:42] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-05-21 19:39:42] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-21 19:39:42] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-21 19:39:42] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-05-21 19:39:42] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-05-21 19:39:42] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 2 ms to minimize.
[2024-05-21 19:39:42] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 2 ms to minimize.
[2024-05-21 19:39:43] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
[2024-05-21 19:39:43] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-21 19:39:43] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-21 19:39:43] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-21 19:39:43] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-21 19:39:43] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 3 ms to minimize.
[2024-05-21 19:39:43] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2024-05-21 19:39:43] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-21 19:39:43] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 2 ms to minimize.
[2024-05-21 19:39:44] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-21 19:39:44] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-05-21 19:39:44] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 2 ms to minimize.
[2024-05-21 19:39:44] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-21 19:39:44] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-21 19:39:45] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 2 ms to minimize.
[2024-05-21 19:39:45] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-21 19:39:45] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 3 ms to minimize.
[2024-05-21 19:39:45] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 2 ms to minimize.
[2024-05-21 19:39:45] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-21 19:39:46] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 2 ms to minimize.
[2024-05-21 19:39:46] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-21 19:39:46] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 148/274 variables, 126/163 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-21 19:39:48] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 10 (OVERLAPS) 0/274 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 164 constraints, problems are : Problem set: 0 solved, 147 unsolved in 9886 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 148/274 variables, 126/164 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 147/311 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/274 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 311 constraints, problems are : Problem set: 0 solved, 147 unsolved in 5342 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 31/31 constraints]
After SMT, in 15274ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 15278ms
Starting structural reductions in LTL mode, iteration 1 : 126/140 places, 148/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15508 ms. Remains : 126/140 places, 148/178 transitions.
[2024-05-21 19:39:56] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:39:56] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:39:56] [INFO ] Input system was already deterministic with 148 transitions.
[2024-05-21 19:39:56] [INFO ] Flatten gal took : 11 ms
[2024-05-21 19:39:56] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:39:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality3932673497562074031.gal : 6 ms
[2024-05-21 19:39:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality2738556152211484367.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3932673497562074031.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2738556152211484367.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.76849e+06,0.315055,10144,2,2587,5,25797,6,0,654,29774,0


Converting to forward existential form...Done !
original formula: EX(AF((p27==1)))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((p27==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t61, t62, t65, t66, t68, t81, t87, t88, t91, t92, t94...310
(forward)formula 0,0,16.0666,449896,1,0,1117,2.99462e+06,319,475,3999,2.78936e+06,1265
FORMULA AutonomousCar-PT-02b-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 178/178 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 129 transition count 167
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 129 transition count 167
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 38 place count 129 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 128 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 128 transition count 150
Applied a total of 40 rules in 7 ms. Remains 128 /140 variables (removed 12) and now considering 150/178 (removed 28) transitions.
// Phase 1: matrix 150 rows 128 cols
[2024-05-21 19:40:12] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 19:40:12] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 19:40:12] [INFO ] Invariant cache hit.
[2024-05-21 19:40:12] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2024-05-21 19:40:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 19:40:14] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-21 19:40:14] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 3 ms to minimize.
[2024-05-21 19:40:14] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-21 19:40:14] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-05-21 19:40:14] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 2 ms to minimize.
[2024-05-21 19:40:14] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-05-21 19:40:14] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 3 ms to minimize.
[2024-05-21 19:40:14] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 3 ms to minimize.
[2024-05-21 19:40:15] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-05-21 19:40:15] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 3 ms to minimize.
[2024-05-21 19:40:15] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 2 ms to minimize.
[2024-05-21 19:40:15] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 2 ms to minimize.
[2024-05-21 19:40:15] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
[2024-05-21 19:40:15] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 3 ms to minimize.
[2024-05-21 19:40:15] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2024-05-21 19:40:16] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2024-05-21 19:40:16] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-05-21 19:40:16] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 19:40:16] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 2 ms to minimize.
[2024-05-21 19:40:16] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-05-21 19:40:16] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-05-21 19:40:17] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-05-21 19:40:17] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 19:40:18] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 150/278 variables, 128/159 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 19:40:21] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 19:40:22] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 2 ms to minimize.
[2024-05-21 19:40:22] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 10 (OVERLAPS) 0/278 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 162 constraints, problems are : Problem set: 0 solved, 149 unsolved in 12853 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-21 19:40:26] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 2 ms to minimize.
[2024-05-21 19:40:26] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 150/278 variables, 128/164 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 149/313 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (OVERLAPS) 0/278 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 278/278 variables, and 313 constraints, problems are : Problem set: 0 solved, 149 unsolved in 6073 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 29/29 constraints]
After SMT, in 18959ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 18961ms
Starting structural reductions in LTL mode, iteration 1 : 128/140 places, 150/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19179 ms. Remains : 128/140 places, 150/178 transitions.
[2024-05-21 19:40:31] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:40:31] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:40:31] [INFO ] Input system was already deterministic with 150 transitions.
[2024-05-21 19:40:31] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:40:31] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:40:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality1000972610632408285.gal : 3 ms
[2024-05-21 19:40:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality16917548873932586354.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1000972610632408285.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16917548873932586354.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.88756e+06,0.202484,9888,2,2681,5,25090,6,0,664,28374,0


Converting to forward existential form...Done !
original formula: AF(AX(AG((((p30==0)&&(p55==1))&&((p99==0)||(p106==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(!(E(TRUE U !((((p30==0)&&(p55==1))&&((p99==0)||(p106==1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t33, t38, t39, t64, t65, t68, t69, t71, t84, t89, t90, t93, t94, t96, t10...300
(forward)formula 0,0,8.27103,197436,1,0,826,908316,328,476,4244,1.20473e+06,774
FORMULA AutonomousCar-PT-02b-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 178/178 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 129 transition count 167
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 129 transition count 167
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 38 place count 129 transition count 151
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 127 transition count 149
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 127 transition count 149
Applied a total of 42 rules in 8 ms. Remains 127 /140 variables (removed 13) and now considering 149/178 (removed 29) transitions.
// Phase 1: matrix 149 rows 127 cols
[2024-05-21 19:40:40] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 19:40:40] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-21 19:40:40] [INFO ] Invariant cache hit.
[2024-05-21 19:40:40] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2024-05-21 19:40:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:40:42] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 3 ms to minimize.
[2024-05-21 19:40:42] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-05-21 19:40:42] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-05-21 19:40:42] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 3 ms to minimize.
[2024-05-21 19:40:42] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 3 ms to minimize.
[2024-05-21 19:40:42] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 3 ms to minimize.
[2024-05-21 19:40:42] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-21 19:40:42] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-05-21 19:40:43] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2024-05-21 19:40:43] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 3 ms to minimize.
[2024-05-21 19:40:43] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 3 ms to minimize.
[2024-05-21 19:40:43] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 3 ms to minimize.
[2024-05-21 19:40:43] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-21 19:40:43] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 2 ms to minimize.
[2024-05-21 19:40:43] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 2 ms to minimize.
[2024-05-21 19:40:43] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-05-21 19:40:44] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
[2024-05-21 19:40:44] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 2 ms to minimize.
[2024-05-21 19:40:44] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-05-21 19:40:44] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:40:44] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 2 ms to minimize.
[2024-05-21 19:40:44] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
[2024-05-21 19:40:44] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-05-21 19:40:45] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
[2024-05-21 19:40:45] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 3 ms to minimize.
[2024-05-21 19:40:45] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 2 ms to minimize.
[2024-05-21 19:40:45] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
[2024-05-21 19:40:45] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 2 ms to minimize.
[2024-05-21 19:40:46] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:40:47] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-21 19:40:47] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2024-05-21 19:40:47] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
[2024-05-21 19:40:47] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-05-21 19:40:47] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:40:48] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 2 ms to minimize.
[2024-05-21 19:40:48] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2024-05-21 19:40:48] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:40:49] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (OVERLAPS) 149/276 variables, 127/172 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:40:51] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 11 (OVERLAPS) 0/276 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 173 constraints, problems are : Problem set: 0 solved, 148 unsolved in 16061 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 39/46 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:40:57] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:40:59] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-05-21 19:40:59] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
[2024-05-21 19:40:59] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:41:00] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 149/276 variables, 127/178 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 148/326 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:41:04] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/276 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/276 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 12 (OVERLAPS) 0/276 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 327 constraints, problems are : Problem set: 0 solved, 148 unsolved in 15351 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 45/45 constraints]
After SMT, in 31449ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 31451ms
Starting structural reductions in LTL mode, iteration 1 : 127/140 places, 149/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31726 ms. Remains : 127/140 places, 149/178 transitions.
[2024-05-21 19:41:11] [INFO ] Flatten gal took : 9 ms
[2024-05-21 19:41:12] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:41:12] [INFO ] Input system was already deterministic with 149 transitions.
[2024-05-21 19:41:12] [INFO ] Flatten gal took : 10 ms
[2024-05-21 19:41:12] [INFO ] Flatten gal took : 13 ms
[2024-05-21 19:41:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality15642009816276162962.gal : 3 ms
[2024-05-21 19:41:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality9030518086163025009.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15642009816276162962.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9030518086163025009.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.85621e+06,0.298248,9096,2,2577,5,22228,6,0,659,25285,0


Converting to forward existential form...Done !
original formula: EF((((p145==1) + EG(EX(((p28==0)||(p46==1))))) + (EG((p133!=1)) + !(A((p105==0) U ((p55==0)||(p94==1)))))))
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * (p145==1))] != FALSE + [FwdG(FwdU(Init,TRUE),EX(((p28==0)||(p46==1))))] != FALSE) + ([FwdG...359
(forward)formula 0,1,0.299749,9360,1,0,6,22228,8,1,662,25285,1
FORMULA AutonomousCar-PT-02b-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 178/178 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 129 transition count 167
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 129 transition count 167
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 38 place count 129 transition count 151
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 127 transition count 149
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 127 transition count 149
Applied a total of 42 rules in 6 ms. Remains 127 /140 variables (removed 13) and now considering 149/178 (removed 29) transitions.
// Phase 1: matrix 149 rows 127 cols
[2024-05-21 19:41:12] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 19:41:12] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-21 19:41:12] [INFO ] Invariant cache hit.
[2024-05-21 19:41:12] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2024-05-21 19:41:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:41:14] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-05-21 19:41:14] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 3 ms to minimize.
[2024-05-21 19:41:14] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-05-21 19:41:14] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-05-21 19:41:14] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 3 ms to minimize.
[2024-05-21 19:41:14] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-21 19:41:15] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 2 ms to minimize.
[2024-05-21 19:41:15] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 3 ms to minimize.
[2024-05-21 19:41:15] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 2 ms to minimize.
[2024-05-21 19:41:15] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-05-21 19:41:15] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 2 ms to minimize.
[2024-05-21 19:41:15] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2024-05-21 19:41:15] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 3 ms to minimize.
[2024-05-21 19:41:15] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 3 ms to minimize.
[2024-05-21 19:41:16] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-21 19:41:16] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 2 ms to minimize.
[2024-05-21 19:41:16] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-05-21 19:41:16] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:41:17] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-05-21 19:41:17] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-05-21 19:41:17] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 2 ms to minimize.
[2024-05-21 19:41:17] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 2 ms to minimize.
[2024-05-21 19:41:17] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 149/276 variables, 127/157 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:41:20] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-21 19:41:20] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 8 (OVERLAPS) 0/276 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 159 constraints, problems are : Problem set: 0 solved, 148 unsolved in 11974 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:41:25] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 2 ms to minimize.
[2024-05-21 19:41:26] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:41:27] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 149/276 variables, 127/162 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 148/310 constraints. Problems are: Problem set: 0 solved, 148 unsolved
[2024-05-21 19:41:29] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 10 (OVERLAPS) 0/276 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 311 constraints, problems are : Problem set: 0 solved, 148 unsolved in 11472 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 29/29 constraints]
After SMT, in 23484ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 23487ms
Starting structural reductions in LTL mode, iteration 1 : 127/140 places, 149/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23801 ms. Remains : 127/140 places, 149/178 transitions.
[2024-05-21 19:41:36] [INFO ] Flatten gal took : 7 ms
[2024-05-21 19:41:36] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:41:36] [INFO ] Input system was already deterministic with 149 transitions.
[2024-05-21 19:41:36] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:41:36] [INFO ] Flatten gal took : 8 ms
[2024-05-21 19:41:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality9860023782973866018.gal : 2 ms
[2024-05-21 19:41:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality15605076155762537356.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9860023782973866018.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15605076155762537356.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.88044e+06,0.257931,10676,2,2747,5,27595,6,0,659,32004,0


Converting to forward existential form...Done !
original formula: !(E(AX(A(((p62==1)||(p61==1)) U (p44!=1))) U (((((p8==0)||(p61==1)) * AX((p146==1))) + (!(AX((p39==0))) * (p102==1))) * AF((AF((p111==1))...188
=> equivalent forward existential formula: [((FwdU(Init,!(EX(!(!((E(!((p44!=1)) U (!(((p62==1)||(p61==1))) * !((p44!=1)))) + EG(!((p44!=1))))))))) * ((((p8...305
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t61, t62, t65, t66, t68, t82, t87, t88, t91, t93, t94...298
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-05-21 19:42:06] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:42:06] [INFO ] Applying decomposition
[2024-05-21 19:42:06] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18157958354351117772.txt' '-o' '/tmp/graph18157958354351117772.bin' '-w' '/tmp/graph18157958354351117772.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18157958354351117772.bin' '-l' '-1' '-v' '-w' '/tmp/graph18157958354351117772.weights' '-q' '0' '-e' '0.001'
[2024-05-21 19:42:06] [INFO ] Decomposing Gal with order
[2024-05-21 19:42:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 19:42:06] [INFO ] Removed a total of 47 redundant transitions.
[2024-05-21 19:42:06] [INFO ] Flatten gal took : 60 ms
[2024-05-21 19:42:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 10 ms.
[2024-05-21 19:42:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality4930568565002392747.gal : 5 ms
[2024-05-21 19:42:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality16165398802918356875.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4930568565002392747.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16165398802918356875.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.88044e+06,0.043548,4552,293,72,1447,349,368,1651,75,713,0


Converting to forward existential form...Done !
original formula: !(E(AX(A(((i6.i1.u20.p62==1)||(i6.i0.u19.p61==1)) U (i4.i0.u14.p44!=1))) U (((((i1.u2.p8==0)||(i6.i0.u19.p61==1)) * AX((i10.u40.p146==1))...285
=> equivalent forward existential formula: [((FwdU(Init,!(EX(!(!((E(!((i4.i0.u14.p44!=1)) U (!(((i6.i1.u20.p62==1)||(i6.i0.u19.p61==1))) * !((i4.i0.u14.p44...422
Reverse transition relation is NOT exact ! Due to transitions t121, t146, u33.t32, u33.t35, u33.t36, u33.t37, i1.t117, i1.t115, i4.i0.u13.t91, i4.i0.u13.t9...440
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,1,1.61111,60248,1,0,131620,1047,2409,171928,390,3648,179102
FORMULA AutonomousCar-PT-02b-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 140/140 places, 178/178 transitions.
Graph (trivial) has 129 edges and 140 vertex of which 4 / 140 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 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 137 transition count 113
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 81 rules applied. Total rules applied 144 place count 75 transition count 94
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 155 place count 64 transition count 94
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 155 place count 64 transition count 89
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 165 place count 59 transition count 89
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 172 place count 52 transition count 82
Iterating global reduction 3 with 7 rules applied. Total rules applied 179 place count 52 transition count 82
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 195 place count 52 transition count 66
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 195 place count 52 transition count 64
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 199 place count 50 transition count 64
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 201 place count 48 transition count 61
Iterating global reduction 4 with 2 rules applied. Total rules applied 203 place count 48 transition count 61
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 205 place count 48 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 206 place count 47 transition count 59
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 236 place count 32 transition count 44
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 238 place count 30 transition count 39
Iterating global reduction 6 with 2 rules applied. Total rules applied 240 place count 30 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 242 place count 30 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 243 place count 29 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 244 place count 29 transition count 36
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 246 place count 27 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 247 place count 26 transition count 34
Applied a total of 247 rules in 19 ms. Remains 26 /140 variables (removed 114) and now considering 34/178 (removed 144) transitions.
// Phase 1: matrix 34 rows 26 cols
[2024-05-21 19:42:08] [INFO ] Computed 5 invariants in 0 ms
[2024-05-21 19:42:08] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-21 19:42:08] [INFO ] Invariant cache hit.
[2024-05-21 19:42:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:42:08] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [20, 25]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 90 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 24/140 places, 34/178 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 23 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 23 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 22 transition count 32
Applied a total of 4 rules in 5 ms. Remains 22 /24 variables (removed 2) and now considering 32/34 (removed 2) transitions.
// Phase 1: matrix 32 rows 22 cols
[2024-05-21 19:42:08] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 19:42:08] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-21 19:42:08] [INFO ] Invariant cache hit.
[2024-05-21 19:42:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 19:42:08] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 22/140 places, 32/178 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 194 ms. Remains : 22/140 places, 32/178 transitions.
[2024-05-21 19:42:08] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:42:08] [INFO ] Flatten gal took : 1 ms
[2024-05-21 19:42:08] [INFO ] Input system was already deterministic with 32 transitions.
[2024-05-21 19:42:08] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:42:08] [INFO ] Flatten gal took : 2 ms
[2024-05-21 19:42:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality17873350446795456022.gal : 1 ms
[2024-05-21 19:42:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality5254522203721830901.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17873350446795456022.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5254522203721830901.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1000,0.011951,3592,2,100,5,970,6,0,119,1112,0


Converting to forward existential form...Done !
original formula: EF(AG(EF(EG((p46==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U EG((p46==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t8, t10, t11, t30, Intersection with reachable at each step enabled. (de...198
(forward)formula 0,1,0.085976,5760,1,0,153,11340,90,75,925,13310,161
FORMULA AutonomousCar-PT-02b-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 178/178 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 127 transition count 165
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 127 transition count 165
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 42 place count 127 transition count 149
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 125 transition count 147
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 125 transition count 147
Applied a total of 46 rules in 5 ms. Remains 125 /140 variables (removed 15) and now considering 147/178 (removed 31) transitions.
// Phase 1: matrix 147 rows 125 cols
[2024-05-21 19:42:08] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 19:42:08] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-21 19:42:08] [INFO ] Invariant cache hit.
[2024-05-21 19:42:08] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-21 19:42:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-21 19:42:10] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-05-21 19:42:10] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-05-21 19:42:10] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
[2024-05-21 19:42:10] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-05-21 19:42:10] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-05-21 19:42:10] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 3 ms to minimize.
[2024-05-21 19:42:10] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-21 19:42:10] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 4 ms to minimize.
[2024-05-21 19:42:10] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-05-21 19:42:11] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 3 ms to minimize.
[2024-05-21 19:42:11] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
[2024-05-21 19:42:11] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
[2024-05-21 19:42:11] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 2 ms to minimize.
[2024-05-21 19:42:11] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 2 ms to minimize.
[2024-05-21 19:42:11] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-05-21 19:42:11] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
[2024-05-21 19:42:11] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-05-21 19:42:11] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 3 ms to minimize.
[2024-05-21 19:42:12] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
[2024-05-21 19:42:12] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-21 19:42:12] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-05-21 19:42:12] [INFO ] Deduced a trap composed of 33 places in 97 ms of which 2 ms to minimize.
[2024-05-21 19:42:12] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 3 ms to minimize.
[2024-05-21 19:42:12] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
[2024-05-21 19:42:12] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 3 ms to minimize.
[2024-05-21 19:42:13] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 147/272 variables, 125/158 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-21 19:42:16] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/272 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-21 19:42:17] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/272 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 160 constraints, problems are : Problem set: 0 solved, 146 unsolved in 11415 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 147/272 variables, 125/160 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 146/306 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-21 19:42:21] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 0/272 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 307 constraints, problems are : Problem set: 0 solved, 146 unsolved in 7791 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 29/29 constraints]
After SMT, in 19229ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 19235ms
Starting structural reductions in LTL mode, iteration 1 : 125/140 places, 147/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19486 ms. Remains : 125/140 places, 147/178 transitions.
[2024-05-21 19:42:27] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:42:27] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:42:28] [INFO ] Input system was already deterministic with 147 transitions.
[2024-05-21 19:42:28] [INFO ] Flatten gal took : 5 ms
[2024-05-21 19:42:28] [INFO ] Flatten gal took : 4 ms
[2024-05-21 19:42:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality6407651307861707211.gal : 2 ms
[2024-05-21 19:42:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality7232631484725766419.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6407651307861707211.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7232631484725766419.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.77244e+06,0.184951,9108,2,2584,5,22226,6,0,649,25670,0


Converting to forward existential form...Done !
original formula: AG(AF(((AX(((p20==0)||(p37==1))) + E((p61==1) U (p102==1))) + ((p127==0) * AG((p49!=0))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((!(EX(!(((p20==0)||(p37==1))))) + E((p61==1) U (p102==1))) + ((p127==0) * !(E(TRUE U !(...179
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t61, t62, t65, t66, t68, t81, t86, t87, t90, t91, t93...305
(forward)formula 0,1,3.11321,89772,1,0,449,423063,330,185,4155,416798,519
FORMULA AutonomousCar-PT-02b-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

[2024-05-21 19:42:31] [INFO ] Flatten gal took : 6 ms
[2024-05-21 19:42:31] [INFO ] Flatten gal took : 6 ms
Total runtime 272879 ms.

BK_STOP 1716320551240

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

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