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-171620167300266.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-04a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167300266
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 12 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 12 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 17:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 72K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2023-12
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2023-13
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2023-14
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716322370877

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-04a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 20:12:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 20:12:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:12:53] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2024-05-21 20:12:53] [INFO ] Transformed 49 places.
[2024-05-21 20:12:53] [INFO ] Transformed 193 transitions.
[2024-05-21 20:12:53] [INFO ] Found NUPN structural information;
[2024-05-21 20:12:53] [INFO ] Parsed PT model containing 49 places and 193 transitions and 1306 arcs in 371 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
Ensure Unique test removed 75 transitions
Reduce redundant transitions removed 75 transitions.
Support contains 40 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 118/118 transitions.
Applied a total of 0 rules in 22 ms. Remains 49 /49 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-05-21 20:12:53] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
// Phase 1: matrix 117 rows 49 cols
[2024-05-21 20:12:53] [INFO ] Computed 9 invariants in 17 ms
[2024-05-21 20:12:54] [INFO ] Implicit Places using invariants in 444 ms returned []
[2024-05-21 20:12:54] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
[2024-05-21 20:12:54] [INFO ] Invariant cache hit.
[2024-05-21 20:12:54] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-21 20:12:54] [INFO ] Implicit Places using invariants and state equation in 242 ms returned [44, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 751 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/49 places, 118/118 transitions.
Applied a total of 0 rules in 4 ms. Remains 47 /47 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 816 ms. Remains : 47/49 places, 118/118 transitions.
Support contains 40 out of 47 places after structural reductions.
[2024-05-21 20:12:54] [INFO ] Flatten gal took : 103 ms
[2024-05-21 20:12:55] [INFO ] Flatten gal took : 41 ms
[2024-05-21 20:12:55] [INFO ] Input system was already deterministic with 118 transitions.
Reduction of identical properties reduced properties to check from 77 to 69
RANDOM walk for 40000 steps (2344 resets) in 2836 ms. (14 steps per ms) remains 9/69 properties
BEST_FIRST walk for 40003 steps (437 resets) in 349 ms. (114 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (368 resets) in 225 ms. (177 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (432 resets) in 497 ms. (80 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (405 resets) in 133 ms. (298 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (373 resets) in 85 ms. (465 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (345 resets) in 115 ms. (344 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (384 resets) in 117 ms. (339 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (368 resets) in 97 ms. (408 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (391 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
[2024-05-21 20:12:56] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
// Phase 1: matrix 117 rows 47 cols
[2024-05-21 20:12:56] [INFO ] Computed 7 invariants in 3 ms
[2024-05-21 20:12:56] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp52 is UNSAT
At refinement iteration 3 (OVERLAPS) 19/44 variables, 6/32 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 19/51 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/51 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 116/160 variables, 44/95 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 66/161 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/161 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/163 variables, 3/164 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 3/167 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 0/167 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/164 variables, 1/168 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/164 variables, 0/168 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/164 variables, 0/168 constraints. Problems are: Problem set: 7 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 168 constraints, problems are : Problem set: 7 solved, 1 unsolved in 284 ms.
Refiners :[Domain max(s): 47/47 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 47/47 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 12/16 variables, 3/7 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 12/19 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/19 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/44 variables, 4/23 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 28/51 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/51 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 116/160 variables, 44/95 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 66/161 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/161 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/163 variables, 3/164 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 3/167 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 1/168 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 0/168 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/164 variables, 1/169 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/164 variables, 0/169 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/164 variables, 0/169 constraints. Problems are: Problem set: 7 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 169 constraints, problems are : Problem set: 7 solved, 1 unsolved in 198 ms.
Refiners :[Domain max(s): 47/47 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 47/47 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 1/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 616ms problems are : Problem set: 7 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 118/118 transitions.
Graph (complete) has 274 edges and 47 vertex of which 45 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 45 transition count 108
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 39 transition count 108
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 19 place count 35 transition count 88
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 35 transition count 88
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 29 place count 32 transition count 85
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 32 transition count 81
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 53 place count 28 transition count 65
Applied a total of 53 rules in 56 ms. Remains 28 /47 variables (removed 19) and now considering 65/118 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 28/47 places, 65/118 transitions.
RANDOM walk for 40000 steps (839 resets) in 258 ms. (154 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (773 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 841 steps, run visited all 1 properties in 17 ms. (steps per millisecond=49 )
Probabilistic random walk after 841 steps, saw 329 distinct states, run finished after 22 ms. (steps per millisecond=38 ) properties seen :1
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
FORMULA AutonomousCar-PT-04a-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04a-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 20:12:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 20:12:57] [INFO ] Flatten gal took : 27 ms
FORMULA AutonomousCar-PT-04a-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 20:12:57] [INFO ] Flatten gal took : 20 ms
[2024-05-21 20:12:57] [INFO ] Input system was already deterministic with 118 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 113
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 42 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 41 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 41 transition count 111
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 40 transition count 111
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 19 place count 35 transition count 90
Iterating global reduction 3 with 5 rules applied. Total rules applied 24 place count 35 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 28 place count 33 transition count 88
Applied a total of 28 rules in 22 ms. Remains 33 /47 variables (removed 14) and now considering 88/118 (removed 30) transitions.
// Phase 1: matrix 88 rows 33 cols
[2024-05-21 20:12:57] [INFO ] Computed 6 invariants in 5 ms
[2024-05-21 20:12:57] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 20:12:57] [INFO ] Invariant cache hit.
[2024-05-21 20:12:57] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-21 20:12:57] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-05-21 20:12:57] [INFO ] Redundant transitions in 3 ms returned []
Running 87 sub problems to find dead transitions.
[2024-05-21 20:12:57] [INFO ] Invariant cache hit.
[2024-05-21 20:12:57] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/33 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 87/120 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 50/89 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 20:12:59] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 1/121 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 0/121 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 91 constraints, problems are : Problem set: 0 solved, 87 unsolved in 2885 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/33 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 87/120 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 50/90 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 87/177 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 1/121 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 20:13:03] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (OVERLAPS) 0/121 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 179 constraints, problems are : Problem set: 0 solved, 87 unsolved in 4994 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 33/33 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 2/2 constraints]
After SMT, in 8144ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 8147ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/47 places, 88/118 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8357 ms. Remains : 33/47 places, 88/118 transitions.
[2024-05-21 20:13:06] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:13:06] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:13:06] [INFO ] Input system was already deterministic with 88 transitions.
[2024-05-21 20:13:06] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:13:06] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:13:06] [INFO ] Time to serialize gal into /tmp/CTLFireability617787335300011918.gal : 5 ms
[2024-05-21 20:13:06] [INFO ] Time to serialize properties into /tmp/CTLFireability12424559622295824432.ctl : 4 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/CTLFireability617787335300011918.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12424559622295824432.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,24331,0.120695,6272,2,557,5,8654,6,0,216,9987,0


Converting to forward existential form...Done !
original formula: EF(AG((((p1==1)&&(p6==1))&&((p20==1)&&(p41==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((p1==1)&&(p6==1))&&((p20==1)&&(p41==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t6, t8, t9, t10, t11, t13, t14, t15, t16, t18, t19, t20, t21, t22, t23, t24, ...288
(forward)formula 0,0,0.278309,9164,1,0,191,25728,197,87,2726,24026,185
FORMULA AutonomousCar-PT-04a-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 44 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 44 transition count 107
Applied a total of 6 rules in 3 ms. Remains 44 /47 variables (removed 3) and now considering 107/118 (removed 11) transitions.
// Phase 1: matrix 107 rows 44 cols
[2024-05-21 20:13:06] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 20:13:06] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 20:13:06] [INFO ] Invariant cache hit.
[2024-05-21 20:13:06] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-21 20:13:06] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-05-21 20:13:06] [INFO ] Invariant cache hit.
[2024-05-21 20:13:06] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 106/150 variables, 44/50 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 58/108 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-21 20:13:08] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 3 ms to minimize.
[2024-05-21 20:13:08] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-21 20:13:08] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 1/151 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/151 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 112 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4228 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 106/150 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 58/111 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 106/217 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 1/151 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/151 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 218 constraints, problems are : Problem set: 0 solved, 106 unsolved in 6270 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 3/3 constraints]
After SMT, in 10665ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 10668ms
Starting structural reductions in LTL mode, iteration 1 : 44/47 places, 107/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10847 ms. Remains : 44/47 places, 107/118 transitions.
[2024-05-21 20:13:17] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:13:17] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:13:17] [INFO ] Input system was already deterministic with 107 transitions.
[2024-05-21 20:13:17] [INFO ] Flatten gal took : 12 ms
[2024-05-21 20:13:17] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:13:17] [INFO ] Time to serialize gal into /tmp/CTLFireability16306846105079462843.gal : 4 ms
[2024-05-21 20:13:17] [INFO ] Time to serialize properties into /tmp/CTLFireability8664397939537299986.ctl : 2 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/CTLFireability16306846105079462843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8664397939537299986.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,156254,0.249267,10476,2,1607,5,21758,6,0,279,26839,0


