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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 9.0K Jun 7 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Jun 7 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 7 15:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 7 15:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 3 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 3 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 3 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 3 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 15K Jun 7 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 175K Jun 7 15:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 7 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Jun 7 15:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:18 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 31K 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-01b-CTLFireability-00
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-01
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-02
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-03
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-04
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-05
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-06
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-07
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-08
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-09
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-10
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-11
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-12
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-13
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-14
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1654897937084

Running Version 202205111006
[2022-06-10 21:52:19] [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 21:52:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 21:52:19] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2022-06-10 21:52:19] [INFO ] Transformed 119 places.
[2022-06-10 21:52:19] [INFO ] Transformed 132 transitions.
[2022-06-10 21:52:19] [INFO ] Found NUPN structural information;
[2022-06-10 21:52:19] [INFO ] Parsed PT model containing 119 places and 132 transitions in 337 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 ms.
Support contains 72 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 132/132 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 114 transition count 127
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 114 transition count 127
Applied a total of 10 rules in 33 ms. Remains 114 /119 variables (removed 5) and now considering 127/132 (removed 5) transitions.
// Phase 1: matrix 127 rows 114 cols
[2022-06-10 21:52:19] [INFO ] Computed 6 place invariants in 22 ms
[2022-06-10 21:52:20] [INFO ] Implicit Places using invariants in 246 ms returned []
// Phase 1: matrix 127 rows 114 cols
[2022-06-10 21:52:20] [INFO ] Computed 6 place invariants in 6 ms
[2022-06-10 21:52:20] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
// Phase 1: matrix 127 rows 114 cols
[2022-06-10 21:52:20] [INFO ] Computed 6 place invariants in 6 ms
[2022-06-10 21:52:20] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 114/119 places, 127/132 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/119 places, 127/132 transitions.
Support contains 72 out of 114 places after structural reductions.
[2022-06-10 21:52:20] [INFO ] Flatten gal took : 119 ms
[2022-06-10 21:52:20] [INFO ] Flatten gal took : 21 ms
[2022-06-10 21:52:20] [INFO ] Input system was already deterministic with 127 transitions.
Support contains 71 out of 114 places (down from 72) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 979 ms. (steps per millisecond=10 ) properties (out of 72) seen :31
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 41) seen :14
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 27) seen :15
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 12) 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 12) seen :7
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 127 rows 114 cols
[2022-06-10 21:52:22] [INFO ] Computed 6 place invariants in 5 ms
[2022-06-10 21:52:22] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-06-10 21:52:22] [INFO ] After 96ms SMT Verify possible using state equation in real domain returned unsat :3 sat :2
[2022-06-10 21:52:22] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 7 ms to minimize.
[2022-06-10 21:52:22] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2022-06-10 21:52:22] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2022-06-10 21:52:22] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
[2022-06-10 21:52:22] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2022-06-10 21:52:22] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 0 ms to minimize.
[2022-06-10 21:52:23] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2022-06-10 21:52:23] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2022-06-10 21:52:23] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2022-06-10 21:52:23] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2022-06-10 21:52:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 905 ms
[2022-06-10 21:52:23] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2022-06-10 21:52:23] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2022-06-10 21:52:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 141 ms
[2022-06-10 21:52:23] [INFO ] After 1165ms SMT Verify possible using trap constraints in real domain returned unsat :4 sat :0 real:1
[2022-06-10 21:52:23] [INFO ] After 1291ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:1
[2022-06-10 21:52:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2022-06-10 21:52:23] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :1
[2022-06-10 21:52:23] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2022-06-10 21:52:23] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2022-06-10 21:52:23] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2022-06-10 21:52:23] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2022-06-10 21:52:23] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 0 ms to minimize.
[2022-06-10 21:52:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 344 ms
[2022-06-10 21:52:23] [INFO ] After 427ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-06-10 21:52:23] [INFO ] After 510ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :1
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 114 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 114/114 places, 127/127 transitions.
Graph (trivial) has 99 edges and 114 vertex of which 4 / 114 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 196 edges and 112 vertex of which 105 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 105 transition count 70
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 58 rules applied. Total rules applied 108 place count 59 transition count 58
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 116 place count 53 transition count 56
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 118 place count 51 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 118 place count 51 transition count 53
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 124 place count 48 transition count 53
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 129 place count 43 transition count 48
Iterating global reduction 4 with 5 rules applied. Total rules applied 134 place count 43 transition count 48
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 139 place count 43 transition count 43
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 139 place count 43 transition count 40
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 145 place count 40 transition count 40
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 146 place count 39 transition count 39
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 39 transition count 39
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 149 place count 39 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 150 place count 38 transition count 37
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 176 place count 25 transition count 24
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 178 place count 23 transition count 21
Iterating global reduction 7 with 2 rules applied. Total rules applied 180 place count 23 transition count 21
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 183 place count 23 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 184 place count 22 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 185 place count 21 transition count 20
Applied a total of 185 rules in 47 ms. Remains 21 /114 variables (removed 93) and now considering 20/127 (removed 107) transitions.
Finished structural reductions, in 1 iterations. Remains : 21/114 places, 20/127 transitions.
Incomplete random walk after 10000 steps, including 720 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Probably explored full state space saw : 95 states, properties seen :0
Probabilistic random walk after 265 steps, saw 95 distinct states, run finished after 18 ms. (steps per millisecond=14 ) properties seen :0
Explored full state space saw : 95 states, properties seen :0
Exhaustive walk after 265 steps, saw 95 distinct states, run finished after 3 ms. (steps per millisecond=88 ) properties seen :0
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2022-06-10 21:52:24] [INFO ] Flatten gal took : 15 ms
[2022-06-10 21:52:24] [INFO ] Flatten gal took : 14 ms
[2022-06-10 21:52:24] [INFO ] Input system was already deterministic with 127 transitions.
Support contains 61 out of 114 places (down from 63) after GAL structural reductions.
Computed a total of 28 stabilizing places and 29 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 127/127 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 106 transition count 119
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 106 transition count 119
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 104 transition count 117
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 104 transition count 117
Applied a total of 20 rules in 25 ms. Remains 104 /114 variables (removed 10) and now considering 117/127 (removed 10) transitions.
// Phase 1: matrix 117 rows 104 cols
[2022-06-10 21:52:24] [INFO ] Computed 6 place invariants in 2 ms
[2022-06-10 21:52:24] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 117 rows 104 cols
[2022-06-10 21:52:24] [INFO ] Computed 6 place invariants in 2 ms
[2022-06-10 21:52:24] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
// Phase 1: matrix 117 rows 104 cols
[2022-06-10 21:52:24] [INFO ] Computed 6 place invariants in 2 ms
[2022-06-10 21:52:24] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 104/114 places, 117/127 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/114 places, 117/127 transitions.
[2022-06-10 21:52:24] [INFO ] Flatten gal took : 16 ms
[2022-06-10 21:52:24] [INFO ] Flatten gal took : 15 ms
[2022-06-10 21:52:24] [INFO ] Input system was already deterministic with 117 transitions.
[2022-06-10 21:52:24] [INFO ] Flatten gal took : 10 ms
[2022-06-10 21:52:24] [INFO ] Flatten gal took : 10 ms
[2022-06-10 21:52:24] [INFO ] Time to serialize gal into /tmp/CTLFireability7026025620447899308.gal : 4 ms
[2022-06-10 21:52:24] [INFO ] Time to serialize properties into /tmp/CTLFireability820380264256990289.ctl : 2 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/CTLFireability7026025620447899308.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability820380264256990289.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,84306,0.063826,5948,2,1141,5,4658,6,0,535,3848,0


