Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 5.9K Feb 26 15:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 15:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 15:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 26 15:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 15:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 68K Mar 5 18:22 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 DES-PT-01b-CTLFireability-00
FORMULA_NAME DES-PT-01b-CTLFireability-01
FORMULA_NAME DES-PT-01b-CTLFireability-02
FORMULA_NAME DES-PT-01b-CTLFireability-03
FORMULA_NAME DES-PT-01b-CTLFireability-04
FORMULA_NAME DES-PT-01b-CTLFireability-05
FORMULA_NAME DES-PT-01b-CTLFireability-06
FORMULA_NAME DES-PT-01b-CTLFireability-07
FORMULA_NAME DES-PT-01b-CTLFireability-08
FORMULA_NAME DES-PT-01b-CTLFireability-09
FORMULA_NAME DES-PT-01b-CTLFireability-10
FORMULA_NAME DES-PT-01b-CTLFireability-11
FORMULA_NAME DES-PT-01b-CTLFireability-12
FORMULA_NAME DES-PT-01b-CTLFireability-13
FORMULA_NAME DES-PT-01b-CTLFireability-14
FORMULA_NAME DES-PT-01b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678259791613

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-01b
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202303021504
[2023-03-08 07:16:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 07:16:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 07:16:33] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2023-03-08 07:16:33] [INFO ] Transformed 284 places.
[2023-03-08 07:16:33] [INFO ] Transformed 235 transitions.
[2023-03-08 07:16:33] [INFO ] Found NUPN structural information;
[2023-03-08 07:16:33] [INFO ] Parsed PT model containing 284 places and 235 transitions and 683 arcs in 120 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 124 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 235/235 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 281 transition count 235
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 15 place count 269 transition count 223
Iterating global reduction 1 with 12 rules applied. Total rules applied 27 place count 269 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 266 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 266 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 266 transition count 218
Applied a total of 35 rules in 52 ms. Remains 266 /284 variables (removed 18) and now considering 218/235 (removed 17) transitions.
// Phase 1: matrix 218 rows 266 cols
[2023-03-08 07:16:33] [INFO ] Computed 62 place invariants in 25 ms
[2023-03-08 07:16:33] [INFO ] Implicit Places using invariants in 252 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 278 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 265/284 places, 218/235 transitions.
Applied a total of 0 rules in 4 ms. Remains 265 /265 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 336 ms. Remains : 265/284 places, 218/235 transitions.
Support contains 124 out of 265 places after structural reductions.
[2023-03-08 07:16:34] [INFO ] Flatten gal took : 43 ms
[2023-03-08 07:16:34] [INFO ] Flatten gal took : 15 ms
[2023-03-08 07:16:34] [INFO ] Input system was already deterministic with 218 transitions.
Incomplete random walk after 10000 steps, including 103 resets, run finished after 502 ms. (steps per millisecond=19 ) properties (out of 78) seen :64
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 218 rows 265 cols
[2023-03-08 07:16:35] [INFO ] Computed 61 place invariants in 5 ms
[2023-03-08 07:16:36] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned sat
[2023-03-08 07:16:36] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 10 ms returned sat
[2023-03-08 07:16:36] [INFO ] After 184ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:8
[2023-03-08 07:16:36] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 5 ms to minimize.
[2023-03-08 07:16:36] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2023-03-08 07:16:36] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2023-03-08 07:16:36] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 2 ms to minimize.
[2023-03-08 07:16:36] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2023-03-08 07:16:36] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2023-03-08 07:16:36] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2023-03-08 07:16:36] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2023-03-08 07:16:37] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2023-03-08 07:16:37] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2023-03-08 07:16:37] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2023-03-08 07:16:37] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2023-03-08 07:16:37] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 835 ms
[2023-03-08 07:16:37] [INFO ] After 1032ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:9
[2023-03-08 07:16:37] [INFO ] After 1285ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:9
[2023-03-08 07:16:37] [INFO ] [Nat]Absence check using 32 positive place invariants in 9 ms returned sat
[2023-03-08 07:16:37] [INFO ] [Nat]Absence check using 32 positive and 29 generalized place invariants in 10 ms returned sat
[2023-03-08 07:16:37] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :8
[2023-03-08 07:16:37] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
[2023-03-08 07:16:37] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2023-03-08 07:16:37] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2023-03-08 07:16:37] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2023-03-08 07:16:37] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2023-03-08 07:16:37] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2023-03-08 07:16:37] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2023-03-08 07:16:38] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2023-03-08 07:16:38] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 478 ms
[2023-03-08 07:16:38] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
[2023-03-08 07:16:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-08 07:16:38] [INFO ] After 859ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :8
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-08 07:16:38] [INFO ] After 1130ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :8
Fused 11 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 60 ms.
Support contains 27 out of 265 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 265/265 places, 218/218 transitions.
Graph (complete) has 479 edges and 265 vertex of which 262 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 262 transition count 199
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 32 place count 248 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 247 transition count 198
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 33 place count 247 transition count 188
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 53 place count 237 transition count 188
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 65 place count 225 transition count 176
Iterating global reduction 3 with 12 rules applied. Total rules applied 77 place count 225 transition count 176
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 81 place count 225 transition count 172
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 81 place count 225 transition count 171
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 83 place count 224 transition count 171
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 90 place count 217 transition count 164
Iterating global reduction 4 with 7 rules applied. Total rules applied 97 place count 217 transition count 164
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 8 rules applied. Total rules applied 105 place count 217 transition count 156
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 108 place count 215 transition count 155
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 108 place count 215 transition count 154
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 110 place count 214 transition count 154
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 6 with 130 rules applied. Total rules applied 240 place count 149 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 244 place count 147 transition count 94
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 246 place count 147 transition count 92
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 248 place count 145 transition count 92
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 249 place count 145 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 250 place count 144 transition count 91
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 251 place count 143 transition count 90
Applied a total of 251 rules in 98 ms. Remains 143 /265 variables (removed 122) and now considering 90/218 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 143/265 places, 90/218 transitions.
Incomplete random walk after 10000 steps, including 429 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 98 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 90 rows 143 cols
[2023-03-08 07:16:38] [INFO ] Computed 63 place invariants in 6 ms
[2023-03-08 07:16:38] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 07:16:38] [INFO ] [Real]Absence check using 36 positive and 27 generalized place invariants in 8 ms returned sat
[2023-03-08 07:16:38] [INFO ] After 50ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-08 07:16:38] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-08 07:16:38] [INFO ] After 14ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 07:16:38] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 07:16:39] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 07:16:39] [INFO ] [Nat]Absence check using 36 positive and 27 generalized place invariants in 5 ms returned sat
[2023-03-08 07:16:39] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 07:16:39] [INFO ] After 13ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 07:16:39] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2023-03-08 07:16:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-08 07:16:39] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 07:16:39] [INFO ] After 202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 0 ms.
Support contains 10 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 90/90 transitions.
Graph (complete) has 383 edges and 143 vertex of which 139 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 139 transition count 85
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 135 transition count 85
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 135 transition count 82
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 16 place count 131 transition count 82
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 131 transition count 81
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 130 transition count 81
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 30 place count 124 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 123 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 123 transition count 74
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 123 transition count 70
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 123 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 38 place count 122 transition count 69
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 122 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 40 place count 121 transition count 68
Applied a total of 40 rules in 31 ms. Remains 121 /143 variables (removed 22) and now considering 68/90 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 121/143 places, 68/90 transitions.
Incomplete random walk after 10000 steps, including 514 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2166311 steps, run timeout after 3001 ms. (steps per millisecond=721 ) properties seen :{}
Probabilistic random walk after 2166311 steps, saw 294827 distinct states, run finished after 3005 ms. (steps per millisecond=720 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 68 rows 121 cols
[2023-03-08 07:16:42] [INFO ] Computed 59 place invariants in 8 ms
[2023-03-08 07:16:42] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-08 07:16:42] [INFO ] [Real]Absence check using 37 positive and 22 generalized place invariants in 4 ms returned sat
[2023-03-08 07:16:42] [INFO ] After 29ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 07:16:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 07:16:42] [INFO ] After 13ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 07:16:42] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 07:16:42] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2023-03-08 07:16:42] [INFO ] [Nat]Absence check using 37 positive and 22 generalized place invariants in 4 ms returned sat
[2023-03-08 07:16:42] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 07:16:42] [INFO ] After 7ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 07:16:42] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-08 07:16:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-08 07:16:42] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-08 07:16:42] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 68/68 transitions.
Applied a total of 0 rules in 5 ms. Remains 121 /121 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 121/121 places, 68/68 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 68/68 transitions.
Applied a total of 0 rules in 4 ms. Remains 121 /121 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-08 07:16:42] [INFO ] Invariant cache hit.
[2023-03-08 07:16:42] [INFO ] Implicit Places using invariants in 93 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 94 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 120/121 places, 68/68 transitions.
Applied a total of 0 rules in 4 ms. Remains 120 /120 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 102 ms. Remains : 120/121 places, 68/68 transitions.
Incomplete random walk after 10000 steps, including 526 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 108 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2451870 steps, run timeout after 3001 ms. (steps per millisecond=817 ) properties seen :{}
Probabilistic random walk after 2451870 steps, saw 332413 distinct states, run finished after 3001 ms. (steps per millisecond=817 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 68 rows 120 cols
[2023-03-08 07:16:45] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 07:16:45] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 07:16:45] [INFO ] [Real]Absence check using 36 positive and 22 generalized place invariants in 4 ms returned sat
[2023-03-08 07:16:45] [INFO ] After 31ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 07:16:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 07:16:45] [INFO ] After 8ms SMT Verify possible using 6 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-08 07:16:45] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-08 07:16:45] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-08 07:16:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 72 ms
[2023-03-08 07:16:45] [INFO ] After 87ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 07:16:45] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 07:16:45] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 07:16:45] [INFO ] [Nat]Absence check using 36 positive and 22 generalized place invariants in 3 ms returned sat
[2023-03-08 07:16:45] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 07:16:45] [INFO ] After 9ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 07:16:45] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2023-03-08 07:16:45] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2023-03-08 07:16:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 71 ms
[2023-03-08 07:16:45] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-08 07:16:45] [INFO ] After 160ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 68/68 transitions.
Applied a total of 0 rules in 4 ms. Remains 120 /120 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 120/120 places, 68/68 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 68/68 transitions.
Applied a total of 0 rules in 4 ms. Remains 120 /120 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-08 07:16:45] [INFO ] Invariant cache hit.
[2023-03-08 07:16:46] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-08 07:16:46] [INFO ] Invariant cache hit.
[2023-03-08 07:16:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 07:16:46] [INFO ] Implicit Places using invariants and state equation in 114 ms returned [30, 34, 38, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 96, 115]
Discarding 16 places :
Implicit Place search using SMT with State Equation took 188 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 104/120 places, 68/68 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 104 transition count 59
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 21 place count 92 transition count 59
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 29 place count 88 transition count 55
Applied a total of 29 rules in 5 ms. Remains 88 /104 variables (removed 16) and now considering 55/68 (removed 13) transitions.
// Phase 1: matrix 55 rows 88 cols
[2023-03-08 07:16:46] [INFO ] Computed 39 place invariants in 1 ms
[2023-03-08 07:16:46] [INFO ] Implicit Places using invariants in 51 ms returned [41, 68, 74, 77]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 52 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 84/120 places, 55/68 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 83 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 83 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 82 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 82 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 81 transition count 51
Applied a total of 6 rules in 5 ms. Remains 81 /84 variables (removed 3) and now considering 51/55 (removed 4) transitions.
// Phase 1: matrix 51 rows 81 cols
[2023-03-08 07:16:46] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-08 07:16:46] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 07:16:46] [INFO ] Invariant cache hit.
[2023-03-08 07:16:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 07:16:46] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 81/120 places, 51/68 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 382 ms. Remains : 81/120 places, 51/68 transitions.
Incomplete random walk after 10000 steps, including 586 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 135 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2452289 steps, run timeout after 3001 ms. (steps per millisecond=817 ) properties seen :{}
Probabilistic random walk after 2452289 steps, saw 370054 distinct states, run finished after 3001 ms. (steps per millisecond=817 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 07:16:49] [INFO ] Invariant cache hit.
[2023-03-08 07:16:49] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-08 07:16:49] [INFO ] [Real]Absence check using 22 positive and 13 generalized place invariants in 2 ms returned sat
[2023-03-08 07:16:49] [INFO ] After 21ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 07:16:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 07:16:49] [INFO ] After 5ms SMT Verify possible using 6 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-08 07:16:49] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-08 07:16:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-08 07:16:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 72 ms
[2023-03-08 07:16:49] [INFO ] After 81ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 07:16:49] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 07:16:49] [INFO ] [Nat]Absence check using 22 positive place invariants in 2 ms returned sat
[2023-03-08 07:16:49] [INFO ] [Nat]Absence check using 22 positive and 13 generalized place invariants in 2 ms returned sat
[2023-03-08 07:16:49] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 07:16:49] [INFO ] After 5ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 07:16:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-08 07:16:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
[2023-03-08 07:16:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 65 ms
[2023-03-08 07:16:49] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-08 07:16:49] [INFO ] After 145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 81/81 places, 51/51 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-08 07:16:49] [INFO ] Invariant cache hit.
[2023-03-08 07:16:49] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-08 07:16:49] [INFO ] Invariant cache hit.
[2023-03-08 07:16:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 07:16:49] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-08 07:16:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 07:16:49] [INFO ] Invariant cache hit.
[2023-03-08 07:16:49] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 81/81 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-08 07:16:49] [INFO ] Invariant cache hit.
[2023-03-08 07:16:49] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-08 07:16:49] [INFO ] [Real]Absence check using 22 positive and 13 generalized place invariants in 2 ms returned sat
[2023-03-08 07:16:49] [INFO ] After 22ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 07:16:49] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2023-03-08 07:16:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-08 07:16:49] [INFO ] After 66ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 07:16:49] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 07:16:49] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-08 07:16:49] [INFO ] [Nat]Absence check using 22 positive and 13 generalized place invariants in 2 ms returned sat
[2023-03-08 07:16:50] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 07:16:50] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2023-03-08 07:16:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-08 07:16:50] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-08 07:16:50] [INFO ] After 104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2023-03-08 07:16:50] [INFO ] Flatten gal took : 21 ms
[2023-03-08 07:16:50] [INFO ] Flatten gal took : 12 ms
[2023-03-08 07:16:50] [INFO ] Input system was already deterministic with 218 transitions.
Computed a total of 54 stabilizing places and 49 stable transitions
Graph (complete) has 479 edges and 265 vertex of which 258 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 246 transition count 199
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 246 transition count 199
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 246 transition count 195
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 238 transition count 187
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 238 transition count 187
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 65 place count 238 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 237 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 237 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 237 transition count 178
Applied a total of 68 rules in 14 ms. Remains 237 /265 variables (removed 28) and now considering 178/218 (removed 40) transitions.
// Phase 1: matrix 178 rows 237 cols
[2023-03-08 07:16:50] [INFO ] Computed 61 place invariants in 3 ms
[2023-03-08 07:16:50] [INFO ] Implicit Places using invariants in 90 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 236/265 places, 178/218 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 236/265 places, 178/218 transitions.
[2023-03-08 07:16:50] [INFO ] Flatten gal took : 9 ms
[2023-03-08 07:16:50] [INFO ] Flatten gal took : 9 ms
[2023-03-08 07:16:50] [INFO ] Input system was already deterministic with 178 transitions.
[2023-03-08 07:16:50] [INFO ] Flatten gal took : 9 ms
[2023-03-08 07:16:50] [INFO ] Flatten gal took : 9 ms
[2023-03-08 07:16:50] [INFO ] Time to serialize gal into /tmp/CTLFireability6053743790335831486.gal : 4 ms
[2023-03-08 07:16:50] [INFO ] Time to serialize properties into /tmp/CTLFireability10697281487034888336.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6053743790335831486.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10697281487034888336.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.71666e+15,24.3204,667316,2,415900,5,2.57807e+06,6,0,1123,2.72328e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2023-03-08 07:17:20] [INFO ] Flatten gal took : 10 ms
[2023-03-08 07:17:20] [INFO ] Applying decomposition
[2023-03-08 07:17:20] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6215075914405668870.txt' '-o' '/tmp/graph6215075914405668870.bin' '-w' '/tmp/graph6215075914405668870.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6215075914405668870.bin' '-l' '-1' '-v' '-w' '/tmp/graph6215075914405668870.weights' '-q' '0' '-e' '0.001'
[2023-03-08 07:17:20] [INFO ] Decomposing Gal with order
[2023-03-08 07:17:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 07:17:20] [INFO ] Removed a total of 10 redundant transitions.
[2023-03-08 07:17:20] [INFO ] Flatten gal took : 38 ms
[2023-03-08 07:17:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2023-03-08 07:17:20] [INFO ] Time to serialize gal into /tmp/CTLFireability11476756040980195362.gal : 7 ms
[2023-03-08 07:17:20] [INFO ] Time to serialize properties into /tmp/CTLFireability12766305296637511716.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11476756040980195362.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12766305296637511716.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.71666e+15,0.401172,20588,2577,81,37681,728,686,68512,83,2075,0


