Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 9.0K Apr 30 00:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 30 00:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 30 00:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 30 00:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 59K May 10 09:33 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 BusinessProcesses-PT-02-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-02-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1652622962888

Running Version 202205111006
[2022-05-15 13:56:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 13:56:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 13:56:04] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2022-05-15 13:56:04] [INFO ] Transformed 262 places.
[2022-05-15 13:56:04] [INFO ] Transformed 219 transitions.
[2022-05-15 13:56:04] [INFO ] Found NUPN structural information;
[2022-05-15 13:56:04] [INFO ] Parsed PT model containing 262 places and 219 transitions in 190 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 87 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 204/204 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 239 transition count 204
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 19 place count 226 transition count 191
Iterating global reduction 1 with 13 rules applied. Total rules applied 32 place count 226 transition count 191
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 223 transition count 188
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 223 transition count 188
Applied a total of 38 rules in 45 ms. Remains 223 /245 variables (removed 22) and now considering 188/204 (removed 16) transitions.
// Phase 1: matrix 188 rows 223 cols
[2022-05-15 13:56:04] [INFO ] Computed 37 place invariants in 26 ms
[2022-05-15 13:56:04] [INFO ] Implicit Places using invariants in 238 ms returned []
// Phase 1: matrix 188 rows 223 cols
[2022-05-15 13:56:04] [INFO ] Computed 37 place invariants in 14 ms
[2022-05-15 13:56:04] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
// Phase 1: matrix 188 rows 223 cols
[2022-05-15 13:56:04] [INFO ] Computed 37 place invariants in 7 ms
[2022-05-15 13:56:04] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 223/245 places, 188/204 transitions.
Finished structural reductions, in 1 iterations. Remains : 223/245 places, 188/204 transitions.
Support contains 87 out of 223 places after structural reductions.
[2022-05-15 13:56:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2022-05-15 13:56:05] [INFO ] Flatten gal took : 41 ms
FORMULA BusinessProcesses-PT-02-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 13:56:05] [INFO ] Flatten gal took : 21 ms
[2022-05-15 13:56:05] [INFO ] Input system was already deterministic with 188 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 551 ms. (steps per millisecond=18 ) properties (out of 60) seen :43
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 188 rows 223 cols
[2022-05-15 13:56:06] [INFO ] Computed 37 place invariants in 7 ms
[2022-05-15 13:56:06] [INFO ] [Real]Absence check using 24 positive place invariants in 5 ms returned sat
[2022-05-15 13:56:06] [INFO ] [Real]Absence check using 24 positive and 13 generalized place invariants in 2 ms returned sat
[2022-05-15 13:56:06] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2022-05-15 13:56:06] [INFO ] [Nat]Absence check using 24 positive place invariants in 13 ms returned sat
[2022-05-15 13:56:06] [INFO ] [Nat]Absence check using 24 positive and 13 generalized place invariants in 2 ms returned sat
[2022-05-15 13:56:06] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :13
[2022-05-15 13:56:07] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 4 ms to minimize.
[2022-05-15 13:56:07] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2022-05-15 13:56:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 127 ms
[2022-05-15 13:56:07] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2022-05-15 13:56:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2022-05-15 13:56:07] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2022-05-15 13:56:07] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2022-05-15 13:56:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
[2022-05-15 13:56:07] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2022-05-15 13:56:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2022-05-15 13:56:07] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2022-05-15 13:56:07] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2022-05-15 13:56:07] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2022-05-15 13:56:07] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2022-05-15 13:56:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 216 ms
[2022-05-15 13:56:07] [INFO ] After 915ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :12
Attempting to minimize the solution found.
Minimization took 126 ms.
[2022-05-15 13:56:07] [INFO ] After 1247ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :12
Fused 17 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 97 ms.
Support contains 25 out of 223 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 223/223 places, 188/188 transitions.
Graph (complete) has 421 edges and 223 vertex of which 218 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 218 transition count 157
Reduce places removed 25 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 32 rules applied. Total rules applied 59 place count 193 transition count 150
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 66 place count 186 transition count 150
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 66 place count 186 transition count 115
Deduced a syphon composed of 35 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 142 place count 145 transition count 115
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 154 place count 133 transition count 103
Iterating global reduction 3 with 12 rules applied. Total rules applied 166 place count 133 transition count 103
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 236 place count 97 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 237 place count 97 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 238 place count 96 transition count 67
Applied a total of 238 rules in 39 ms. Remains 96 /223 variables (removed 127) and now considering 67/188 (removed 121) transitions.
Finished structural reductions, in 1 iterations. Remains : 96/223 places, 67/188 transitions.
Incomplete random walk after 10000 steps, including 522 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 124 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 132 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 131 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 137 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 133 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 137 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 67 rows 96 cols
[2022-05-15 13:56:08] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-15 13:56:08] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-15 13:56:08] [INFO ] [Nat]Absence check using 25 positive place invariants in 4 ms returned sat
[2022-05-15 13:56:08] [INFO ] [Nat]Absence check using 25 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-15 13:56:09] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-05-15 13:56:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 13:56:09] [INFO ] After 51ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-05-15 13:56:09] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2022-05-15 13:56:09] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2022-05-15 13:56:09] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2022-05-15 13:56:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 113 ms
[2022-05-15 13:56:09] [INFO ] After 232ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 37 ms.
[2022-05-15 13:56:09] [INFO ] After 420ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 16 out of 96 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 96/96 places, 67/67 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 96 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 95 transition count 66
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 95 transition count 63
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 92 transition count 63
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 90 transition count 61
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 90 transition count 61
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 28 place count 82 transition count 53
Applied a total of 28 rules in 9 ms. Remains 82 /96 variables (removed 14) and now considering 53/67 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 82/96 places, 53/67 transitions.
Incomplete random walk after 10000 steps, including 688 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 171 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 82 cols
[2022-05-15 13:56:09] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-15 13:56:09] [INFO ] [Real]Absence check using 25 positive place invariants in 4 ms returned sat
[2022-05-15 13:56:09] [INFO ] [Real]Absence check using 25 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-15 13:56:09] [INFO ] After 21ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-15 13:56:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 13:56:09] [INFO ] After 4ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2022-05-15 13:56:09] [INFO ] After 10ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-15 13:56:09] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 82/82 places, 53/53 transitions.
Graph (trivial) has 18 edges and 82 vertex of which 2 / 82 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 81 transition count 47
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 77 transition count 47
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 9 place count 77 transition count 43
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 71 transition count 43
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 69 transition count 41
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 69 transition count 41
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 37 place count 62 transition count 34
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 62 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 61 transition count 33
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 61 transition count 33
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 59 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 58 transition count 31
Applied a total of 43 rules in 15 ms. Remains 58 /82 variables (removed 24) and now considering 31/53 (removed 22) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/82 places, 31/53 transitions.
Incomplete random walk after 10000 steps, including 438 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Finished Best-First random walk after 247 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=247 )
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
[2022-05-15 13:56:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2022-05-15 13:56:09] [INFO ] Flatten gal took : 13 ms
FORMULA BusinessProcesses-PT-02-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 13:56:09] [INFO ] Flatten gal took : 12 ms
[2022-05-15 13:56:09] [INFO ] Input system was already deterministic with 188 transitions.
Computed a total of 215 stabilizing places and 178 stable transitions
Graph (complete) has 421 edges and 223 vertex of which 218 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 188/188 transitions.
Graph (complete) has 421 edges and 223 vertex of which 218 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 217 transition count 150
Reduce places removed 32 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 185 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 183 transition count 148
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 69 place count 183 transition count 100
Deduced a syphon composed of 48 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 173 place count 127 transition count 100
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 196 place count 104 transition count 77
Iterating global reduction 3 with 23 rules applied. Total rules applied 219 place count 104 transition count 77
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 299 place count 63 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 300 place count 62 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 301 place count 61 transition count 37
Applied a total of 301 rules in 20 ms. Remains 61 /223 variables (removed 162) and now considering 37/188 (removed 151) transitions.
// Phase 1: matrix 37 rows 61 cols
[2022-05-15 13:56:09] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-15 13:56:09] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 37 rows 61 cols
[2022-05-15 13:56:09] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-15 13:56:09] [INFO ] Implicit Places using invariants and state equation in 69 ms returned [5, 7, 9, 12, 13, 14, 15, 16, 18, 20, 22, 23, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 125 ms to find 22 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 39/223 places, 37/188 transitions.
Graph (complete) has 77 edges and 39 vertex of which 37 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
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 37 transition count 30
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 31 transition count 30
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 29 transition count 28
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 29 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 22 place count 26 transition count 26
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 25 transition count 25
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 25 transition count 25
Applied a total of 24 rules in 5 ms. Remains 25 /39 variables (removed 14) and now considering 25/37 (removed 12) transitions.
// Phase 1: matrix 25 rows 25 cols
[2022-05-15 13:56:09] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-15 13:56:09] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2022-05-15 13:56:09] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 13:56:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 13:56:09] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 25/223 places, 25/188 transitions.
Finished structural reductions, in 2 iterations. Remains : 25/223 places, 25/188 transitions.
[2022-05-15 13:56:09] [INFO ] Flatten gal took : 2 ms
[2022-05-15 13:56:09] [INFO ] Flatten gal took : 3 ms
[2022-05-15 13:56:09] [INFO ] Input system was already deterministic with 25 transitions.
[2022-05-15 13:56:09] [INFO ] Flatten gal took : 2 ms
[2022-05-15 13:56:09] [INFO ] Flatten gal took : 2 ms
[2022-05-15 13:56:09] [INFO ] Time to serialize gal into /tmp/CTLFireability16516446897826833160.gal : 1 ms
[2022-05-15 13:56:09] [INFO ] Time to serialize properties into /tmp/CTLFireability17771180712184742484.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16516446897826833160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17771180712184742484.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,207,0.011211,4380,2,114,5,620,6,0,123,625,0