Converting to forward existential form...Done !
original formula: !(E(!(((AG((p85==1)) + AG((((p6==1)&&(p9==1))&&((p37==1)&&(p76==1))))) * (p96==1))) U ((((EG((((p108==1)||(p78==1))&&(p41==1))) + !(EG((p...363
=> equivalent forward existential formula: [(((((FwdU(Init,!(((!(E(TRUE U !((p85==1)))) + !(E(TRUE U !((((p6==1)&&(p9==1))&&((p37==1)&&(p76==1))))))) * (p9...563
Reverse transition relation is NOT exact ! Due to transitions t11, t18, t19, t27, t38, t42, t43, t58, t64, t65, t68, t69, t71, t85, t92, t94, t96, t103, t1...264
(forward)formula 0,0,4.77885,128360,1,0,971,828893,286,444,3456,743869,1160
FORMULA AutonomousCar-PT-01b-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 127/127 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 100 transition count 113
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 100 transition count 113
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 100 transition count 109
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 96 transition count 105
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 95 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 95 transition count 104
Applied a total of 42 rules in 20 ms. Remains 95 /114 variables (removed 19) and now considering 104/127 (removed 23) transitions.
// Phase 1: matrix 104 rows 95 cols
[2022-06-10 21:52:29] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:52:29] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 104 rows 95 cols
[2022-06-10 21:52:29] [INFO ] Computed 6 place invariants in 2 ms
[2022-06-10 21:52:29] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
// Phase 1: matrix 104 rows 95 cols
[2022-06-10 21:52:29] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:52:29] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 95/114 places, 104/127 transitions.
Finished structural reductions, in 1 iterations. Remains : 95/114 places, 104/127 transitions.
[2022-06-10 21:52:29] [INFO ] Flatten gal took : 9 ms
[2022-06-10 21:52:29] [INFO ] Flatten gal took : 9 ms
[2022-06-10 21:52:29] [INFO ] Input system was already deterministic with 104 transitions.
[2022-06-10 21:52:29] [INFO ] Flatten gal took : 8 ms
[2022-06-10 21:52:29] [INFO ] Flatten gal took : 8 ms
[2022-06-10 21:52:29] [INFO ] Time to serialize gal into /tmp/CTLFireability3121045872536672523.gal : 2 ms
[2022-06-10 21:52:29] [INFO ] Time to serialize properties into /tmp/CTLFireability11943574524507791957.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/CTLFireability3121045872536672523.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11943574524507791957.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,65988,0.04767,5560,2,1049,5,4399,6,0,486,3639,0


Converting to forward existential form...Done !
original formula: (AX(EG((EG((p74==0)) * (p34==1)))) + AG((AX(EG((p34==0))) * ((p49==1) + ((p104==1) * EF((p27==0)))))))
=> equivalent forward existential formula: ([(EY(FwdU((Init * !(!(EX(!(EG((EG((p74==0)) * (p34==1)))))))),TRUE)) * !(EG((p34==0))))] = FALSE * ([((FwdU((In...368
Reverse transition relation is NOT exact ! Due to transitions t11, t17, t18, t25, t33, t36, t37, t38, t58, t59, t62, t63, t65, t78, t85, t87, t92, t101, I...252
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,4.35811,102860,1,0,897,652856,246,422,3142,592995,1015
FORMULA AutonomousCar-PT-01b-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 127/127 transitions.
Graph (trivial) has 105 edges and 114 vertex of which 2 / 114 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 112 transition count 69
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 68 rules applied. Total rules applied 125 place count 56 transition count 57
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 131 place count 50 transition count 57
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 131 place count 50 transition count 53
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 139 place count 46 transition count 53
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 144 place count 41 transition count 48
Iterating global reduction 3 with 5 rules applied. Total rules applied 149 place count 41 transition count 48
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 153 place count 41 transition count 44
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 153 place count 41 transition count 42
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 157 place count 39 transition count 42
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 158 place count 38 transition count 41
Iterating global reduction 4 with 1 rules applied. Total rules applied 159 place count 38 transition count 41
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 4 with 2 rules applied. Total rules applied 161 place count 38 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 162 place count 37 transition count 39
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 184 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 186 place count 24 transition count 25
Iterating global reduction 6 with 2 rules applied. Total rules applied 188 place count 24 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 189 place count 24 transition count 24
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 191 place count 22 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 192 place count 21 transition count 22
Applied a total of 192 rules in 41 ms. Remains 21 /114 variables (removed 93) and now considering 22/127 (removed 105) transitions.
// Phase 1: matrix 22 rows 21 cols
[2022-06-10 21:52:34] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 21:52:34] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 22 rows 21 cols
[2022-06-10 21:52:34] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 21:52:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:52:34] [INFO ] Implicit Places using invariants and state equation in 51 ms returned [12, 20]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 84 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 19/114 places, 22/127 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 19 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 18 transition count 21
Applied a total of 2 rules in 3 ms. Remains 18 /19 variables (removed 1) and now considering 21/22 (removed 1) transitions.
// Phase 1: matrix 21 rows 18 cols
[2022-06-10 21:52:34] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:52:34] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 21 rows 18 cols
[2022-06-10 21:52:34] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 21:52:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:52:34] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 18/114 places, 21/127 transitions.
Finished structural reductions, in 2 iterations. Remains : 18/114 places, 21/127 transitions.
[2022-06-10 21:52:34] [INFO ] Flatten gal took : 5 ms
[2022-06-10 21:52:34] [INFO ] Flatten gal took : 2 ms
[2022-06-10 21:52:34] [INFO ] Input system was already deterministic with 21 transitions.
Finished random walk after 101 steps, including 13 resets, run visited all 1 properties in 2 ms. (steps per millisecond=50 )
FORMULA AutonomousCar-PT-01b-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 127/127 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 100 transition count 113
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 100 transition count 113
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 100 transition count 109
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 96 transition count 105
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 95 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 95 transition count 104
Applied a total of 42 rules in 7 ms. Remains 95 /114 variables (removed 19) and now considering 104/127 (removed 23) transitions.
// Phase 1: matrix 104 rows 95 cols
[2022-06-10 21:52:34] [INFO ] Computed 6 place invariants in 2 ms
[2022-06-10 21:52:34] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 104 rows 95 cols
[2022-06-10 21:52:34] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:52:34] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
// Phase 1: matrix 104 rows 95 cols
[2022-06-10 21:52:34] [INFO ] Computed 6 place invariants in 2 ms
[2022-06-10 21:52:34] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 95/114 places, 104/127 transitions.
Finished structural reductions, in 1 iterations. Remains : 95/114 places, 104/127 transitions.
[2022-06-10 21:52:34] [INFO ] Flatten gal took : 6 ms
[2022-06-10 21:52:34] [INFO ] Flatten gal took : 7 ms
[2022-06-10 21:52:34] [INFO ] Input system was already deterministic with 104 transitions.
[2022-06-10 21:52:34] [INFO ] Flatten gal took : 7 ms
[2022-06-10 21:52:34] [INFO ] Flatten gal took : 7 ms
[2022-06-10 21:52:34] [INFO ] Time to serialize gal into /tmp/CTLFireability15297919620884328205.gal : 1 ms
[2022-06-10 21:52:34] [INFO ] Time to serialize properties into /tmp/CTLFireability16163743482251891471.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/CTLFireability15297919620884328205.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16163743482251891471.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,65988,0.044193,5584,2,1049,5,4399,6,0,486,3639,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.047449,5584,1,0,6,4399,7,1,587,3639,1
FORMULA AutonomousCar-PT-01b-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 127/127 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 104 transition count 117
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 104 transition count 117
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 104 transition count 113
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 101 transition count 110
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 101 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 100 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 100 transition count 109
Applied a total of 32 rules in 6 ms. Remains 100 /114 variables (removed 14) and now considering 109/127 (removed 18) transitions.
// Phase 1: matrix 109 rows 100 cols
[2022-06-10 21:52:34] [INFO ] Computed 6 place invariants in 0 ms
[2022-06-10 21:52:35] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 109 rows 100 cols
[2022-06-10 21:52:35] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:52:35] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
// Phase 1: matrix 109 rows 100 cols
[2022-06-10 21:52:35] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:52:35] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/114 places, 109/127 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/114 places, 109/127 transitions.
[2022-06-10 21:52:35] [INFO ] Flatten gal took : 7 ms
[2022-06-10 21:52:35] [INFO ] Flatten gal took : 7 ms
[2022-06-10 21:52:35] [INFO ] Input system was already deterministic with 109 transitions.
[2022-06-10 21:52:35] [INFO ] Flatten gal took : 7 ms
[2022-06-10 21:52:35] [INFO ] Flatten gal took : 7 ms
[2022-06-10 21:52:35] [INFO ] Time to serialize gal into /tmp/CTLFireability10376384284953117943.gal : 1 ms
[2022-06-10 21:52:35] [INFO ] Time to serialize properties into /tmp/CTLFireability126276630141618801.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/CTLFireability10376384284953117943.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability126276630141618801.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,71666,0.048364,5748,2,1169,5,5066,6,0,511,4124,0


Converting to forward existential form...Done !
original formula: (E(((p71==1)||(p68==1)) U AF(((EG((p8==1)) + ((p82==1)&&(p26!=1))) + (p49==1)))) * (AX(EF((((p6==1)&&(p9==1))&&((p33==1)&&(p76==1))))) + ...227
=> equivalent forward existential formula: ([(Init * !(E(((p71==1)||(p68==1)) U !(EG(!(((EG((p8==1)) + ((p82==1)&&(p26!=1))) + (p49==1))))))))] = FALSE * [...317
Reverse transition relation is NOT exact ! Due to transitions t11, t17, t18, t25, t34, t40, t41, t61, t62, t65, t66, t68, t71, t83, t90, t92, t97, t106, I...252
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,7.16714,153656,1,0,1117,1.03856e+06,271,626,3141,873436,1192
FORMULA AutonomousCar-PT-01b-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 127/127 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 101 transition count 114
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 101 transition count 114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 101 transition count 110
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 97 transition count 106
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 97 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 96 transition count 105
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 96 transition count 105
Applied a total of 40 rules in 8 ms. Remains 96 /114 variables (removed 18) and now considering 105/127 (removed 22) transitions.
// Phase 1: matrix 105 rows 96 cols
[2022-06-10 21:52:42] [INFO ] Computed 6 place invariants in 0 ms
[2022-06-10 21:52:42] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 105 rows 96 cols
[2022-06-10 21:52:42] [INFO ] Computed 6 place invariants in 0 ms
[2022-06-10 21:52:42] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
// Phase 1: matrix 105 rows 96 cols
[2022-06-10 21:52:42] [INFO ] Computed 6 place invariants in 2 ms
[2022-06-10 21:52:42] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/114 places, 105/127 transitions.
Finished structural reductions, in 1 iterations. Remains : 96/114 places, 105/127 transitions.
[2022-06-10 21:52:42] [INFO ] Flatten gal took : 7 ms
[2022-06-10 21:52:42] [INFO ] Flatten gal took : 6 ms
[2022-06-10 21:52:42] [INFO ] Input system was already deterministic with 105 transitions.
[2022-06-10 21:52:42] [INFO ] Flatten gal took : 6 ms
[2022-06-10 21:52:42] [INFO ] Flatten gal took : 11 ms
[2022-06-10 21:52:42] [INFO ] Time to serialize gal into /tmp/CTLFireability9707606045099617103.gal : 2 ms
[2022-06-10 21:52:42] [INFO ] Time to serialize properties into /tmp/CTLFireability7889296662574116549.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/CTLFireability9707606045099617103.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7889296662574116549.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,66852,0.047358,5992,2,1069,5,4749,6,0,491,3774,0


Converting to forward existential form...Done !
original formula: (AF((p73==1)) + AG(EX(AG((p91==1)))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(EG(!((p73==1)))))),TRUE) * !(EX(!(E(TRUE U !((p91==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t17, t18, t25, t33, t37, t38, t39, t59, t60, t63, t64, t66, t79, t86, t88, t93, t102, I...252
(forward)formula 0,0,3.68352,97068,1,0,801,610104,239,358,3037,550876,914
FORMULA AutonomousCar-PT-01b-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 127/127 transitions.
Graph (trivial) has 103 edges and 114 vertex of which 4 / 114 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 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 111 transition count 69
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 67 rules applied. Total rules applied 123 place count 56 transition count 57
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 129 place count 50 transition count 57
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 129 place count 50 transition count 52
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 139 place count 45 transition count 52
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 145 place count 39 transition count 46
Iterating global reduction 3 with 6 rules applied. Total rules applied 151 place count 39 transition count 46
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 155 place count 39 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 155 place count 39 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 157 place count 38 transition count 41
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 158 place count 37 transition count 40
Iterating global reduction 4 with 1 rules applied. Total rules applied 159 place count 37 transition count 40
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 4 with 2 rules applied. Total rules applied 161 place count 37 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 162 place count 36 transition count 38
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 182 place count 26 transition count 28
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 183 place count 25 transition count 27
Iterating global reduction 6 with 1 rules applied. Total rules applied 184 place count 25 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 185 place count 25 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 186 place count 24 transition count 25
Applied a total of 186 rules in 17 ms. Remains 24 /114 variables (removed 90) and now considering 25/127 (removed 102) transitions.
// Phase 1: matrix 25 rows 24 cols
[2022-06-10 21:52:46] [INFO ] Computed 5 place invariants in 0 ms
[2022-06-10 21:52:46] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 25 rows 24 cols
[2022-06-10 21:52:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 21:52:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:52:46] [INFO ] Implicit Places using invariants and state equation in 39 ms returned [17, 23]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 73 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 22/114 places, 25/127 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 22 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 21 transition count 24
Applied a total of 2 rules in 2 ms. Remains 21 /22 variables (removed 1) and now considering 24/25 (removed 1) transitions.
// Phase 1: matrix 24 rows 21 cols
[2022-06-10 21:52:46] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-10 21:52:46] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 24 rows 21 cols
[2022-06-10 21:52:46] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:52:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:52:46] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 21/114 places, 24/127 transitions.
Finished structural reductions, in 2 iterations. Remains : 21/114 places, 24/127 transitions.
[2022-06-10 21:52:46] [INFO ] Flatten gal took : 2 ms
[2022-06-10 21:52:46] [INFO ] Flatten gal took : 2 ms
[2022-06-10 21:52:46] [INFO ] Input system was already deterministic with 24 transitions.
[2022-06-10 21:52:46] [INFO ] Flatten gal took : 3 ms
[2022-06-10 21:52:46] [INFO ] Flatten gal took : 2 ms
[2022-06-10 21:52:46] [INFO ] Time to serialize gal into /tmp/CTLFireability5569726347291716122.gal : 0 ms
[2022-06-10 21:52:46] [INFO ] Time to serialize properties into /tmp/CTLFireability15682104427839428876.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/CTLFireability5569726347291716122.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15682104427839428876.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,472,0.008145,4476,2,131,5,613,6,0,105,656,0


Converting to forward existential form...Done !
original formula: EG(EF((((p6==1)&&(p9==1))&&((p37==1)&&(p76==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((p6==1)&&(p9==1))&&((p37==1)&&(p76==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t5, t6, t8, t12, t14, t17, t19, t20, Intersection with reachable at each ste...213
(forward)formula 0,1,0.054047,6292,1,0,168,9096,73,86,680,11756,148
FORMULA AutonomousCar-PT-01b-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 127/127 transitions.
Graph (trivial) has 105 edges and 114 vertex of which 4 / 114 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 111 transition count 70
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 65 rules applied. Total rules applied 120 place count 57 transition count 59
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 128 place count 51 transition count 57
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 131 place count 49 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 131 place count 49 transition count 53
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 137 place count 46 transition count 53
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 143 place count 40 transition count 47
Iterating global reduction 4 with 6 rules applied. Total rules applied 149 place count 40 transition count 47
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 153 place count 40 transition count 43
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 153 place count 40 transition count 41
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 157 place count 38 transition count 41
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 158 place count 37 transition count 40
Iterating global reduction 5 with 1 rules applied. Total rules applied 159 place count 37 transition count 40
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 161 place count 37 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 162 place count 36 transition count 38
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 184 place count 25 transition count 27
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 186 place count 23 transition count 24
Iterating global reduction 7 with 2 rules applied. Total rules applied 188 place count 23 transition count 24
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 189 place count 23 transition count 23
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 191 place count 21 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 192 place count 20 transition count 21
Applied a total of 192 rules in 15 ms. Remains 20 /114 variables (removed 94) and now considering 21/127 (removed 106) transitions.
// Phase 1: matrix 21 rows 20 cols
[2022-06-10 21:52:46] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-10 21:52:46] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 21 rows 20 cols
[2022-06-10 21:52:46] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-10 21:52:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:52:46] [INFO ] Implicit Places using invariants and state equation in 49 ms returned [12, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 75 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 18/114 places, 21/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 18/114 places, 21/127 transitions.
[2022-06-10 21:52:46] [INFO ] Flatten gal took : 1 ms
[2022-06-10 21:52:46] [INFO ] Flatten gal took : 2 ms
[2022-06-10 21:52:46] [INFO ] Input system was already deterministic with 21 transitions.
[2022-06-10 21:52:46] [INFO ] Flatten gal took : 2 ms
[2022-06-10 21:52:46] [INFO ] Flatten gal took : 2 ms
[2022-06-10 21:52:46] [INFO ] Time to serialize gal into /tmp/CTLFireability3721388033139891028.gal : 1 ms
[2022-06-10 21:52:46] [INFO ] Time to serialize properties into /tmp/CTLFireability16772438553858367325.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/CTLFireability3721388033139891028.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16772438553858367325.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,147,0.005414,4508,2,60,5,234,6,0,91,210,0


Converting to forward existential form...Done !
original formula: AF(AG((p91!=1)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((p91!=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t4, t6, t8, t13, t14, t15, Intersection with reachable at each step enabled. (destro...194
(forward)formula 0,0,0.024952,5272,1,0,125,3897,68,69,565,4624,115
FORMULA AutonomousCar-PT-01b-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 127/127 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 105 transition count 118
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 105 transition count 118
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 105 transition count 114
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 103 transition count 112
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 103 transition count 112
Applied a total of 26 rules in 6 ms. Remains 103 /114 variables (removed 11) and now considering 112/127 (removed 15) transitions.
// Phase 1: matrix 112 rows 103 cols
[2022-06-10 21:52:46] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:52:47] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 112 rows 103 cols
[2022-06-10 21:52:47] [INFO ] Computed 6 place invariants in 2 ms
[2022-06-10 21:52:47] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
// Phase 1: matrix 112 rows 103 cols
[2022-06-10 21:52:47] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:52:47] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 103/114 places, 112/127 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/114 places, 112/127 transitions.
[2022-06-10 21:52:47] [INFO ] Flatten gal took : 7 ms
[2022-06-10 21:52:47] [INFO ] Flatten gal took : 7 ms
[2022-06-10 21:52:47] [INFO ] Input system was already deterministic with 112 transitions.
[2022-06-10 21:52:47] [INFO ] Flatten gal took : 7 ms
[2022-06-10 21:52:47] [INFO ] Flatten gal took : 6 ms
[2022-06-10 21:52:47] [INFO ] Time to serialize gal into /tmp/CTLFireability10667714793707610090.gal : 1 ms
[2022-06-10 21:52:47] [INFO ] Time to serialize properties into /tmp/CTLFireability673865806773963796.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/CTLFireability10667714793707610090.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability673865806773963796.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,76814,0.050881,5628,2,1083,5,4809,6,0,526,3717,0


Converting to forward existential form...Done !
original formula: A(((p98==1) * (AX(((((p68==1)||(p90==1)) * AG((p18==1))) + AX((p19==1)))) + (EF((p28==1)) * EG(AG((p91==1)))))) U (EG(AF((p107==1))) * EG...217
=> equivalent forward existential formula: [((Init * !(EG(!((EG(!(EG(!((p107==1))))) * EG(!((E(!((!(EG(!((p91==1)))) + E((p73==1) U (p109==1)))) U (!(EX((p...903
Reverse transition relation is NOT exact ! Due to transitions t11, t17, t18, t27, t35, t39, t41, t42, t56, t63, t64, t67, t68, t70, t73, t85, t92, t94, t99...256
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
(forward)formula 0,0,5.60236,160212,1,0,1430,1.09612e+06,277,784,3219,871826,1565
FORMULA AutonomousCar-PT-01b-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 127/127 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 103 transition count 116
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 103 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 103 transition count 112
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 99 transition count 108
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 99 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 98 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 98 transition count 107
Applied a total of 36 rules in 6 ms. Remains 98 /114 variables (removed 16) and now considering 107/127 (removed 20) transitions.
// Phase 1: matrix 107 rows 98 cols
[2022-06-10 21:52:52] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:52:53] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 107 rows 98 cols
[2022-06-10 21:52:53] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:52:53] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
// Phase 1: matrix 107 rows 98 cols
[2022-06-10 21:52:53] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:52:53] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/114 places, 107/127 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/114 places, 107/127 transitions.
[2022-06-10 21:52:53] [INFO ] Flatten gal took : 8 ms
[2022-06-10 21:52:53] [INFO ] Flatten gal took : 8 ms
[2022-06-10 21:52:53] [INFO ] Input system was already deterministic with 107 transitions.
[2022-06-10 21:52:53] [INFO ] Flatten gal took : 8 ms
[2022-06-10 21:52:53] [INFO ] Flatten gal took : 8 ms
[2022-06-10 21:52:53] [INFO ] Time to serialize gal into /tmp/CTLFireability8349163546768731123.gal : 7 ms
[2022-06-10 21:52:53] [INFO ] Time to serialize properties into /tmp/CTLFireability3247956629447077287.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/CTLFireability8349163546768731123.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3247956629447077287.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,69012,0.07105,5952,2,1083,5,4879,6,0,501,3865,0


Converting to forward existential form...Done !
original formula: (EG(EF((p26==1))) * !(E(((p43==1) + (E((p69==1) U (p32==1)) * EX((p68==1)))) U AG(((((p111==1)||(p104==1)) * EX((p73==1))) * A((p15==1) U...170
=> equivalent forward existential formula: ([(Init * !(EG(E(TRUE U (p26==1)))))] = FALSE * [(FwdU(Init,((p43==1) + (E((p69==1) U (p32==1)) * EX((p68==1))))...297
Reverse transition relation is NOT exact ! Due to transitions t11, t17, t18, t25, t33, t37, t38, t40, t60, t61, t64, t65, t67, t70, t81, t88, t90, t95, t10...257
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,5.17519,129288,1,0,944,866173,253,470,3065,718536,1141
FORMULA AutonomousCar-PT-01b-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 127/127 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 100 transition count 113
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 100 transition count 113
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 100 transition count 109
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 97 transition count 106
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 97 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 96 transition count 105
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 96 transition count 105
Applied a total of 40 rules in 4 ms. Remains 96 /114 variables (removed 18) and now considering 105/127 (removed 22) transitions.
// Phase 1: matrix 105 rows 96 cols
[2022-06-10 21:52:58] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:52:58] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 105 rows 96 cols
[2022-06-10 21:52:58] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:52:58] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
// Phase 1: matrix 105 rows 96 cols
[2022-06-10 21:52:58] [INFO ] Computed 6 place invariants in 2 ms
[2022-06-10 21:52:58] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/114 places, 105/127 transitions.
Finished structural reductions, in 1 iterations. Remains : 96/114 places, 105/127 transitions.
[2022-06-10 21:52:58] [INFO ] Flatten gal took : 9 ms
[2022-06-10 21:52:58] [INFO ] Flatten gal took : 9 ms
[2022-06-10 21:52:58] [INFO ] Input system was already deterministic with 105 transitions.
[2022-06-10 21:52:58] [INFO ] Flatten gal took : 9 ms
[2022-06-10 21:52:58] [INFO ] Flatten gal took : 9 ms
[2022-06-10 21:52:58] [INFO ] Time to serialize gal into /tmp/CTLFireability2876654100174884085.gal : 2 ms
[2022-06-10 21:52:58] [INFO ] Time to serialize properties into /tmp/CTLFireability3085539216232899098.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/CTLFireability2876654100174884085.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3085539216232899098.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,68172,0.064724,5544,2,1048,5,4539,6,0,491,3752,0


Converting to forward existential form...Done !
original formula: AG(AF(((AF((((((p6==1)&&(p9==1))&&((p37==1)&&(p76==1)))||(((p6==1)&&(p9==1))&&((p40==1)&&(p76==1))))||((p62==1)&&(p81==1)))) + EG(A((p58=...241
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((!(EG(!((((((p6==1)&&(p9==1))&&((p37==1)&&(p76==1)))||(((p6==1)&&(p9==1))&&((p40==1)&&(...362
Reverse transition relation is NOT exact ! Due to transitions t11, t17, t18, t25, t33, t36, t37, t38, t58, t59, t62, t63, t65, t78, t85, t87, t92, t102, I...252
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,6.97808,186892,1,0,1438,1.21314e+06,260,680,3056,1.16916e+06,1610
FORMULA AutonomousCar-PT-01b-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 127/127 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 102 transition count 115
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 102 transition count 115
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 102 transition count 111
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 98 transition count 107
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 98 transition count 107
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 97 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 97 transition count 106
Applied a total of 38 rules in 5 ms. Remains 97 /114 variables (removed 17) and now considering 106/127 (removed 21) transitions.
// Phase 1: matrix 106 rows 97 cols
[2022-06-10 21:53:05] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:06] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 106 rows 97 cols
[2022-06-10 21:53:06] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:06] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
// Phase 1: matrix 106 rows 97 cols
[2022-06-10 21:53:06] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:06] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/114 places, 106/127 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/114 places, 106/127 transitions.
[2022-06-10 21:53:06] [INFO ] Flatten gal took : 10 ms
[2022-06-10 21:53:06] [INFO ] Flatten gal took : 9 ms
[2022-06-10 21:53:06] [INFO ] Input system was already deterministic with 106 transitions.
[2022-06-10 21:53:06] [INFO ] Flatten gal took : 8 ms
[2022-06-10 21:53:06] [INFO ] Flatten gal took : 8 ms
[2022-06-10 21:53:06] [INFO ] Time to serialize gal into /tmp/CTLFireability651653860539492031.gal : 1 ms
[2022-06-10 21:53:06] [INFO ] Time to serialize properties into /tmp/CTLFireability4972798436812521782.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/CTLFireability651653860539492031.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4972798436812521782.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,66852,0.066936,5468,2,1033,5,4238,6,0,496,3043,0


Converting to forward existential form...Done !
original formula: EF(((AG((AX((p52==1)) * AF((p69==0)))) + (p55==1)) + (p107==1)))
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E(TRUE U !((!(EX(!((p52==1)))) * !(EG(!((p69==0)))))))))] != FALSE + [(FwdU(Init,TRUE) *...220
Reverse transition relation is NOT exact ! Due to transitions t11, t17, t18, t25, t33, t36, t38, t40, t54, t60, t61, t64, t65, t67, t80, t87, t89, t94, In...251
(forward)formula 0,1,1.13808,29964,1,0,345,125559,240,143,2898,119831,415
FORMULA AutonomousCar-PT-01b-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 127/127 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 101 transition count 114
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 101 transition count 114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 101 transition count 110
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 98 transition count 107
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 98 transition count 107
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 97 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 97 transition count 106
Applied a total of 38 rules in 3 ms. Remains 97 /114 variables (removed 17) and now considering 106/127 (removed 21) transitions.
// Phase 1: matrix 106 rows 97 cols
[2022-06-10 21:53:07] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:07] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 106 rows 97 cols
[2022-06-10 21:53:07] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:07] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
// Phase 1: matrix 106 rows 97 cols
[2022-06-10 21:53:07] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:07] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/114 places, 106/127 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/114 places, 106/127 transitions.
[2022-06-10 21:53:07] [INFO ] Flatten gal took : 7 ms
[2022-06-10 21:53:07] [INFO ] Flatten gal took : 6 ms
[2022-06-10 21:53:07] [INFO ] Input system was already deterministic with 106 transitions.
[2022-06-10 21:53:07] [INFO ] Flatten gal took : 7 ms
[2022-06-10 21:53:07] [INFO ] Flatten gal took : 6 ms
[2022-06-10 21:53:07] [INFO ] Time to serialize gal into /tmp/CTLFireability10137663006238231874.gal : 2 ms
[2022-06-10 21:53:07] [INFO ] Time to serialize properties into /tmp/CTLFireability17448180226251108064.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/CTLFireability10137663006238231874.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17448180226251108064.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,70930,0.07484,5852,2,1062,5,4650,6,0,496,3783,0


Converting to forward existential form...Done !
original formula: EX((A(E(A((p61==1) U (p81==1)) U (p61==1)) U AG((p64==1))) + AG(EF((p17==1)))))
=> equivalent forward existential formula: ([((EY(Init) * !(EG(!(!(E(TRUE U !((p64==1)))))))) * !(E(!(!(E(TRUE U !((p64==1))))) U (!(E(!((E(!((p81==1)) U (...321
Reverse transition relation is NOT exact ! Due to transitions t11, t17, t18, t25, t33, t36, t37, t38, t58, t59, t62, t63, t65, t79, t86, t88, t93, t103, I...252
(forward)formula 0,0,4.28455,114244,1,0,873,749808,248,397,2911,645027,1022
FORMULA AutonomousCar-PT-01b-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 127/127 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 103 transition count 116
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 103 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 103 transition count 112
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 101 transition count 110
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 101 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 100 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 100 transition count 109
Applied a total of 32 rules in 5 ms. Remains 100 /114 variables (removed 14) and now considering 109/127 (removed 18) transitions.
// Phase 1: matrix 109 rows 100 cols
[2022-06-10 21:53:12] [INFO ] Computed 6 place invariants in 0 ms
[2022-06-10 21:53:12] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 109 rows 100 cols
[2022-06-10 21:53:12] [INFO ] Computed 6 place invariants in 2 ms
[2022-06-10 21:53:12] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
// Phase 1: matrix 109 rows 100 cols
[2022-06-10 21:53:12] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:12] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 100/114 places, 109/127 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/114 places, 109/127 transitions.
[2022-06-10 21:53:12] [INFO ] Flatten gal took : 4 ms
[2022-06-10 21:53:12] [INFO ] Flatten gal took : 4 ms
[2022-06-10 21:53:12] [INFO ] Input system was already deterministic with 109 transitions.
[2022-06-10 21:53:12] [INFO ] Flatten gal took : 4 ms
[2022-06-10 21:53:12] [INFO ] Flatten gal took : 5 ms
[2022-06-10 21:53:12] [INFO ] Time to serialize gal into /tmp/CTLFireability11462357455934855091.gal : 1 ms
[2022-06-10 21:53:12] [INFO ] Time to serialize properties into /tmp/CTLFireability8174234466341978832.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/CTLFireability11462357455934855091.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8174234466341978832.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,72540,0.072715,5544,2,1113,5,4582,6,0,511,3695,0


Converting to forward existential form...Done !
original formula: ((EF(AX(!(E(((p78==1)||(p111==1)) U !((((p6==1)&&(p9==1))&&((p40==1)&&(p76==1)))))))) + AG((EG((p63==1)) + (AF((p85==1)) * AG((p51==1))))...170
=> equivalent forward existential formula: [(EY((Init * !((E(TRUE U !(EX(!(!(E(((p78==1)||(p111==1)) U !((((p6==1)&&(p9==1))&&((p40==1)&&(p76==1)))))))))) ...262
Reverse transition relation is NOT exact ! Due to transitions t11, t17, t18, t25, t35, t39, t40, t56, t62, t63, t66, t67, t69, t82, t89, t91, t96, t106, I...252
(forward)formula 0,1,2.29557,51288,1,0,394,270561,253,175,3004,212222,511
FORMULA AutonomousCar-PT-01b-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 127/127 transitions.
Graph (trivial) has 98 edges and 114 vertex of which 4 / 114 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.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 112 transition count 74
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 60 rules applied. Total rules applied 112 place count 61 transition count 65
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 116 place count 57 transition count 65
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 116 place count 57 transition count 59
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 128 place count 51 transition count 59
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 134 place count 45 transition count 53
Iterating global reduction 3 with 6 rules applied. Total rules applied 140 place count 45 transition count 53
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 144 place count 45 transition count 49
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 144 place count 45 transition count 48
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 146 place count 44 transition count 48
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 147 place count 43 transition count 47
Iterating global reduction 4 with 1 rules applied. Total rules applied 148 place count 43 transition count 47
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 170 place count 32 transition count 36
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 171 place count 31 transition count 35
Iterating global reduction 4 with 1 rules applied. Total rules applied 172 place count 31 transition count 35
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 174 place count 31 transition count 33
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 175 place count 31 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 176 place count 30 transition count 32
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 177 place count 30 transition count 32
Applied a total of 177 rules in 14 ms. Remains 30 /114 variables (removed 84) and now considering 32/127 (removed 95) transitions.
// Phase 1: matrix 32 rows 30 cols
[2022-06-10 21:53:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 21:53:14] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 32 rows 30 cols
[2022-06-10 21:53:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-06-10 21:53:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:53:14] [INFO ] Implicit Places using invariants and state equation in 39 ms returned [21, 27]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 68 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 28/114 places, 32/127 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 28 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 27 transition count 31
Applied a total of 2 rules in 2 ms. Remains 27 /28 variables (removed 1) and now considering 31/32 (removed 1) transitions.
// Phase 1: matrix 31 rows 27 cols
[2022-06-10 21:53:14] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-10 21:53:15] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 31 rows 27 cols
[2022-06-10 21:53:15] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-10 21:53:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-10 21:53:15] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 27/114 places, 31/127 transitions.
Finished structural reductions, in 2 iterations. Remains : 27/114 places, 31/127 transitions.
[2022-06-10 21:53:15] [INFO ] Flatten gal took : 3 ms
[2022-06-10 21:53:15] [INFO ] Flatten gal took : 2 ms
[2022-06-10 21:53:15] [INFO ] Input system was already deterministic with 31 transitions.
[2022-06-10 21:53:15] [INFO ] Flatten gal took : 3 ms
[2022-06-10 21:53:15] [INFO ] Flatten gal took : 3 ms
[2022-06-10 21:53:15] [INFO ] Time to serialize gal into /tmp/CTLFireability16779716688717126544.gal : 2 ms
[2022-06-10 21:53:15] [INFO ] Time to serialize properties into /tmp/CTLFireability15992068792448553730.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/CTLFireability16779716688717126544.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15992068792448553730.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,793,0.009661,4556,2,169,5,813,6,0,137,810,0


Converting to forward existential form...Done !
original formula: EG((AG((EF((((p6==0)||(p9==0))||((p40==0)||(p76==0)))) * EG((p117==1)))) + AF(((p0==0)&&(p18==0)))))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !((E(TRUE U (((p6==0)||(p9==0))||((p40==0)||(p76==0)))) * EG((p117==1)))))) + !(EG(!(((p0...185
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t7, t8, t10, t17, t22, t24, t25, Intersection with reachable at each ste...213
(forward)formula 0,1,0.108488,7756,1,0,244,14627,98,130,889,19133,266
FORMULA AutonomousCar-PT-01b-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 127/127 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 100 transition count 113
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 100 transition count 113
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 100 transition count 109
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 96 transition count 105
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 95 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 95 transition count 104
Applied a total of 42 rules in 6 ms. Remains 95 /114 variables (removed 19) and now considering 104/127 (removed 23) transitions.
// Phase 1: matrix 104 rows 95 cols
[2022-06-10 21:53:15] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:15] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 104 rows 95 cols
[2022-06-10 21:53:15] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:15] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
// Phase 1: matrix 104 rows 95 cols
[2022-06-10 21:53:15] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-10 21:53:15] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 95/114 places, 104/127 transitions.
Finished structural reductions, in 1 iterations. Remains : 95/114 places, 104/127 transitions.
[2022-06-10 21:53:15] [INFO ] Flatten gal took : 4 ms
[2022-06-10 21:53:15] [INFO ] Flatten gal took : 5 ms
[2022-06-10 21:53:15] [INFO ] Input system was already deterministic with 104 transitions.
[2022-06-10 21:53:15] [INFO ] Flatten gal took : 5 ms
[2022-06-10 21:53:15] [INFO ] Flatten gal took : 4 ms
[2022-06-10 21:53:15] [INFO ] Time to serialize gal into /tmp/CTLFireability15896911636869647487.gal : 1 ms
[2022-06-10 21:53:15] [INFO ] Time to serialize properties into /tmp/CTLFireability1077104213477173023.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/CTLFireability15896911636869647487.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1077104213477173023.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,65988,0.052359,5596,2,1049,5,4399,6,0,486,3639,0


Converting to forward existential form...Done !
original formula: (EX(EG(((p38==0)||(p77==0)))) + AG((p91==1)))
=> equivalent forward existential formula: [(FwdU((Init * !(EX(EG(((p38==0)||(p77==0)))))),TRUE) * !((p91==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t11, t17, t18, t25, t33, t36, t37, t38, t58, t59, t62, t63, t65, t78, t85, t87, t92, t101, I...252
(forward)formula 0,1,3.32832,98928,1,0,811,633019,230,361,2719,580627,913
FORMULA AutonomousCar-PT-01b-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2022-06-10 21:53:18] [INFO ] Flatten gal took : 7 ms
[2022-06-10 21:53:18] [INFO ] Flatten gal took : 7 ms
Total runtime 59721 ms.

BK_STOP 1654897999037

--------------------
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-01b"
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-01b, 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-165463872900418"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-01b.tgz
mv AutonomousCar-PT-01b execution
cd execution
if [ "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 ;