Converting to forward existential form...Done !
original formula: ((AX(AG((((p1==1)&&(p6==1))&&((p20==1)&&(p41==1))))) + EX((((p1==1)&&(p6==1))&&((p15==1)&&(p41==1))))) + (EF((!(A((p33==1) U (((p1==1)&&(...217
=> equivalent forward existential formula: [(FwdU(EY(((Init * !((E(TRUE U (!(!((E(!((((p1==1)&&(p7==1))&&((p26==1)&&(p41==1)))) U (!((p33==1)) * !((((p1==1...396
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t7, t10, t11, t12, t15, t16, t19, t20, t23, t75, t81, t83, t89, t90, t91, t10...263
(forward)formula 0,1,6.21132,154500,1,0,1028,690616,254,456,3204,829990,1170
FORMULA AutonomousCar-PT-04a-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 45 transition count 108
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 108
Applied a total of 4 rules in 5 ms. Remains 45 /47 variables (removed 2) and now considering 108/118 (removed 10) transitions.
[2024-05-21 20:13:23] [INFO ] Flow matrix only has 107 transitions (discarded 1 similar events)
// Phase 1: matrix 107 rows 45 cols
[2024-05-21 20:13:23] [INFO ] Computed 7 invariants in 6 ms
[2024-05-21 20:13:23] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-21 20:13:23] [INFO ] Flow matrix only has 107 transitions (discarded 1 similar events)
[2024-05-21 20:13:23] [INFO ] Invariant cache hit.
[2024-05-21 20:13:23] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-21 20:13:23] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2024-05-21 20:13:23] [INFO ] Flow matrix only has 107 transitions (discarded 1 similar events)
[2024-05-21 20:13:23] [INFO ] Invariant cache hit.
[2024-05-21 20:13:23] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-21 20:13:24] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2024-05-21 20:13:25] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 3 ms to minimize.
[2024-05-21 20:13:25] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 106/151 variables, 45/55 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 58/113 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 1/152 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 0/152 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 114 constraints, problems are : Problem set: 0 solved, 107 unsolved in 5134 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 106/151 variables, 45/55 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 58/113 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 107/220 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 1/152 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 0/152 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 221 constraints, problems are : Problem set: 0 solved, 107 unsolved in 6717 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 45/45 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 3/3 constraints]
After SMT, in 12046ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 12050ms
Starting structural reductions in LTL mode, iteration 1 : 45/47 places, 108/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12237 ms. Remains : 45/47 places, 108/118 transitions.
[2024-05-21 20:13:36] [INFO ] Flatten gal took : 18 ms
[2024-05-21 20:13:36] [INFO ] Flatten gal took : 17 ms
[2024-05-21 20:13:36] [INFO ] Input system was already deterministic with 108 transitions.
[2024-05-21 20:13:36] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:13:36] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:13:36] [INFO ] Time to serialize gal into /tmp/CTLFireability15514163857618484564.gal : 2 ms
[2024-05-21 20:13:36] [INFO ] Time to serialize properties into /tmp/CTLFireability14165497053984222131.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/CTLFireability15514163857618484564.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14165497053984222131.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,156254,0.275448,11004,2,1460,5,23551,6,0,281,25684,0


Converting to forward existential form...Done !
original formula: A(EF(EG((((((p11==1)&&(p21==1))&&((p25==1)&&(p35==1)))&&(p42==1))||(((p1==1)&&(p7==1))&&((p27==1)&&(p41==1)))))) U EG((E((p45==1) U (((((...431
=> equivalent forward existential formula: [((Init * !(EG(!(EG((E((p45==1) U ((((((p1==1)&&(p5==1))&&((p15==1)&&(p41==1)))&&(((p1==1)&&(p7==1))&&((p24==1)&...1447
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t9, t10, t11, t14, t15, t16, t19, t20, t35, t75, t81, t89, t96, t97, t105, I...252
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,12.2966,287964,1,0,1379,1.28856e+06,265,724,3319,1.46703e+06,1492
FORMULA AutonomousCar-PT-04a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 45 transition count 112
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 112
Applied a total of 4 rules in 2 ms. Remains 45 /47 variables (removed 2) and now considering 112/118 (removed 6) transitions.
// Phase 1: matrix 112 rows 45 cols
[2024-05-21 20:13:48] [INFO ] Computed 6 invariants in 3 ms
[2024-05-21 20:13:48] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 20:13:48] [INFO ] Invariant cache hit.
[2024-05-21 20:13:48] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-21 20:13:48] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2024-05-21 20:13:48] [INFO ] Invariant cache hit.
[2024-05-21 20:13:48] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 111/156 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 62/113 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-21 20:13:50] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-21 20:13:50] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-21 20:13:50] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-05-21 20:13:51] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 1/157 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 0/157 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 118 constraints, problems are : Problem set: 0 solved, 111 unsolved in 5777 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 45/45 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 111/156 variables, 45/55 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 62/117 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 111/228 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 1/157 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 229 constraints, problems are : Problem set: 0 solved, 111 unsolved in 7046 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 45/45 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 4/4 constraints]
After SMT, in 12955ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 12958ms
Starting structural reductions in LTL mode, iteration 1 : 45/47 places, 112/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13132 ms. Remains : 45/47 places, 112/118 transitions.
[2024-05-21 20:14:01] [INFO ] Flatten gal took : 12 ms
[2024-05-21 20:14:01] [INFO ] Flatten gal took : 13 ms
[2024-05-21 20:14:01] [INFO ] Input system was already deterministic with 112 transitions.
[2024-05-21 20:14:01] [INFO ] Flatten gal took : 12 ms
[2024-05-21 20:14:01] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:14:01] [INFO ] Time to serialize gal into /tmp/CTLFireability16441130314727954654.gal : 3 ms
[2024-05-21 20:14:01] [INFO ] Time to serialize properties into /tmp/CTLFireability6739092005928116710.ctl : 2 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/CTLFireability16441130314727954654.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6739092005928116710.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,179660,0.35025,11332,2,1712,5,24968,6,0,288,30538,0


Converting to forward existential form...Done !
original formula: EF(((((p1==1)&&(p5==1))&&((p31==1)&&(p41==1))) * (AF(((((p1==1)&&(p2==1))&&((p15==1)&&(p41==1)))||(((p1==1)&&(p2==1))&&((p26==1)&&(p41==1...322
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (((p1==1)&&(p5==1))&&((p31==1)&&(p41==1)))) * !(EG(!(((((p1==1)&&(p2==1))&&((p15==1)&&(p41...458
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t7, t10, t11, t12, t15, t16, t19, t20, t21, t24, t52, t80, t86, t88, t95, t10...263
(forward)formula 0,0,6.07942,140016,1,0,656,636521,250,287,3335,762321,727
FORMULA AutonomousCar-PT-04a-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 113
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 42 transition count 113
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 42 transition count 112
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 41 transition count 112
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 17 place count 36 transition count 91
Iterating global reduction 2 with 5 rules applied. Total rules applied 22 place count 36 transition count 91
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 34 transition count 89
Applied a total of 26 rules in 18 ms. Remains 34 /47 variables (removed 13) and now considering 89/118 (removed 29) transitions.
// Phase 1: matrix 89 rows 34 cols
[2024-05-21 20:14:07] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 20:14:07] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 20:14:07] [INFO ] Invariant cache hit.
[2024-05-21 20:14:07] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-21 20:14:07] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-21 20:14:07] [INFO ] Redundant transitions in 2 ms returned []
Running 88 sub problems to find dead transitions.
[2024-05-21 20:14:07] [INFO ] Invariant cache hit.
[2024-05-21 20:14:07] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (OVERLAPS) 88/122 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 50/90 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-21 20:14:09] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 1/123 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 0/123 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 92 constraints, problems are : Problem set: 0 solved, 88 unsolved in 3715 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 88/122 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 50/91 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 88/179 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 1/123 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/123 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 180 constraints, problems are : Problem set: 0 solved, 88 unsolved in 4897 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 1/1 constraints]
After SMT, in 8749ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 8751ms
Starting structural reductions in SI_CTL mode, iteration 1 : 34/47 places, 89/118 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8903 ms. Remains : 34/47 places, 89/118 transitions.
[2024-05-21 20:14:16] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:14:16] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:14:16] [INFO ] Input system was already deterministic with 89 transitions.
[2024-05-21 20:14:16] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:14:16] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:14:16] [INFO ] Time to serialize gal into /tmp/CTLFireability14607946617974904396.gal : 3 ms
[2024-05-21 20:14:16] [INFO ] Time to serialize properties into /tmp/CTLFireability1413037397723705515.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/CTLFireability14607946617974904396.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1413037397723705515.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,29024,0.213998,6352,2,586,5,8485,6,0,221,9847,0


Converting to forward existential form...Done !
original formula: EF(EG((((EF((p34==1)) + (p1==0)) + ((p7==0)||(p29==0))) + (p41==0))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((E(TRUE U (p34==1)) + (p1==0)) + ((p7==0)||(p29==0))) + (p41==0)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t6, t7, t9, t10, t12, t13, t15, t16, t17, t18, t20, t21, t22, t23, t24, t25, t26,...289
(forward)formula 0,1,1.03734,21060,1,0,257,68773,207,107,2766,84845,258
FORMULA AutonomousCar-PT-04a-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 102
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 102
Applied a total of 8 rules in 3 ms. Remains 43 /47 variables (removed 4) and now considering 102/118 (removed 16) transitions.
// Phase 1: matrix 102 rows 43 cols
[2024-05-21 20:14:17] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 20:14:17] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 20:14:17] [INFO ] Invariant cache hit.
[2024-05-21 20:14:18] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 20:14:18] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-21 20:14:18] [INFO ] Invariant cache hit.
[2024-05-21 20:14:18] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 101/144 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 54/103 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-21 20:14:19] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-21 20:14:19] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-21 20:14:20] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 1/145 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 107 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4797 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 101/144 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 54/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 101/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 1/145 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 208 constraints, problems are : Problem set: 0 solved, 101 unsolved in 6484 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
After SMT, in 11434ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 11437ms
Starting structural reductions in LTL mode, iteration 1 : 43/47 places, 102/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11641 ms. Remains : 43/47 places, 102/118 transitions.
[2024-05-21 20:14:29] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:14:29] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:14:29] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-21 20:14:29] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:14:29] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:14:29] [INFO ] Time to serialize gal into /tmp/CTLFireability914456267441992026.gal : 2 ms
[2024-05-21 20:14:29] [INFO ] Time to serialize properties into /tmp/CTLFireability17981588030810164965.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/CTLFireability914456267441992026.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17981588030810164965.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,135866,0.296435,9888,2,1497,5,20713,6,0,270,24496,0


Converting to forward existential form...Done !
original formula: AG(AF(AX(EF((((p1==0)||(p6==0))||((p24==0)||(p41==0)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(!(EX(!(E(TRUE U (((p1==0)||(p6==0))||((p24==0)||(p41==0)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t9, t10, t11, t14, t15, t18, t19, t70, t76, t78, t84, t85, t86, t91, t92, t93...272
(forward)formula 0,1,1.42396,31888,1,0,256,109733,230,102,3059,131422,262
FORMULA AutonomousCar-PT-04a-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 102
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 102
Applied a total of 8 rules in 2 ms. Remains 43 /47 variables (removed 4) and now considering 102/118 (removed 16) transitions.
// Phase 1: matrix 102 rows 43 cols
[2024-05-21 20:14:31] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 20:14:31] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 20:14:31] [INFO ] Invariant cache hit.
[2024-05-21 20:14:31] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 20:14:31] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-21 20:14:31] [INFO ] Invariant cache hit.
[2024-05-21 20:14:31] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 101/144 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 54/103 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-21 20:14:32] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-05-21 20:14:33] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-21 20:14:33] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 1/145 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 107 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4754 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 101/144 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 54/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 101/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 1/145 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 208 constraints, problems are : Problem set: 0 solved, 101 unsolved in 6323 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
After SMT, in 11235ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 11239ms
Starting structural reductions in LTL mode, iteration 1 : 43/47 places, 102/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11406 ms. Remains : 43/47 places, 102/118 transitions.
[2024-05-21 20:14:42] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:14:42] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:14:42] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-21 20:14:42] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:14:42] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:14:42] [INFO ] Time to serialize gal into /tmp/CTLFireability9215982041002146183.gal : 2 ms
[2024-05-21 20:14:42] [INFO ] Time to serialize properties into /tmp/CTLFireability12536281714693694734.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/CTLFireability9215982041002146183.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12536281714693694734.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,135866,0.277085,9620,2,1453,5,20639,6,0,270,22485,0


Converting to forward existential form...Done !
original formula: E(!(((E(EF((((p1==1)&&(p5==1))&&((p20==1)&&(p41==1)))) U (!((((p1==1)&&(p6==1))&&((p13==1)&&(p41==1)))) * AX((((p1==1)&&(p6==1))&&((p10==...338
=> equivalent forward existential formula: [(FwdU(Init,!(((E(E(TRUE U (((p1==1)&&(p5==1))&&((p20==1)&&(p41==1)))) U (!((((p1==1)&&(p6==1))&&((p13==1)&&(p41...414
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t9, t10, t13, t14, t17, t18, t19, t46, t76, t78, t79, t81, t85, t87, t89, t91...272
(forward)formula 0,0,6.62892,145880,1,0,638,588479,239,349,3114,696631,700
FORMULA AutonomousCar-PT-04a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 102
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 102
Applied a total of 8 rules in 4 ms. Remains 43 /47 variables (removed 4) and now considering 102/118 (removed 16) transitions.
// Phase 1: matrix 102 rows 43 cols
[2024-05-21 20:14:49] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 20:14:49] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 20:14:49] [INFO ] Invariant cache hit.
[2024-05-21 20:14:49] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 20:14:49] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-21 20:14:49] [INFO ] Invariant cache hit.
[2024-05-21 20:14:49] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 101/144 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 54/103 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-21 20:14:50] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-21 20:14:50] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
[2024-05-21 20:14:50] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 1/145 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 107 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4985 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 101/144 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 54/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 101/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 1/145 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 208 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5445 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
After SMT, in 10531ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 10533ms
Starting structural reductions in LTL mode, iteration 1 : 43/47 places, 102/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10670 ms. Remains : 43/47 places, 102/118 transitions.
[2024-05-21 20:14:59] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:14:59] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:14:59] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-21 20:14:59] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:14:59] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:14:59] [INFO ] Time to serialize gal into /tmp/CTLFireability7606643368352291128.gal : 2 ms
[2024-05-21 20:14:59] [INFO ] Time to serialize properties into /tmp/CTLFireability2838195010141180411.ctl : 4 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/CTLFireability7606643368352291128.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2838195010141180411.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,135866,0.31404,10148,2,1457,5,20746,6,0,270,22207,0


Converting to forward existential form...Done !
original formula: AF((((AX((((p1==0)||(p7==0))||((p29==0)||(p41==0)))) * (p11==1)) * ((p18==1)&&(p25==1))) * (((p35==1)&&(p42==1)) * ((EX((((p1==0)||(p2==0...327
=> equivalent forward existential formula: [FwdG(Init,!((((!(EX(!((((p1==0)||(p7==0))||((p29==0)||(p41==0)))))) * (p11==1)) * ((p18==1)&&(p25==1))) * (((p3...491
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t9, t10, t13, t14, t15, t18, t19, t34, t76, t78, t79, t80, t84, t87, t88, t91...272
(forward)formula 0,0,7.05569,170692,1,0,880,718383,241,446,3066,924633,879
FORMULA AutonomousCar-PT-04a-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 46 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 46 transition count 117
Applied a total of 2 rules in 2 ms. Remains 46 /47 variables (removed 1) and now considering 117/118 (removed 1) transitions.
// Phase 1: matrix 117 rows 46 cols
[2024-05-21 20:15:07] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 20:15:07] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-21 20:15:07] [INFO ] Invariant cache hit.
[2024-05-21 20:15:07] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-21 20:15:07] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2024-05-21 20:15:07] [INFO ] Invariant cache hit.
[2024-05-21 20:15:07] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 116/162 variables, 46/52 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 66/118 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-21 20:15:09] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2024-05-21 20:15:09] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 1/163 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/163 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 121 constraints, problems are : Problem set: 0 solved, 116 unsolved in 6402 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 46/46 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 116/162 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 66/120 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 116/236 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 1/163 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 0/163 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 237 constraints, problems are : Problem set: 0 solved, 116 unsolved in 7732 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 46/46 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 2/2 constraints]
After SMT, in 14370ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 14372ms
Starting structural reductions in LTL mode, iteration 1 : 46/47 places, 117/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14537 ms. Remains : 46/47 places, 117/118 transitions.
[2024-05-21 20:15:21] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:15:21] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:15:21] [INFO ] Input system was already deterministic with 117 transitions.
[2024-05-21 20:15:21] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:15:21] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:15:21] [INFO ] Time to serialize gal into /tmp/CTLFireability10348210508646964999.gal : 3 ms
[2024-05-21 20:15:21] [INFO ] Time to serialize properties into /tmp/CTLFireability6770892363928440359.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/CTLFireability10348210508646964999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6770892363928440359.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,206492,0.50315,12720,2,1805,5,28611,6,0,297,32721,0


Converting to forward existential form...Done !
original formula: ((E(E(AX((!((((p1==1)&&(p6==1))&&((p20==1)&&(p41==1)))) * AF((p30==1)))) U (!(((((p14==1)&&(p21==1))&&((p28==1)&&(p35==1)))&&(p42==1))) *...1160
=> equivalent forward existential formula: (([(Init * !(E(E(!(EX(!((!((((p1==1)&&(p6==1))&&((p20==1)&&(p41==1)))) * !(EG(!((p30==1)))))))) U (!(((((p14==1)...1804
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t7, t10, t11, t12, t15, t16, t17, t20, t21, t22, t25, t41, t57, t85, t91, t93...268
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,26.806,521312,1,0,2983,2.4173e+06,353,1535,3579,2.74094e+06,3410
FORMULA AutonomousCar-PT-04a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 102
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 102
Applied a total of 8 rules in 3 ms. Remains 43 /47 variables (removed 4) and now considering 102/118 (removed 16) transitions.
// Phase 1: matrix 102 rows 43 cols
[2024-05-21 20:15:48] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 20:15:48] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 20:15:48] [INFO ] Invariant cache hit.
[2024-05-21 20:15:48] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 20:15:48] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2024-05-21 20:15:48] [INFO ] Invariant cache hit.
[2024-05-21 20:15:48] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 101/144 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 54/103 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-21 20:15:50] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-21 20:15:50] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
[2024-05-21 20:15:50] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 1/145 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 107 constraints, problems are : Problem set: 0 solved, 101 unsolved in 4976 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 101/144 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 54/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 101/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 1/145 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 208 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5713 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints]
After SMT, in 10857ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 10860ms
Starting structural reductions in LTL mode, iteration 1 : 43/47 places, 102/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11070 ms. Remains : 43/47 places, 102/118 transitions.
[2024-05-21 20:15:59] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:15:59] [INFO ] Flatten gal took : 9 ms
[2024-05-21 20:15:59] [INFO ] Input system was already deterministic with 102 transitions.
[2024-05-21 20:15:59] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:15:59] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:15:59] [INFO ] Time to serialize gal into /tmp/CTLFireability9455763320002569210.gal : 3 ms
[2024-05-21 20:15:59] [INFO ] Time to serialize properties into /tmp/CTLFireability10697115927193982138.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/CTLFireability9455763320002569210.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10697115927193982138.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,135866,0.328264,9620,2,1540,5,19313,6,0,270,23776,0


Converting to forward existential form...Done !
original formula: (AG(AX((EX((p34==0)) * (((p1==0)||(p6==0))||((p31==0)||(p41==0)))))) + AG(E(!((E((((p1==1)&&(p5==1))&&((p29==1)&&(p41==1))) U (((p1==1)&&...303
=> equivalent forward existential formula: [(FwdU((Init * !(!(E(TRUE U !(!(EX(!((EX((p34==0)) * (((p1==0)||(p6==0))||((p31==0)||(p41==0)))))))))))),TRUE) *...384
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t7, t10, t11, t14, t15, t18, t19, t22, t76, t78, t79, t80, t81, t82, t84, t85...272
(forward)formula 0,0,3.16297,74912,1,0,304,268795,238,160,3098,329145,328
FORMULA AutonomousCar-PT-04a-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 113
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 42 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 41 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 41 transition count 111
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 40 transition count 111
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 18 place count 36 transition count 95
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 36 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 26 place count 34 transition count 93
Applied a total of 26 rules in 25 ms. Remains 34 /47 variables (removed 13) and now considering 93/118 (removed 25) transitions.
// Phase 1: matrix 93 rows 34 cols
[2024-05-21 20:16:03] [INFO ] Computed 6 invariants in 2 ms
[2024-05-21 20:16:03] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 20:16:03] [INFO ] Invariant cache hit.
[2024-05-21 20:16:03] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 20:16:03] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-05-21 20:16:03] [INFO ] Redundant transitions in 3 ms returned []
Running 92 sub problems to find dead transitions.
[2024-05-21 20:16:03] [INFO ] Invariant cache hit.
[2024-05-21 20:16:03] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 92/126 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 54/94 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-05-21 20:16:04] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 1/127 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 0/127 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 96 constraints, problems are : Problem set: 0 solved, 92 unsolved in 4298 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 92/126 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 54/95 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 92/187 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 1/127 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/127 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 188 constraints, problems are : Problem set: 0 solved, 92 unsolved in 4306 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 1/1 constraints]
After SMT, in 8773ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 8777ms
Starting structural reductions in SI_CTL mode, iteration 1 : 34/47 places, 93/118 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8989 ms. Remains : 34/47 places, 93/118 transitions.
[2024-05-21 20:16:11] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:16:11] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:16:11] [INFO ] Input system was already deterministic with 93 transitions.
[2024-05-21 20:16:11] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:16:12] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:16:12] [INFO ] Time to serialize gal into /tmp/CTLFireability5481090500157332542.gal : 1 ms
[2024-05-21 20:16:12] [INFO ] Time to serialize properties into /tmp/CTLFireability4557768988854664609.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/CTLFireability5481090500157332542.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4557768988854664609.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,28801,0.137935,6940,2,666,5,10016,6,0,225,13312,0


Converting to forward existential form...Done !
original formula: EG((EF((((p1==1)&&(p5==1))&&((p27==1)&&(p41==1)))) * EG(EF((((p1==1)&&(p7==1))&&((p26==1)&&(p41==1)))))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (((p1==1)&&(p5==1))&&((p27==1)&&(p41==1)))) * EG(E(TRUE U (((p1==1)&&(p7==1))&&((p26==1)&&(...178
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t6, t7, t8, t9, t11, t12, t19, t20, t21, t26, t27, t28, t29, t34, t37, t38, t...257
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,4.45236,92668,1,0,646,330052,219,357,2855,392899,671
FORMULA AutonomousCar-PT-04a-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 45 transition count 112
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 40 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 40 transition count 111
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 13 place count 39 transition count 111
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 18 place count 34 transition count 90
Iterating global reduction 2 with 5 rules applied. Total rules applied 23 place count 34 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 32 transition count 88
Applied a total of 27 rules in 20 ms. Remains 32 /47 variables (removed 15) and now considering 88/118 (removed 30) transitions.
// Phase 1: matrix 88 rows 32 cols
[2024-05-21 20:16:16] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 20:16:16] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 20:16:16] [INFO ] Invariant cache hit.
[2024-05-21 20:16:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 20:16:16] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-05-21 20:16:16] [INFO ] Redundant transitions in 2 ms returned []
Running 87 sub problems to find dead transitions.
[2024-05-21 20:16:16] [INFO ] Invariant cache hit.
[2024-05-21 20:16:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 87/119 variables, 32/37 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-05-21 20:16:17] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
[2024-05-21 20:16:17] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 1/120 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 40 constraints, problems are : Problem set: 0 solved, 87 unsolved in 2580 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 32/32 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (OVERLAPS) 87/119 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 87/126 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (OVERLAPS) 1/120 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 127 constraints, problems are : Problem set: 0 solved, 87 unsolved in 3384 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 32/32 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 2/2 constraints]
After SMT, in 6105ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 6110ms
Starting structural reductions in SI_CTL mode, iteration 1 : 32/47 places, 88/118 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6340 ms. Remains : 32/47 places, 88/118 transitions.
[2024-05-21 20:16:22] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:16:22] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:16:22] [INFO ] Input system was already deterministic with 88 transitions.
[2024-05-21 20:16:22] [INFO ] Flatten gal took : 4 ms
[2024-05-21 20:16:22] [INFO ] Flatten gal took : 3 ms
[2024-05-21 20:16:22] [INFO ] Time to serialize gal into /tmp/CTLFireability8211674945719631476.gal : 2 ms
[2024-05-21 20:16:22] [INFO ] Time to serialize properties into /tmp/CTLFireability15031180528618194255.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/CTLFireability8211674945719631476.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15031180528618194255.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,29023,0.120104,5152,2,406,5,6413,6,0,214,7133,0


Converting to forward existential form...Done !
original formula: EG(AF((p9==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((p9==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t5, t7, t8, t10, t11, t14, t15, t16, t17, t19, t20, t21, t22, t23, t24, t25, ...288
(forward)formula 0,0,1.23325,29276,1,0,514,127033,202,217,2536,147064,554
FORMULA AutonomousCar-PT-04a-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 113
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 42 transition count 113
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 42 transition count 112
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 12 place count 41 transition count 112
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 17 place count 36 transition count 91
Iterating global reduction 2 with 5 rules applied. Total rules applied 22 place count 36 transition count 91
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 34 transition count 89
Applied a total of 26 rules in 25 ms. Remains 34 /47 variables (removed 13) and now considering 89/118 (removed 29) transitions.
// Phase 1: matrix 89 rows 34 cols
[2024-05-21 20:16:24] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 20:16:24] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 20:16:24] [INFO ] Invariant cache hit.
[2024-05-21 20:16:24] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-21 20:16:24] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-05-21 20:16:24] [INFO ] Redundant transitions in 2 ms returned []
Running 88 sub problems to find dead transitions.
[2024-05-21 20:16:24] [INFO ] Invariant cache hit.
[2024-05-21 20:16:24] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (OVERLAPS) 88/122 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 50/90 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-21 20:16:25] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 1/123 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 0/123 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 92 constraints, problems are : Problem set: 0 solved, 88 unsolved in 3796 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 88/122 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 50/91 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 88/179 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 1/123 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/123 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 180 constraints, problems are : Problem set: 0 solved, 88 unsolved in 4441 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 1/1 constraints]
After SMT, in 8331ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 8334ms
Starting structural reductions in SI_CTL mode, iteration 1 : 34/47 places, 89/118 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8546 ms. Remains : 34/47 places, 89/118 transitions.
[2024-05-21 20:16:32] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:16:32] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:16:32] [INFO ] Input system was already deterministic with 89 transitions.
[2024-05-21 20:16:32] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:16:32] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:16:32] [INFO ] Time to serialize gal into /tmp/CTLFireability10583872356406662187.gal : 2 ms
[2024-05-21 20:16:32] [INFO ] Time to serialize properties into /tmp/CTLFireability9608507165279479856.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/CTLFireability10583872356406662187.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9608507165279479856.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,29024,0.245564,7676,2,999,5,15205,6,0,221,15548,0


Converting to forward existential form...Done !
original formula: EF(EG((((p1==1)&&(p6==1))&&((p22==1)&&(p41==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((p1==1)&&(p6==1))&&((p22==1)&&(p41==1))))] != FALSE
Hit Full ! (commute/partial/dont) 21/126/68
(forward)formula 0,1,0.86697,16388,1,0,48,54363,19,2,2021,51351,47
FORMULA AutonomousCar-PT-04a-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-21 20:16:33] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:16:33] [INFO ] Flatten gal took : 5 ms
Total runtime 220552 ms.

BK_STOP 1716322593690

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

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