Converting to forward existential form...Done !
original formula: AG((EG(EF((p255==0))) * (((p28==0)||(p163==0))||(p255==0))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG(E(TRUE U (p255==0)))))] = FALSE * [(FwdU(Init,TRUE) * !((((p28==0)||(p163==0))||(p255=...171
(forward)formula 0,0,0.012103,5036,1,0,7,620,9,2,140,625,1
FORMULA BusinessProcesses-PT-02-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 188/188 transitions.
Graph (trivial) has 120 edges and 223 vertex of which 4 / 223 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 418 edges and 220 vertex of which 218 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 217 transition count 143
Reduce places removed 39 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 178 transition count 141
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 84 place count 176 transition count 141
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 84 place count 176 transition count 102
Deduced a syphon composed of 39 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 170 place count 129 transition count 102
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 191 place count 108 transition count 81
Iterating global reduction 3 with 21 rules applied. Total rules applied 212 place count 108 transition count 81
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 298 place count 64 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 299 place count 63 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 300 place count 62 transition count 38
Applied a total of 300 rules in 19 ms. Remains 62 /223 variables (removed 161) and now considering 38/188 (removed 150) transitions.
// Phase 1: matrix 38 rows 62 cols
[2022-05-15 13:56:09] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-15 13:56:09] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 38 rows 62 cols
[2022-05-15 13:56:09] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-15 13:56:10] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [0, 1, 2, 3, 5, 7, 10, 11, 12, 13, 14, 18, 20, 22, 23, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42]
Discarding 25 places :
Implicit Place search using SMT with State Equation took 111 ms to find 25 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 37/223 places, 38/188 transitions.
Graph (complete) has 69 edges and 37 vertex of which 35 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
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 35 transition count 31
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 29 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 27 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 27 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 22 place count 24 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 24 transition count 26
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 24 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 25 place count 23 transition count 25
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 26 place count 23 transition count 25
Applied a total of 26 rules in 5 ms. Remains 23 /37 variables (removed 14) and now considering 25/38 (removed 13) transitions.
// Phase 1: matrix 25 rows 23 cols
[2022-05-15 13:56:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 13:56:10] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 25 rows 23 cols
[2022-05-15 13:56:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 13:56:10] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 23/223 places, 25/188 transitions.
Finished structural reductions, in 2 iterations. Remains : 23/223 places, 25/188 transitions.
[2022-05-15 13:56:10] [INFO ] Flatten gal took : 2 ms
[2022-05-15 13:56:10] [INFO ] Flatten gal took : 1 ms
[2022-05-15 13:56:10] [INFO ] Input system was already deterministic with 25 transitions.
[2022-05-15 13:56:10] [INFO ] Flatten gal took : 1 ms
[2022-05-15 13:56:10] [INFO ] Flatten gal took : 2 ms
[2022-05-15 13:56:10] [INFO ] Time to serialize gal into /tmp/CTLFireability9297910367819154070.gal : 1 ms
[2022-05-15 13:56:10] [INFO ] Time to serialize properties into /tmp/CTLFireability14003353543659359585.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9297910367819154070.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14003353543659359585.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,267,0.006978,4572,2,123,5,643,6,0,115,563,0


Converting to forward existential form...Done !
original formula: AG(!(A(A(((p230==1)||(p223==1)) U (p206==1)) U (p120==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!((p120==1))))) * !(E(!((p120==1)) U (!(!((E(!((p206==1)) U (!(((p230==1)||(p223==1)))...222
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t6, t14, t22, Intersection with reachable at each step enabled. (destroyed/reverse/i...181
(forward)formula 0,0,0.041236,6652,1,0,131,10714,82,83,655,11391,165
FORMULA BusinessProcesses-PT-02-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 188/188 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 199 transition count 164
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 199 transition count 164
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 190 transition count 155
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 190 transition count 155
Applied a total of 66 rules in 17 ms. Remains 190 /223 variables (removed 33) and now considering 155/188 (removed 33) transitions.
// Phase 1: matrix 155 rows 190 cols
[2022-05-15 13:56:10] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:56:10] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 155 rows 190 cols
[2022-05-15 13:56:10] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:56:10] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
// Phase 1: matrix 155 rows 190 cols
[2022-05-15 13:56:10] [INFO ] Computed 37 place invariants in 4 ms
[2022-05-15 13:56:10] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 190/223 places, 155/188 transitions.
Finished structural reductions, in 1 iterations. Remains : 190/223 places, 155/188 transitions.
[2022-05-15 13:56:10] [INFO ] Flatten gal took : 8 ms
[2022-05-15 13:56:10] [INFO ] Flatten gal took : 8 ms
[2022-05-15 13:56:10] [INFO ] Input system was already deterministic with 155 transitions.
[2022-05-15 13:56:10] [INFO ] Flatten gal took : 7 ms
[2022-05-15 13:56:10] [INFO ] Flatten gal took : 7 ms
[2022-05-15 13:56:10] [INFO ] Time to serialize gal into /tmp/CTLFireability3906635413718179831.gal : 3 ms
[2022-05-15 13:56:10] [INFO ] Time to serialize properties into /tmp/CTLFireability7385021900125159910.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3906635413718179831.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7385021900125159910.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46352e+12,0.276146,16788,2,13085,5,41106,6,0,915,37734,0


Converting to forward existential form...Done !
original formula: A(EX((p97==1)) U EF(((EF((p12==1)) * (p255==1)) * AG(!(E((p161==1) U (p198==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U ((E(TRUE U (p12==1)) * (p255==1)) * !(E(TRUE U !(!(E((p161==1) U (p198==1)))))))))))) ...383
Reverse transition relation is NOT exact ! Due to transitions t2, t17, t20, t26, t30, t33, t36, t39, t42, t45, t48, t51, t54, t57, t66, t69, t72, t74, t77,...339
Detected timeout of ITS tools.
[2022-05-15 13:56:40] [INFO ] Flatten gal took : 9 ms
[2022-05-15 13:56:40] [INFO ] Applying decomposition
[2022-05-15 13:56:40] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11493639370150313362.txt' '-o' '/tmp/graph11493639370150313362.bin' '-w' '/tmp/graph11493639370150313362.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11493639370150313362.bin' '-l' '-1' '-v' '-w' '/tmp/graph11493639370150313362.weights' '-q' '0' '-e' '0.001'
[2022-05-15 13:56:40] [INFO ] Decomposing Gal with order
[2022-05-15 13:56:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 13:56:40] [INFO ] Removed a total of 30 redundant transitions.
[2022-05-15 13:56:40] [INFO ] Flatten gal took : 89 ms
[2022-05-15 13:56:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2022-05-15 13:56:40] [INFO ] Time to serialize gal into /tmp/CTLFireability2271296209120147388.gal : 7 ms
[2022-05-15 13:56:40] [INFO ] Time to serialize properties into /tmp/CTLFireability788167588839177736.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2271296209120147388.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability788167588839177736.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...252
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.46352e+12,0.079116,7884,920,43,6620,544,413,7429,52,1093,0


Converting to forward existential form...Done !
original formula: A(EX((i9.i0.u32.p97==1)) U EF(((EF((i3.u5.p12==1)) * (i15.u56.p255==1)) * AG(!(E((i11.u47.p161==1) U (i15.u54.p198==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U ((E(TRUE U (i3.u5.p12==1)) * (i15.u56.p255==1)) * !(E(TRUE U !(!(E((i11.u47.p161==1) U...483
Reverse transition relation is NOT exact ! Due to transitions t94, t98, t104, t114, i1.u24.t89, i2.u22.t93, i2.u50.t39, i3.t110, i3.u6.t120, i3.u10.t113, i...557
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,1,6.5348,199724,1,0,387669,1703,2795,865153,297,10275,416956
FORMULA BusinessProcesses-PT-02-CTLFireability-02 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 : 223/223 places, 188/188 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 201 transition count 166
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 201 transition count 166
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 54 place count 191 transition count 156
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 191 transition count 156
Applied a total of 64 rules in 11 ms. Remains 191 /223 variables (removed 32) and now considering 156/188 (removed 32) transitions.
// Phase 1: matrix 156 rows 191 cols
[2022-05-15 13:56:47] [INFO ] Computed 37 place invariants in 3 ms
[2022-05-15 13:56:47] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 156 rows 191 cols
[2022-05-15 13:56:47] [INFO ] Computed 37 place invariants in 9 ms
[2022-05-15 13:56:47] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
// Phase 1: matrix 156 rows 191 cols
[2022-05-15 13:56:47] [INFO ] Computed 37 place invariants in 16 ms
[2022-05-15 13:56:47] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 191/223 places, 156/188 transitions.
Finished structural reductions, in 1 iterations. Remains : 191/223 places, 156/188 transitions.
[2022-05-15 13:56:47] [INFO ] Flatten gal took : 7 ms
[2022-05-15 13:56:47] [INFO ] Flatten gal took : 7 ms
[2022-05-15 13:56:47] [INFO ] Input system was already deterministic with 156 transitions.
[2022-05-15 13:56:47] [INFO ] Flatten gal took : 6 ms
[2022-05-15 13:56:47] [INFO ] Flatten gal took : 6 ms
[2022-05-15 13:56:47] [INFO ] Time to serialize gal into /tmp/CTLFireability8704627496016076602.gal : 2 ms
[2022-05-15 13:56:47] [INFO ] Time to serialize properties into /tmp/CTLFireability16873803323895975362.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8704627496016076602.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16873803323895975362.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.47495e+12,0.292368,17248,2,13526,5,41746,6,0,920,37392,0


Converting to forward existential form...Done !
original formula: AX(((p109==1) + (AG(((((p50==1)&&(p53==1))&&(p3==1))||((p211==0)&&(p132==0)))) * EG(AG((p229==0))))))
=> equivalent forward existential formula: ([(FwdU((EY(Init) * !((p109==1))),TRUE) * !(((((p50==1)&&(p53==1))&&(p3==1))||((p211==0)&&(p132==0)))))] = FALSE...231
Reverse transition relation is NOT exact ! Due to transitions t2, t14, t18, t21, t26, t30, t33, t36, t39, t42, t45, t48, t51, t54, t57, t67, t68, t70, t73,...349
Detected timeout of ITS tools.
[2022-05-15 13:57:17] [INFO ] Flatten gal took : 9 ms
[2022-05-15 13:57:17] [INFO ] Applying decomposition
[2022-05-15 13:57:17] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17400160131388235877.txt' '-o' '/tmp/graph17400160131388235877.bin' '-w' '/tmp/graph17400160131388235877.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17400160131388235877.bin' '-l' '-1' '-v' '-w' '/tmp/graph17400160131388235877.weights' '-q' '0' '-e' '0.001'
[2022-05-15 13:57:17] [INFO ] Decomposing Gal with order
[2022-05-15 13:57:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 13:57:18] [INFO ] Removed a total of 31 redundant transitions.
[2022-05-15 13:57:18] [INFO ] Flatten gal took : 23 ms
[2022-05-15 13:57:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2022-05-15 13:57:18] [INFO ] Time to serialize gal into /tmp/CTLFireability11983862453354563642.gal : 8 ms
[2022-05-15 13:57:18] [INFO ] Time to serialize properties into /tmp/CTLFireability10418643268865983351.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11983862453354563642.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10418643268865983351.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.47495e+12,0.155796,8604,923,47,7697,467,423,8981,55,1244,0


Converting to forward existential form...Done !
original formula: AX(((i13.u36.p109==1) + (AG(((((i5.u17.p50==1)&&(i5.u18.p53==1))&&(i0.u1.p3==1))||((i16.u56.p211==0)&&(i3.i1.u41.p132==0)))) * EG(AG((i16...173
=> equivalent forward existential formula: ([(FwdU((EY(Init) * !((i13.u36.p109==1))),TRUE) * !(((((i5.u17.p50==1)&&(i5.u18.p53==1))&&(i0.u1.p3==1))||((i16....293
Reverse transition relation is NOT exact ! Due to transitions t95, t99, t105, t115, i0.u25.t86, i1.u27.t82, i2.t111, i2.u7.t118, i2.u9.t114, i3.i0.u5.t121,...584
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,0,4.39659,146472,1,0,302215,1382,2719,421847,286,7069,360441
FORMULA BusinessProcesses-PT-02-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 188/188 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 200 transition count 165
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 200 transition count 165
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 55 place count 191 transition count 156
Iterating global reduction 0 with 9 rules applied. Total rules applied 64 place count 191 transition count 156
Applied a total of 64 rules in 19 ms. Remains 191 /223 variables (removed 32) and now considering 156/188 (removed 32) transitions.
// Phase 1: matrix 156 rows 191 cols
[2022-05-15 13:57:22] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:57:22] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 156 rows 191 cols
[2022-05-15 13:57:22] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:57:22] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
// Phase 1: matrix 156 rows 191 cols
[2022-05-15 13:57:22] [INFO ] Computed 37 place invariants in 0 ms
[2022-05-15 13:57:23] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 191/223 places, 156/188 transitions.
Finished structural reductions, in 1 iterations. Remains : 191/223 places, 156/188 transitions.
[2022-05-15 13:57:23] [INFO ] Flatten gal took : 6 ms
[2022-05-15 13:57:23] [INFO ] Flatten gal took : 6 ms
[2022-05-15 13:57:23] [INFO ] Input system was already deterministic with 156 transitions.
[2022-05-15 13:57:23] [INFO ] Flatten gal took : 7 ms
[2022-05-15 13:57:23] [INFO ] Flatten gal took : 5 ms
[2022-05-15 13:57:23] [INFO ] Time to serialize gal into /tmp/CTLFireability9476870511200840219.gal : 21 ms
[2022-05-15 13:57:23] [INFO ] Time to serialize properties into /tmp/CTLFireability2971646351999819673.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9476870511200840219.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2971646351999819673.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46461e+12,0.310765,17164,2,13145,5,41641,6,0,920,40182,0


Converting to forward existential form...Done !
original formula: A((A((p222==1) U ((p145==1) + EF(((p171==1)||(p258==1))))) + (!(E(!(AG((p190==1))) U AF((p19==1)))) * AX(FALSE))) U (AX((((p66==1)&&(p169...190
=> equivalent forward existential formula: [((Init * !(EG(!((!(EX(!((((p66==1)&&(p169==1))&&(p239==1))))) + E(TRUE U (p61==1))))))) * !(E(!((!(EX(!((((p66=...564
Reverse transition relation is NOT exact ! Due to transitions t2, t16, t21, t26, t30, t34, t35, t37, t40, t43, t46, t49, t52, t55, t58, t67, t70, t73, t75,...344
Using saturation style SCC detection
Detected timeout of ITS tools.
[2022-05-15 13:57:53] [INFO ] Flatten gal took : 10 ms
[2022-05-15 13:57:53] [INFO ] Applying decomposition
[2022-05-15 13:57:53] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4528605647118906417.txt' '-o' '/tmp/graph4528605647118906417.bin' '-w' '/tmp/graph4528605647118906417.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4528605647118906417.bin' '-l' '-1' '-v' '-w' '/tmp/graph4528605647118906417.weights' '-q' '0' '-e' '0.001'
[2022-05-15 13:57:53] [INFO ] Decomposing Gal with order
[2022-05-15 13:57:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 13:57:53] [INFO ] Removed a total of 29 redundant transitions.
[2022-05-15 13:57:53] [INFO ] Flatten gal took : 11 ms
[2022-05-15 13:57:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-15 13:57:53] [INFO ] Time to serialize gal into /tmp/CTLFireability9695593503942636655.gal : 16 ms
[2022-05-15 13:57:53] [INFO ] Time to serialize properties into /tmp/CTLFireability4824771716840088855.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9695593503942636655.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4824771716840088855.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46461e+12,0.086897,7444,874,45,5512,713,394,5878,56,1584,0


Converting to forward existential form...Done !
original formula: A((A((i17.u57.p222==1) U ((i14.u41.p145==1) + EF(((i12.u47.p171==1)||(i17.u65.p258==1))))) + (!(E(!(AG((i16.i1.u51.p190==1))) U AF((u6.p1...269
=> equivalent forward existential formula: [((Init * !(EG(!((!(EX(!((((i2.u21.p66==1)&&(i13.u46.p169==1))&&(i2.u61.p239==1))))) + E(TRUE U (i16.i0.u19.p61=...757
Reverse transition relation is NOT exact ! Due to transitions t95, t99, t111, t115, i1.u24.t86, i2.u20.t94, i3.t105, i3.u5.t121, i3.u11.t110, i5.u7.t118, i...572
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,1,6.23831,202068,1,0,441519,1246,2752,557828,320,5672,536179
FORMULA BusinessProcesses-PT-02-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 188/188 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 198 transition count 163
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 198 transition count 163
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 60 place count 188 transition count 153
Iterating global reduction 0 with 10 rules applied. Total rules applied 70 place count 188 transition count 153
Applied a total of 70 rules in 19 ms. Remains 188 /223 variables (removed 35) and now considering 153/188 (removed 35) transitions.
// Phase 1: matrix 153 rows 188 cols
[2022-05-15 13:57:59] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:57:59] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 153 rows 188 cols
[2022-05-15 13:57:59] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-15 13:57:59] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
// Phase 1: matrix 153 rows 188 cols
[2022-05-15 13:57:59] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-15 13:58:00] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/223 places, 153/188 transitions.
Finished structural reductions, in 1 iterations. Remains : 188/223 places, 153/188 transitions.
[2022-05-15 13:58:00] [INFO ] Flatten gal took : 5 ms
[2022-05-15 13:58:00] [INFO ] Flatten gal took : 5 ms
[2022-05-15 13:58:00] [INFO ] Input system was already deterministic with 153 transitions.
[2022-05-15 13:58:00] [INFO ] Flatten gal took : 5 ms
[2022-05-15 13:58:00] [INFO ] Flatten gal took : 5 ms
[2022-05-15 13:58:00] [INFO ] Time to serialize gal into /tmp/CTLFireability10709569295123605207.gal : 1 ms
[2022-05-15 13:58:00] [INFO ] Time to serialize properties into /tmp/CTLFireability4192558135206122258.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10709569295123605207.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4192558135206122258.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46025e+12,0.323484,16784,2,13010,5,40610,6,0,905,37181,0


Converting to forward existential form...Done !
original formula: AX(!(A(((p86==1)&&(!(((p156==1)&&(p63==1))&&((p178==1)&&(p255==1))))) U EG(AF((p44==1))))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(EG(!(EG(!((p44==1))))))))) * !(E(!(EG(!(EG(!((p44==1)))))) U (!(((p86==1)&&(!(((p156==1)&&(...232
Reverse transition relation is NOT exact ! Due to transitions t2, t19, t24, t28, t31, t34, t37, t40, t43, t46, t49, t52, t55, t64, t67, t70, t72, t75, t79,...334
Detected timeout of ITS tools.
[2022-05-15 13:58:30] [INFO ] Flatten gal took : 6 ms
[2022-05-15 13:58:30] [INFO ] Applying decomposition
[2022-05-15 13:58:30] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1634167465219508895.txt' '-o' '/tmp/graph1634167465219508895.bin' '-w' '/tmp/graph1634167465219508895.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1634167465219508895.bin' '-l' '-1' '-v' '-w' '/tmp/graph1634167465219508895.weights' '-q' '0' '-e' '0.001'
[2022-05-15 13:58:30] [INFO ] Decomposing Gal with order
[2022-05-15 13:58:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 13:58:30] [INFO ] Removed a total of 29 redundant transitions.
[2022-05-15 13:58:30] [INFO ] Flatten gal took : 9 ms
[2022-05-15 13:58:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-15 13:58:30] [INFO ] Time to serialize gal into /tmp/CTLFireability17893362790970748166.gal : 2 ms
[2022-05-15 13:58:30] [INFO ] Time to serialize properties into /tmp/CTLFireability11952204529283823476.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17893362790970748166.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11952204529283823476.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46025e+12,0.075776,7824,969,60,6547,516,426,7007,59,1229,0


Converting to forward existential form...Done !
original formula: AX(!(A(((i15.u26.p86==1)&&(!(((i0.u45.p156==1)&&(i4.u21.p63==1))&&((i10.u49.p178==1)&&(i13.u53.p255==1))))) U EG(AF((i2.u13.p44==1))))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(EG(!(EG(!((i2.u13.p44==1))))))))) * !(E(!(EG(!(EG(!((i2.u13.p44==1)))))) U (!(((i15.u26.p86...291
Reverse transition relation is NOT exact ! Due to transitions t92, t96, t102, t112, i0.t108, i0.u7.t115, i0.u9.t111, i0.u45.t49, i1.u5.t118, i2.u11.t107, i...558
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,9.29964,250088,1,0,453144,2279,2806,793103,319,11589,496945
FORMULA BusinessProcesses-PT-02-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 188/188 transitions.
Graph (trivial) has 123 edges and 223 vertex of which 7 / 223 are part of one of the 1 SCC in 10 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 414 edges and 217 vertex of which 212 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 211 transition count 134
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 84 place count 170 transition count 134
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 84 place count 170 transition count 97
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 166 place count 125 transition count 97
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 187 place count 104 transition count 76
Iterating global reduction 2 with 21 rules applied. Total rules applied 208 place count 104 transition count 76
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 294 place count 60 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 295 place count 59 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 296 place count 58 transition count 33
Applied a total of 296 rules in 30 ms. Remains 58 /223 variables (removed 165) and now considering 33/188 (removed 155) transitions.
// Phase 1: matrix 33 rows 58 cols
[2022-05-15 13:58:39] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-15 13:58:39] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 33 rows 58 cols
[2022-05-15 13:58:39] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-15 13:58:39] [INFO ] Implicit Places using invariants and state equation in 78 ms returned [0, 1, 2, 3, 5, 7, 10, 11, 12, 13, 14, 16, 18, 20, 21, 26, 28, 30, 32, 34, 36, 38, 40, 42]
Discarding 24 places :
Implicit Place search using SMT with State Equation took 158 ms to find 24 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 34/223 places, 33/188 transitions.
Graph (complete) has 68 edges and 34 vertex of which 32 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
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 32 transition count 27
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 27 transition count 27
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 26 transition count 26
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 26 transition count 26
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 20 place count 22 transition count 23
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 2 with 2 rules applied. Total rules applied 22 place count 21 transition count 22
Applied a total of 22 rules in 6 ms. Remains 21 /34 variables (removed 13) and now considering 22/33 (removed 11) transitions.
// Phase 1: matrix 22 rows 21 cols
[2022-05-15 13:58:39] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 13:58:39] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 22 rows 21 cols
[2022-05-15 13:58:39] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 13:58:39] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 21/223 places, 22/188 transitions.
Finished structural reductions, in 2 iterations. Remains : 21/223 places, 22/188 transitions.
[2022-05-15 13:58:39] [INFO ] Flatten gal took : 2 ms
[2022-05-15 13:58:39] [INFO ] Flatten gal took : 1 ms
[2022-05-15 13:58:39] [INFO ] Input system was already deterministic with 22 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
FORMULA BusinessProcesses-PT-02-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 188/188 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 198 transition count 163
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 198 transition count 163
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 60 place count 188 transition count 153
Iterating global reduction 0 with 10 rules applied. Total rules applied 70 place count 188 transition count 153
Applied a total of 70 rules in 5 ms. Remains 188 /223 variables (removed 35) and now considering 153/188 (removed 35) transitions.
// Phase 1: matrix 153 rows 188 cols
[2022-05-15 13:58:39] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:58:40] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 153 rows 188 cols
[2022-05-15 13:58:40] [INFO ] Computed 37 place invariants in 7 ms
[2022-05-15 13:58:40] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
// Phase 1: matrix 153 rows 188 cols
[2022-05-15 13:58:40] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:58:40] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/223 places, 153/188 transitions.
Finished structural reductions, in 1 iterations. Remains : 188/223 places, 153/188 transitions.
[2022-05-15 13:58:40] [INFO ] Flatten gal took : 5 ms
[2022-05-15 13:58:40] [INFO ] Flatten gal took : 5 ms
[2022-05-15 13:58:40] [INFO ] Input system was already deterministic with 153 transitions.
[2022-05-15 13:58:40] [INFO ] Flatten gal took : 4 ms
[2022-05-15 13:58:40] [INFO ] Flatten gal took : 5 ms
[2022-05-15 13:58:40] [INFO ] Time to serialize gal into /tmp/CTLFireability17566277118397504836.gal : 1 ms
[2022-05-15 13:58:40] [INFO ] Time to serialize properties into /tmp/CTLFireability12202831162510897715.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17566277118397504836.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12202831162510897715.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...276
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46025e+12,0.294849,16600,2,13010,5,40610,6,0,905,37181,0


Converting to forward existential form...Done !
original formula: AX(AX(!(A(EG((p102==1)) U (((p49==1)&&(p179==1))&&(p256==1))))))
=> equivalent forward existential formula: [((EY(EY(Init)) * !(EG(!((((p49==1)&&(p179==1))&&(p256==1)))))) * !(E(!((((p49==1)&&(p179==1))&&(p256==1))) U (!...223
Reverse transition relation is NOT exact ! Due to transitions t2, t19, t24, t28, t31, t34, t37, t40, t43, t46, t49, t52, t55, t64, t67, t70, t72, t75, t79,...334
Detected timeout of ITS tools.
[2022-05-15 13:59:10] [INFO ] Flatten gal took : 5 ms
[2022-05-15 13:59:10] [INFO ] Applying decomposition
[2022-05-15 13:59:10] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18381800168909010076.txt' '-o' '/tmp/graph18381800168909010076.bin' '-w' '/tmp/graph18381800168909010076.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18381800168909010076.bin' '-l' '-1' '-v' '-w' '/tmp/graph18381800168909010076.weights' '-q' '0' '-e' '0.001'
[2022-05-15 13:59:10] [INFO ] Decomposing Gal with order
[2022-05-15 13:59:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 13:59:10] [INFO ] Removed a total of 31 redundant transitions.
[2022-05-15 13:59:10] [INFO ] Flatten gal took : 10 ms
[2022-05-15 13:59:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2022-05-15 13:59:10] [INFO ] Time to serialize gal into /tmp/CTLFireability3022302619041639829.gal : 2 ms
[2022-05-15 13:59:10] [INFO ] Time to serialize properties into /tmp/CTLFireability13477404799725381579.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3022302619041639829.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13477404799725381579.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46025e+12,0.122397,9772,1530,45,10208,642,399,13055,52,1483,0


Converting to forward existential form...Done !
original formula: AX(AX(!(A(EG((i1.u1.p102==1)) U (((i8.u18.p49==1)&&(i10.u50.p179==1))&&(i8.u59.p256==1))))))
=> equivalent forward existential formula: [((EY(EY(Init)) * !(EG(!((((i8.u18.p49==1)&&(i10.u50.p179==1))&&(i8.u59.p256==1)))))) * !(E(!((((i8.u18.p49==1)&...295
Reverse transition relation is NOT exact ! Due to transitions t96, t102, t112, i0.i1.u31.t75, i1.u52.t31, i1.u53.t28, i2.u27.t83, i2.u29.t79, i3.u25.t87, i...547
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,12.6723,303396,1,0,524498,1981,2640,1.02967e+06,280,12552,627608
FORMULA BusinessProcesses-PT-02-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 188/188 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 200 transition count 165
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 200 transition count 165
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 55 place count 191 transition count 156
Iterating global reduction 0 with 9 rules applied. Total rules applied 64 place count 191 transition count 156
Applied a total of 64 rules in 5 ms. Remains 191 /223 variables (removed 32) and now considering 156/188 (removed 32) transitions.
// Phase 1: matrix 156 rows 191 cols
[2022-05-15 13:59:23] [INFO ] Computed 37 place invariants in 10 ms
[2022-05-15 13:59:23] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 156 rows 191 cols
[2022-05-15 13:59:23] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-15 13:59:23] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
// Phase 1: matrix 156 rows 191 cols
[2022-05-15 13:59:23] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-15 13:59:23] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 191/223 places, 156/188 transitions.
Finished structural reductions, in 1 iterations. Remains : 191/223 places, 156/188 transitions.
[2022-05-15 13:59:23] [INFO ] Flatten gal took : 13 ms
[2022-05-15 13:59:23] [INFO ] Flatten gal took : 9 ms
[2022-05-15 13:59:23] [INFO ] Input system was already deterministic with 156 transitions.
[2022-05-15 13:59:23] [INFO ] Flatten gal took : 5 ms
[2022-05-15 13:59:23] [INFO ] Flatten gal took : 7 ms
[2022-05-15 13:59:23] [INFO ] Time to serialize gal into /tmp/CTLFireability6930787912513486241.gal : 1 ms
[2022-05-15 13:59:23] [INFO ] Time to serialize properties into /tmp/CTLFireability3814025901931309905.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6930787912513486241.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3814025901931309905.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46025e+12,0.285669,16844,2,13349,5,41491,6,0,920,38101,0


Converting to forward existential form...Done !
original formula: AF((AF((AG((p201==0)) + (p31==1))) * E(EX(EX((p167==1))) U AX(EX((p161==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!((!(E(TRUE U !((p201==0)))) + (p31==1))))) * E(EX(EX((p167==1))) U !(EX(!(EX((p161==1)))))))...166
Reverse transition relation is NOT exact ! Due to transitions t2, t19, t24, t28, t31, t34, t37, t40, t44, t45, t47, t50, t53, t56, t65, t68, t71, t73, t76,...345
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,25.3084,729868,1,0,876,2.88307e+06,352,532,5629,3.52251e+06,714
FORMULA BusinessProcesses-PT-02-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 188/188 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 201 transition count 166
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 201 transition count 166
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 53 place count 192 transition count 157
Iterating global reduction 0 with 9 rules applied. Total rules applied 62 place count 192 transition count 157
Applied a total of 62 rules in 7 ms. Remains 192 /223 variables (removed 31) and now considering 157/188 (removed 31) transitions.
// Phase 1: matrix 157 rows 192 cols
[2022-05-15 13:59:49] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:59:49] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 157 rows 192 cols
[2022-05-15 13:59:49] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:59:49] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
// Phase 1: matrix 157 rows 192 cols
[2022-05-15 13:59:49] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 13:59:49] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 192/223 places, 157/188 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/223 places, 157/188 transitions.
[2022-05-15 13:59:49] [INFO ] Flatten gal took : 4 ms
[2022-05-15 13:59:49] [INFO ] Flatten gal took : 4 ms
[2022-05-15 13:59:49] [INFO ] Input system was already deterministic with 157 transitions.
[2022-05-15 13:59:49] [INFO ] Flatten gal took : 5 ms
[2022-05-15 13:59:49] [INFO ] Flatten gal took : 4 ms
[2022-05-15 13:59:49] [INFO ] Time to serialize gal into /tmp/CTLFireability2655181241380415640.gal : 1 ms
[2022-05-15 13:59:49] [INFO ] Time to serialize properties into /tmp/CTLFireability567700848686440280.ctl : 73 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2655181241380415640.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability567700848686440280.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...273
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46025e+12,0.302187,17424,2,13463,5,42083,6,0,925,40085,0


Converting to forward existential form...Done !
original formula: EX(((AF(EX(((p157==1)&&(p114==1)))) * AG(((EX((p24==1)) + (((p49==1)&&(p179==1))&&(p256==1))) + (p20==1)))) * ((p187==1) + AF(((p115==0)&...170
=> equivalent forward existential formula: ([((EY(Init) * (!(EG(!(EX(((p157==1)&&(p114==1)))))) * !(E(TRUE U !(((EX((p24==1)) + (((p49==1)&&(p179==1))&&(p2...389
Reverse transition relation is NOT exact ! Due to transitions t2, t19, t24, t28, t32, t33, t35, t38, t41, t44, t47, t51, t52, t54, t57, t66, t69, t72, t74,...350
(forward)formula 0,0,14.7385,439532,1,0,564,1.86915e+06,347,254,5469,2.02423e+06,598
FORMULA BusinessProcesses-PT-02-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 188/188 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 199 transition count 164
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 199 transition count 164
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 58 place count 189 transition count 154
Iterating global reduction 0 with 10 rules applied. Total rules applied 68 place count 189 transition count 154
Applied a total of 68 rules in 13 ms. Remains 189 /223 variables (removed 34) and now considering 154/188 (removed 34) transitions.
// Phase 1: matrix 154 rows 189 cols
[2022-05-15 14:00:04] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-15 14:00:04] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 154 rows 189 cols
[2022-05-15 14:00:04] [INFO ] Computed 37 place invariants in 4 ms
[2022-05-15 14:00:04] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
// Phase 1: matrix 154 rows 189 cols
[2022-05-15 14:00:04] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 14:00:04] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/223 places, 154/188 transitions.
Finished structural reductions, in 1 iterations. Remains : 189/223 places, 154/188 transitions.
[2022-05-15 14:00:04] [INFO ] Flatten gal took : 5 ms
[2022-05-15 14:00:04] [INFO ] Flatten gal took : 4 ms
[2022-05-15 14:00:04] [INFO ] Input system was already deterministic with 154 transitions.
[2022-05-15 14:00:04] [INFO ] Flatten gal took : 4 ms
[2022-05-15 14:00:04] [INFO ] Flatten gal took : 5 ms
[2022-05-15 14:00:04] [INFO ] Time to serialize gal into /tmp/CTLFireability5438411010625400705.gal : 1 ms
[2022-05-15 14:00:04] [INFO ] Time to serialize properties into /tmp/CTLFireability5902488243052238779.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5438411010625400705.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5902488243052238779.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46413e+12,0.26741,16952,2,13074,5,41004,6,0,910,37480,0


Converting to forward existential form...Done !
original formula: A((p255==1) U AF(EX(((AG((p10==1)) + (p250==1)) + ((p20==1)||(((p21==1)&&(p158==1))&&(p255==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(EX(((!(E(TRUE U !((p10==1)))) + (p250==1)) + ((p20==1)||(((p21==1)&&(p158==1))&&(p255==1...419
Reverse transition relation is NOT exact ! Due to transitions t2, t6, t20, t25, t29, t32, t35, t38, t41, t44, t47, t50, t53, t56, t65, t68, t71, t73, t76, ...338
Detected timeout of ITS tools.
[2022-05-15 14:00:34] [INFO ] Flatten gal took : 5 ms
[2022-05-15 14:00:34] [INFO ] Applying decomposition
[2022-05-15 14:00:34] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph4667163697262847061.txt' '-o' '/tmp/graph4667163697262847061.bin' '-w' '/tmp/graph4667163697262847061.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4667163697262847061.bin' '-l' '-1' '-v' '-w' '/tmp/graph4667163697262847061.weights' '-q' '0' '-e' '0.001'
[2022-05-15 14:00:34] [INFO ] Decomposing Gal with order
[2022-05-15 14:00:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 14:00:34] [INFO ] Removed a total of 31 redundant transitions.
[2022-05-15 14:00:34] [INFO ] Flatten gal took : 9 ms
[2022-05-15 14:00:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-15 14:00:34] [INFO ] Time to serialize gal into /tmp/CTLFireability7140195574959912454.gal : 2 ms
[2022-05-15 14:00:34] [INFO ] Time to serialize properties into /tmp/CTLFireability4654249709508259200.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7140195574959912454.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4654249709508259200.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46413e+12,0.108746,9248,1322,45,10059,383,408,11719,50,892,0


Converting to forward existential form...Done !
original formula: A((i17.u63.p255==1) U AF(EX(((AG((i1.u4.p10==1)) + (i17.u63.p250==1)) + ((u6.p20==1)||(((i3.u7.p21==1)&&(i14.i1.u45.p158==1))&&(i17.u63.p...168
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(EX(((!(E(TRUE U !((i1.u4.p10==1)))) + (i17.u63.p250==1)) + ((u6.p20==1)||(((i3.u7.p21==1...553
Reverse transition relation is NOT exact ! Due to transitions t97, t109, t113, i0.u20.t92, i0.u22.t88, i1.t103, i1.u5.t119, i1.u11.t108, i3.u7.t116, i3.u43...575
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,0,13.5396,366568,1,0,640394,1520,2772,908235,269,9426,668626
FORMULA BusinessProcesses-PT-02-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 188/188 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 203 transition count 168
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 203 transition count 168
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 197 transition count 162
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 197 transition count 162
Applied a total of 52 rules in 12 ms. Remains 197 /223 variables (removed 26) and now considering 162/188 (removed 26) transitions.
// Phase 1: matrix 162 rows 197 cols
[2022-05-15 14:00:48] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-15 14:00:48] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 162 rows 197 cols
[2022-05-15 14:00:48] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 14:00:48] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 197 cols
[2022-05-15 14:00:48] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 14:00:48] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 197/223 places, 162/188 transitions.
Finished structural reductions, in 1 iterations. Remains : 197/223 places, 162/188 transitions.
[2022-05-15 14:00:48] [INFO ] Flatten gal took : 4 ms
[2022-05-15 14:00:48] [INFO ] Flatten gal took : 4 ms
[2022-05-15 14:00:48] [INFO ] Input system was already deterministic with 162 transitions.
[2022-05-15 14:00:48] [INFO ] Flatten gal took : 3 ms
[2022-05-15 14:00:48] [INFO ] Flatten gal took : 3 ms
[2022-05-15 14:00:48] [INFO ] Time to serialize gal into /tmp/CTLFireability10580260568958652947.gal : 1 ms
[2022-05-15 14:00:48] [INFO ] Time to serialize properties into /tmp/CTLFireability3442144691263661706.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10580260568958652947.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3442144691263661706.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.548e+12,0.270886,17220,2,13486,5,42308,6,0,950,36514,0


Converting to forward existential form...Done !
original formula: (AX((p208==1)) * A(E((p237==1) U ((AF((p241==1)) + E((p216==1) U (p107==1))) + E((p111==1) U (p250==1)))) U EF(((p140!=1)&&(((p50==1)&&(p...178
=> equivalent forward existential formula: ([(EY(Init) * !((p208==1)))] = FALSE * ([((FwdU(Init,!(E(TRUE U ((p140!=1)&&(((p50==1)&&(p53==1))||(p186==1)))))...412
Reverse transition relation is NOT exact ! Due to transitions t2, t6, t10, t13, t22, t25, t28, t33, t37, t40, t43, t46, t49, t52, t55, t58, t61, t64, t73, ...362
Detected timeout of ITS tools.
[2022-05-15 14:01:18] [INFO ] Flatten gal took : 10 ms
[2022-05-15 14:01:18] [INFO ] Applying decomposition
[2022-05-15 14:01:18] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph594865695512104636.txt' '-o' '/tmp/graph594865695512104636.bin' '-w' '/tmp/graph594865695512104636.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph594865695512104636.bin' '-l' '-1' '-v' '-w' '/tmp/graph594865695512104636.weights' '-q' '0' '-e' '0.001'
[2022-05-15 14:01:18] [INFO ] Decomposing Gal with order
[2022-05-15 14:01:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 14:01:18] [INFO ] Removed a total of 34 redundant transitions.
[2022-05-15 14:01:18] [INFO ] Flatten gal took : 8 ms
[2022-05-15 14:01:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-15 14:01:18] [INFO ] Time to serialize gal into /tmp/CTLFireability8464677542973581348.gal : 2 ms
[2022-05-15 14:01:18] [INFO ] Time to serialize properties into /tmp/CTLFireability9866870151798165336.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8464677542973581348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9866870151798165336.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.548e+12,0.110654,9516,1302,42,10105,347,419,12766,53,821,0


Converting to forward existential form...Done !
original formula: (AX((i16.u55.p208==1)) * A(E((i16.u62.p237==1) U ((AF((i16.u64.p241==1)) + E((i16.u57.p216==1) U (i13.u35.p107==1))) + E((i15.u36.p111==1...264
=> equivalent forward existential formula: ([(EY(Init) * !((i16.u55.p208==1)))] = FALSE * ([((FwdU(Init,!(E(TRUE U ((i14.u41.p140!=1)&&(((i6.u17.p50==1)&&(...558
Reverse transition relation is NOT exact ! Due to transitions t101, t105, t117, t121, i0.i1.u29.t84, i1.u19.t104, i1.u25.t92, i2.u6.t127, i3.u8.t124, i3.u4...608
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,0,7.70176,227496,1,0,383263,1538,2756,852321,256,9738,519237
FORMULA BusinessProcesses-PT-02-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 188/188 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 200 transition count 165
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 200 transition count 165
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 56 place count 190 transition count 155
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 190 transition count 155
Applied a total of 66 rules in 5 ms. Remains 190 /223 variables (removed 33) and now considering 155/188 (removed 33) transitions.
// Phase 1: matrix 155 rows 190 cols
[2022-05-15 14:01:26] [INFO ] Computed 37 place invariants in 2 ms
[2022-05-15 14:01:26] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 155 rows 190 cols
[2022-05-15 14:01:26] [INFO ] Computed 37 place invariants in 4 ms
[2022-05-15 14:01:26] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
// Phase 1: matrix 155 rows 190 cols
[2022-05-15 14:01:26] [INFO ] Computed 37 place invariants in 1 ms
[2022-05-15 14:01:27] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 190/223 places, 155/188 transitions.
Finished structural reductions, in 1 iterations. Remains : 190/223 places, 155/188 transitions.
[2022-05-15 14:01:27] [INFO ] Flatten gal took : 4 ms
[2022-05-15 14:01:27] [INFO ] Flatten gal took : 4 ms
[2022-05-15 14:01:27] [INFO ] Input system was already deterministic with 155 transitions.
[2022-05-15 14:01:27] [INFO ] Flatten gal took : 4 ms
[2022-05-15 14:01:27] [INFO ] Flatten gal took : 4 ms
[2022-05-15 14:01:27] [INFO ] Time to serialize gal into /tmp/CTLFireability9381633405404288284.gal : 1 ms
[2022-05-15 14:01:27] [INFO ] Time to serialize properties into /tmp/CTLFireability12919217686833954889.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9381633405404288284.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12919217686833954889.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.47495e+12,0.273822,16852,2,13181,5,41220,6,0,915,37794,0


Converting to forward existential form...Done !
original formula: !(E(EF((p215==1)) U EX(EF((p229==1)))))
=> equivalent forward existential formula: [(FwdU(EY(FwdU(Init,E(TRUE U (p215==1)))),TRUE) * (p229==1))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t14, t17, t21, t26, t30, t33, t36, t39, t42, t45, t48, t51, t54, t57, t66, t69, t72, t74,...344
(forward)formula 0,0,16.9621,546164,1,0,868,2.17468e+06,337,505,5566,2.6374e+06,890
FORMULA BusinessProcesses-PT-02-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2022-05-15 14:01:44] [INFO ] Flatten gal took : 5 ms
[2022-05-15 14:01:44] [INFO ] Flatten gal took : 5 ms
Total runtime 340217 ms.

BK_STOP 1652623304390

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-02"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-02, 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 r024-tall-165251918400330"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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