Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.3K Jun 7 15:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Jun 7 15:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 7 15:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 7 15:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 3 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 3 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 3 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 3 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 7.7K Jun 7 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 7 15:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Jun 7 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 7 15:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 3 16:02 instance
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 iscolored
-rw-r--r-- 1 mcc users 110K Jun 3 16:02 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-04b-CTLFireability-00
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-01
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-02
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-03
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-04
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-05
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-06
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-07
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-08
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-09
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-10
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-11
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-12
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-13
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-14
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1654899105108

Running Version 202205111006
[2022-06-10 22:11:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 22:11:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 22:11:48] [INFO ] Load time of PNML (sax parser for PT used): 243 ms
[2022-06-10 22:11:48] [INFO ] Transformed 221 places.
[2022-06-10 22:11:48] [INFO ] Transformed 368 transitions.
[2022-06-10 22:11:48] [INFO ] Found NUPN structural information;
[2022-06-10 22:11:48] [INFO ] Parsed PT model containing 221 places and 368 transitions in 594 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Support contains 96 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 368/368 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 205 transition count 352
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 205 transition count 352
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 203 transition count 350
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 203 transition count 350
Applied a total of 36 rules in 98 ms. Remains 203 /221 variables (removed 18) and now considering 350/368 (removed 18) transitions.
// Phase 1: matrix 350 rows 203 cols
[2022-06-10 22:11:48] [INFO ] Computed 9 place invariants in 29 ms
[2022-06-10 22:11:49] [INFO ] Implicit Places using invariants in 379 ms returned []
// Phase 1: matrix 350 rows 203 cols
[2022-06-10 22:11:49] [INFO ] Computed 9 place invariants in 12 ms
[2022-06-10 22:11:49] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
// Phase 1: matrix 350 rows 203 cols
[2022-06-10 22:11:49] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-10 22:11:49] [INFO ] Dead Transitions using invariants and state equation in 465 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/221 places, 350/368 transitions.
Finished structural reductions, in 1 iterations. Remains : 203/221 places, 350/368 transitions.
Support contains 96 out of 203 places after structural reductions.
[2022-06-10 22:11:50] [INFO ] Flatten gal took : 150 ms
[2022-06-10 22:11:50] [INFO ] Flatten gal took : 73 ms
[2022-06-10 22:11:50] [INFO ] Input system was already deterministic with 350 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 1074 ms. (steps per millisecond=9 ) properties (out of 85) seen :50
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 35) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 34) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 31) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 29) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
// Phase 1: matrix 350 rows 203 cols
[2022-06-10 22:11:52] [INFO ] Computed 9 place invariants in 7 ms
[2022-06-10 22:11:53] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2022-06-10 22:11:53] [INFO ] After 791ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:24
[2022-06-10 22:11:54] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-06-10 22:11:55] [INFO ] After 1051ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :23
[2022-06-10 22:11:55] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 6 ms to minimize.
[2022-06-10 22:11:55] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 1 ms to minimize.
[2022-06-10 22:11:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 264 ms
[2022-06-10 22:11:56] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 1 ms to minimize.
[2022-06-10 22:11:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2022-06-10 22:11:56] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 3 ms to minimize.
[2022-06-10 22:11:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 123 ms
[2022-06-10 22:11:56] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 1 ms to minimize.
[2022-06-10 22:11:56] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 1 ms to minimize.
[2022-06-10 22:11:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 288 ms
[2022-06-10 22:11:56] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2022-06-10 22:11:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2022-06-10 22:11:57] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 1 ms to minimize.
[2022-06-10 22:11:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2022-06-10 22:11:57] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 1 ms to minimize.
[2022-06-10 22:11:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 128 ms
[2022-06-10 22:11:57] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 1 ms to minimize.
[2022-06-10 22:11:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2022-06-10 22:11:57] [INFO ] After 3318ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :19
Attempting to minimize the solution found.
Minimization took 529 ms.
[2022-06-10 22:11:58] [INFO ] After 4675ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :19
Fused 28 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 337 ms.
Support contains 38 out of 203 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 203/203 places, 350/350 transitions.
Graph (trivial) has 130 edges and 203 vertex of which 2 / 203 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 566 edges and 202 vertex of which 201 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 58 rules applied. Total rules applied 60 place count 201 transition count 290
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 70 rules applied. Total rules applied 130 place count 144 transition count 277
Reduce places removed 7 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 11 rules applied. Total rules applied 141 place count 137 transition count 273
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 146 place count 133 transition count 272
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 146 place count 133 transition count 258
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 174 place count 119 transition count 258
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 182 place count 111 transition count 250
Iterating global reduction 4 with 8 rules applied. Total rules applied 190 place count 111 transition count 250
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 4 with 64 rules applied. Total rules applied 254 place count 111 transition count 186
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 292 place count 92 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 293 place count 92 transition count 166
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 295 place count 91 transition count 165
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 297 place count 90 transition count 178
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 299 place count 90 transition count 176
Free-agglomeration rule applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 307 place count 90 transition count 168
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 315 place count 82 transition count 168
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 316 place count 82 transition count 167
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 320 place count 82 transition count 167
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 321 place count 81 transition count 166
Applied a total of 321 rules in 152 ms. Remains 81 /203 variables (removed 122) and now considering 166/350 (removed 184) transitions.
Finished structural reductions, in 1 iterations. Remains : 81/203 places, 166/350 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 917 ms. (steps per millisecond=10 ) properties (out of 19) seen :4
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 166 rows 81 cols
[2022-06-10 22:11:59] [INFO ] Computed 9 place invariants in 6 ms
[2022-06-10 22:12:00] [INFO ] [Real]Absence check using 9 positive place invariants in 12 ms returned sat
[2022-06-10 22:12:00] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-10 22:12:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-10 22:12:00] [INFO ] After 201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-06-10 22:12:00] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-06-10 22:12:00] [INFO ] After 120ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-06-10 22:12:00] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
[2022-06-10 22:12:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2022-06-10 22:12:00] [INFO ] After 397ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 158 ms.
[2022-06-10 22:12:00] [INFO ] After 841ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 64 ms.
Support contains 19 out of 81 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 81/81 places, 166/166 transitions.
Graph (trivial) has 34 edges and 81 vertex of which 2 / 81 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 380 edges and 80 vertex of which 76 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 11 rules applied. Total rules applied 13 place count 76 transition count 150
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 23 place count 66 transition count 150
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 23 place count 66 transition count 149
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 25 place count 65 transition count 149
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 35 place count 60 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 59 transition count 139
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 59 transition count 139
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 59 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 59 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 40 place count 58 transition count 137
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 43 place count 58 transition count 134
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 51 place count 55 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 52 place count 54 transition count 128
Applied a total of 52 rules in 40 ms. Remains 54 /81 variables (removed 27) and now considering 128/166 (removed 38) transitions.
Finished structural reductions, in 1 iterations. Remains : 54/81 places, 128/166 transitions.
Incomplete random walk after 10000 steps, including 404 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 128 rows 54 cols
[2022-06-10 22:12:01] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 22:12:01] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-10 22:12:01] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-10 22:12:01] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2022-06-10 22:12:01] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-10 22:12:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:12:01] [INFO ] After 36ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-10 22:12:01] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2022-06-10 22:12:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2022-06-10 22:12:01] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2022-06-10 22:12:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2022-06-10 22:12:01] [INFO ] After 176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 36 ms.
[2022-06-10 22:12:02] [INFO ] After 327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 16 ms.
Support contains 10 out of 54 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 54/54 places, 128/128 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 54 transition count 124
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 50 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 50 transition count 123
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 49 transition count 123
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 48 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 48 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 48 transition count 118
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 17 place count 46 transition count 116
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 46 transition count 114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 21 place count 44 transition count 114
Applied a total of 21 rules in 17 ms. Remains 44 /54 variables (removed 10) and now considering 114/128 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 44/54 places, 114/128 transitions.
Incomplete random walk after 10000 steps, including 287 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Finished probabilistic random walk after 123054 steps, run visited all 3 properties in 336 ms. (steps per millisecond=366 )
Probabilistic random walk after 123054 steps, saw 23261 distinct states, run finished after 337 ms. (steps per millisecond=365 ) properties seen :3
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-04b-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-10 22:12:02] [INFO ] Flatten gal took : 33 ms
[2022-06-10 22:12:02] [INFO ] Flatten gal took : 38 ms
[2022-06-10 22:12:02] [INFO ] Input system was already deterministic with 350 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 203/203 places, 350/350 transitions.
Graph (trivial) has 187 edges and 203 vertex of which 4 / 203 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 200 transition count 264
Reduce places removed 83 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 108 rules applied. Total rules applied 192 place count 117 transition count 239
Reduce places removed 15 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 17 rules applied. Total rules applied 209 place count 102 transition count 237
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 212 place count 100 transition count 236
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 212 place count 100 transition count 231
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 222 place count 95 transition count 231
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 233 place count 84 transition count 220
Iterating global reduction 4 with 11 rules applied. Total rules applied 244 place count 84 transition count 220
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 4 with 64 rules applied. Total rules applied 308 place count 84 transition count 156
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 311 place count 81 transition count 147
Iterating global reduction 5 with 3 rules applied. Total rules applied 314 place count 81 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 318 place count 81 transition count 143
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 320 place count 79 transition count 143
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 7 with 54 rules applied. Total rules applied 374 place count 52 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 375 place count 52 transition count 115
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 380 place count 47 transition count 92
Iterating global reduction 8 with 5 rules applied. Total rules applied 385 place count 47 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 4 rules applied. Total rules applied 389 place count 47 transition count 88
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 391 place count 45 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 393 place count 44 transition count 87
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 394 place count 44 transition count 86
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 396 place count 42 transition count 84
Applied a total of 396 rules in 50 ms. Remains 42 /203 variables (removed 161) and now considering 84/350 (removed 266) transitions.
// Phase 1: matrix 84 rows 42 cols
[2022-06-10 22:12:03] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 22:12:03] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 84 rows 42 cols
[2022-06-10 22:12:03] [INFO ] Computed 8 place invariants in 0 ms
[2022-06-10 22:12:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:12:03] [INFO ] Implicit Places using invariants and state equation in 76 ms returned [34, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 143 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 40/203 places, 84/350 transitions.
Applied a total of 0 rules in 5 ms. Remains 40 /40 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 40/203 places, 84/350 transitions.
[2022-06-10 22:12:03] [INFO ] Flatten gal took : 10 ms
[2022-06-10 22:12:03] [INFO ] Flatten gal took : 10 ms
[2022-06-10 22:12:03] [INFO ] Input system was already deterministic with 84 transitions.
[2022-06-10 22:12:03] [INFO ] Flatten gal took : 9 ms
[2022-06-10 22:12:03] [INFO ] Flatten gal took : 9 ms
[2022-06-10 22:12:03] [INFO ] Time to serialize gal into /tmp/CTLFireability13785044027135790900.gal : 3 ms
[2022-06-10 22:12:03] [INFO ] Time to serialize properties into /tmp/CTLFireability1706130544740914799.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13785044027135790900.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1706130544740914799.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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,134416,0.691655,18500,2,1732,5,45711,6,0,242,47767,0


Converting to forward existential form...Done !
original formula: EG(!(A(EG((((p6==1)&&(p15==1))&&((p83==1)&&(p178==1)))) U (p193==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!((E(!((p193==1)) U (!(EG((((p6==1)&&(p15==1))&&((p83==1)&&(p178==1))))) * !((p193==1)))) + EG(!((p...178
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t4, t6, t8, t10, t12, t14, t16, t18, t20, t24, t25, t29, t32, t33, t36, t37, t43, t44...265
(forward)formula 0,1,5.83173,135400,1,0,663,623570,198,323,2752,643874,712
FORMULA AutonomousCar-PT-04b-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 203/203 places, 350/350 transitions.
Graph (trivial) has 190 edges and 203 vertex of which 4 / 203 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 200 transition count 262
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 111 rules applied. Total rules applied 197 place count 115 transition count 236
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 212 place count 100 transition count 236
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 212 place count 100 transition count 230
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 224 place count 94 transition count 230
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 235 place count 83 transition count 219
Iterating global reduction 3 with 11 rules applied. Total rules applied 246 place count 83 transition count 219
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 3 with 64 rules applied. Total rules applied 310 place count 83 transition count 155
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 313 place count 80 transition count 146
Iterating global reduction 4 with 3 rules applied. Total rules applied 316 place count 80 transition count 146
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 320 place count 80 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 322 place count 78 transition count 142
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 376 place count 51 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 377 place count 51 transition count 114
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 382 place count 46 transition count 90
Iterating global reduction 7 with 5 rules applied. Total rules applied 387 place count 46 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 389 place count 46 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 390 place count 45 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 392 place count 44 transition count 87
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 393 place count 44 transition count 86
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 395 place count 42 transition count 84
Applied a total of 395 rules in 71 ms. Remains 42 /203 variables (removed 161) and now considering 84/350 (removed 266) transitions.
// Phase 1: matrix 84 rows 42 cols
[2022-06-10 22:12:09] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 22:12:09] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 84 rows 42 cols
[2022-06-10 22:12:09] [INFO ] Computed 8 place invariants in 2 ms
[2022-06-10 22:12:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:12:09] [INFO ] Implicit Places using invariants and state equation in 81 ms returned [35, 41]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 128 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 40/203 places, 84/350 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 40 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 39 transition count 83
Applied a total of 2 rules in 7 ms. Remains 39 /40 variables (removed 1) and now considering 83/84 (removed 1) transitions.
// Phase 1: matrix 83 rows 39 cols
[2022-06-10 22:12:09] [INFO ] Computed 6 place invariants in 9 ms
[2022-06-10 22:12:09] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 83 rows 39 cols
[2022-06-10 22:12:09] [INFO ] Computed 6 place invariants in 0 ms
[2022-06-10 22:12:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:12:09] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 39/203 places, 83/350 transitions.
Finished structural reductions, in 2 iterations. Remains : 39/203 places, 83/350 transitions.
[2022-06-10 22:12:09] [INFO ] Flatten gal took : 9 ms
[2022-06-10 22:12:09] [INFO ] Flatten gal took : 9 ms
[2022-06-10 22:12:09] [INFO ] Input system was already deterministic with 83 transitions.
Finished random walk after 9612 steps, including 523 resets, run visited all 1 properties in 42 ms. (steps per millisecond=228 )
FORMULA AutonomousCar-PT-04b-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 350/350 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 183 transition count 330
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 183 transition count 330
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 104 place count 183 transition count 266
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 180 transition count 263
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 180 transition count 263
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 179 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 179 transition count 262
Applied a total of 112 rules in 22 ms. Remains 179 /203 variables (removed 24) and now considering 262/350 (removed 88) transitions.
// Phase 1: matrix 262 rows 179 cols
[2022-06-10 22:12:09] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:12:09] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 262 rows 179 cols
[2022-06-10 22:12:09] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-10 22:12:09] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
// Phase 1: matrix 262 rows 179 cols
[2022-06-10 22:12:09] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:12:10] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 179/203 places, 262/350 transitions.
Finished structural reductions, in 1 iterations. Remains : 179/203 places, 262/350 transitions.
[2022-06-10 22:12:10] [INFO ] Flatten gal took : 22 ms
[2022-06-10 22:12:10] [INFO ] Flatten gal took : 17 ms
[2022-06-10 22:12:10] [INFO ] Input system was already deterministic with 262 transitions.
[2022-06-10 22:12:10] [INFO ] Flatten gal took : 16 ms
[2022-06-10 22:12:10] [INFO ] Flatten gal took : 15 ms
[2022-06-10 22:12:10] [INFO ] Time to serialize gal into /tmp/CTLFireability165461253878464493.gal : 9 ms
[2022-06-10 22:12:10] [INFO ] Time to serialize properties into /tmp/CTLFireability6679905115541808478.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability165461253878464493.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6679905115541808478.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...273
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.39231e+09,9.11061,199504,2,14717,5,754872,6,0,980,971371,0


Converting to forward existential form...Done !
original formula: EX(AG(AF(AX(((((p139==1)&&(p6==1))&&((p9==1)&&(p76==1)))&&(p178==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(EG(!(!(EX(!(((((p139==1)&&(p6==1))&&((p9==1)&&(p76==1)))&&(p178==1))))))))))))] != F...159
Reverse transition relation is NOT exact ! Due to transitions t11, t17, t18, t25, t33, t36, t37, t38, t62, t63, t66, t67, t69, t82, t88, t89, t92, t93, t95...449
Detected timeout of ITS tools.
[2022-06-10 22:12:40] [INFO ] Flatten gal took : 15 ms
[2022-06-10 22:12:40] [INFO ] Applying decomposition
[2022-06-10 22:12:40] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17718209596246426878.txt' '-o' '/tmp/graph17718209596246426878.bin' '-w' '/tmp/graph17718209596246426878.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17718209596246426878.bin' '-l' '-1' '-v' '-w' '/tmp/graph17718209596246426878.weights' '-q' '0' '-e' '0.001'
[2022-06-10 22:12:40] [INFO ] Decomposing Gal with order
[2022-06-10 22:12:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 22:12:40] [INFO ] Removed a total of 242 redundant transitions.
[2022-06-10 22:12:40] [INFO ] Flatten gal took : 94 ms
[2022-06-10 22:12:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 12 ms.
[2022-06-10 22:12:40] [INFO ] Time to serialize gal into /tmp/CTLFireability4081727542142678219.gal : 7 ms
[2022-06-10 22:12:40] [INFO ] Time to serialize properties into /tmp/CTLFireability12249417666657883518.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4081727542142678219.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12249417666657883518.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.39231e+09,0.08955,7212,423,102,3644,578,462,5958,82,1853,0


Converting to forward existential form...Done !
original formula: EX(AG(AF(AX(((((i10.i1.u38.p139==1)&&(i0.u1.p6==1))&&((i0.u1.p9==1)&&(i6.i1.u24.p76==1)))&&(i0.u1.p178==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(EG(!(!(EX(!(((((i10.i1.u38.p139==1)&&(i0.u1.p6==1))&&((i0.u1.p9==1)&&(i6.i1.u24.p76=...198
Reverse transition relation is NOT exact ! Due to transitions t168, t173, t189, t205, t233, t259, i0.t166, i1.u55.t33, i1.u55.t36, i1.u55.t37, i1.u55.t38, ...643
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,3.27258,102252,1,0,197479,2426,3168,282773,448,9927,202853
FORMULA AutonomousCar-PT-04b-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 203/203 places, 350/350 transitions.
Graph (trivial) has 189 edges and 203 vertex of which 4 / 203 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 85 place count 200 transition count 263
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 108 rules applied. Total rules applied 193 place count 116 transition count 239
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 16 rules applied. Total rules applied 209 place count 102 transition count 237
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 213 place count 100 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 214 place count 99 transition count 235
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 214 place count 99 transition count 229
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 226 place count 93 transition count 229
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 237 place count 82 transition count 218
Iterating global reduction 5 with 11 rules applied. Total rules applied 248 place count 82 transition count 218
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 5 with 64 rules applied. Total rules applied 312 place count 82 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 312 place count 82 transition count 153
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 314 place count 81 transition count 153
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 317 place count 78 transition count 144
Iterating global reduction 6 with 3 rules applied. Total rules applied 320 place count 78 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 323 place count 78 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 324 place count 77 transition count 141
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 8 with 54 rules applied. Total rules applied 378 place count 50 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 379 place count 50 transition count 113
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 385 place count 44 transition count 85
Iterating global reduction 9 with 6 rules applied. Total rules applied 391 place count 44 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 9 with 4 rules applied. Total rules applied 395 place count 44 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 397 place count 42 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 399 place count 41 transition count 80
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 400 place count 41 transition count 79
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 402 place count 39 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 403 place count 38 transition count 77
Applied a total of 403 rules in 41 ms. Remains 38 /203 variables (removed 165) and now considering 77/350 (removed 273) transitions.
// Phase 1: matrix 77 rows 38 cols
[2022-06-10 22:12:43] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:12:44] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 77 rows 38 cols
[2022-06-10 22:12:44] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:12:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:12:44] [INFO ] Implicit Places using invariants and state equation in 81 ms returned [31, 37]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 129 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 36/203 places, 77/350 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 36 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 35 transition count 76
Applied a total of 2 rules in 4 ms. Remains 35 /36 variables (removed 1) and now considering 76/77 (removed 1) transitions.
// Phase 1: matrix 76 rows 35 cols
[2022-06-10 22:12:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:12:44] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 76 rows 35 cols
[2022-06-10 22:12:44] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 22:12:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:12:44] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 35/203 places, 76/350 transitions.
Finished structural reductions, in 2 iterations. Remains : 35/203 places, 76/350 transitions.
[2022-06-10 22:12:44] [INFO ] Flatten gal took : 5 ms
[2022-06-10 22:12:44] [INFO ] Flatten gal took : 6 ms
[2022-06-10 22:12:44] [INFO ] Input system was already deterministic with 76 transitions.
Finished random walk after 21 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
FORMULA AutonomousCar-PT-04b-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 203/203 places, 350/350 transitions.
Graph (trivial) has 189 edges and 203 vertex of which 4 / 203 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 200 transition count 262
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 110 rules applied. Total rules applied 196 place count 115 transition count 237
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 15 rules applied. Total rules applied 211 place count 101 transition count 236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 212 place count 100 transition count 236
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 212 place count 100 transition count 230
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 224 place count 94 transition count 230
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 234 place count 84 transition count 220
Iterating global reduction 4 with 10 rules applied. Total rules applied 244 place count 84 transition count 220
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 4 with 64 rules applied. Total rules applied 308 place count 84 transition count 156
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 310 place count 82 transition count 151
Iterating global reduction 5 with 2 rules applied. Total rules applied 312 place count 82 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 314 place count 82 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 315 place count 81 transition count 149
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 7 with 54 rules applied. Total rules applied 369 place count 54 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 370 place count 54 transition count 121
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 376 place count 48 transition count 93
Iterating global reduction 8 with 6 rules applied. Total rules applied 382 place count 48 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 4 rules applied. Total rules applied 386 place count 48 transition count 89
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 388 place count 46 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 390 place count 45 transition count 88
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 391 place count 45 transition count 87
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 393 place count 43 transition count 85
Applied a total of 393 rules in 28 ms. Remains 43 /203 variables (removed 160) and now considering 85/350 (removed 265) transitions.
// Phase 1: matrix 85 rows 43 cols
[2022-06-10 22:12:44] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 22:12:44] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 85 rows 43 cols
[2022-06-10 22:12:44] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 22:12:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:12:44] [INFO ] Implicit Places using invariants and state equation in 77 ms returned [36, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 124 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 41/203 places, 85/350 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 41 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 40 transition count 84
Applied a total of 2 rules in 4 ms. Remains 40 /41 variables (removed 1) and now considering 84/85 (removed 1) transitions.
// Phase 1: matrix 84 rows 40 cols
[2022-06-10 22:12:44] [INFO ] Computed 6 place invariants in 0 ms
[2022-06-10 22:12:44] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 84 rows 40 cols
[2022-06-10 22:12:44] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 22:12:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:12:44] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 40/203 places, 84/350 transitions.
Finished structural reductions, in 2 iterations. Remains : 40/203 places, 84/350 transitions.
[2022-06-10 22:12:44] [INFO ] Flatten gal took : 6 ms
[2022-06-10 22:12:44] [INFO ] Flatten gal took : 7 ms
[2022-06-10 22:12:44] [INFO ] Input system was already deterministic with 84 transitions.
[2022-06-10 22:12:44] [INFO ] Flatten gal took : 6 ms
[2022-06-10 22:12:44] [INFO ] Flatten gal took : 6 ms
[2022-06-10 22:12:44] [INFO ] Time to serialize gal into /tmp/CTLFireability1946886251370282799.gal : 2 ms
[2022-06-10 22:12:44] [INFO ] Time to serialize properties into /tmp/CTLFireability8640967333544879792.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1946886251370282799.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8640967333544879792.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
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,139930,0.47635,16352,2,1624,5,42347,6,0,242,42758,0


Converting to forward existential form...Done !
original formula: EG(A(EF((((p6==1)&&(p15==1))&&((p33==1)&&(p178==1)))) U !(EG((p32==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(EG((p32==1)))) U (!(E(TRUE U (((p6==1)&&(p15==1))&&((p33==1)&&(p178==1))))) * !(!(EG((p32==1...199
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t4, t5, t6, t8, t10, t12, t14, t16, t18, t20, t26, t27, t28, t29, t31, t32, t33, t34,...419
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,6.89041,157748,1,0,628,639521,204,328,2801,864640,589
FORMULA AutonomousCar-PT-04b-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 203/203 places, 350/350 transitions.
Graph (trivial) has 177 edges and 203 vertex of which 4 / 203 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 200 transition count 269
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 101 rules applied. Total rules applied 180 place count 122 transition count 246
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 16 rules applied. Total rules applied 196 place count 108 transition count 244
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 200 place count 106 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 201 place count 105 transition count 242
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 201 place count 105 transition count 238
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 209 place count 101 transition count 238
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 219 place count 91 transition count 228
Iterating global reduction 5 with 10 rules applied. Total rules applied 229 place count 91 transition count 228
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 5 with 64 rules applied. Total rules applied 293 place count 91 transition count 164
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 295 place count 89 transition count 156
Iterating global reduction 6 with 2 rules applied. Total rules applied 297 place count 89 transition count 156
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 300 place count 89 transition count 153
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 302 place count 88 transition count 152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 303 place count 87 transition count 152
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 9 with 52 rules applied. Total rules applied 355 place count 61 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 357 place count 61 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 358 place count 60 transition count 124
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 363 place count 55 transition count 100
Iterating global reduction 11 with 5 rules applied. Total rules applied 368 place count 55 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 11 with 2 rules applied. Total rules applied 370 place count 55 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 371 place count 54 transition count 98
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 372 place count 54 transition count 97
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 374 place count 54 transition count 97
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 376 place count 52 transition count 95
Applied a total of 376 rules in 32 ms. Remains 52 /203 variables (removed 151) and now considering 95/350 (removed 255) transitions.
// Phase 1: matrix 95 rows 52 cols
[2022-06-10 22:12:51] [INFO ] Computed 8 place invariants in 1 ms
[2022-06-10 22:12:51] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 95 rows 52 cols
[2022-06-10 22:12:51] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-10 22:12:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:12:51] [INFO ] Implicit Places using invariants and state equation in 90 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 138 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 51/203 places, 95/350 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 51/203 places, 95/350 transitions.
[2022-06-10 22:12:51] [INFO ] Flatten gal took : 7 ms
[2022-06-10 22:12:51] [INFO ] Flatten gal took : 7 ms
[2022-06-10 22:12:51] [INFO ] Input system was already deterministic with 95 transitions.
[2022-06-10 22:12:51] [INFO ] Flatten gal took : 7 ms
[2022-06-10 22:12:51] [INFO ] Flatten gal took : 14 ms
[2022-06-10 22:12:51] [INFO ] Time to serialize gal into /tmp/CTLFireability13707970212518161501.gal : 8 ms
[2022-06-10 22:12:51] [INFO ] Time to serialize properties into /tmp/CTLFireability2454669224965742021.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13707970212518161501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2454669224965742021.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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,472654,0.36369,14804,2,1620,5,41246,6,0,298,36652,0


Converting to forward existential form...Done !
original formula: EF(((AF(((p188==1) + (E((p183==1) U (p55==1)) * AG((p177==1))))) * AG(((((p205==1)&&(p6==1))&&((p15==1)&&(p138==1)))&&(p178==1)))) * ((p1...180
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * (!(EG(!(((p188==1) + (E((p183==1) U (p55==1)) * !(E(TRUE U !((p177==1))))))))) * !(E(...269
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t9, t12, t14, t16, t19, t21, t23, t25, t27, t28, t31, t32, t33, t34, t36, t37, t38, t...307
(forward)formula 0,0,0.737675,18716,1,0,208,68727,215,91,3134,45076,200
FORMULA AutonomousCar-PT-04b-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 350/350 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 184 transition count 331
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 184 transition count 331
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 102 place count 184 transition count 267
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 182 transition count 265
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 182 transition count 265
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 181 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 181 transition count 264
Applied a total of 108 rules in 9 ms. Remains 181 /203 variables (removed 22) and now considering 264/350 (removed 86) transitions.
// Phase 1: matrix 264 rows 181 cols
[2022-06-10 22:12:52] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:12:52] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 264 rows 181 cols
[2022-06-10 22:12:52] [INFO ] Computed 9 place invariants in 4 ms
[2022-06-10 22:12:52] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
// Phase 1: matrix 264 rows 181 cols
[2022-06-10 22:12:52] [INFO ] Computed 9 place invariants in 4 ms
[2022-06-10 22:12:52] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 181/203 places, 264/350 transitions.
Finished structural reductions, in 1 iterations. Remains : 181/203 places, 264/350 transitions.
[2022-06-10 22:12:52] [INFO ] Flatten gal took : 10 ms
[2022-06-10 22:12:52] [INFO ] Flatten gal took : 11 ms
[2022-06-10 22:12:52] [INFO ] Input system was already deterministic with 264 transitions.
[2022-06-10 22:12:53] [INFO ] Flatten gal took : 10 ms
[2022-06-10 22:12:53] [INFO ] Flatten gal took : 10 ms
[2022-06-10 22:12:53] [INFO ] Time to serialize gal into /tmp/CTLFireability14852146236974786849.gal : 3 ms
[2022-06-10 22:12:53] [INFO ] Time to serialize properties into /tmp/CTLFireability6653133382540555032.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14852146236974786849.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6653133382540555032.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.45023e+09,8.91895,200920,2,14665,5,750411,6,0,990,966692,0


Converting to forward existential form...Done !
original formula: AG((((AG(((p91==0)||(p10==0))) + AX((p72==0))) + (AX(EG((((p6==1)&&(p15==1))&&((p49==1)&&(p178==1))))) + (((p6==1)&&(p9==1))&&((p145==1)&...247
=> equivalent forward existential formula: [(EY((((FwdU(Init,TRUE) * !((EX((p32==0)) * ((((p6==0)||(p16==0))||((p49==0)||(p178==0)))||(p80==0))))) * !((!(E...328
Reverse transition relation is NOT exact ! Due to transitions t11, t17, t18, t25, t33, t36, t37, t38, t62, t63, t66, t67, t69, t82, t88, t89, t92, t93, t95...455
Detected timeout of ITS tools.
[2022-06-10 22:13:23] [INFO ] Flatten gal took : 12 ms
[2022-06-10 22:13:23] [INFO ] Applying decomposition
[2022-06-10 22:13:23] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6398879985369369702.txt' '-o' '/tmp/graph6398879985369369702.bin' '-w' '/tmp/graph6398879985369369702.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6398879985369369702.bin' '-l' '-1' '-v' '-w' '/tmp/graph6398879985369369702.weights' '-q' '0' '-e' '0.001'
[2022-06-10 22:13:23] [INFO ] Decomposing Gal with order
[2022-06-10 22:13:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 22:13:23] [INFO ] Removed a total of 246 redundant transitions.
[2022-06-10 22:13:23] [INFO ] Flatten gal took : 29 ms
[2022-06-10 22:13:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 6 ms.
[2022-06-10 22:13:23] [INFO ] Time to serialize gal into /tmp/CTLFireability2104077931349791092.gal : 5 ms
[2022-06-10 22:13:23] [INFO ] Time to serialize properties into /tmp/CTLFireability15417110519333035989.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2104077931349791092.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15417110519333035989.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.45023e+09,0.342898,15732,607,100,16221,1620,458,63003,80,8506,0


Converting to forward existential form...Done !
original formula: AG((((AG(((i7.i1.u34.p91==0)||(i2.u3.p10==0))) + AX((i4.i1.u24.p72==0))) + (AX(EG((((i2.u2.p6==1)&&(i2.u2.p15==1))&&((i2.u16.p49==1)&&(i2...367
=> equivalent forward existential formula: [(EY((((FwdU(Init,TRUE) * !((EX((i3.i3.u9.p32==0)) * ((((i2.u2.p6==0)||(i2.u2.p16==0))||((i2.u16.p49==0)||(i2.u2...448
Reverse transition relation is NOT exact ! Due to transitions t170, t172, t188, t232, t261, i0.u56.t33, i0.u56.t36, i0.u56.t37, i0.u56.t38, i2.t204, i2.t16...643
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,1,5.61995,138756,1,0,230024,3068,2957,705864,435,22701,272738
FORMULA AutonomousCar-PT-04b-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 350/350 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 189 transition count 336
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 189 transition count 336
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 92 place count 189 transition count 272
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 94 place count 187 transition count 270
Iterating global reduction 1 with 2 rules applied. Total rules applied 96 place count 187 transition count 270
Applied a total of 96 rules in 7 ms. Remains 187 /203 variables (removed 16) and now considering 270/350 (removed 80) transitions.
// Phase 1: matrix 270 rows 187 cols
[2022-06-10 22:13:28] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:13:28] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 270 rows 187 cols
[2022-06-10 22:13:29] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:13:29] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
// Phase 1: matrix 270 rows 187 cols
[2022-06-10 22:13:29] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:13:29] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 187/203 places, 270/350 transitions.
Finished structural reductions, in 1 iterations. Remains : 187/203 places, 270/350 transitions.
[2022-06-10 22:13:29] [INFO ] Flatten gal took : 11 ms
[2022-06-10 22:13:29] [INFO ] Flatten gal took : 12 ms
[2022-06-10 22:13:29] [INFO ] Input system was already deterministic with 270 transitions.
[2022-06-10 22:13:29] [INFO ] Flatten gal took : 17 ms
[2022-06-10 22:13:29] [INFO ] Flatten gal took : 19 ms
[2022-06-10 22:13:29] [INFO ] Time to serialize gal into /tmp/CTLFireability11310838014729291749.gal : 3 ms
[2022-06-10 22:13:29] [INFO ] Time to serialize properties into /tmp/CTLFireability16056794402648215409.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11310838014729291749.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16056794402648215409.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.87636e+09,10.8506,228520,2,14824,5,843490,6,0,1020,1.0651e+06,0


Converting to forward existential form...Done !
original formula: (!(A(EX((((p6==1)&&(p14==1))&&((p111==1)&&(p178==1)))) U !(AX(FALSE)))) * (E(((!(EX((p49==1))) + ((((p218!=1) + EF((((p6==1)&&(p16==1))&&...597
=> equivalent forward existential formula: ([((Init * !(EG(!(!(!(EX(!(FALSE)))))))) * !(E(!(!(!(EX(!(FALSE))))) U (!(EX((((p6==1)&&(p14==1))&&((p111==1)&&(...924
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t19, t27, t35, t38, t39, t40, t65, t66, t69, t71, t72, t73, t87, t93, t94, t97, t98...413
Detected timeout of ITS tools.
[2022-06-10 22:13:59] [INFO ] Flatten gal took : 10 ms
[2022-06-10 22:13:59] [INFO ] Applying decomposition
[2022-06-10 22:13:59] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1691193084797907205.txt' '-o' '/tmp/graph1691193084797907205.bin' '-w' '/tmp/graph1691193084797907205.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1691193084797907205.bin' '-l' '-1' '-v' '-w' '/tmp/graph1691193084797907205.weights' '-q' '0' '-e' '0.001'
[2022-06-10 22:13:59] [INFO ] Decomposing Gal with order
[2022-06-10 22:13:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 22:13:59] [INFO ] Removed a total of 242 redundant transitions.
[2022-06-10 22:13:59] [INFO ] Flatten gal took : 29 ms
[2022-06-10 22:13:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 5 ms.
[2022-06-10 22:13:59] [INFO ] Time to serialize gal into /tmp/CTLFireability12853585380365033626.gal : 4 ms
[2022-06-10 22:13:59] [INFO ] Time to serialize properties into /tmp/CTLFireability4897838630978256851.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12853585380365033626.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4897838630978256851.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.87636e+09,0.10254,7332,530,99,4757,616,498,6814,78,1706,0


Converting to forward existential form...Done !
original formula: (!(A(EX((((i1.u1.p6==1)&&(i1.u1.p14==1))&&((i8.u36.p111==1)&&(i1.u1.p178==1)))) U !(AX(FALSE)))) * (E(((!(EX((i4.u15.p49==1))) + ((((i0.i...922
=> equivalent forward existential formula: ([((Init * !(EG(!(!(!(EX(!(FALSE)))))))) * !(E(!(!(!(EX(!(FALSE))))) U (!(EX((((i1.u1.p6==1)&&(i1.u1.p14==1))&&(...1333
Reverse transition relation is NOT exact ! Due to transitions t175, t196, t240, t267, i1.t173, i2.u57.t35, i2.u57.t38, i2.u57.t39, i2.u57.t40, i3.i2.t166, ...671
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,16.5535,473208,1,0,989167,2997,3755,1.16186e+06,458,17123,1034944
FORMULA AutonomousCar-PT-04b-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 203/203 places, 350/350 transitions.
Graph (trivial) has 191 edges and 203 vertex of which 4 / 203 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 200 transition count 264
Reduce places removed 83 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 106 rules applied. Total rules applied 190 place count 117 transition count 241
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 14 rules applied. Total rules applied 204 place count 104 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 205 place count 103 transition count 240
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 205 place count 103 transition count 233
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 219 place count 96 transition count 233
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 230 place count 85 transition count 222
Iterating global reduction 4 with 11 rules applied. Total rules applied 241 place count 85 transition count 222
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 4 with 64 rules applied. Total rules applied 305 place count 85 transition count 158
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 305 place count 85 transition count 157
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 307 place count 84 transition count 157
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 310 place count 81 transition count 148
Iterating global reduction 5 with 3 rules applied. Total rules applied 313 place count 81 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 315 place count 81 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 316 place count 80 transition count 146
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 7 with 54 rules applied. Total rules applied 370 place count 53 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 371 place count 53 transition count 118
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 377 place count 47 transition count 90
Iterating global reduction 8 with 6 rules applied. Total rules applied 383 place count 47 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 4 rules applied. Total rules applied 387 place count 47 transition count 86
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 389 place count 45 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 391 place count 44 transition count 85
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 393 place count 44 transition count 83
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 1 rules applied. Total rules applied 394 place count 44 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 395 place count 43 transition count 82
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 397 place count 41 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 398 place count 40 transition count 80
Applied a total of 398 rules in 42 ms. Remains 40 /203 variables (removed 163) and now considering 80/350 (removed 270) transitions.
// Phase 1: matrix 80 rows 40 cols
[2022-06-10 22:14:16] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:14:16] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 80 rows 40 cols
[2022-06-10 22:14:16] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-10 22:14:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:14:16] [INFO ] Implicit Places using invariants and state equation in 86 ms returned [33, 39]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 149 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 38/203 places, 80/350 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 37 transition count 79
Applied a total of 2 rules in 7 ms. Remains 37 /38 variables (removed 1) and now considering 79/80 (removed 1) transitions.
// Phase 1: matrix 79 rows 37 cols
[2022-06-10 22:14:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:14:16] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 79 rows 37 cols
[2022-06-10 22:14:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:14:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:14:16] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 37/203 places, 79/350 transitions.
Finished structural reductions, in 2 iterations. Remains : 37/203 places, 79/350 transitions.
[2022-06-10 22:14:16] [INFO ] Flatten gal took : 4 ms
[2022-06-10 22:14:16] [INFO ] Flatten gal took : 4 ms
[2022-06-10 22:14:16] [INFO ] Input system was already deterministic with 79 transitions.
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
FORMULA AutonomousCar-PT-04b-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 350/350 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 184 transition count 331
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 184 transition count 331
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 102 place count 184 transition count 267
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 182 transition count 265
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 182 transition count 265
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 181 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 181 transition count 264
Applied a total of 108 rules in 9 ms. Remains 181 /203 variables (removed 22) and now considering 264/350 (removed 86) transitions.
// Phase 1: matrix 264 rows 181 cols
[2022-06-10 22:14:16] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 22:14:16] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 264 rows 181 cols
[2022-06-10 22:14:16] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 22:14:17] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
// Phase 1: matrix 264 rows 181 cols
[2022-06-10 22:14:17] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:14:17] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 181/203 places, 264/350 transitions.
Finished structural reductions, in 1 iterations. Remains : 181/203 places, 264/350 transitions.
[2022-06-10 22:14:17] [INFO ] Flatten gal took : 8 ms
[2022-06-10 22:14:17] [INFO ] Flatten gal took : 9 ms
[2022-06-10 22:14:17] [INFO ] Input system was already deterministic with 264 transitions.
[2022-06-10 22:14:17] [INFO ] Flatten gal took : 8 ms
[2022-06-10 22:14:17] [INFO ] Flatten gal took : 9 ms
[2022-06-10 22:14:17] [INFO ] Time to serialize gal into /tmp/CTLFireability16234192331931863254.gal : 2 ms
[2022-06-10 22:14:17] [INFO ] Time to serialize properties into /tmp/CTLFireability10205802361623407335.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16234192331931863254.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10205802361623407335.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.45023e+09,9.37304,209636,2,14967,5,798241,6,0,990,1.00924e+06,0


Converting to forward existential form...Done !
original formula: EF((AG((p83==1)) + (EF((p32==0)) * AX((p73==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((p83==1)))))] != FALSE + [((FwdU(Init,TRUE) * E(TRUE U (p32==0))) * !(EX(!((p7...175
Reverse transition relation is NOT exact ! Due to transitions t11, t17, t18, t25, t33, t36, t37, t38, t62, t63, t66, t67, t69, t82, t88, t89, t92, t93, t95...455
(forward)formula 0,1,25.7528,445856,1,0,469,2.29163e+06,551,251,7670,1.67393e+06,550
FORMULA AutonomousCar-PT-04b-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 203/203 places, 350/350 transitions.
Graph (trivial) has 190 edges and 203 vertex of which 4 / 203 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 200 transition count 262
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 111 rules applied. Total rules applied 197 place count 115 transition count 236
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 16 rules applied. Total rules applied 213 place count 100 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 214 place count 99 transition count 235
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 214 place count 99 transition count 229
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 226 place count 93 transition count 229
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 237 place count 82 transition count 218
Iterating global reduction 4 with 11 rules applied. Total rules applied 248 place count 82 transition count 218
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 4 with 64 rules applied. Total rules applied 312 place count 82 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 312 place count 82 transition count 153
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 314 place count 81 transition count 153
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 317 place count 78 transition count 144
Iterating global reduction 5 with 3 rules applied. Total rules applied 320 place count 78 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 323 place count 78 transition count 141
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 325 place count 77 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 326 place count 76 transition count 140
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 8 with 54 rules applied. Total rules applied 380 place count 49 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 381 place count 49 transition count 112
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 387 place count 43 transition count 84
Iterating global reduction 9 with 6 rules applied. Total rules applied 393 place count 43 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 9 with 4 rules applied. Total rules applied 397 place count 43 transition count 80
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 399 place count 41 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 401 place count 40 transition count 79
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 402 place count 40 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 404 place count 38 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 405 place count 37 transition count 76
Applied a total of 405 rules in 30 ms. Remains 37 /203 variables (removed 166) and now considering 76/350 (removed 274) transitions.
// Phase 1: matrix 76 rows 37 cols
[2022-06-10 22:14:43] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:14:43] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 76 rows 37 cols
[2022-06-10 22:14:43] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 22:14:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:14:43] [INFO ] Implicit Places using invariants and state equation in 73 ms returned [30, 36]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 119 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 35/203 places, 76/350 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 35 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 34 transition count 75
Applied a total of 2 rules in 3 ms. Remains 34 /35 variables (removed 1) and now considering 75/76 (removed 1) transitions.
// Phase 1: matrix 75 rows 34 cols
[2022-06-10 22:14:43] [INFO ] Computed 5 place invariants in 5 ms
[2022-06-10 22:14:43] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 75 rows 34 cols
[2022-06-10 22:14:43] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 22:14:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 22:14:43] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 34/203 places, 75/350 transitions.
Finished structural reductions, in 2 iterations. Remains : 34/203 places, 75/350 transitions.
[2022-06-10 22:14:43] [INFO ] Flatten gal took : 4 ms
[2022-06-10 22:14:43] [INFO ] Flatten gal took : 4 ms
[2022-06-10 22:14:43] [INFO ] Input system was already deterministic with 75 transitions.
[2022-06-10 22:14:43] [INFO ] Flatten gal took : 3 ms
[2022-06-10 22:14:43] [INFO ] Flatten gal took : 3 ms
[2022-06-10 22:14:43] [INFO ] Time to serialize gal into /tmp/CTLFireability3630570646850701426.gal : 1 ms
[2022-06-10 22:14:43] [INFO ] Time to serialize properties into /tmp/CTLFireability7988127992674949880.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3630570646850701426.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7988127992674949880.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
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,42108,0.115269,7232,2,501,5,9938,6,0,209,12605,0


Converting to forward existential form...Done !
original formula: EG(AF((p55==1)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((p55==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t4, t5, t6, t8, t10, t12, t14, t16, t18, t19, t20, t21, t22, t23, t25, t26, t27, t28,...294
(forward)formula 0,1,1.58727,45968,1,0,698,198430,175,335,2259,258238,658
FORMULA AutonomousCar-PT-04b-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 350/350 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 185 transition count 332
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 185 transition count 332
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 100 place count 185 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 102 place count 183 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 104 place count 183 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 182 transition count 265
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 182 transition count 265
Applied a total of 106 rules in 10 ms. Remains 182 /203 variables (removed 21) and now considering 265/350 (removed 85) transitions.
// Phase 1: matrix 265 rows 182 cols
[2022-06-10 22:14:45] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:14:45] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 265 rows 182 cols
[2022-06-10 22:14:45] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:14:45] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
// Phase 1: matrix 265 rows 182 cols
[2022-06-10 22:14:45] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 22:14:45] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 182/203 places, 265/350 transitions.
Finished structural reductions, in 1 iterations. Remains : 182/203 places, 265/350 transitions.
[2022-06-10 22:14:45] [INFO ] Flatten gal took : 13 ms
[2022-06-10 22:14:45] [INFO ] Flatten gal took : 14 ms
[2022-06-10 22:14:45] [INFO ] Input system was already deterministic with 265 transitions.
[2022-06-10 22:14:45] [INFO ] Flatten gal took : 14 ms
[2022-06-10 22:14:45] [INFO ] Flatten gal took : 14 ms
[2022-06-10 22:14:45] [INFO ] Time to serialize gal into /tmp/CTLFireability17072271210665853970.gal : 4 ms
[2022-06-10 22:14:45] [INFO ] Time to serialize properties into /tmp/CTLFireability7640089774485953991.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17072271210665853970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7640089774485953991.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.52282e+09,8.57343,190920,2,13948,5,696418,6,0,995,896468,0


Converting to forward existential form...Done !
original formula: EF((((p67==0) * ((AF((p57==1)) + (p215==0)) + ((((p6==1)&&(p16==1))&&((p145==1)&&(p178==1)))||((((p50==1)&&(p87==1))&&((p112==1)&&(p143==...277
=> equivalent forward existential formula: ([(EY((FwdU(Init,TRUE) * ((p67==0) * ((!(EG(!((p57==1)))) + (p215==0)) + ((((p6==1)&&(p16==1))&&((p145==1)&&(p17...529
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t19, t26, t34, t37, t38, t39, t63, t64, t67, t68, t70, t83, t89, t90, t93, t94, t96...449
Detected timeout of ITS tools.
[2022-06-10 22:15:15] [INFO ] Flatten gal took : 8 ms
[2022-06-10 22:15:15] [INFO ] Applying decomposition
[2022-06-10 22:15:15] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9896684508054603482.txt' '-o' '/tmp/graph9896684508054603482.bin' '-w' '/tmp/graph9896684508054603482.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9896684508054603482.bin' '-l' '-1' '-v' '-w' '/tmp/graph9896684508054603482.weights' '-q' '0' '-e' '0.001'
[2022-06-10 22:15:15] [INFO ] Decomposing Gal with order
[2022-06-10 22:15:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 22:15:15] [INFO ] Removed a total of 242 redundant transitions.
[2022-06-10 22:15:15] [INFO ] Flatten gal took : 22 ms
[2022-06-10 22:15:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 3 ms.
[2022-06-10 22:15:15] [INFO ] Time to serialize gal into /tmp/CTLFireability10182768405032205692.gal : 3 ms
[2022-06-10 22:15:15] [INFO ] Time to serialize properties into /tmp/CTLFireability196892270974216015.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10182768405032205692.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability196892270974216015.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.52282e+09,0.103306,7720,565,103,5576,542,463,8263,78,1791,0


Converting to forward existential form...Done !
original formula: EF((((i4.i0.u21.p67==0) * ((AF((i3.u18.p57==1)) + (i13.i2.u66.p215==0)) + ((((i0.u1.p6==1)&&(i0.u1.p16==1))&&((i8.u44.p145==1)&&(i0.u1.p1...422
=> equivalent forward existential formula: ([(EY((FwdU(Init,TRUE) * ((i4.i0.u21.p67==0) * ((!(EG(!((i3.u18.p57==1)))) + (i13.i2.u66.p215==0)) + ((((i0.u1.p...766
Reverse transition relation is NOT exact ! Due to transitions t171, t175, t195, t211, t235, t262, i0.t169, i3.t162, i3.t142, i3.u15.t146, i3.u15.t147, i3.u...623
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,1,7.61064,226048,1,0,489872,2490,2975,564750,419,12370,608827
FORMULA AutonomousCar-PT-04b-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 350/350 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 184 transition count 331
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 184 transition count 331
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 102 place count 184 transition count 267
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 105 place count 181 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 108 place count 181 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 180 transition count 263
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 180 transition count 263
Applied a total of 110 rules in 9 ms. Remains 180 /203 variables (removed 23) and now considering 263/350 (removed 87) transitions.
// Phase 1: matrix 263 rows 180 cols
[2022-06-10 22:15:23] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 22:15:23] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 263 rows 180 cols
[2022-06-10 22:15:23] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 22:15:23] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
// Phase 1: matrix 263 rows 180 cols
[2022-06-10 22:15:23] [INFO ] Computed 9 place invariants in 3 ms
[2022-06-10 22:15:24] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/203 places, 263/350 transitions.
Finished structural reductions, in 1 iterations. Remains : 180/203 places, 263/350 transitions.
[2022-06-10 22:15:24] [INFO ] Flatten gal took : 8 ms
[2022-06-10 22:15:24] [INFO ] Flatten gal took : 8 ms
[2022-06-10 22:15:24] [INFO ] Input system was already deterministic with 263 transitions.
[2022-06-10 22:15:24] [INFO ] Flatten gal took : 12 ms
[2022-06-10 22:15:24] [INFO ] Flatten gal took : 8 ms
[2022-06-10 22:15:24] [INFO ] Time to serialize gal into /tmp/CTLFireability6379504125982288775.gal : 2 ms
[2022-06-10 22:15:24] [INFO ] Time to serialize properties into /tmp/CTLFireability13436105747726059650.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6379504125982288775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13436105747726059650.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.45023e+09,11.2738,208152,2,14717,5,785898,6,0,985,1.01238e+06,0


Converting to forward existential form...Done !
original formula: EG((((p39==1) + AX(E((p117!=1) U (((p6==1)&&(p15==1))&&((p142==1)&&(p178==1)))))) + (((AF(((((p6==0)||(p14==0))||((p142==0)||(p178==0)))|...268
=> equivalent forward existential formula: [FwdG(Init,(((p39==1) + !(EX(!(E((p117!=1) U (((p6==1)&&(p15==1))&&((p142==1)&&(p178==1)))))))) + (((!(EG(!(((((...335
Reverse transition relation is NOT exact ! Due to transitions t11, t17, t18, t25, t33, t36, t37, t38, t62, t63, t66, t67, t69, t82, t88, t89, t92, t93, t95...449
Detected timeout of ITS tools.
[2022-06-10 22:15:54] [INFO ] Flatten gal took : 16 ms
[2022-06-10 22:15:54] [INFO ] Applying decomposition
[2022-06-10 22:15:54] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14205151906261163709.txt' '-o' '/tmp/graph14205151906261163709.bin' '-w' '/tmp/graph14205151906261163709.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14205151906261163709.bin' '-l' '-1' '-v' '-w' '/tmp/graph14205151906261163709.weights' '-q' '0' '-e' '0.001'
[2022-06-10 22:15:54] [INFO ] Decomposing Gal with order
[2022-06-10 22:15:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 22:15:54] [INFO ] Removed a total of 237 redundant transitions.
[2022-06-10 22:15:54] [INFO ] Flatten gal took : 72 ms
[2022-06-10 22:15:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 5 ms.
[2022-06-10 22:15:54] [INFO ] Time to serialize gal into /tmp/CTLFireability2433186282918957370.gal : 20 ms
[2022-06-10 22:15:54] [INFO ] Time to serialize properties into /tmp/CTLFireability4585439420757845623.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2433186282918957370.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4585439420757845623.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.45023e+09,0.079674,6676,415,101,3298,576,457,4690,82,1748,0


Converting to forward existential form...Done !
original formula: EG((((i2.i0.u13.p39==1) + AX(E((i5.u36.p117!=1) U (((i10.u1.p6==1)&&(i10.u1.p15==1))&&((i8.u43.p142==1)&&(i10.u1.p178==1)))))) + (((AF(((...410
=> equivalent forward existential formula: [FwdG(Init,(((i2.i0.u13.p39==1) + !(EX(!(E((i5.u36.p117!=1) U (((i10.u1.p6==1)&&(i10.u1.p15==1))&&((i8.u43.p142=...477
Reverse transition relation is NOT exact ! Due to transitions t169, t175, t191, t203, t227, t260, i1.i0.u15.t143, i1.i0.u15.t146, i1.i0.u16.t144, i1.i1.t16...618
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,0.626544,26328,1,0,48454,1676,2973,64257,434,5458,81089
FORMULA AutonomousCar-PT-04b-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 350/350 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 187 transition count 334
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 187 transition count 334
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 96 place count 187 transition count 270
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 98 place count 185 transition count 268
Iterating global reduction 1 with 2 rules applied. Total rules applied 100 place count 185 transition count 268
Applied a total of 100 rules in 6 ms. Remains 185 /203 variables (removed 18) and now considering 268/350 (removed 82) transitions.
// Phase 1: matrix 268 rows 185 cols
[2022-06-10 22:15:55] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:15:55] [INFO ] Implicit Places using invariants in 202 ms returned []
// Phase 1: matrix 268 rows 185 cols
[2022-06-10 22:15:55] [INFO ] Computed 9 place invariants in 4 ms
[2022-06-10 22:15:55] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
// Phase 1: matrix 268 rows 185 cols
[2022-06-10 22:15:55] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 22:15:55] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/203 places, 268/350 transitions.
Finished structural reductions, in 1 iterations. Remains : 185/203 places, 268/350 transitions.
[2022-06-10 22:15:55] [INFO ] Flatten gal took : 8 ms
[2022-06-10 22:15:55] [INFO ] Flatten gal took : 9 ms
[2022-06-10 22:15:55] [INFO ] Input system was already deterministic with 268 transitions.
[2022-06-10 22:15:55] [INFO ] Flatten gal took : 8 ms
[2022-06-10 22:15:55] [INFO ] Flatten gal took : 9 ms
[2022-06-10 22:15:55] [INFO ] Time to serialize gal into /tmp/CTLFireability5192030703514885956.gal : 2 ms
[2022-06-10 22:15:55] [INFO ] Time to serialize properties into /tmp/CTLFireability3168307301252370918.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5192030703514885956.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3168307301252370918.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.74683e+09,7.82005,179428,2,14965,5,710037,6,0,1010,833960,0


Converting to forward existential form...Done !
original formula: E((!(((((AF(((((p6==1)&&(p13==1))&&((p178==1)&&(p216==1)))||(p105==1))) + EX((p68!=1))) * (p50==1)) * ((p81==1)&&(p112==1))) * ((p149==1)...606
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(!(((((!(EG(!(((((p6==1)&&(p13==1))&&((p178==1)&&(p216==1)))||(p105==1))))) + EX((p68!=1))) * (...701
Reverse transition relation is NOT exact ! Due to transitions t11, t17, t18, t27, t35, t38, t39, t41, t65, t66, t69, t70, t72, t85, t91, t92, t95, t96, t98...455
Detected timeout of ITS tools.
[2022-06-10 22:16:26] [INFO ] Flatten gal took : 8 ms
[2022-06-10 22:16:26] [INFO ] Applying decomposition
[2022-06-10 22:16:26] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13769662112515066028.txt' '-o' '/tmp/graph13769662112515066028.bin' '-w' '/tmp/graph13769662112515066028.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13769662112515066028.bin' '-l' '-1' '-v' '-w' '/tmp/graph13769662112515066028.weights' '-q' '0' '-e' '0.001'
[2022-06-10 22:16:26] [INFO ] Decomposing Gal with order
[2022-06-10 22:16:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 22:16:26] [INFO ] Removed a total of 245 redundant transitions.
[2022-06-10 22:16:26] [INFO ] Flatten gal took : 22 ms
[2022-06-10 22:16:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 3 ms.
[2022-06-10 22:16:26] [INFO ] Time to serialize gal into /tmp/CTLFireability1478057632809112558.gal : 3 ms
[2022-06-10 22:16:26] [INFO ] Time to serialize properties into /tmp/CTLFireability8330993790833244000.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1478057632809112558.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8330993790833244000.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.74683e+09,0.227338,11684,595,102,12776,1557,457,27224,77,6384,0


Converting to forward existential form...Done !
original formula: E((!(((((AF(((((i4.u2.p6==1)&&(i4.u2.p13==1))&&((i4.u2.p178==1)&&(i12.i2.u70.p216==1)))||(i7.i1.u30.p105==1))) + EX((i3.u21.p68!=1))) * (...940
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(!(((((!(EG(!(((((i4.u2.p6==1)&&(i4.u2.p13==1))&&((i4.u2.p178==1)&&(i12.i2.u70.p216==1)))||(i7....1035
Reverse transition relation is NOT exact ! Due to transitions t173, t182, t210, t238, t265, i2.t164, i2.u10.t144, i2.u14.t148, i2.u14.t149, i2.u14.t151, i2...635
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an SCC at level 13
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 350/350 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 184 transition count 331
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 184 transition count 331
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 102 place count 184 transition count 267
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 105 place count 181 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 108 place count 181 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 180 transition count 263
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 180 transition count 263
Applied a total of 110 rules in 7 ms. Remains 180 /203 variables (removed 23) and now considering 263/350 (removed 87) transitions.
// Phase 1: matrix 263 rows 180 cols
[2022-06-10 22:16:56] [INFO ] Computed 9 place invariants in 1 ms
[2022-06-10 22:16:56] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 263 rows 180 cols
[2022-06-10 22:16:56] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:16:56] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
// Phase 1: matrix 263 rows 180 cols
[2022-06-10 22:16:56] [INFO ] Computed 9 place invariants in 2 ms
[2022-06-10 22:16:56] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/203 places, 263/350 transitions.
Finished structural reductions, in 1 iterations. Remains : 180/203 places, 263/350 transitions.
[2022-06-10 22:16:56] [INFO ] Flatten gal took : 11 ms
[2022-06-10 22:16:56] [INFO ] Flatten gal took : 8 ms
[2022-06-10 22:16:56] [INFO ] Input system was already deterministic with 263 transitions.
[2022-06-10 22:16:56] [INFO ] Flatten gal took : 13 ms
[2022-06-10 22:16:56] [INFO ] Flatten gal took : 13 ms
[2022-06-10 22:16:56] [INFO ] Time to serialize gal into /tmp/CTLFireability18413200699957945409.gal : 2 ms
[2022-06-10 22:16:56] [INFO ] Time to serialize properties into /tmp/CTLFireability12589343914524224508.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18413200699957945409.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12589343914524224508.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.52282e+09,9.5186,204484,2,14475,5,776671,6,0,985,971346,0


Converting to forward existential form...Done !
original formula: AG(EX(!(E((AX((p212==1)) * E((p11==1) U (((p6==1)&&(p9==1))&&((p76==1)&&(p178==1))))) U (p215==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(E((!(EX(!((p212==1)))) * E((p11==1) U (((p6==1)&&(p9==1))&&((p76==1)&&(p178==1))))) U...179
Reverse transition relation is NOT exact ! Due to transitions t11, t12, t19, t26, t34, t37, t38, t39, t63, t64, t67, t68, t70, t83, t89, t90, t93, t94, t96...449
(forward)formula 0,0,21.4044,323252,1,0,474,1.37834e+06,550,253,7551,1.18538e+06,551
FORMULA AutonomousCar-PT-04b-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2022-06-10 22:17:18] [INFO ] Flatten gal took : 12 ms
[2022-06-10 22:17:18] [INFO ] Flatten gal took : 11 ms
[2022-06-10 22:17:18] [INFO ] Applying decomposition
[2022-06-10 22:17:18] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14899688747586520399.txt' '-o' '/tmp/graph14899688747586520399.bin' '-w' '/tmp/graph14899688747586520399.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14899688747586520399.bin' '-l' '-1' '-v' '-w' '/tmp/graph14899688747586520399.weights' '-q' '0' '-e' '0.001'
[2022-06-10 22:17:18] [INFO ] Decomposing Gal with order
[2022-06-10 22:17:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 22:17:18] [INFO ] Removed a total of 408 redundant transitions.
[2022-06-10 22:17:18] [INFO ] Flatten gal took : 33 ms
[2022-06-10 22:17:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 4 ms.
[2022-06-10 22:17:18] [INFO ] Time to serialize gal into /tmp/CTLFireability12762261723501478390.gal : 5 ms
[2022-06-10 22:17:18] [INFO ] Time to serialize properties into /tmp/CTLFireability14234527492033258229.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12762261723501478390.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14234527492033258229.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
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,3.57083e+09,0.172901,10020,687,83,7929,1518,511,21164,85,6728,0


Converting to forward existential form...Done !
original formula: E((!(((((AF(((((i11.u63.p6==1)&&(i11.u63.p13==1))&&((i11.u63.p178==1)&&(i13.i1.i1.u78.p216==1)))||(i5.i0.i0.u37.p105==1))) + EX((i4.u20.p...956
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(!(((((!(EG(!(((((i11.u63.p6==1)&&(i11.u63.p13==1))&&((i11.u63.p178==1)&&(i13.i1.i1.u78.p216==1...1051
Reverse transition relation is NOT exact ! Due to transitions t93, t188, t190, t317, t347, i2.u13.t164, i2.u13.t165, i2.u14.t162, i2.u14.t166, i3.t181, i3....694
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 5
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an SCC at level 13
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 5
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,1,74.7243,1010948,1,0,1.72604e+06,9913,4427,4.58279e+06,531,176664,1635865
FORMULA AutonomousCar-PT-04b-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 405717 ms.

BK_STOP 1654899513524

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-04b"
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-4028"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-04b, 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 r294-smll-165463873000466"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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