Converting to forward existential form...Done !
original formula: E(!(((EF((EG((i5.i0.u20.p77==1)) * !(AX((i10.i0.u43.p161==1))))) * (i4.i1.u28.p107==1)) * (i4.i1.u28.p109==1))) U ((i7.i1.u68.p251==1)&&(...172
=> equivalent forward existential formula: [(FwdU(Init,!(((E(TRUE U (EG((i5.i0.u20.p77==1)) * !(!(EX(!((i10.i0.u43.p161==1))))))) * (i4.i1.u28.p107==1)) * ...230
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t54, t62, t87, t131, t172, i0.u75.t17, i1.t119, i1.u8.t124, i1.u8.t125, i1.u9.t121, ...737
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Graph (complete) has 479 edges and 265 vertex of which 258 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 257 transition count 193
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 237 transition count 193
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 41 place count 237 transition count 183
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 61 place count 227 transition count 183
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 75 place count 213 transition count 169
Iterating global reduction 2 with 14 rules applied. Total rules applied 89 place count 213 transition count 169
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 93 place count 213 transition count 165
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 93 place count 213 transition count 164
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 212 transition count 164
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 103 place count 204 transition count 156
Iterating global reduction 3 with 8 rules applied. Total rules applied 111 place count 204 transition count 156
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 9 rules applied. Total rules applied 120 place count 204 transition count 147
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 123 place count 202 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 123 place count 202 transition count 145
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 125 place count 201 transition count 145
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 5 with 130 rules applied. Total rules applied 255 place count 136 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 257 place count 134 transition count 78
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 259 place count 132 transition count 78
Applied a total of 259 rules in 39 ms. Remains 132 /265 variables (removed 133) and now considering 78/218 (removed 140) transitions.
// Phase 1: matrix 78 rows 132 cols
[2023-03-08 07:17:50] [INFO ] Computed 56 place invariants in 1 ms
[2023-03-08 07:17:50] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-08 07:17:50] [INFO ] Invariant cache hit.
[2023-03-08 07:17:50] [INFO ] Implicit Places using invariants and state equation in 113 ms returned [11, 38, 42, 46, 50, 52, 54, 56, 58, 60, 62, 64, 104, 127]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 228 ms to find 14 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 118/265 places, 78/218 transitions.
Graph (complete) has 257 edges and 118 vertex of which 116 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 114 transition count 75
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 114 transition count 73
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 112 transition count 73
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 31 place count 100 transition count 61
Applied a total of 31 rules in 8 ms. Remains 100 /118 variables (removed 18) and now considering 61/78 (removed 17) transitions.
// Phase 1: matrix 61 rows 100 cols
[2023-03-08 07:17:50] [INFO ] Computed 41 place invariants in 0 ms
[2023-03-08 07:17:50] [INFO ] Implicit Places using invariants in 59 ms returned [78, 85, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 61 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 97/265 places, 61/218 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 96 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 96 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 95 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 95 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 94 transition count 57
Applied a total of 6 rules in 5 ms. Remains 94 /97 variables (removed 3) and now considering 57/61 (removed 4) transitions.
// Phase 1: matrix 57 rows 94 cols
[2023-03-08 07:17:50] [INFO ] Computed 38 place invariants in 1 ms
[2023-03-08 07:17:51] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-08 07:17:51] [INFO ] Invariant cache hit.
[2023-03-08 07:17:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 07:17:51] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 94/265 places, 57/218 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 497 ms. Remains : 94/265 places, 57/218 transitions.
[2023-03-08 07:17:51] [INFO ] Flatten gal took : 3 ms
[2023-03-08 07:17:51] [INFO ] Flatten gal took : 3 ms
[2023-03-08 07:17:51] [INFO ] Input system was already deterministic with 57 transitions.
[2023-03-08 07:17:51] [INFO ] Flatten gal took : 3 ms
[2023-03-08 07:17:51] [INFO ] Flatten gal took : 3 ms
[2023-03-08 07:17:51] [INFO ] Time to serialize gal into /tmp/CTLFireability15229890048986001061.gal : 1 ms
[2023-03-08 07:17:51] [INFO ] Time to serialize properties into /tmp/CTLFireability13548717121946818148.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15229890048986001061.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13548717121946818148.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.82655e+07,0.824193,33900,2,47310,5,104853,6,0,415,93407,0


Converting to forward existential form...Done !
original formula: E(EF((EF(EG((p179==1))) + (p4==1))) U (p58==1))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (E(TRUE U EG((p179==1))) + (p4==1)))) * (p58==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t5, t8, t11, t13, t32, t33, t35, t36, t37, t43, t53, t54, t55, t56, Intersection wit...236
Detected timeout of ITS tools.
[2023-03-08 07:18:21] [INFO ] Flatten gal took : 7 ms
[2023-03-08 07:18:21] [INFO ] Applying decomposition
[2023-03-08 07:18:21] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13811178454870322481.txt' '-o' '/tmp/graph13811178454870322481.bin' '-w' '/tmp/graph13811178454870322481.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13811178454870322481.bin' '-l' '-1' '-v' '-w' '/tmp/graph13811178454870322481.weights' '-q' '0' '-e' '0.001'
[2023-03-08 07:18:21] [INFO ] Decomposing Gal with order
[2023-03-08 07:18:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 07:18:21] [INFO ] Removed a total of 12 redundant transitions.
[2023-03-08 07:18:21] [INFO ] Flatten gal took : 8 ms
[2023-03-08 07:18:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2023-03-08 07:18:21] [INFO ] Time to serialize gal into /tmp/CTLFireability13960485898956979634.gal : 2 ms
[2023-03-08 07:18:21] [INFO ] Time to serialize properties into /tmp/CTLFireability4579715334333469662.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13960485898956979634.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4579715334333469662.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.82655e+07,0.034805,5088,605,58,3588,240,290,3162,70,488,0


Converting to forward existential form...Done !
original formula: E(EF((EF(EG((i6.i3.u19.p179==1))) + (i0.u1.p4==1))) U (i11.u5.p58==1))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (E(TRUE U EG((i6.i3.u19.p179==1))) + (i0.u1.p4==1)))) * (i11.u5.p58==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t36, t37, t43, t53, t54, u3.t11, u14.t35, i2.u2.t13, i2.u8.t5, i3.t33, i3.u10.t1, i3.u11.t32,...283
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 12
(forward)formula 0,1,1.00277,58416,1,0,156042,689,1472,154832,318,1814,222656
FORMULA DES-PT-01b-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 249 transition count 202
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 249 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 249 transition count 199
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 243 transition count 193
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 243 transition count 193
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 52 place count 243 transition count 188
Applied a total of 52 rules in 8 ms. Remains 243 /265 variables (removed 22) and now considering 188/218 (removed 30) transitions.
// Phase 1: matrix 188 rows 243 cols
[2023-03-08 07:18:22] [INFO ] Computed 61 place invariants in 2 ms
[2023-03-08 07:18:22] [INFO ] Implicit Places using invariants in 95 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/265 places, 188/218 transitions.
Applied a total of 0 rules in 2 ms. Remains 242 /242 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108 ms. Remains : 242/265 places, 188/218 transitions.
[2023-03-08 07:18:22] [INFO ] Flatten gal took : 7 ms
[2023-03-08 07:18:22] [INFO ] Flatten gal took : 7 ms
[2023-03-08 07:18:22] [INFO ] Input system was already deterministic with 188 transitions.
[2023-03-08 07:18:22] [INFO ] Flatten gal took : 6 ms
[2023-03-08 07:18:22] [INFO ] Flatten gal took : 6 ms
[2023-03-08 07:18:22] [INFO ] Time to serialize gal into /tmp/CTLFireability2271042427174399744.gal : 1 ms
[2023-03-08 07:18:22] [INFO ] Time to serialize properties into /tmp/CTLFireability6209773318758459985.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2271042427174399744.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6209773318758459985.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2023-03-08 07:18:52] [INFO ] Flatten gal took : 6 ms
[2023-03-08 07:18:52] [INFO ] Applying decomposition
[2023-03-08 07:18:52] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15440108560401860046.txt' '-o' '/tmp/graph15440108560401860046.bin' '-w' '/tmp/graph15440108560401860046.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15440108560401860046.bin' '-l' '-1' '-v' '-w' '/tmp/graph15440108560401860046.weights' '-q' '0' '-e' '0.001'
[2023-03-08 07:18:52] [INFO ] Decomposing Gal with order
[2023-03-08 07:18:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 07:18:52] [INFO ] Removed a total of 18 redundant transitions.
[2023-03-08 07:18:52] [INFO ] Flatten gal took : 13 ms
[2023-03-08 07:18:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 6 ms.
[2023-03-08 07:18:52] [INFO ] Time to serialize gal into /tmp/CTLFireability3006756459706371314.gal : 3 ms
[2023-03-08 07:18:52] [INFO ] Time to serialize properties into /tmp/CTLFireability8581472730595932158.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3006756459706371314.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8581472730595932158.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.04941e+16,0.377515,20460,3068,70,36539,578,717,66028,84,1700,0


Converting to forward existential form...Done !
original formula: A(((i9.i2.u59.p203==1)&&(i9.i2.u67.p231==1)) U (A(!(AF((((i2.u11.p36==1)&&(i2.u33.p126==1))&&(i10.i0.u46.p161==1)))) U (((AX((i2.u11.p41=...666
=> equivalent forward existential formula: [((Init * !(EG(!((!((E(!((((!(EX(!((i2.u11.p41==1)))) * EG(((i3.i1.u14.p57==1)&&(i12.i0.u69.p242==1)))) * (!(EG(...3845
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t58, t124, t138, t182, i0.u15.t110, i1.t129, i1.u7.t127, i1.u8.t128, i2.u9.t117, i3....746
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Graph (complete) has 479 edges and 265 vertex of which 258 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 257 transition count 197
Reduce places removed 16 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 18 rules applied. Total rules applied 35 place count 241 transition count 195
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 37 place count 239 transition count 195
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 37 place count 239 transition count 186
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 55 place count 230 transition count 186
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 69 place count 216 transition count 172
Iterating global reduction 3 with 14 rules applied. Total rules applied 83 place count 216 transition count 172
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 87 place count 216 transition count 168
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 87 place count 216 transition count 167
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 89 place count 215 transition count 167
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 97 place count 207 transition count 159
Iterating global reduction 4 with 8 rules applied. Total rules applied 105 place count 207 transition count 159
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 9 rules applied. Total rules applied 114 place count 207 transition count 150
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 117 place count 205 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 117 place count 205 transition count 148
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 119 place count 204 transition count 148
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 6 with 126 rules applied. Total rules applied 245 place count 141 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 247 place count 139 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 249 place count 137 transition count 83
Applied a total of 249 rules in 48 ms. Remains 137 /265 variables (removed 128) and now considering 83/218 (removed 135) transitions.
// Phase 1: matrix 83 rows 137 cols
[2023-03-08 07:19:22] [INFO ] Computed 56 place invariants in 2 ms
[2023-03-08 07:19:22] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-08 07:19:22] [INFO ] Invariant cache hit.
[2023-03-08 07:19:22] [INFO ] Implicit Places using invariants and state equation in 106 ms returned [41, 45, 49, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 107, 132]
Discarding 18 places :
Implicit Place search using SMT with State Equation took 186 ms to find 18 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 119/265 places, 83/218 transitions.
Graph (complete) has 248 edges and 119 vertex of which 117 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 117 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 116 transition count 81
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 3 place count 116 transition count 72
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 19 rules applied. Total rules applied 22 place count 106 transition count 72
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 60 place count 80 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 78 transition count 59
Applied a total of 63 rules in 6 ms. Remains 78 /119 variables (removed 41) and now considering 59/83 (removed 24) transitions.
// Phase 1: matrix 59 rows 78 cols
[2023-03-08 07:19:22] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-08 07:19:22] [INFO ] Implicit Places using invariants in 44 ms returned [51, 61, 64]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 46 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 75/265 places, 59/218 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 74 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 74 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 73 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 73 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 72 transition count 55
Applied a total of 6 rules in 3 ms. Remains 72 /75 variables (removed 3) and now considering 55/59 (removed 4) transitions.
// Phase 1: matrix 55 rows 72 cols
[2023-03-08 07:19:22] [INFO ] Computed 18 place invariants in 0 ms
[2023-03-08 07:19:22] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 07:19:22] [INFO ] Invariant cache hit.
[2023-03-08 07:19:23] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 72/265 places, 55/218 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 395 ms. Remains : 72/265 places, 55/218 transitions.
[2023-03-08 07:19:23] [INFO ] Flatten gal took : 2 ms
[2023-03-08 07:19:23] [INFO ] Flatten gal took : 2 ms
[2023-03-08 07:19:23] [INFO ] Input system was already deterministic with 55 transitions.
[2023-03-08 07:19:23] [INFO ] Flatten gal took : 2 ms
[2023-03-08 07:19:23] [INFO ] Flatten gal took : 2 ms
[2023-03-08 07:19:23] [INFO ] Time to serialize gal into /tmp/CTLFireability6124815575443650898.gal : 0 ms
[2023-03-08 07:19:23] [INFO ] Time to serialize properties into /tmp/CTLFireability9630918764297175429.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6124815575443650898.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9630918764297175429.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.41846e+06,0.051646,5696,2,2966,5,10619,6,0,341,8519,0


Converting to forward existential form...Done !
original formula: EG(((p4==0) + ((!(E((p274==1) U (p48==1))) * (p161==0)) * (!(E((p121==1) U (p26==1))) + (p18==0)))))
=> equivalent forward existential formula: [FwdG(Init,((p4==0) + ((!(E((p274==1) U (p48==1))) * (p161==0)) * (!(E((p121==1) U (p26==1))) + (p18==0)))))] !=...161
Reverse transition relation is NOT exact ! Due to transitions t8, t12, t16, t19, t23, t24, t33, t39, t40, t42, t48, t50, t51, t53, t54, Intersection with ...234
(forward)formula 0,1,5.67866,171676,1,0,780,1.00299e+06,144,420,2044,1.21271e+06,680
FORMULA DES-PT-01b-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 246 transition count 199
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 246 transition count 199
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 246 transition count 195
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 238 transition count 187
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 238 transition count 187
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 65 place count 238 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 237 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 237 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 237 transition count 178
Applied a total of 68 rules in 17 ms. Remains 237 /265 variables (removed 28) and now considering 178/218 (removed 40) transitions.
// Phase 1: matrix 178 rows 237 cols
[2023-03-08 07:19:28] [INFO ] Computed 61 place invariants in 1 ms
[2023-03-08 07:19:28] [INFO ] Implicit Places using invariants in 91 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 92 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 236/265 places, 178/218 transitions.
Applied a total of 0 rules in 2 ms. Remains 236 /236 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 111 ms. Remains : 236/265 places, 178/218 transitions.
[2023-03-08 07:19:28] [INFO ] Flatten gal took : 6 ms
[2023-03-08 07:19:28] [INFO ] Flatten gal took : 6 ms
[2023-03-08 07:19:28] [INFO ] Input system was already deterministic with 178 transitions.
[2023-03-08 07:19:28] [INFO ] Flatten gal took : 5 ms
[2023-03-08 07:19:28] [INFO ] Flatten gal took : 6 ms
[2023-03-08 07:19:28] [INFO ] Time to serialize gal into /tmp/CTLFireability13995750328211215583.gal : 1 ms
[2023-03-08 07:19:28] [INFO ] Time to serialize properties into /tmp/CTLFireability1128310308221576232.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13995750328211215583.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1128310308221576232.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.71666e+15,22.7232,667532,2,415900,5,2.57807e+06,6,0,1123,2.72328e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2023-03-08 07:19:58] [INFO ] Flatten gal took : 12 ms
[2023-03-08 07:19:58] [INFO ] Applying decomposition
[2023-03-08 07:19:58] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2207464587608782169.txt' '-o' '/tmp/graph2207464587608782169.bin' '-w' '/tmp/graph2207464587608782169.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2207464587608782169.bin' '-l' '-1' '-v' '-w' '/tmp/graph2207464587608782169.weights' '-q' '0' '-e' '0.001'
[2023-03-08 07:19:58] [INFO ] Decomposing Gal with order
[2023-03-08 07:19:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 07:19:59] [INFO ] Removed a total of 10 redundant transitions.
[2023-03-08 07:19:59] [INFO ] Flatten gal took : 12 ms
[2023-03-08 07:19:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2023-03-08 07:19:59] [INFO ] Time to serialize gal into /tmp/CTLFireability4293403549487036194.gal : 6 ms
[2023-03-08 07:19:59] [INFO ] Time to serialize properties into /tmp/CTLFireability6283777441246495566.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4293403549487036194.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6283777441246495566.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.71666e+15,0.308621,17156,2329,68,33510,405,655,36118,77,1195,0


Converting to forward existential form...Done !
original formula: AF(((EX((i10.i0.u67.p250==1)) + A((i5.u28.p121==1) U (i0.i0.u3.p3==1))) + EG((i8.i2.u46.p182==0))))
=> equivalent forward existential formula: [FwdG(Init,!(((EX((i10.i0.u67.p250==1)) + !((E(!((i0.i0.u3.p3==1)) U (!((i5.u28.p121==1)) * !((i0.i0.u3.p3==1)))...223
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t87, t99, t119, t131, t172, i0.i0.u30.t79, i1.u8.t121, i1.u8.t122, i1.u12.t112, i1.u...720
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 248 transition count 201
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 248 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 248 transition count 198
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 240 transition count 190
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 240 transition count 190
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 60 place count 240 transition count 183
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 239 transition count 182
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 239 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 239 transition count 181
Applied a total of 63 rules in 10 ms. Remains 239 /265 variables (removed 26) and now considering 181/218 (removed 37) transitions.
// Phase 1: matrix 181 rows 239 cols
[2023-03-08 07:20:29] [INFO ] Computed 61 place invariants in 4 ms
[2023-03-08 07:20:29] [INFO ] Implicit Places using invariants in 162 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 163 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 238/265 places, 181/218 transitions.
Applied a total of 0 rules in 2 ms. Remains 238 /238 variables (removed 0) and now considering 181/181 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 176 ms. Remains : 238/265 places, 181/218 transitions.
[2023-03-08 07:20:29] [INFO ] Flatten gal took : 5 ms
[2023-03-08 07:20:29] [INFO ] Flatten gal took : 4 ms
[2023-03-08 07:20:29] [INFO ] Input system was already deterministic with 181 transitions.
[2023-03-08 07:20:29] [INFO ] Flatten gal took : 20 ms
[2023-03-08 07:20:29] [INFO ] Flatten gal took : 5 ms
[2023-03-08 07:20:29] [INFO ] Time to serialize gal into /tmp/CTLFireability13247400350274872219.gal : 1 ms
[2023-03-08 07:20:29] [INFO ] Time to serialize properties into /tmp/CTLFireability2806510930492695846.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13247400350274872219.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2806510930492695846.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.91143e+15,29.0839,668640,2,416846,5,2.5826e+06,6,0,1134,2.72737e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2023-03-08 07:20:59] [INFO ] Flatten gal took : 31 ms
[2023-03-08 07:20:59] [INFO ] Applying decomposition
[2023-03-08 07:20:59] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1680027246546634755.txt' '-o' '/tmp/graph1680027246546634755.bin' '-w' '/tmp/graph1680027246546634755.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1680027246546634755.bin' '-l' '-1' '-v' '-w' '/tmp/graph1680027246546634755.weights' '-q' '0' '-e' '0.001'
[2023-03-08 07:20:59] [INFO ] Decomposing Gal with order
[2023-03-08 07:20:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 07:20:59] [INFO ] Removed a total of 12 redundant transitions.
[2023-03-08 07:20:59] [INFO ] Flatten gal took : 11 ms
[2023-03-08 07:20:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 11 ms.
[2023-03-08 07:20:59] [INFO ] Time to serialize gal into /tmp/CTLFireability12829332044909374113.gal : 3 ms
[2023-03-08 07:20:59] [INFO ] Time to serialize properties into /tmp/CTLFireability2118575350247584140.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12829332044909374113.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2118575350247584140.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.91143e+15,0.262495,14852,2074,64,25203,375,668,37655,79,1094,0


Converting to forward existential form...Done !
original formula: E((EG(EF(((i12.i1.u71.p257==1)&&(i12.i2.u75.p266==1)))) * EX((i3.i1.u20.p84==1))) U EX(EF(((AX(((i6.u33.p136==1)&&(i7.i0.u38.p244==1))) +...308
=> equivalent forward existential formula: (([(FwdU(EY(FwdU(Init,(EG(E(TRUE U ((i12.i1.u71.p257==1)&&(i12.i2.u75.p266==1)))) * EX((i3.i1.u20.p84==1))))),TR...627
Reverse transition relation is NOT exact ! Due to transitions t0, t50, t56, t133, t174, i0.t121, i0.u6.t126, i0.u6.t127, i0.u7.t123, i0.u7.t124, i0.u11.t11...746
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 249 transition count 202
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 249 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 249 transition count 199
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 42 place count 242 transition count 192
Iterating global reduction 1 with 7 rules applied. Total rules applied 49 place count 242 transition count 192
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 55 place count 242 transition count 186
Applied a total of 55 rules in 10 ms. Remains 242 /265 variables (removed 23) and now considering 186/218 (removed 32) transitions.
// Phase 1: matrix 186 rows 242 cols
[2023-03-08 07:21:29] [INFO ] Computed 61 place invariants in 5 ms
[2023-03-08 07:21:29] [INFO ] Implicit Places using invariants in 107 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 241/265 places, 186/218 transitions.
Applied a total of 0 rules in 2 ms. Remains 241 /241 variables (removed 0) and now considering 186/186 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 121 ms. Remains : 241/265 places, 186/218 transitions.
[2023-03-08 07:21:29] [INFO ] Flatten gal took : 5 ms
[2023-03-08 07:21:29] [INFO ] Flatten gal took : 5 ms
[2023-03-08 07:21:29] [INFO ] Input system was already deterministic with 186 transitions.
[2023-03-08 07:21:29] [INFO ] Flatten gal took : 5 ms
[2023-03-08 07:21:29] [INFO ] Flatten gal took : 5 ms
[2023-03-08 07:21:29] [INFO ] Time to serialize gal into /tmp/CTLFireability8732336392324354185.gal : 1 ms
[2023-03-08 07:21:29] [INFO ] Time to serialize properties into /tmp/CTLFireability1548652011999852297.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8732336392324354185.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1548652011999852297.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.16295e+15,27.704,755588,2,419021,5,2.92962e+06,6,0,1151,3.06682e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2023-03-08 07:21:59] [INFO ] Flatten gal took : 6 ms
[2023-03-08 07:21:59] [INFO ] Applying decomposition
[2023-03-08 07:21:59] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6812829226547855098.txt' '-o' '/tmp/graph6812829226547855098.bin' '-w' '/tmp/graph6812829226547855098.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6812829226547855098.bin' '-l' '-1' '-v' '-w' '/tmp/graph6812829226547855098.weights' '-q' '0' '-e' '0.001'
[2023-03-08 07:21:59] [INFO ] Decomposing Gal with order
[2023-03-08 07:21:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 07:21:59] [INFO ] Removed a total of 16 redundant transitions.
[2023-03-08 07:21:59] [INFO ] Flatten gal took : 12 ms
[2023-03-08 07:21:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2023-03-08 07:21:59] [INFO ] Time to serialize gal into /tmp/CTLFireability10226467989591790028.gal : 3 ms
[2023-03-08 07:22:00] [INFO ] Time to serialize properties into /tmp/CTLFireability16514021219566114447.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10226467989591790028.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16514021219566114447.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
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,9.16295e+15,0.267142,15692,2072,66,26335,628,712,48362,86,1925,0


Converting to forward existential form...Done !
original formula: (AG(EX(((EX(((i1.i1.u14.p53==0)||(i11.u70.p242==0))) * !(E((i2.u7.p29==1) U ((i0.i2.u79.p281==1)&&(i0.i2.u79.p283==1))))) + ((i9.i0.u45.p...208
=> equivalent forward existential formula: [(FwdU((Init * !(E(TRUE U (i11.u70.p246==1)))),TRUE) * !(EX(((EX(((i1.i1.u14.p53==0)||(i11.u70.p242==0))) * !(E(...271
Reverse transition relation is NOT exact ! Due to transitions t0, t51, t53, t55, t57, t88, t137, t180, i0.i1.u33.t80, i0.i2.u79.t17, i1.i0.u15.t110, i1.i1....759
(forward)formula 0,1,5.44318,183068,1,0,372378,1139,3510,762157,437,3737,471004
FORMULA DES-PT-01b-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Graph (complete) has 479 edges and 265 vertex of which 258 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 257 transition count 195
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 239 transition count 195
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 37 place count 239 transition count 183
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 61 place count 227 transition count 183
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 75 place count 213 transition count 169
Iterating global reduction 2 with 14 rules applied. Total rules applied 89 place count 213 transition count 169
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 93 place count 213 transition count 165
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 93 place count 213 transition count 164
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 212 transition count 164
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 103 place count 204 transition count 156
Iterating global reduction 3 with 8 rules applied. Total rules applied 111 place count 204 transition count 156
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 9 rules applied. Total rules applied 120 place count 204 transition count 147
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 123 place count 202 transition count 146
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 123 place count 202 transition count 144
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 127 place count 200 transition count 144
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 5 with 130 rules applied. Total rules applied 257 place count 135 transition count 79
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 259 place count 133 transition count 77
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 261 place count 131 transition count 77
Applied a total of 261 rules in 29 ms. Remains 131 /265 variables (removed 134) and now considering 77/218 (removed 141) transitions.
// Phase 1: matrix 77 rows 131 cols
[2023-03-08 07:22:05] [INFO ] Computed 56 place invariants in 1 ms
[2023-03-08 07:22:05] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-08 07:22:05] [INFO ] Invariant cache hit.
[2023-03-08 07:22:05] [INFO ] Implicit Places using invariants and state equation in 114 ms returned [9, 35, 40, 44, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 126]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 237 ms to find 21 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 110/265 places, 77/218 transitions.
Graph (complete) has 225 edges and 110 vertex of which 108 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 106 transition count 65
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 97 transition count 65
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 49 place count 77 transition count 55
Applied a total of 49 rules in 4 ms. Remains 77 /110 variables (removed 33) and now considering 55/77 (removed 22) transitions.
// Phase 1: matrix 55 rows 77 cols
[2023-03-08 07:22:05] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-08 07:22:05] [INFO ] Implicit Places using invariants in 112 ms returned [41, 42, 46, 47]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 114 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 73/265 places, 55/218 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 73 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 71 transition count 53
Applied a total of 4 rules in 3 ms. Remains 71 /73 variables (removed 2) and now considering 53/55 (removed 2) transitions.
// Phase 1: matrix 53 rows 71 cols
[2023-03-08 07:22:05] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-08 07:22:05] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-08 07:22:05] [INFO ] Invariant cache hit.
[2023-03-08 07:22:06] [INFO ] Implicit Places using invariants and state equation in 111 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 178 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 70/265 places, 53/218 transitions.
Applied a total of 0 rules in 2 ms. Remains 70 /70 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 4 iterations and 567 ms. Remains : 70/265 places, 53/218 transitions.
[2023-03-08 07:22:06] [INFO ] Flatten gal took : 2 ms
[2023-03-08 07:22:06] [INFO ] Flatten gal took : 2 ms
[2023-03-08 07:22:06] [INFO ] Input system was already deterministic with 53 transitions.
[2023-03-08 07:22:06] [INFO ] Flatten gal took : 2 ms
[2023-03-08 07:22:06] [INFO ] Flatten gal took : 2 ms
[2023-03-08 07:22:06] [INFO ] Time to serialize gal into /tmp/CTLFireability6547520794888710855.gal : 1 ms
[2023-03-08 07:22:06] [INFO ] Time to serialize properties into /tmp/CTLFireability4445320398539187006.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6547520794888710855.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4445320398539187006.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.47558e+06,0.036124,5172,2,2094,5,8213,6,0,330,7363,0


Converting to forward existential form...Done !
original formula: AF(!(E((p134!=1) U ((p216==1)&&(p240==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E((p134!=1) U ((p216==1)&&(p240==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t8, t11, t13, t19, t39, t40, t42, t43, t49, Intersection with reachable at e...220
(forward)formula 0,0,7.34393,250992,1,0,688,1.54926e+06,132,385,1999,1.82668e+06,651
FORMULA DES-PT-01b-CTLFireability-07 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 : 265/265 places, 218/218 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 247 transition count 200
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 247 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 247 transition count 197
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 240 transition count 190
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 240 transition count 190
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 59 place count 240 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 239 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 239 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 239 transition count 182
Applied a total of 62 rules in 15 ms. Remains 239 /265 variables (removed 26) and now considering 182/218 (removed 36) transitions.
// Phase 1: matrix 182 rows 239 cols
[2023-03-08 07:22:13] [INFO ] Computed 61 place invariants in 2 ms
[2023-03-08 07:22:13] [INFO ] Implicit Places using invariants in 94 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 238/265 places, 182/218 transitions.
Applied a total of 0 rules in 2 ms. Remains 238 /238 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113 ms. Remains : 238/265 places, 182/218 transitions.
[2023-03-08 07:22:13] [INFO ] Flatten gal took : 5 ms
[2023-03-08 07:22:13] [INFO ] Flatten gal took : 4 ms
[2023-03-08 07:22:13] [INFO ] Input system was already deterministic with 182 transitions.
[2023-03-08 07:22:13] [INFO ] Flatten gal took : 4 ms
[2023-03-08 07:22:13] [INFO ] Flatten gal took : 5 ms
[2023-03-08 07:22:13] [INFO ] Time to serialize gal into /tmp/CTLFireability10634175309183970503.gal : 1 ms
[2023-03-08 07:22:13] [INFO ] Time to serialize properties into /tmp/CTLFireability18162227089928482964.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10634175309183970503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18162227089928482964.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.44495e+15,22.9347,675884,2,416330,5,2.58012e+06,6,0,1135,2.72508e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2023-03-08 07:22:43] [INFO ] Flatten gal took : 4 ms
[2023-03-08 07:22:43] [INFO ] Applying decomposition
[2023-03-08 07:22:43] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph18303054073426155766.txt' '-o' '/tmp/graph18303054073426155766.bin' '-w' '/tmp/graph18303054073426155766.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph18303054073426155766.bin' '-l' '-1' '-v' '-w' '/tmp/graph18303054073426155766.weights' '-q' '0' '-e' '0.001'
[2023-03-08 07:22:43] [INFO ] Decomposing Gal with order
[2023-03-08 07:22:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 07:22:43] [INFO ] Removed a total of 15 redundant transitions.
[2023-03-08 07:22:43] [INFO ] Flatten gal took : 9 ms
[2023-03-08 07:22:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2023-03-08 07:22:43] [INFO ] Time to serialize gal into /tmp/CTLFireability17994195640796106481.gal : 2 ms
[2023-03-08 07:22:43] [INFO ] Time to serialize properties into /tmp/CTLFireability5013920910921653662.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17994195640796106481.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5013920910921653662.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.44495e+15,0.523929,27900,2518,66,41329,467,626,154885,83,1571,0


Converting to forward existential form...Done !
original formula: EF(((EX(((i7.i1.i0.u52.p197==1)&&(i7.i1.i0.u59.p227==1))) + ((i5.u33.p136==1)&&(i10.u37.p244==1))) + (((i10.u13.p53==1)&&(i9.u64.p242==1)...197
=> equivalent forward existential formula: (([(EY(FwdU(Init,TRUE)) * ((i7.i1.i0.u52.p197==1)&&(i7.i1.i0.u59.p227==1)))] != FALSE + [(FwdU(Init,TRUE) * ((i5...311
(forward)formula 0,1,0.671518,27900,1,0,41329,467,847,154885,106,1571,37241
FORMULA DES-PT-01b-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Graph (complete) has 479 edges and 265 vertex of which 258 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 257 transition count 199
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 243 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 242 transition count 198
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 31 place count 242 transition count 188
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 51 place count 232 transition count 188
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 62 place count 221 transition count 177
Iterating global reduction 3 with 11 rules applied. Total rules applied 73 place count 221 transition count 177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 76 place count 221 transition count 174
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 83 place count 214 transition count 167
Iterating global reduction 4 with 7 rules applied. Total rules applied 90 place count 214 transition count 167
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 7 rules applied. Total rules applied 97 place count 214 transition count 160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 98 place count 213 transition count 160
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 98 place count 213 transition count 159
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 100 place count 212 transition count 159
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 6 with 122 rules applied. Total rules applied 222 place count 151 transition count 98
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 223 place count 151 transition count 97
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 224 place count 151 transition count 97
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 226 place count 149 transition count 95
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 228 place count 147 transition count 95
Applied a total of 228 rules in 49 ms. Remains 147 /265 variables (removed 118) and now considering 95/218 (removed 123) transitions.
// Phase 1: matrix 95 rows 147 cols
[2023-03-08 07:22:44] [INFO ] Computed 56 place invariants in 1 ms
[2023-03-08 07:22:44] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-08 07:22:44] [INFO ] Invariant cache hit.
[2023-03-08 07:22:44] [INFO ] Implicit Places using invariants and state equation in 125 ms returned [10, 46, 51, 56, 76, 78, 117]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 239 ms to find 7 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 140/265 places, 95/218 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 139 transition count 93
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 138 transition count 93
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 14 place count 132 transition count 87
Applied a total of 14 rules in 9 ms. Remains 132 /140 variables (removed 8) and now considering 87/95 (removed 8) transitions.
// Phase 1: matrix 87 rows 132 cols
[2023-03-08 07:22:44] [INFO ] Computed 49 place invariants in 1 ms
[2023-03-08 07:22:44] [INFO ] Implicit Places using invariants in 125 ms returned [105, 113, 116]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 126 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 129/265 places, 87/218 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 128 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 128 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 127 transition count 85
Applied a total of 4 rules in 7 ms. Remains 127 /129 variables (removed 2) and now considering 85/87 (removed 2) transitions.
// Phase 1: matrix 85 rows 127 cols
[2023-03-08 07:22:44] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-08 07:22:44] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-08 07:22:44] [INFO ] Invariant cache hit.
[2023-03-08 07:22:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 07:22:45] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 127/265 places, 85/218 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 609 ms. Remains : 127/265 places, 85/218 transitions.
[2023-03-08 07:22:45] [INFO ] Flatten gal took : 3 ms
[2023-03-08 07:22:45] [INFO ] Flatten gal took : 3 ms
[2023-03-08 07:22:45] [INFO ] Input system was already deterministic with 85 transitions.
[2023-03-08 07:22:45] [INFO ] Flatten gal took : 3 ms
[2023-03-08 07:22:45] [INFO ] Flatten gal took : 3 ms
[2023-03-08 07:22:45] [INFO ] Time to serialize gal into /tmp/CTLFireability7050858115207352513.gal : 1 ms
[2023-03-08 07:22:45] [INFO ] Time to serialize properties into /tmp/CTLFireability7952607113264989782.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7050858115207352513.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7952607113264989782.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.82543e+09,2.53162,94568,2,92089,5,364854,6,0,586,349013,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2023-03-08 07:23:15] [INFO ] Flatten gal took : 3 ms
[2023-03-08 07:23:15] [INFO ] Applying decomposition
[2023-03-08 07:23:15] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15720384215793943721.txt' '-o' '/tmp/graph15720384215793943721.bin' '-w' '/tmp/graph15720384215793943721.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15720384215793943721.bin' '-l' '-1' '-v' '-w' '/tmp/graph15720384215793943721.weights' '-q' '0' '-e' '0.001'
[2023-03-08 07:23:15] [INFO ] Decomposing Gal with order
[2023-03-08 07:23:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 07:23:15] [INFO ] Removed a total of 12 redundant transitions.
[2023-03-08 07:23:15] [INFO ] Flatten gal took : 5 ms
[2023-03-08 07:23:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-08 07:23:15] [INFO ] Time to serialize gal into /tmp/CTLFireability3149017428927861883.gal : 1 ms
[2023-03-08 07:23:15] [INFO ] Time to serialize properties into /tmp/CTLFireability13563393721760423699.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3149017428927861883.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13563393721760423699.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.82543e+09,0.080849,7308,743,173,6140,1722,404,13724,91,6592,0


Converting to forward existential form...Done !
original formula: EF((AG((i4.u14.p121==0)) + (AF(E((((i0.u0.p7==1)&&(i0.u46.p276==1))&&(i2.u8.p80==1)) U (((i5.i0.u19.p152==1)&&(i11.i1.u6.p61==1))&&(i11.i...368
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !((i4.u14.p121==0)))))] != FALSE + [((FwdU(Init,TRUE) * ((i5.i0.u41.p209==1)||((...469
Reverse transition relation is NOT exact ! Due to transitions t42, t62, t65, u2.t20, i0.u46.t49, i2.t75, i2.u1.t22, i2.u8.t74, i2.u9.t11, i3.t58, i3.u12.t5...384
(forward)formula 0,1,0.546318,29484,1,0,43141,3395,1876,156403,453,17043,66687
FORMULA DES-PT-01b-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 251 transition count 204
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 251 transition count 204
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 251 transition count 201
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 246 transition count 196
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 246 transition count 196
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 46 place count 246 transition count 191
Applied a total of 46 rules in 10 ms. Remains 246 /265 variables (removed 19) and now considering 191/218 (removed 27) transitions.
// Phase 1: matrix 191 rows 246 cols
[2023-03-08 07:23:15] [INFO ] Computed 61 place invariants in 2 ms
[2023-03-08 07:23:15] [INFO ] Implicit Places using invariants in 86 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/265 places, 191/218 transitions.
Applied a total of 0 rules in 2 ms. Remains 245 /245 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 245/265 places, 191/218 transitions.
[2023-03-08 07:23:15] [INFO ] Flatten gal took : 4 ms
[2023-03-08 07:23:15] [INFO ] Flatten gal took : 4 ms
[2023-03-08 07:23:15] [INFO ] Input system was already deterministic with 191 transitions.
[2023-03-08 07:23:15] [INFO ] Flatten gal took : 4 ms
[2023-03-08 07:23:15] [INFO ] Flatten gal took : 4 ms
[2023-03-08 07:23:15] [INFO ] Time to serialize gal into /tmp/CTLFireability15017298667118029576.gal : 1 ms
[2023-03-08 07:23:15] [INFO ] Time to serialize properties into /tmp/CTLFireability3495154007553410728.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15017298667118029576.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3495154007553410728.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.06311e+16,26.2929,761208,2,532486,5,3.14788e+06,6,0,1172,3.02689e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2023-03-08 07:23:45] [INFO ] Flatten gal took : 11 ms
[2023-03-08 07:23:45] [INFO ] Applying decomposition
[2023-03-08 07:23:45] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6912427800006656149.txt' '-o' '/tmp/graph6912427800006656149.bin' '-w' '/tmp/graph6912427800006656149.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6912427800006656149.bin' '-l' '-1' '-v' '-w' '/tmp/graph6912427800006656149.weights' '-q' '0' '-e' '0.001'
[2023-03-08 07:23:45] [INFO ] Decomposing Gal with order
[2023-03-08 07:23:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 07:23:45] [INFO ] Removed a total of 16 redundant transitions.
[2023-03-08 07:23:45] [INFO ] Flatten gal took : 12 ms
[2023-03-08 07:23:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2023-03-08 07:23:45] [INFO ] Time to serialize gal into /tmp/CTLFireability15707213905995467760.gal : 4 ms
[2023-03-08 07:23:45] [INFO ] Time to serialize properties into /tmp/CTLFireability11384369348058902712.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15707213905995467760.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11384369348058902712.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.06311e+16,0.319844,16728,1983,69,30510,963,663,39972,80,3162,0


Converting to forward existential form...Done !
original formula: EF((((EX(((AF((i9.i0.u60.p209==1)) + (i1.u16.p66==1)) * AF((i4.i0.u1.p4==1)))) * ((i9.i0.u41.p150==1) + ((EF((i2.u11.p42==1)) * AG((i6.u2...660
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * ((EX(((!(EG(!((i9.i0.u60.p209==1)))) + (i1.u16.p66==1)) * !(EG(!((i4.i0.u1.p4==1)))))) * ...2098
Reverse transition relation is NOT exact ! Due to transitions t0, t53, t57, t140, t185, i0.u36.t77, i1.t128, i1.u7.t133, i1.u7.t134, i1.u8.t130, i1.u8.t131...777
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 246 transition count 199
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 246 transition count 199
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 246 transition count 195
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 238 transition count 187
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 238 transition count 187
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 65 place count 238 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 237 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 237 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 237 transition count 178
Applied a total of 68 rules in 17 ms. Remains 237 /265 variables (removed 28) and now considering 178/218 (removed 40) transitions.
// Phase 1: matrix 178 rows 237 cols
[2023-03-08 07:24:16] [INFO ] Computed 61 place invariants in 1 ms
[2023-03-08 07:24:16] [INFO ] Implicit Places using invariants in 91 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 236/265 places, 178/218 transitions.
Applied a total of 0 rules in 2 ms. Remains 236 /236 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122 ms. Remains : 236/265 places, 178/218 transitions.
[2023-03-08 07:24:16] [INFO ] Flatten gal took : 4 ms
[2023-03-08 07:24:16] [INFO ] Flatten gal took : 4 ms
[2023-03-08 07:24:16] [INFO ] Input system was already deterministic with 178 transitions.
[2023-03-08 07:24:16] [INFO ] Flatten gal took : 4 ms
[2023-03-08 07:24:16] [INFO ] Flatten gal took : 4 ms
[2023-03-08 07:24:16] [INFO ] Time to serialize gal into /tmp/CTLFireability3133249474473459548.gal : 0 ms
[2023-03-08 07:24:16] [INFO ] Time to serialize properties into /tmp/CTLFireability10031395071144091199.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3133249474473459548.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10031395071144091199.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.71666e+15,22.6444,668204,2,415900,5,2.57807e+06,6,0,1123,2.72328e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2023-03-08 07:24:46] [INFO ] Flatten gal took : 11 ms
[2023-03-08 07:24:46] [INFO ] Applying decomposition
[2023-03-08 07:24:46] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph556529487816776391.txt' '-o' '/tmp/graph556529487816776391.bin' '-w' '/tmp/graph556529487816776391.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph556529487816776391.bin' '-l' '-1' '-v' '-w' '/tmp/graph556529487816776391.weights' '-q' '0' '-e' '0.001'
[2023-03-08 07:24:46] [INFO ] Decomposing Gal with order
[2023-03-08 07:24:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 07:24:46] [INFO ] Removed a total of 11 redundant transitions.
[2023-03-08 07:24:46] [INFO ] Flatten gal took : 9 ms
[2023-03-08 07:24:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2023-03-08 07:24:46] [INFO ] Time to serialize gal into /tmp/CTLFireability12032096850285032847.gal : 4 ms
[2023-03-08 07:24:46] [INFO ] Time to serialize properties into /tmp/CTLFireability12081944612361430926.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12032096850285032847.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12081944612361430926.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.71666e+15,0.412811,21708,2705,71,39383,606,693,72995,86,1757,0


Converting to forward existential form...Done !
original formula: AF((AG(((i7.i1.u69.p253==0) + ((((A((i8.i0.u44.p159==1) U (i3.i0.u18.p73==1)) * (i9.i3.u64.p220==1)) * ((i9.i3.u64.p222==1)&&(i9.i3.u63.p...360
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !(((i7.i1.u69.p253==0) + ((((!((E(!((i3.i0.u18.p73==1)) U (!((i8.i0.u44.p159==1)) * !((...500
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t56, t58, t87, t131, t172, i0.u15.t109, i1.t119, i1.u8.t124, i1.u8.t125, i1.u9.t121,...742
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 247 transition count 200
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 247 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 247 transition count 197
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 239 transition count 189
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 239 transition count 189
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 62 place count 239 transition count 182
Applied a total of 62 rules in 11 ms. Remains 239 /265 variables (removed 26) and now considering 182/218 (removed 36) transitions.
// Phase 1: matrix 182 rows 239 cols
[2023-03-08 07:25:16] [INFO ] Computed 61 place invariants in 3 ms
[2023-03-08 07:25:16] [INFO ] Implicit Places using invariants in 89 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 238/265 places, 182/218 transitions.
Applied a total of 0 rules in 3 ms. Remains 238 /238 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 238/265 places, 182/218 transitions.
[2023-03-08 07:25:16] [INFO ] Flatten gal took : 4 ms
[2023-03-08 07:25:16] [INFO ] Flatten gal took : 4 ms
[2023-03-08 07:25:16] [INFO ] Input system was already deterministic with 182 transitions.
[2023-03-08 07:25:16] [INFO ] Flatten gal took : 4 ms
[2023-03-08 07:25:16] [INFO ] Flatten gal took : 4 ms
[2023-03-08 07:25:16] [INFO ] Time to serialize gal into /tmp/CTLFireability12368183992461712757.gal : 1 ms
[2023-03-08 07:25:16] [INFO ] Time to serialize properties into /tmp/CTLFireability14237626868715081533.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12368183992461712757.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14237626868715081533.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.0935e+15,22.6608,675236,2,416172,5,2.57929e+06,6,0,1135,2.72436e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2023-03-08 07:25:46] [INFO ] Flatten gal took : 8 ms
[2023-03-08 07:25:46] [INFO ] Applying decomposition
[2023-03-08 07:25:46] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph14324664984622890974.txt' '-o' '/tmp/graph14324664984622890974.bin' '-w' '/tmp/graph14324664984622890974.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph14324664984622890974.bin' '-l' '-1' '-v' '-w' '/tmp/graph14324664984622890974.weights' '-q' '0' '-e' '0.001'
[2023-03-08 07:25:46] [INFO ] Decomposing Gal with order
[2023-03-08 07:25:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 07:25:46] [INFO ] Removed a total of 16 redundant transitions.
[2023-03-08 07:25:46] [INFO ] Flatten gal took : 8 ms
[2023-03-08 07:25:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2023-03-08 07:25:46] [INFO ] Time to serialize gal into /tmp/CTLFireability8738157234608077413.gal : 2 ms
[2023-03-08 07:25:46] [INFO ] Time to serialize properties into /tmp/CTLFireability2920036414619275001.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8738157234608077413.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2920036414619275001.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
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,6.0935e+15,0.219044,13304,2317,63,22595,497,701,27409,83,1619,0


Converting to forward existential form...Done !
original formula: EF((EX(((i1.i1.u15.p53==0)||(i11.i0.u68.p242==0))) * EX(EG(((i12.i0.u3.p3==0)||(i3.u12.p41==0))))))
=> equivalent forward existential formula: [FwdG(EY((FwdU(Init,TRUE) * EX(((i1.i1.u15.p53==0)||(i11.i0.u68.p242==0))))),((i12.i0.u3.p3==0)||(i3.u12.p41==0)...167
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t58, t87, t134, i0.u36.t76, i1.i0.u16.t109, i1.i1.u14.t113, i2.t122, i2.u8.t127, i2....739
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 246 transition count 199
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 246 transition count 199
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 246 transition count 195
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 238 transition count 187
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 238 transition count 187
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 65 place count 238 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 237 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 237 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 237 transition count 178
Applied a total of 68 rules in 16 ms. Remains 237 /265 variables (removed 28) and now considering 178/218 (removed 40) transitions.
// Phase 1: matrix 178 rows 237 cols
[2023-03-08 07:26:16] [INFO ] Computed 61 place invariants in 1 ms
[2023-03-08 07:26:16] [INFO ] Implicit Places using invariants in 96 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 236/265 places, 178/218 transitions.
Applied a total of 0 rules in 2 ms. Remains 236 /236 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 116 ms. Remains : 236/265 places, 178/218 transitions.
[2023-03-08 07:26:16] [INFO ] Flatten gal took : 3 ms
[2023-03-08 07:26:16] [INFO ] Flatten gal took : 3 ms
[2023-03-08 07:26:16] [INFO ] Input system was already deterministic with 178 transitions.
[2023-03-08 07:26:16] [INFO ] Flatten gal took : 3 ms
[2023-03-08 07:26:16] [INFO ] Flatten gal took : 3 ms
[2023-03-08 07:26:16] [INFO ] Time to serialize gal into /tmp/CTLFireability17600558011190857151.gal : 1 ms
[2023-03-08 07:26:16] [INFO ] Time to serialize properties into /tmp/CTLFireability1896893650155556417.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17600558011190857151.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1896893650155556417.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.71666e+15,22.9265,667668,2,415900,5,2.57807e+06,6,0,1123,2.72328e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2023-03-08 07:26:46] [INFO ] Flatten gal took : 13 ms
[2023-03-08 07:26:46] [INFO ] Applying decomposition
[2023-03-08 07:26:46] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6561255839447726500.txt' '-o' '/tmp/graph6561255839447726500.bin' '-w' '/tmp/graph6561255839447726500.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6561255839447726500.bin' '-l' '-1' '-v' '-w' '/tmp/graph6561255839447726500.weights' '-q' '0' '-e' '0.001'
[2023-03-08 07:26:46] [INFO ] Decomposing Gal with order
[2023-03-08 07:26:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 07:26:46] [INFO ] Removed a total of 12 redundant transitions.
[2023-03-08 07:26:46] [INFO ] Flatten gal took : 9 ms
[2023-03-08 07:26:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2023-03-08 07:26:46] [INFO ] Time to serialize gal into /tmp/CTLFireability2360004248147641227.gal : 2 ms
[2023-03-08 07:26:46] [INFO ] Time to serialize properties into /tmp/CTLFireability2906495447538220582.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2360004248147641227.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2906495447538220582.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.71666e+15,0.252406,15192,2249,64,24339,623,691,45103,80,2040,0


Converting to forward existential form...Done !
original formula: EF(AX(((i7.i1.u43.p164==1)&&(i7.i1.u52.p190==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((i7.i1.u43.p164==1)&&(i7.i1.u52.p190==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t56, t87, t131, i0.i0.u36.t76, i0.i1.u73.t25, i1.i0.u13.t112, i1.i0.u15.t109, i2.t11...736
(forward)formula 0,1,1.45964,73536,1,0,159976,682,2723,304543,373,2265,259618
FORMULA DES-PT-01b-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 246 transition count 199
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 246 transition count 199
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 246 transition count 195
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 238 transition count 187
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 238 transition count 187
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 65 place count 238 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 237 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 237 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 237 transition count 178
Applied a total of 68 rules in 15 ms. Remains 237 /265 variables (removed 28) and now considering 178/218 (removed 40) transitions.
[2023-03-08 07:26:48] [INFO ] Invariant cache hit.
[2023-03-08 07:26:48] [INFO ] Implicit Places using invariants in 87 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 236/265 places, 178/218 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106 ms. Remains : 236/265 places, 178/218 transitions.
[2023-03-08 07:26:48] [INFO ] Flatten gal took : 3 ms
[2023-03-08 07:26:48] [INFO ] Flatten gal took : 3 ms
[2023-03-08 07:26:48] [INFO ] Input system was already deterministic with 178 transitions.
[2023-03-08 07:26:48] [INFO ] Flatten gal took : 3 ms
[2023-03-08 07:26:48] [INFO ] Flatten gal took : 4 ms
[2023-03-08 07:26:48] [INFO ] Time to serialize gal into /tmp/CTLFireability17753734788612671629.gal : 1 ms
[2023-03-08 07:26:48] [INFO ] Time to serialize properties into /tmp/CTLFireability6046793668189469964.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17753734788612671629.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6046793668189469964.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.71666e+15,22.8445,667420,2,415900,5,2.57807e+06,6,0,1123,2.72328e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2023-03-08 07:27:18] [INFO ] Flatten gal took : 7 ms
[2023-03-08 07:27:18] [INFO ] Applying decomposition
[2023-03-08 07:27:18] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13326415158721565997.txt' '-o' '/tmp/graph13326415158721565997.bin' '-w' '/tmp/graph13326415158721565997.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13326415158721565997.bin' '-l' '-1' '-v' '-w' '/tmp/graph13326415158721565997.weights' '-q' '0' '-e' '0.001'
[2023-03-08 07:27:18] [INFO ] Decomposing Gal with order
[2023-03-08 07:27:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 07:27:18] [INFO ] Removed a total of 10 redundant transitions.
[2023-03-08 07:27:18] [INFO ] Flatten gal took : 8 ms
[2023-03-08 07:27:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2023-03-08 07:27:18] [INFO ] Time to serialize gal into /tmp/CTLFireability17706625577028587104.gal : 3 ms
[2023-03-08 07:27:18] [INFO ] Time to serialize properties into /tmp/CTLFireability11915955777515068515.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17706625577028587104.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11915955777515068515.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.71666e+15,0.792744,35968,5148,79,77919,705,685,105442,80,1991,0


Converting to forward existential form...Done !
original formula: (AX(AG(!(A(E((i8.i0.u39.p156==1) U ((i9.i1.u42.p164==1)&&(i9.i1.u49.p190==1))) U EF(((i9.i1.u42.p164==1)&&(i9.i1.u49.p190==1))))))) + AF(...229
=> equivalent forward existential formula: [FwdG((Init * !(!(EX(!(!(E(TRUE U !(!(!((E(!(E(TRUE U ((i9.i1.u42.p164==1)&&(i9.i1.u49.p190==1)))) U (!(E((i8.i0...434
Reverse transition relation is NOT exact ! Due to transitions t0, t50, t54, t56, t58, t87, t131, t172, i0.i1.u31.t79, i0.i2.u14.t109, i1.u9.t115, i2.t119, ...729
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 265/265 places, 218/218 transitions.
Graph (complete) has 479 edges and 265 vertex of which 258 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 257 transition count 195
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 239 transition count 195
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 37 place count 239 transition count 184
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 228 transition count 184
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 71 place count 216 transition count 172
Iterating global reduction 2 with 12 rules applied. Total rules applied 83 place count 216 transition count 172
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 87 place count 216 transition count 168
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 87 place count 216 transition count 167
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 89 place count 215 transition count 167
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 96 place count 208 transition count 160
Iterating global reduction 3 with 7 rules applied. Total rules applied 103 place count 208 transition count 160
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 3 with 6 rules applied. Total rules applied 109 place count 208 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 110 place count 207 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 110 place count 207 transition count 153
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 112 place count 206 transition count 153
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 5 with 128 rules applied. Total rules applied 240 place count 142 transition count 89
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 241 place count 142 transition count 88
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 244 place count 142 transition count 88
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 246 place count 140 transition count 86
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 248 place count 138 transition count 86
Applied a total of 248 rules in 30 ms. Remains 138 /265 variables (removed 127) and now considering 86/218 (removed 132) transitions.
// Phase 1: matrix 86 rows 138 cols
[2023-03-08 07:27:48] [INFO ] Computed 56 place invariants in 1 ms
[2023-03-08 07:27:48] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-08 07:27:48] [INFO ] Invariant cache hit.
[2023-03-08 07:27:48] [INFO ] Implicit Places using invariants and state equation in 120 ms returned [10, 47, 51, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 78, 80, 82, 84, 86, 110, 133]
Discarding 20 places :
Implicit Place search using SMT with State Equation took 201 ms to find 20 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 118/265 places, 86/218 transitions.
Graph (complete) has 243 edges and 118 vertex of which 116 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 114 transition count 74
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 105 transition count 74
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 47 place count 87 transition count 64
Applied a total of 47 rules in 4 ms. Remains 87 /118 variables (removed 31) and now considering 64/86 (removed 22) transitions.
// Phase 1: matrix 64 rows 87 cols
[2023-03-08 07:27:48] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-08 07:27:48] [INFO ] Implicit Places using invariants in 49 ms returned [50, 54, 55, 58, 61, 62, 65, 72, 75]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 50 ms to find 9 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 78/265 places, 64/218 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 78 transition count 63
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 77 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 76 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 76 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 75 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 75 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 73 transition count 58
Applied a total of 10 rules in 3 ms. Remains 73 /78 variables (removed 5) and now considering 58/64 (removed 6) transitions.
// Phase 1: matrix 58 rows 73 cols
[2023-03-08 07:27:48] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-08 07:27:48] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 07:27:48] [INFO ] Invariant cache hit.
[2023-03-08 07:27:49] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 73/265 places, 58/218 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 388 ms. Remains : 73/265 places, 58/218 transitions.
[2023-03-08 07:27:49] [INFO ] Flatten gal took : 2 ms
[2023-03-08 07:27:49] [INFO ] Flatten gal took : 1 ms
[2023-03-08 07:27:49] [INFO ] Input system was already deterministic with 58 transitions.
[2023-03-08 07:27:49] [INFO ] Flatten gal took : 1 ms
[2023-03-08 07:27:49] [INFO ] Flatten gal took : 2 ms
[2023-03-08 07:27:49] [INFO ] Time to serialize gal into /tmp/CTLFireability5810323036896404348.gal : 1 ms
[2023-03-08 07:27:49] [INFO ] Time to serialize properties into /tmp/CTLFireability7929056898537560027.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5810323036896404348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7929056898537560027.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1603e+07,0.066299,6272,2,4149,5,12709,6,0,347,11114,0


Converting to forward existential form...Done !
original formula: EF(((AF(((p81==1)&&(p102==1))) * ((p21!=1)||((p45==1)&&(p126==1)))) + (((p217==1)&&(p192==0))&&(p113==0))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * ((p21!=1)||((p45==1)&&(p126==1)))) * !(EG(!(((p81==1)&&(p102==1))))))] != FALSE + [(FwdU(I...214
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t9, t13, t15, t40, t41, t43, t44, t49, t52, t53, t56, t57, Intersection with rea...231
(forward)formula 0,1,21.2634,721172,1,0,771,4.42407e+06,140,323,2108,5.43008e+06,863
FORMULA DES-PT-01b-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2023-03-08 07:28:10] [INFO ] Flatten gal took : 9 ms
[2023-03-08 07:28:10] [INFO ] Flatten gal took : 4 ms
[2023-03-08 07:28:10] [INFO ] Applying decomposition
[2023-03-08 07:28:10] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8872150650732560525.txt' '-o' '/tmp/graph8872150650732560525.bin' '-w' '/tmp/graph8872150650732560525.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8872150650732560525.bin' '-l' '-1' '-v' '-w' '/tmp/graph8872150650732560525.weights' '-q' '0' '-e' '0.001'
[2023-03-08 07:28:10] [INFO ] Decomposing Gal with order
[2023-03-08 07:28:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 07:28:10] [INFO ] Removed a total of 34 redundant transitions.
[2023-03-08 07:28:10] [INFO ] Flatten gal took : 9 ms
[2023-03-08 07:28:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 2 ms.
[2023-03-08 07:28:10] [INFO ] Time to serialize gal into /tmp/CTLFireability7569470136879685876.gal : 2 ms
[2023-03-08 07:28:10] [INFO ] Time to serialize properties into /tmp/CTLFireability10515823678042763977.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7569470136879685876.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10515823678042763977.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 8 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,9.08917e+16,0.421412,23384,3088,65,43656,835,678,80044,94,3100,0


Converting to forward existential form...Done !
original formula: E(!(((EF((EG((i5.u23.p77==1)) * !(AX((i11.i1.i0.u52.p161==1))))) * (i6.u32.p107==1)) * (i2.u33.p109==1))) U ((i9.u76.p251==1)&&(i0.u83.p2...163
=> equivalent forward existential formula: [(FwdU(Init,!(((E(TRUE U (EG((i5.u23.p77==1)) * !(!(EX(!((i11.i1.i0.u52.p161==1))))))) * (i6.u32.p107==1)) * (i2...221
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t56, t140, t158, i0.u82.t17, i1.t152, i1.u8.t148, i1.u8.t150, i2.t146, i2.u10.t142, ...828
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,42.1886,901992,1,0,2.10006e+06,1287,4026,3.12034e+06,490,5320,1774046
FORMULA DES-PT-01b-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A(((i10.u63.p203==1)&&(i10.u67.p231==1)) U (A(!(AF((((i3.u13.p36==1)&&(i3.u37.p126==1))&&(i11.i1.i0.u52.p161==1)))) U (((AX((i3.u13.p41==...668
Detected timeout of ITS tools.
=> equivalent forward existential formula: [((Init * !(EG(!((!((E(!((((!(EX(!((i3.u13.p41==1)))) * EG(((i4.u17.p57==1)&&(i9.u73.p242==1)))) * (!(EG(!((((i1...3383
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:213)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-08 07:52:02] [INFO ] Applying decomposition
[2023-03-08 07:52:02] [INFO ] Flatten gal took : 5 ms
[2023-03-08 07:52:02] [INFO ] Decomposing Gal with order
[2023-03-08 07:52:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 07:52:02] [INFO ] Removed a total of 20 redundant transitions.
[2023-03-08 07:52:02] [INFO ] Flatten gal took : 9 ms
[2023-03-08 07:52:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 6 ms.
[2023-03-08 07:52:02] [INFO ] Time to serialize gal into /tmp/CTLFireability13808981857914481618.gal : 3 ms
[2023-03-08 07:52:02] [INFO ] Time to serialize properties into /tmp/CTLFireability13254756688877223173.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13808981857914481618.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13254756688877223173.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 7 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,9.08917e+16,16.7674,551264,57828,289,615563,1917,650,5.34722e+06,153,6851,0


Converting to forward existential form...Done !
original formula: A(((i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.u78.p203==1)&&(i1.i1.i0.i1.i0.i0.i1.i0.i1.i0.u93.p231==1)) U (A(!(AF((((i1.i0.i0.i0.i0.i0.u17.p36==1...1308
=> equivalent forward existential formula: [((Init * !(EG(!((!((E(!((((!(EX(!((i1.i0.i0.i0.i0.i0.u17.p41==1)))) * EG(((i1.i0.i0.i0.i0.u18.p57==1)&&(i1.i1.i...7157
Reverse transition relation is NOT exact ! Due to transitions t158, i0.t0, i1.i0.i0.i0.u19.t120, i1.i0.i0.i0.i0.u18.t124, i1.i0.i0.i0.i0.u18.t126, i1.i0.i0...1921
Detected timeout of ITS tools.
[2023-03-08 08:16:21] [INFO ] Flatten gal took : 150 ms
[2023-03-08 08:16:22] [INFO ] Input system was already deterministic with 218 transitions.
[2023-03-08 08:16:22] [INFO ] Transformed 265 places.
[2023-03-08 08:16:22] [INFO ] Transformed 218 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-08 08:16:22] [INFO ] Time to serialize gal into /tmp/CTLFireability5314834839868758939.gal : 9 ms
[2023-03-08 08:16:22] [INFO ] Time to serialize properties into /tmp/CTLFireability9699755306519292760.ctl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5314834839868758939.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9699755306519292760.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15887912 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16156540 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-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-5348"
echo " Executing tool itstools"
echo " Input is DES-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 r101-tall-167814475300370"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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