Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143800402.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-11, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143800402
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 141K May 5 16:51 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-11-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-11-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620762204458

Running Version 0
[2021-05-11 19:43:26] [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]
[2021-05-11 19:43:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 19:43:26] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2021-05-11 19:43:26] [INFO ] Transformed 567 places.
[2021-05-11 19:43:26] [INFO ] Transformed 508 transitions.
[2021-05-11 19:43:26] [INFO ] Found NUPN structural information;
[2021-05-11 19:43:26] [INFO ] Parsed PT model containing 567 places and 508 transitions in 111 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 7 transitions.
Support contains 303 out of 560 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 560/560 places, 501/501 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 556 transition count 501
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 31 place count 529 transition count 474
Iterating global reduction 1 with 27 rules applied. Total rules applied 58 place count 529 transition count 474
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 67 place count 520 transition count 465
Iterating global reduction 1 with 9 rules applied. Total rules applied 76 place count 520 transition count 465
Applied a total of 76 rules in 77 ms. Remains 520 /560 variables (removed 40) and now considering 465/501 (removed 36) transitions.
// Phase 1: matrix 465 rows 520 cols
[2021-05-11 19:43:26] [INFO ] Computed 91 place invariants in 23 ms
[2021-05-11 19:43:26] [INFO ] Implicit Places using invariants in 246 ms returned []
// Phase 1: matrix 465 rows 520 cols
[2021-05-11 19:43:26] [INFO ] Computed 91 place invariants in 14 ms
[2021-05-11 19:43:26] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
// Phase 1: matrix 465 rows 520 cols
[2021-05-11 19:43:26] [INFO ] Computed 91 place invariants in 24 ms
[2021-05-11 19:43:27] [INFO ] Dead Transitions using invariants and state equation in 317 ms returned []
Finished structural reductions, in 1 iterations. Remains : 520/560 places, 465/501 transitions.
[2021-05-11 19:43:27] [INFO ] Flatten gal took : 64 ms
[2021-05-11 19:43:27] [INFO ] Flatten gal took : 29 ms
[2021-05-11 19:43:27] [INFO ] Input system was already deterministic with 465 transitions.
Incomplete random walk after 100000 steps, including 751 resets, run finished after 269 ms. (steps per millisecond=371 ) properties (out of 44) seen :39
Running SMT prover for 5 properties.
// Phase 1: matrix 465 rows 520 cols
[2021-05-11 19:43:27] [INFO ] Computed 91 place invariants in 5 ms
[2021-05-11 19:43:28] [INFO ] [Real]Absence check using 51 positive place invariants in 14 ms returned sat
[2021-05-11 19:43:28] [INFO ] [Real]Absence check using 51 positive and 40 generalized place invariants in 10 ms returned sat
[2021-05-11 19:43:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:28] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2021-05-11 19:43:28] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 4 ms to minimize.
[2021-05-11 19:43:28] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2021-05-11 19:43:28] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2021-05-11 19:43:28] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2021-05-11 19:43:28] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2021-05-11 19:43:28] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2021-05-11 19:43:28] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2021-05-11 19:43:29] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2021-05-11 19:43:29] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2021-05-11 19:43:29] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 841 ms
[2021-05-11 19:43:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:43:29] [INFO ] [Nat]Absence check using 51 positive place invariants in 17 ms returned sat
[2021-05-11 19:43:29] [INFO ] [Nat]Absence check using 51 positive and 40 generalized place invariants in 10 ms returned sat
[2021-05-11 19:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:29] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2021-05-11 19:43:29] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2021-05-11 19:43:29] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2021-05-11 19:43:29] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2021-05-11 19:43:29] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2021-05-11 19:43:29] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 0 ms to minimize.
[2021-05-11 19:43:29] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2021-05-11 19:43:29] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2021-05-11 19:43:29] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2021-05-11 19:43:29] [INFO ] Deduced a trap composed of 43 places in 26 ms of which 1 ms to minimize.
[2021-05-11 19:43:30] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 664 ms
[2021-05-11 19:43:30] [INFO ] Computed and/alt/rep : 433/753/433 causal constraints (skipped 31 transitions) in 24 ms.
[2021-05-11 19:43:31] [INFO ] Deduced a trap composed of 117 places in 136 ms of which 1 ms to minimize.
[2021-05-11 19:43:31] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 0 ms to minimize.
[2021-05-11 19:43:31] [INFO ] Deduced a trap composed of 101 places in 121 ms of which 1 ms to minimize.
[2021-05-11 19:43:32] [INFO ] Deduced a trap composed of 105 places in 125 ms of which 1 ms to minimize.
[2021-05-11 19:43:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 705 ms
[2021-05-11 19:43:32] [INFO ] Added : 252 causal constraints over 51 iterations in 2109 ms. Result :sat
[2021-05-11 19:43:32] [INFO ] [Real]Absence check using 51 positive place invariants in 16 ms returned sat
[2021-05-11 19:43:32] [INFO ] [Real]Absence check using 51 positive and 40 generalized place invariants in 9 ms returned sat
[2021-05-11 19:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:32] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2021-05-11 19:43:32] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 1 ms to minimize.
[2021-05-11 19:43:32] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
[2021-05-11 19:43:32] [INFO ] Deduced a trap composed of 104 places in 158 ms of which 1 ms to minimize.
[2021-05-11 19:43:33] [INFO ] Deduced a trap composed of 106 places in 147 ms of which 1 ms to minimize.
[2021-05-11 19:43:33] [INFO ] Deduced a trap composed of 110 places in 154 ms of which 0 ms to minimize.
[2021-05-11 19:43:33] [INFO ] Deduced a trap composed of 123 places in 136 ms of which 1 ms to minimize.
[2021-05-11 19:43:33] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 1 ms to minimize.
[2021-05-11 19:43:33] [INFO ] Deduced a trap composed of 120 places in 133 ms of which 1 ms to minimize.
[2021-05-11 19:43:33] [INFO ] Deduced a trap composed of 114 places in 148 ms of which 0 ms to minimize.
[2021-05-11 19:43:34] [INFO ] Deduced a trap composed of 114 places in 125 ms of which 1 ms to minimize.
[2021-05-11 19:43:34] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 0 ms to minimize.
[2021-05-11 19:43:34] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 1 ms to minimize.
[2021-05-11 19:43:34] [INFO ] Deduced a trap composed of 103 places in 123 ms of which 0 ms to minimize.
[2021-05-11 19:43:34] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 0 ms to minimize.
[2021-05-11 19:43:34] [INFO ] Deduced a trap composed of 122 places in 145 ms of which 1 ms to minimize.
[2021-05-11 19:43:35] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 1 ms to minimize.
[2021-05-11 19:43:35] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 0 ms to minimize.
[2021-05-11 19:43:35] [INFO ] Deduced a trap composed of 112 places in 122 ms of which 1 ms to minimize.
[2021-05-11 19:43:35] [INFO ] Deduced a trap composed of 109 places in 198 ms of which 2 ms to minimize.
[2021-05-11 19:43:35] [INFO ] Deduced a trap composed of 114 places in 116 ms of which 1 ms to minimize.
[2021-05-11 19:43:35] [INFO ] Deduced a trap composed of 109 places in 104 ms of which 1 ms to minimize.
[2021-05-11 19:43:35] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 0 ms to minimize.
[2021-05-11 19:43:36] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 0 ms to minimize.
[2021-05-11 19:43:36] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 0 ms to minimize.
[2021-05-11 19:43:36] [INFO ] Deduced a trap composed of 112 places in 122 ms of which 0 ms to minimize.
[2021-05-11 19:43:36] [INFO ] Deduced a trap composed of 104 places in 130 ms of which 1 ms to minimize.
[2021-05-11 19:43:36] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 1 ms to minimize.
[2021-05-11 19:43:36] [INFO ] Deduced a trap composed of 108 places in 127 ms of which 0 ms to minimize.
[2021-05-11 19:43:36] [INFO ] Deduced a trap composed of 111 places in 115 ms of which 1 ms to minimize.
[2021-05-11 19:43:37] [INFO ] Deduced a trap composed of 113 places in 118 ms of which 0 ms to minimize.
[2021-05-11 19:43:37] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 0 ms to minimize.
[2021-05-11 19:43:37] [INFO ] Deduced a trap composed of 108 places in 144 ms of which 1 ms to minimize.
[2021-05-11 19:43:37] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 1 ms to minimize.
[2021-05-11 19:43:37] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 1 ms to minimize.
[2021-05-11 19:43:37] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 2 ms to minimize.
[2021-05-11 19:43:38] [INFO ] Deduced a trap composed of 125 places in 137 ms of which 0 ms to minimize.
[2021-05-11 19:43:38] [INFO ] Deduced a trap composed of 120 places in 135 ms of which 1 ms to minimize.
[2021-05-11 19:43:38] [INFO ] Deduced a trap composed of 116 places in 124 ms of which 0 ms to minimize.
[2021-05-11 19:43:38] [INFO ] Deduced a trap composed of 116 places in 117 ms of which 1 ms to minimize.
[2021-05-11 19:43:38] [INFO ] Deduced a trap composed of 115 places in 141 ms of which 0 ms to minimize.
[2021-05-11 19:43:38] [INFO ] Deduced a trap composed of 112 places in 143 ms of which 0 ms to minimize.
[2021-05-11 19:43:39] [INFO ] Deduced a trap composed of 107 places in 143 ms of which 0 ms to minimize.
[2021-05-11 19:43:39] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 1 ms to minimize.
[2021-05-11 19:43:39] [INFO ] Deduced a trap composed of 103 places in 143 ms of which 3 ms to minimize.
[2021-05-11 19:43:39] [INFO ] Deduced a trap composed of 115 places in 142 ms of which 1 ms to minimize.
[2021-05-11 19:43:39] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 3 ms to minimize.
[2021-05-11 19:43:39] [INFO ] Deduced a trap composed of 103 places in 146 ms of which 2 ms to minimize.
[2021-05-11 19:43:40] [INFO ] Deduced a trap composed of 99 places in 141 ms of which 1 ms to minimize.
[2021-05-11 19:43:40] [INFO ] Deduced a trap composed of 108 places in 127 ms of which 0 ms to minimize.
[2021-05-11 19:43:40] [INFO ] Deduced a trap composed of 110 places in 146 ms of which 0 ms to minimize.
[2021-05-11 19:43:40] [INFO ] Deduced a trap composed of 119 places in 151 ms of which 0 ms to minimize.
[2021-05-11 19:43:40] [INFO ] Deduced a trap composed of 122 places in 133 ms of which 1 ms to minimize.
[2021-05-11 19:43:40] [INFO ] Deduced a trap composed of 125 places in 140 ms of which 0 ms to minimize.
[2021-05-11 19:43:41] [INFO ] Deduced a trap composed of 115 places in 120 ms of which 0 ms to minimize.
[2021-05-11 19:43:41] [INFO ] Deduced a trap composed of 115 places in 131 ms of which 0 ms to minimize.
[2021-05-11 19:43:41] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2021-05-11 19:43:41] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2021-05-11 19:43:41] [INFO ] Deduced a trap composed of 111 places in 155 ms of which 0 ms to minimize.
[2021-05-11 19:43:41] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 10 ms to minimize.
[2021-05-11 19:43:41] [INFO ] Deduced a trap composed of 113 places in 143 ms of which 1 ms to minimize.
[2021-05-11 19:43:42] [INFO ] Deduced a trap composed of 114 places in 144 ms of which 0 ms to minimize.
[2021-05-11 19:43:42] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 0 ms to minimize.
[2021-05-11 19:43:42] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 0 ms to minimize.
[2021-05-11 19:43:42] [INFO ] Deduced a trap composed of 111 places in 119 ms of which 1 ms to minimize.
[2021-05-11 19:43:42] [INFO ] Deduced a trap composed of 114 places in 128 ms of which 0 ms to minimize.
[2021-05-11 19:43:42] [INFO ] Deduced a trap composed of 113 places in 115 ms of which 1 ms to minimize.
[2021-05-11 19:43:43] [INFO ] Deduced a trap composed of 126 places in 137 ms of which 0 ms to minimize.
[2021-05-11 19:43:43] [INFO ] Deduced a trap composed of 112 places in 128 ms of which 1 ms to minimize.
[2021-05-11 19:43:43] [INFO ] Deduced a trap composed of 117 places in 100 ms of which 1 ms to minimize.
[2021-05-11 19:43:43] [INFO ] Deduced a trap composed of 116 places in 113 ms of which 1 ms to minimize.
[2021-05-11 19:43:43] [INFO ] Deduced a trap composed of 114 places in 146 ms of which 1 ms to minimize.
[2021-05-11 19:43:43] [INFO ] Deduced a trap composed of 117 places in 127 ms of which 0 ms to minimize.
[2021-05-11 19:43:43] [INFO ] Deduced a trap composed of 120 places in 96 ms of which 0 ms to minimize.
[2021-05-11 19:43:44] [INFO ] Deduced a trap composed of 116 places in 124 ms of which 1 ms to minimize.
[2021-05-11 19:43:44] [INFO ] Deduced a trap composed of 118 places in 101 ms of which 0 ms to minimize.
[2021-05-11 19:43:44] [INFO ] Deduced a trap composed of 119 places in 124 ms of which 1 ms to minimize.
[2021-05-11 19:43:44] [INFO ] Deduced a trap composed of 124 places in 96 ms of which 0 ms to minimize.
[2021-05-11 19:43:44] [INFO ] Deduced a trap composed of 117 places in 128 ms of which 1 ms to minimize.
[2021-05-11 19:43:44] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 1 ms to minimize.
[2021-05-11 19:43:44] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 0 ms to minimize.
[2021-05-11 19:43:45] [INFO ] Deduced a trap composed of 123 places in 127 ms of which 1 ms to minimize.
[2021-05-11 19:43:45] [INFO ] Deduced a trap composed of 126 places in 122 ms of which 0 ms to minimize.
[2021-05-11 19:43:45] [INFO ] Deduced a trap composed of 110 places in 138 ms of which 0 ms to minimize.
[2021-05-11 19:43:45] [INFO ] Deduced a trap composed of 113 places in 132 ms of which 1 ms to minimize.
[2021-05-11 19:43:45] [INFO ] Deduced a trap composed of 113 places in 122 ms of which 1 ms to minimize.
[2021-05-11 19:43:45] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 1 ms to minimize.
[2021-05-11 19:43:46] [INFO ] Deduced a trap composed of 110 places in 123 ms of which 1 ms to minimize.
[2021-05-11 19:43:46] [INFO ] Deduced a trap composed of 115 places in 129 ms of which 1 ms to minimize.
[2021-05-11 19:43:46] [INFO ] Deduced a trap composed of 113 places in 120 ms of which 0 ms to minimize.
[2021-05-11 19:43:46] [INFO ] Deduced a trap composed of 115 places in 134 ms of which 1 ms to minimize.
[2021-05-11 19:43:46] [INFO ] Deduced a trap composed of 119 places in 128 ms of which 1 ms to minimize.
[2021-05-11 19:43:46] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
[2021-05-11 19:43:46] [INFO ] Deduced a trap composed of 113 places in 100 ms of which 0 ms to minimize.
[2021-05-11 19:43:47] [INFO ] Deduced a trap composed of 111 places in 131 ms of which 0 ms to minimize.
[2021-05-11 19:43:47] [INFO ] Deduced a trap composed of 121 places in 126 ms of which 0 ms to minimize.
[2021-05-11 19:43:47] [INFO ] Deduced a trap composed of 116 places in 133 ms of which 0 ms to minimize.
[2021-05-11 19:43:47] [INFO ] Deduced a trap composed of 109 places in 151 ms of which 1 ms to minimize.
[2021-05-11 19:43:47] [INFO ] Deduced a trap composed of 112 places in 139 ms of which 0 ms to minimize.
[2021-05-11 19:43:47] [INFO ] Deduced a trap composed of 110 places in 130 ms of which 1 ms to minimize.
[2021-05-11 19:43:48] [INFO ] Deduced a trap composed of 117 places in 125 ms of which 1 ms to minimize.
[2021-05-11 19:43:48] [INFO ] Deduced a trap composed of 115 places in 101 ms of which 1 ms to minimize.
[2021-05-11 19:43:48] [INFO ] Deduced a trap composed of 124 places in 113 ms of which 0 ms to minimize.
[2021-05-11 19:43:48] [INFO ] Deduced a trap composed of 109 places in 129 ms of which 1 ms to minimize.
[2021-05-11 19:43:48] [INFO ] Deduced a trap composed of 110 places in 111 ms of which 0 ms to minimize.
[2021-05-11 19:43:48] [INFO ] Deduced a trap composed of 120 places in 108 ms of which 1 ms to minimize.
[2021-05-11 19:43:48] [INFO ] Deduced a trap composed of 115 places in 142 ms of which 1 ms to minimize.
[2021-05-11 19:43:49] [INFO ] Deduced a trap composed of 118 places in 121 ms of which 1 ms to minimize.
[2021-05-11 19:43:49] [INFO ] Deduced a trap composed of 118 places in 126 ms of which 1 ms to minimize.
[2021-05-11 19:43:49] [INFO ] Deduced a trap composed of 113 places in 133 ms of which 1 ms to minimize.
[2021-05-11 19:43:49] [INFO ] Deduced a trap composed of 128 places in 158 ms of which 1 ms to minimize.
[2021-05-11 19:43:49] [INFO ] Deduced a trap composed of 119 places in 110 ms of which 1 ms to minimize.
[2021-05-11 19:43:49] [INFO ] Deduced a trap composed of 107 places in 140 ms of which 0 ms to minimize.
[2021-05-11 19:43:50] [INFO ] Deduced a trap composed of 118 places in 134 ms of which 1 ms to minimize.
[2021-05-11 19:43:50] [INFO ] Deduced a trap composed of 108 places in 127 ms of which 0 ms to minimize.
[2021-05-11 19:43:50] [INFO ] Deduced a trap composed of 118 places in 129 ms of which 0 ms to minimize.
[2021-05-11 19:43:50] [INFO ] Deduced a trap composed of 120 places in 128 ms of which 0 ms to minimize.
[2021-05-11 19:43:50] [INFO ] Deduced a trap composed of 109 places in 97 ms of which 1 ms to minimize.
[2021-05-11 19:43:50] [INFO ] Deduced a trap composed of 121 places in 170 ms of which 1 ms to minimize.
[2021-05-11 19:43:51] [INFO ] Deduced a trap composed of 112 places in 132 ms of which 1 ms to minimize.
[2021-05-11 19:43:51] [INFO ] Deduced a trap composed of 124 places in 132 ms of which 1 ms to minimize.
[2021-05-11 19:43:51] [INFO ] Deduced a trap composed of 125 places in 139 ms of which 1 ms to minimize.
[2021-05-11 19:43:51] [INFO ] Deduced a trap composed of 115 places in 150 ms of which 0 ms to minimize.
[2021-05-11 19:43:51] [INFO ] Deduced a trap composed of 118 places in 146 ms of which 0 ms to minimize.
[2021-05-11 19:43:51] [INFO ] Deduced a trap composed of 116 places in 144 ms of which 1 ms to minimize.
[2021-05-11 19:43:52] [INFO ] Deduced a trap composed of 115 places in 126 ms of which 1 ms to minimize.
[2021-05-11 19:43:52] [INFO ] Deduced a trap composed of 116 places in 132 ms of which 1 ms to minimize.
[2021-05-11 19:43:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-11 19:43:52] [INFO ] [Real]Absence check using 51 positive place invariants in 22 ms returned sat
[2021-05-11 19:43:52] [INFO ] [Real]Absence check using 51 positive and 40 generalized place invariants in 13 ms returned sat
[2021-05-11 19:43:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:52] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2021-05-11 19:43:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:43:52] [INFO ] [Nat]Absence check using 51 positive place invariants in 22 ms returned sat
[2021-05-11 19:43:52] [INFO ] [Nat]Absence check using 51 positive and 40 generalized place invariants in 13 ms returned sat
[2021-05-11 19:43:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:52] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2021-05-11 19:43:52] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2021-05-11 19:43:53] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 0 ms to minimize.
[2021-05-11 19:43:53] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2021-05-11 19:43:53] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2021-05-11 19:43:53] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 0 ms to minimize.
[2021-05-11 19:43:53] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2021-05-11 19:43:53] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2021-05-11 19:43:53] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
[2021-05-11 19:43:53] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2021-05-11 19:43:53] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 0 ms to minimize.
[2021-05-11 19:43:53] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 0 ms to minimize.
[2021-05-11 19:43:54] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 0 ms to minimize.
[2021-05-11 19:43:54] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 0 ms to minimize.
[2021-05-11 19:43:54] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1236 ms
[2021-05-11 19:43:54] [INFO ] Computed and/alt/rep : 433/753/433 causal constraints (skipped 31 transitions) in 23 ms.
[2021-05-11 19:43:55] [INFO ] Added : 247 causal constraints over 50 iterations in 1580 ms. Result :sat
[2021-05-11 19:43:55] [INFO ] [Real]Absence check using 51 positive place invariants in 16 ms returned sat
[2021-05-11 19:43:55] [INFO ] [Real]Absence check using 51 positive and 40 generalized place invariants in 10 ms returned sat
[2021-05-11 19:43:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:55] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2021-05-11 19:43:56] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 0 ms to minimize.
[2021-05-11 19:43:56] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 1 ms to minimize.
[2021-05-11 19:43:56] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 1 ms to minimize.
[2021-05-11 19:43:56] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
[2021-05-11 19:43:56] [INFO ] Deduced a trap composed of 103 places in 141 ms of which 1 ms to minimize.
[2021-05-11 19:43:56] [INFO ] Deduced a trap composed of 104 places in 131 ms of which 1 ms to minimize.
[2021-05-11 19:43:57] [INFO ] Deduced a trap composed of 104 places in 121 ms of which 1 ms to minimize.
[2021-05-11 19:43:57] [INFO ] Deduced a trap composed of 115 places in 108 ms of which 1 ms to minimize.
[2021-05-11 19:43:57] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 0 ms to minimize.
[2021-05-11 19:43:57] [INFO ] Deduced a trap composed of 105 places in 101 ms of which 0 ms to minimize.
[2021-05-11 19:43:57] [INFO ] Deduced a trap composed of 106 places in 115 ms of which 0 ms to minimize.
[2021-05-11 19:43:57] [INFO ] Deduced a trap composed of 106 places in 107 ms of which 0 ms to minimize.
[2021-05-11 19:43:57] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 0 ms to minimize.
[2021-05-11 19:43:58] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 1 ms to minimize.
[2021-05-11 19:43:58] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2021-05-11 19:43:58] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 0 ms to minimize.
[2021-05-11 19:43:58] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2021-05-11 19:43:58] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2021-05-11 19:43:58] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2021-05-11 19:43:58] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2021-05-11 19:43:58] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 0 ms to minimize.
[2021-05-11 19:43:58] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2021-05-11 19:43:58] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 0 ms to minimize.
[2021-05-11 19:43:59] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2021-05-11 19:43:59] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2021-05-11 19:43:59] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3138 ms
[2021-05-11 19:43:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:43:59] [INFO ] [Nat]Absence check using 51 positive place invariants in 16 ms returned sat
[2021-05-11 19:43:59] [INFO ] [Nat]Absence check using 51 positive and 40 generalized place invariants in 9 ms returned sat
[2021-05-11 19:43:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:59] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2021-05-11 19:43:59] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 0 ms to minimize.
[2021-05-11 19:43:59] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 0 ms to minimize.
[2021-05-11 19:43:59] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 1 ms to minimize.
[2021-05-11 19:44:00] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
[2021-05-11 19:44:00] [INFO ] Deduced a trap composed of 103 places in 128 ms of which 0 ms to minimize.
[2021-05-11 19:44:00] [INFO ] Deduced a trap composed of 104 places in 144 ms of which 0 ms to minimize.
[2021-05-11 19:44:00] [INFO ] Deduced a trap composed of 104 places in 117 ms of which 1 ms to minimize.
[2021-05-11 19:44:00] [INFO ] Deduced a trap composed of 115 places in 113 ms of which 1 ms to minimize.
[2021-05-11 19:44:00] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 1 ms to minimize.
[2021-05-11 19:44:00] [INFO ] Deduced a trap composed of 105 places in 122 ms of which 0 ms to minimize.
[2021-05-11 19:44:01] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 1 ms to minimize.
[2021-05-11 19:44:01] [INFO ] Deduced a trap composed of 106 places in 140 ms of which 0 ms to minimize.
[2021-05-11 19:44:01] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 1 ms to minimize.
[2021-05-11 19:44:01] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 1 ms to minimize.
[2021-05-11 19:44:01] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2021-05-11 19:44:01] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
[2021-05-11 19:44:01] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2021-05-11 19:44:01] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 0 ms to minimize.
[2021-05-11 19:44:01] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 0 ms to minimize.
[2021-05-11 19:44:01] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
[2021-05-11 19:44:02] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2021-05-11 19:44:02] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2021-05-11 19:44:02] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2021-05-11 19:44:02] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 0 ms to minimize.
[2021-05-11 19:44:02] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2021-05-11 19:44:02] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2873 ms
[2021-05-11 19:44:02] [INFO ] Computed and/alt/rep : 433/753/433 causal constraints (skipped 31 transitions) in 27 ms.
[2021-05-11 19:44:04] [INFO ] Deduced a trap composed of 111 places in 142 ms of which 1 ms to minimize.
[2021-05-11 19:44:04] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 0 ms to minimize.
[2021-05-11 19:44:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 412 ms
[2021-05-11 19:44:04] [INFO ] Added : 269 causal constraints over 56 iterations in 2150 ms. Result :sat
[2021-05-11 19:44:04] [INFO ] [Real]Absence check using 51 positive place invariants in 21 ms returned sat
[2021-05-11 19:44:04] [INFO ] [Real]Absence check using 51 positive and 40 generalized place invariants in 14 ms returned sat
[2021-05-11 19:44:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:44:04] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2021-05-11 19:44:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:44:04] [INFO ] [Nat]Absence check using 51 positive place invariants in 19 ms returned sat
[2021-05-11 19:44:04] [INFO ] [Nat]Absence check using 51 positive and 40 generalized place invariants in 11 ms returned sat
[2021-05-11 19:44:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:44:05] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2021-05-11 19:44:05] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 0 ms to minimize.
[2021-05-11 19:44:05] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 1 ms to minimize.
[2021-05-11 19:44:05] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 1 ms to minimize.
[2021-05-11 19:44:05] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 0 ms to minimize.
[2021-05-11 19:44:05] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 0 ms to minimize.
[2021-05-11 19:44:05] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2021-05-11 19:44:06] [INFO ] Deduced a trap composed of 107 places in 105 ms of which 0 ms to minimize.
[2021-05-11 19:44:06] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 0 ms to minimize.
[2021-05-11 19:44:06] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1136 ms
[2021-05-11 19:44:06] [INFO ] Computed and/alt/rep : 433/753/433 causal constraints (skipped 31 transitions) in 21 ms.
[2021-05-11 19:44:07] [INFO ] Deduced a trap composed of 110 places in 147 ms of which 1 ms to minimize.
[2021-05-11 19:44:08] [INFO ] Deduced a trap composed of 113 places in 115 ms of which 1 ms to minimize.
[2021-05-11 19:44:08] [INFO ] Deduced a trap composed of 113 places in 142 ms of which 1 ms to minimize.
[2021-05-11 19:44:08] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 0 ms to minimize.
[2021-05-11 19:44:08] [INFO ] Deduced a trap composed of 117 places in 137 ms of which 0 ms to minimize.
[2021-05-11 19:44:08] [INFO ] Deduced a trap composed of 107 places in 112 ms of which 1 ms to minimize.
[2021-05-11 19:44:08] [INFO ] Deduced a trap composed of 111 places in 133 ms of which 0 ms to minimize.
[2021-05-11 19:44:09] [INFO ] Deduced a trap composed of 108 places in 149 ms of which 0 ms to minimize.
[2021-05-11 19:44:09] [INFO ] Deduced a trap composed of 120 places in 116 ms of which 0 ms to minimize.
[2021-05-11 19:44:09] [INFO ] Deduced a trap composed of 112 places in 142 ms of which 0 ms to minimize.
[2021-05-11 19:44:09] [INFO ] Deduced a trap composed of 118 places in 143 ms of which 1 ms to minimize.
[2021-05-11 19:44:09] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1953 ms
[2021-05-11 19:44:09] [INFO ] Added : 298 causal constraints over 60 iterations in 3603 ms. Result :sat
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 519 transition count 392
Reduce places removed 72 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 75 rules applied. Total rules applied 147 place count 447 transition count 389
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 150 place count 444 transition count 389
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 150 place count 444 transition count 278
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 239 rules applied. Total rules applied 389 place count 316 transition count 278
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 445 place count 260 transition count 222
Iterating global reduction 3 with 56 rules applied. Total rules applied 501 place count 260 transition count 222
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 501 place count 260 transition count 218
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 509 place count 256 transition count 218
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 185 rules applied. Total rules applied 694 place count 162 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 695 place count 162 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 697 place count 161 transition count 130
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 698 place count 160 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 699 place count 159 transition count 129
Applied a total of 699 rules in 120 ms. Remains 159 /520 variables (removed 361) and now considering 129/465 (removed 336) transitions.
[2021-05-11 19:44:10] [INFO ] Flatten gal took : 13 ms
[2021-05-11 19:44:10] [INFO ] Flatten gal took : 15 ms
[2021-05-11 19:44:10] [INFO ] Input system was already deterministic with 129 transitions.
Finished random walk after 159 steps, including 21 resets, run visited all 1 properties in 3 ms. (steps per millisecond=53 )
FORMULA BusinessProcesses-PT-11-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 519 transition count 396
Reduce places removed 68 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 72 rules applied. Total rules applied 140 place count 451 transition count 392
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 144 place count 447 transition count 392
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 144 place count 447 transition count 292
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 213 rules applied. Total rules applied 357 place count 334 transition count 292
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 408 place count 283 transition count 241
Iterating global reduction 3 with 51 rules applied. Total rules applied 459 place count 283 transition count 241
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 459 place count 283 transition count 238
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 465 place count 280 transition count 238
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 183 rules applied. Total rules applied 648 place count 187 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 649 place count 187 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 651 place count 186 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 652 place count 185 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 653 place count 184 transition count 149
Applied a total of 653 rules in 88 ms. Remains 184 /520 variables (removed 336) and now considering 149/465 (removed 316) transitions.
[2021-05-11 19:44:10] [INFO ] Flatten gal took : 14 ms
[2021-05-11 19:44:10] [INFO ] Flatten gal took : 15 ms
[2021-05-11 19:44:10] [INFO ] Input system was already deterministic with 149 transitions.
[2021-05-11 19:44:10] [INFO ] Flatten gal took : 14 ms
[2021-05-11 19:44:10] [INFO ] Flatten gal took : 14 ms
[2021-05-11 19:44:10] [INFO ] Time to serialize gal into /tmp/CTLFireability16455953237675469570.gal : 7 ms
[2021-05-11 19:44:10] [INFO ] Time to serialize properties into /tmp/CTLFireability3073497115670510454.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability16455953237675469570.gal, -t, CGAL, -ctl, /tmp/CTLFireability3073497115670510454.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability16455953237675469570.gal -t CGAL -ctl /tmp/CTLFireability3073497115670510454.ctl --gen-order FOLLOW
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,279036,0.192604,10056,2,3863,5,18105,6,0,886,16397,0


Converting to forward existential form...Done !
original formula: EG(!(AF((!(A((((p460==1)||(p223==1))||(p221==1)) U (((((((((((p126==1)&&(p317==1))&&(p469==1))||(p324==1))||((p79==1)&&(p455==1)))||(p512==1))||(p528==1))||(p218==1))||(p238==1))||(((p139==1)&&(p331==1))&&(p528==1)))||(p46==1)))) * !(EF(((p338==1)||(p479==1))))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EG(!((!(!((E(!((((((((((((p126==1)&&(p317==1))&&(p469==1))||(p324==1))||((p79==1)&&(p455==1)))||(p512==1))||(p528==1))||(p218==1))||(p238==1))||(((p139==1)&&(p331==1))&&(p528==1)))||(p46==1))) U (!((((p460==1)||(p223==1))||(p221==1))) * !((((((((((((p126==1)&&(p317==1))&&(p469==1))||(p324==1))||((p79==1)&&(p455==1)))||(p512==1))||(p528==1))||(p218==1))||(p238==1))||(((p139==1)&&(p331==1))&&(p528==1)))||(p46==1))))) + EG(!((((((((((((p126==1)&&(p317==1))&&(p469==1))||(p324==1))||((p79==1)&&(p455==1)))||(p512==1))||(p528==1))||(p218==1))||(p238==1))||(((p139==1)&&(p331==1))&&(p528==1)))||(p46==1))))))) * !(E(TRUE U ((p338==1)||(p479==1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t8, t10, t39, t40, t42, t43, t44, t45, t46, t51, t52, t53, t54, t55, t90, t105, t106, t108, t118, t119, t120, t128, t139, t140, t141, t142, t143, t144, t147, t148, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/81/32/149
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,6.57719,229644,1,0,614,1.19252e+06,305,409,6899,1.29164e+06,683
FORMULA BusinessProcesses-PT-11-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Graph (trivial) has 270 edges and 520 vertex of which 4 / 520 are part of one of the 1 SCC in 3 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 91 place count 516 transition count 371
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 181 place count 426 transition count 371
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 181 place count 426 transition count 278
Deduced a syphon composed of 93 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 385 place count 315 transition count 278
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 437 place count 263 transition count 226
Iterating global reduction 2 with 52 rules applied. Total rules applied 489 place count 263 transition count 226
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 489 place count 263 transition count 224
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 493 place count 261 transition count 224
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 179 rules applied. Total rules applied 672 place count 170 transition count 136
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 676 place count 168 transition count 139
Partial Post-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 683 place count 168 transition count 139
Applied a total of 683 rules in 86 ms. Remains 168 /520 variables (removed 352) and now considering 139/465 (removed 326) transitions.
[2021-05-11 19:44:17] [INFO ] Flatten gal took : 18 ms
[2021-05-11 19:44:17] [INFO ] Flatten gal took : 17 ms
[2021-05-11 19:44:17] [INFO ] Input system was already deterministic with 139 transitions.
[2021-05-11 19:44:17] [INFO ] Flatten gal took : 15 ms
[2021-05-11 19:44:17] [INFO ] Flatten gal took : 15 ms
[2021-05-11 19:44:17] [INFO ] Time to serialize gal into /tmp/CTLFireability14689599152363783677.gal : 2 ms
[2021-05-11 19:44:17] [INFO ] Time to serialize properties into /tmp/CTLFireability6837949672031269416.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability14689599152363783677.gal, -t, CGAL, -ctl, /tmp/CTLFireability6837949672031269416.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability14689599152363783677.gal -t CGAL -ctl /tmp/CTLFireability6837949672031269416.ctl --gen-order FOLLOW
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,74533,0.229229,12492,2,6765,5,24888,6,0,810,18432,0


Converting to forward existential form...Done !
original formula: AG(EF(!(AG(!(E((((((p72==1)&&(p267==1))&&(p545==1))||(p360==1))||(p566==1)) U ((((p438==1)||(((p103==1)&&(p292==1))&&(p551==1)))||(p290==1))||(p411==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(E(TRUE U !(!(E((((((p72==1)&&(p267==1))&&(p545==1))||(p360==1))||(p566==1)) U ((((p438==1)||(((p103==1)&&(p292==1))&&(p551==1)))||(p290==1))||(p411==1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t9, t10, t48, t49, t50, t51, t52, t54, t60, t61, t83, t84, t90, t91, t94, t102, t110, t111, t112, t124, t125, t126, t127, t128, t129, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/77/26/139
(forward)formula 0,0,3.34618,115164,1,0,239,422338,266,118,6616,319998,310
FORMULA BusinessProcesses-PT-11-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Graph (trivial) has 276 edges and 520 vertex of which 7 / 520 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 90 place count 513 transition count 368
Reduce places removed 89 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 91 rules applied. Total rules applied 181 place count 424 transition count 366
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 183 place count 422 transition count 366
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 183 place count 422 transition count 273
Deduced a syphon composed of 93 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 387 place count 311 transition count 273
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 440 place count 258 transition count 220
Iterating global reduction 3 with 53 rules applied. Total rules applied 493 place count 258 transition count 220
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 493 place count 258 transition count 216
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 501 place count 254 transition count 216
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 173 rules applied. Total rules applied 674 place count 166 transition count 131
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 678 place count 164 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 679 place count 163 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 680 place count 162 transition count 133
Applied a total of 680 rules in 88 ms. Remains 162 /520 variables (removed 358) and now considering 133/465 (removed 332) transitions.
[2021-05-11 19:44:20] [INFO ] Flatten gal took : 13 ms
[2021-05-11 19:44:20] [INFO ] Flatten gal took : 12 ms
[2021-05-11 19:44:20] [INFO ] Input system was already deterministic with 133 transitions.
[2021-05-11 19:44:20] [INFO ] Flatten gal took : 10 ms
[2021-05-11 19:44:20] [INFO ] Flatten gal took : 10 ms
[2021-05-11 19:44:20] [INFO ] Time to serialize gal into /tmp/CTLFireability13733456281109214580.gal : 2 ms
[2021-05-11 19:44:20] [INFO ] Time to serialize properties into /tmp/CTLFireability11147153500947837109.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability13733456281109214580.gal, -t, CGAL, -ctl, /tmp/CTLFireability11147153500947837109.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability13733456281109214580.gal -t CGAL -ctl /tmp/CTLFireability11147153500947837109.ctl --gen-order FOLLOW
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,57958,0.182327,10548,2,3387,5,21348,6,0,779,13245,0


Converting to forward existential form...Done !
original formula: AG(!(EG(((((p309==1)||(p150==1))||(p134==1))||(p257==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((((p309==1)||(p150==1))||(p134==1))||(p257==1)))] = FALSE
Hit Full ! (commute/partial/dont) 123/0/10
(forward)formula 0,0,0.797239,34140,1,0,8,104393,19,2,4645,41243,8
FORMULA BusinessProcesses-PT-11-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Graph (trivial) has 274 edges and 520 vertex of which 7 / 520 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 90 place count 513 transition count 368
Reduce places removed 89 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 424 transition count 367
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 181 place count 423 transition count 367
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 91 Pre rules applied. Total rules applied 181 place count 423 transition count 276
Deduced a syphon composed of 91 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 379 place count 316 transition count 276
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 432 place count 263 transition count 223
Iterating global reduction 3 with 53 rules applied. Total rules applied 485 place count 263 transition count 223
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 485 place count 263 transition count 219
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 493 place count 259 transition count 219
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 185 rules applied. Total rules applied 678 place count 165 transition count 128
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 682 place count 163 transition count 131
Applied a total of 682 rules in 37 ms. Remains 163 /520 variables (removed 357) and now considering 131/465 (removed 334) transitions.
[2021-05-11 19:44:21] [INFO ] Flatten gal took : 20 ms
[2021-05-11 19:44:21] [INFO ] Flatten gal took : 7 ms
[2021-05-11 19:44:21] [INFO ] Input system was already deterministic with 131 transitions.
[2021-05-11 19:44:21] [INFO ] Flatten gal took : 7 ms
[2021-05-11 19:44:21] [INFO ] Flatten gal took : 7 ms
[2021-05-11 19:44:21] [INFO ] Time to serialize gal into /tmp/CTLFireability9531684694205606408.gal : 2 ms
[2021-05-11 19:44:21] [INFO ] Time to serialize properties into /tmp/CTLFireability4102961336368570277.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability9531684694205606408.gal, -t, CGAL, -ctl, /tmp/CTLFireability4102961336368570277.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability9531684694205606408.gal -t CGAL -ctl /tmp/CTLFireability4102961336368570277.ctl --gen-order FOLLOW
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,8635,0.084384,8216,2,3308,5,11991,6,0,782,8259,0


Converting to forward existential form...Done !
original formula: !(EF((((p418==1)||(p198==1))||(p165==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((p418==1)||(p198==1))||(p165==1)))] = FALSE
(forward)formula 0,0,0.085939,8656,1,0,7,11991,8,1,791,8259,1
FORMULA BusinessProcesses-PT-11-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 519 transition count 411
Reduce places removed 53 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 61 rules applied. Total rules applied 114 place count 466 transition count 403
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 122 place count 458 transition count 403
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 97 Pre rules applied. Total rules applied 122 place count 458 transition count 306
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 208 rules applied. Total rules applied 330 place count 347 transition count 306
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 372 place count 305 transition count 264
Iterating global reduction 3 with 42 rules applied. Total rules applied 414 place count 305 transition count 264
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 414 place count 305 transition count 263
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 416 place count 304 transition count 263
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 171 rules applied. Total rules applied 587 place count 217 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 588 place count 217 transition count 178
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 594 place count 217 transition count 178
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 595 place count 216 transition count 177
Applied a total of 595 rules in 42 ms. Remains 216 /520 variables (removed 304) and now considering 177/465 (removed 288) transitions.
[2021-05-11 19:44:21] [INFO ] Flatten gal took : 24 ms
[2021-05-11 19:44:21] [INFO ] Flatten gal took : 8 ms
[2021-05-11 19:44:21] [INFO ] Input system was already deterministic with 177 transitions.
[2021-05-11 19:44:21] [INFO ] Flatten gal took : 8 ms
[2021-05-11 19:44:21] [INFO ] Flatten gal took : 8 ms
[2021-05-11 19:44:21] [INFO ] Time to serialize gal into /tmp/CTLFireability4829484934534947815.gal : 2 ms
[2021-05-11 19:44:21] [INFO ] Time to serialize properties into /tmp/CTLFireability11552048507792907511.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability4829484934534947815.gal, -t, CGAL, -ctl, /tmp/CTLFireability11552048507792907511.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability4829484934534947815.gal -t CGAL -ctl /tmp/CTLFireability11552048507792907511.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.02798e+07,0.722718,36444,2,14381,5,99597,6,0,1039,104292,0


Converting to forward existential form...Done !
original formula: E((((((((((((!(EF((((((((p78==0)||(p297==0))||(p536==0))&&(p278==0))&&(p4==0))&&(((p58==0)||(p287==0))||(p436==0))) * A((p430==1) U (((((((((((p109==1)&&(p311==1))&&(p528==1))||(p343==1))||(p84==1))||(p354==1))||(((p34==1)&&(p277==1))&&(p414==1)))||(p363==1))||(p457==1))||(p566==1))||(((p58==1)&&(p287==1))&&(p436==1))))))) * !(AF(((((((p390==1)||(p162==1))||(p244==1))||(p484==1))||(p230==1))||(p364==1))))) * (p33==0)) * (p214==0)) * (p290==0)) * (p383==0)) * (p563==0)) * (p395==0)) * (p505==0)) * (((p44==0)||(p266==0))||(p528==0))) * (((p222==0)||(p397==0))||(p524==0))) * (((p142==0)||(p336==0))||(p528==0))) U EG(((((p223==1)||(p250==1))||(((p97==1)&&(p267==1))&&(p545==1)))||(((p157==1)&&(p342==1))&&(p487==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,(((((((((((!(E(TRUE U (((((((p78==0)||(p297==0))||(p536==0))&&(p278==0))&&(p4==0))&&(((p58==0)||(p287==0))||(p436==0))) * !((E(!((((((((((((p109==1)&&(p311==1))&&(p528==1))||(p343==1))||(p84==1))||(p354==1))||(((p34==1)&&(p277==1))&&(p414==1)))||(p363==1))||(p457==1))||(p566==1))||(((p58==1)&&(p287==1))&&(p436==1)))) U (!((p430==1)) * !((((((((((((p109==1)&&(p311==1))&&(p528==1))||(p343==1))||(p84==1))||(p354==1))||(((p34==1)&&(p277==1))&&(p414==1)))||(p363==1))||(p457==1))||(p566==1))||(((p58==1)&&(p287==1))&&(p436==1)))))) + EG(!((((((((((((p109==1)&&(p311==1))&&(p528==1))||(p343==1))||(p84==1))||(p354==1))||(((p34==1)&&(p277==1))&&(p414==1)))||(p363==1))||(p457==1))||(p566==1))||(((p58==1)&&(p287==1))&&(p436==1)))))))))) * !(!(EG(!(((((((p390==1)||(p162==1))||(p244==1))||(p484==1))||(p230==1))||(p364==1))))))) * (p33==0)) * (p214==0)) * (p290==0)) * (p383==0)) * (p563==0)) * (p395==0)) * (p505==0)) * (((p44==0)||(p266==0))||(p528==0))) * (((p222==0)||(p397==0))||(p524==0))) * (((p142==0)||(p336==0))||(p528==0)))),((((p223==1)||(p250==1))||(((p97==1)&&(p267==1))&&(p545==1)))||(((p157==1)&&(p342==1))&&(p487==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t8, t12, t13, t14, t16, t19, t22, t23, t24, t26, t27, t29, t83, t84, t88, t89, t90, t91, t92, t94, t95, t96, t97, t98, t100, t107, t110, t111, t112, t113, t114, t117, t120, t132, t139, t152, t156, t157, t158, t164, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/100/41/177
Detected timeout of ITS tools.
[2021-05-11 19:44:51] [INFO ] Flatten gal took : 8 ms
[2021-05-11 19:44:51] [INFO ] Applying decomposition
[2021-05-11 19:44:51] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph18417542582545227634.txt, -o, /tmp/graph18417542582545227634.bin, -w, /tmp/graph18417542582545227634.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph18417542582545227634.bin, -l, -1, -v, -w, /tmp/graph18417542582545227634.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 19:44:51] [INFO ] Decomposing Gal with order
[2021-05-11 19:44:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 19:44:51] [INFO ] Removed a total of 121 redundant transitions.
[2021-05-11 19:44:52] [INFO ] Flatten gal took : 37 ms
[2021-05-11 19:44:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 8 ms.
[2021-05-11 19:44:52] [INFO ] Time to serialize gal into /tmp/CTLFireability8421852635607644982.gal : 4 ms
[2021-05-11 19:44:52] [INFO ] Time to serialize properties into /tmp/CTLFireability3043425152176022393.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability8421852635607644982.gal, -t, CGAL, -ctl, /tmp/CTLFireability3043425152176022393.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability8421852635607644982.gal -t CGAL -ctl /tmp/CTLFireability3043425152176022393.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.02798e+07,0.196909,10372,1050,415,10179,2190,682,16437,168,5582,0


Converting to forward existential form...Done !
original formula: E((((((((((((!(EF((((((((i6.u54.p78==0)||(i6.u26.p297==0))||(i6.u65.p536==0))&&(i4.u21.p278==0))&&(i7.u0.p4==0))&&(((i1.u3.p58==0)||(i1.u24.p287==0))||(i1.u53.p436==0))) * A((i13.i3.u51.p430==1) U (((((((((((i13.i1.u7.p109==1)&&(i13.i1.u29.p311==1))&&(i13.i3.u49.p528==1))||(i9.u35.p343==1))||(u20.p84==1))||(i8.u39.p354==1))||(((i0.i0.u1.p34==1)&&(i4.u22.p277==1))&&(i0.i0.u2.p414==1)))||(i11.i0.u40.p363==1))||(i13.i3.u55.p457==1))||(i8.u69.p566==1))||(((i1.u3.p58==1)&&(i1.u24.p287==1))&&(i1.u53.p436==1))))))) * !(AF(((((((i12.i2.u46.p390==1)||(i8.u12.p162==1))||(i11.i1.u42.p244==1))||(i2.u59.p484==1))||(i7.u18.p230==1))||(i11.i1.u41.p364==1))))) * (i0.i0.u2.p33==0)) * (i12.i0.u16.p214==0)) * (i5.u25.p290==0)) * (i14.i1.u44.p383==0)) * (i10.u68.p563==0)) * (i12.i0.u47.p395==0)) * (i13.i3.u49.p505==0)) * (((i0.i0.u2.p44==0)||(u20.p266==0))||(i13.i3.u49.p528==0))) * (((i12.i1.u17.p222==0)||(i12.i0.u47.p397==0))||(i12.i1.u64.p524==0))) * (((i2.u8.p142==0)||(i8.u34.p336==0))||(i13.i3.u49.p528==0))) U EG(((((i12.i1.u17.p223==1)||(i9.u19.p250==1))||(((u20.p97==1)&&(u20.p267==1))&&(u20.p545==1)))||(((i10.u11.p157==1)&&(i9.u36.p342==1))&&(i10.u60.p487==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,(((((((((((!(E(TRUE U (((((((i6.u54.p78==0)||(i6.u26.p297==0))||(i6.u65.p536==0))&&(i4.u21.p278==0))&&(i7.u0.p4==0))&&(((i1.u3.p58==0)||(i1.u24.p287==0))||(i1.u53.p436==0))) * !((E(!((((((((((((i13.i1.u7.p109==1)&&(i13.i1.u29.p311==1))&&(i13.i3.u49.p528==1))||(i9.u35.p343==1))||(u20.p84==1))||(i8.u39.p354==1))||(((i0.i0.u1.p34==1)&&(i4.u22.p277==1))&&(i0.i0.u2.p414==1)))||(i11.i0.u40.p363==1))||(i13.i3.u55.p457==1))||(i8.u69.p566==1))||(((i1.u3.p58==1)&&(i1.u24.p287==1))&&(i1.u53.p436==1)))) U (!((i13.i3.u51.p430==1)) * !((((((((((((i13.i1.u7.p109==1)&&(i13.i1.u29.p311==1))&&(i13.i3.u49.p528==1))||(i9.u35.p343==1))||(u20.p84==1))||(i8.u39.p354==1))||(((i0.i0.u1.p34==1)&&(i4.u22.p277==1))&&(i0.i0.u2.p414==1)))||(i11.i0.u40.p363==1))||(i13.i3.u55.p457==1))||(i8.u69.p566==1))||(((i1.u3.p58==1)&&(i1.u24.p287==1))&&(i1.u53.p436==1)))))) + EG(!((((((((((((i13.i1.u7.p109==1)&&(i13.i1.u29.p311==1))&&(i13.i3.u49.p528==1))||(i9.u35.p343==1))||(u20.p84==1))||(i8.u39.p354==1))||(((i0.i0.u1.p34==1)&&(i4.u22.p277==1))&&(i0.i0.u2.p414==1)))||(i11.i0.u40.p363==1))||(i13.i3.u55.p457==1))||(i8.u69.p566==1))||(((i1.u3.p58==1)&&(i1.u24.p287==1))&&(i1.u53.p436==1)))))))))) * !(!(EG(!(((((((i12.i2.u46.p390==1)||(i8.u12.p162==1))||(i11.i1.u42.p244==1))||(i2.u59.p484==1))||(i7.u18.p230==1))||(i11.i1.u41.p364==1))))))) * (i0.i0.u2.p33==0)) * (i12.i0.u16.p214==0)) * (i5.u25.p290==0)) * (i14.i1.u44.p383==0)) * (i10.u68.p563==0)) * (i12.i0.u47.p395==0)) * (i13.i3.u49.p505==0)) * (((i0.i0.u2.p44==0)||(u20.p266==0))||(i13.i3.u49.p528==0))) * (((i12.i1.u17.p222==0)||(i12.i0.u47.p397==0))||(i12.i1.u64.p524==0))) * (((i2.u8.p142==0)||(i8.u34.p336==0))||(i13.i3.u49.p528==0)))),((((i12.i1.u17.p223==1)||(i9.u19.p250==1))||(((u20.p97==1)&&(u20.p267==1))&&(u20.p545==1)))||(((i10.u11.p157==1)&&(i9.u36.p342==1))&&(i10.u60.p487==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t83, t84, t94, t95, t96, t97, t110, t111, t112, t113, t114, t117, t120, t132, t139, t152, t157, t158, t164, i0.i0.u2.t88, i4.t26, i4.u22.t27, i5.u25.t24, i7.u18.t29, i8.u12.t89, i8.u39.t91, i9.t22, i9.u36.t23, i10.u13.t100, i11.i0.u40.t19, i11.i1.u41.t92, i12.i0.u16.t90, i12.i0.u47.t13, i12.i0.u47.t107, i12.i2.u46.t14, i13.i1.u7.t98, i13.i3.t8, i13.i3.t12, i13.i3.t156, i13.i3.u49.t2, i14.i1.u44.t16, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :25/100/41/166
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an 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
(forward)formula 0,0,2.34233,88636,1,0,143641,8005,3690,399398,1375,31316,267073
FORMULA BusinessProcesses-PT-11-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2021-05-11 19:44:54] [INFO ] Flatten gal took : 37 ms
[2021-05-11 19:44:54] [INFO ] Flatten gal took : 26 ms
[2021-05-11 19:44:54] [INFO ] Applying decomposition
[2021-05-11 19:44:54] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13147713797277902158.txt, -o, /tmp/graph13147713797277902158.bin, -w, /tmp/graph13147713797277902158.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph13147713797277902158.bin, -l, -1, -v, -w, /tmp/graph13147713797277902158.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 19:44:54] [INFO ] Decomposing Gal with order
[2021-05-11 19:44:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 19:44:54] [INFO ] Removed a total of 234 redundant transitions.
[2021-05-11 19:44:54] [INFO ] Flatten gal took : 43 ms
[2021-05-11 19:44:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-11 19:44:54] [INFO ] Time to serialize gal into /tmp/CTLFireability11040248607216264423.gal : 8 ms
[2021-05-11 19:44:54] [INFO ] Time to serialize properties into /tmp/CTLFireability548941008002805440.ctl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability11040248607216264423.gal, -t, CGAL, -ctl, /tmp/CTLFireability548941008002805440.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability11040248607216264423.gal -t CGAL -ctl /tmp/CTLFireability548941008002805440.ctl
No direction supplied, using forward translation only.
Parsed 10 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,7.04676e+22,3.28016,114088,7831,116,162592,1272,1189,743035,94,4319,0


Converting to forward existential form...Done !
original formula: !(EG(!(AG(E((((((((((i12.u89.p244==0)&&(((i4.u80.p217==0)||(i4.u145.p392==0))||(i4.u188.p520==0)))&&(((i8.u13.p28==0)||(i8.u101.p272==0))||(i8.u155.p422==0)))&&(((i9.u27.p100==0)||(i9.u111.p297==0))||(i9.u111.p454==0)))&&(i15.u190.p493==0))&&(i13.u140.p378==0))&&(i11.i1.i0.u125.p329==0))&&(((i10.u108.p85==0)||(i10.u108.p292==0))||(i10.u108.p451==0)))&&(i9.u41.p108==0)) U AX(((((((((((i2.u15.p33==1)||(((i9.u31.p88==1)&&(i9.u111.p297==1))&&(i9.u162.p536==1)))||(i15.u152.p405==1))||(((i4.u78.p212==1)&&(i14.u146.p396==1))&&(i15.u190.p528==1)))||(i2.u19.p37==1))||(i13.u88.p241==1))||(i3.u50.p133==1))||(i10.u150.p527==1))||(((i5.u58.p154==1)&&(i5.u131.p351==1))&&(i15.u190.p528==1)))||(i3.u173.p474==1))))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(E((((((((((i12.u89.p244==0)&&(((i4.u80.p217==0)||(i4.u145.p392==0))||(i4.u188.p520==0)))&&(((i8.u13.p28==0)||(i8.u101.p272==0))||(i8.u155.p422==0)))&&(((i9.u27.p100==0)||(i9.u111.p297==0))||(i9.u111.p454==0)))&&(i15.u190.p493==0))&&(i13.u140.p378==0))&&(i11.i1.i0.u125.p329==0))&&(((i10.u108.p85==0)||(i10.u108.p292==0))||(i10.u108.p451==0)))&&(i9.u41.p108==0)) U !(EX(!(((((((((((i2.u15.p33==1)||(((i9.u31.p88==1)&&(i9.u111.p297==1))&&(i9.u162.p536==1)))||(i15.u152.p405==1))||(((i4.u78.p212==1)&&(i14.u146.p396==1))&&(i15.u190.p528==1)))||(i2.u19.p37==1))||(i13.u88.p241==1))||(i3.u50.p133==1))||(i10.u150.p527==1))||(((i5.u58.p154==1)&&(i5.u131.p351==1))&&(i15.u190.p528==1)))||(i3.u173.p474==1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t9, t12, t59, t220, t226, t242, t254, t262, t266, t284, t292, t460, i0.t288, i0.t178, i0.u42.t291, i0.u114.t179, i1.t317, i1.t313, i1.u22.t320, i1.u24.t316, i2.t337, i2.t333, i2.t331, i2.t328, i2.t325, i2.t323, i2.u19.t329, i2.u19.t332, i3.t281, i3.t278, i3.t274, i3.t170, i3.u44.t287, i3.u49.t277, i3.u46.t283, i3.u119.t171, i4.t223, i4.t114, i4.u78.t225, i4.u143.t117, i4.u145.t115, i5.t258, i5.u56.t265, i5.u58.t261, i5.u130.t146, i5.u131.t143, i6.t182, i6.t174, i6.t166, i6.t162, i6.u112.t183, i6.u116.t175, i6.u121.t167, i6.u122.t163, i7.t198, i7.t194, i7.u105.t199, i7.u106.t195, i8.t202, i8.u12.t340, i8.u103.t203, i9.t296, i9.t208, i9.t186, i9.t2, i9.u99.t209, i9.u26.t294, i9.u26.t306, i9.u26.t312, i9.u111.t187, i10.t190, i10.t57, i10.t7, i10.u108.t191, i10.u150.t13, i10.u150.t15, i10.u150.t23, i10.u150.t25, i10.u150.t37, i10.u150.t46, i10.u150.t82, i10.u150.t93, i11.i0.i0.u51.t273, i11.i1.i0.t158, i11.i1.i0.u124.t159, i11.i1.i1.t154, i11.i1.i1.u126.t155, i11.i1.i2.t150, i11.i1.i2.u128.t151, i12.t230, i12.t132, i12.u72.t237, i12.u74.t233, i12.u137.t133, i13.t238, i13.t125, i13.t121, i13.u68.t245, i13.u70.t241, i13.u139.t126, i13.u142.t122, i14.t216, i14.t110, i14.t106, i14.u85.t211, i14.u76.t229, i14.u81.t219, i14.u83.t214, i14.u146.t111, i14.u149.t107, i15.t100, i15.t89, i15.t86, i15.t84, i15.t81, i15.t78, i15.t55, i15.t52, i15.t49, i15.t44, i15.t42, i15.t40, i15.t21, i15.t18, i15.u190.t34, i15.u190.t66, i15.u190.t75, i16.i0.i0.t140, i16.i0.i0.u132.t141, i16.i0.i1.t136, i16.i0.i1.u135.t137, i16.i1.i1.t246, i16.i1.i1.u60.t257, i16.i1.i1.u62.t253, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/293/136/465
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 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 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,169.174,2201560,1,0,3.64549e+06,1918,2609,9.9962e+06,195,7644,3231937
FORMULA BusinessProcesses-PT-11-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EF((i9.u165.p447==1)) * EF(EG(AX(((i3.u46.p122==1)||(i6.u94.p254==1))))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * E(TRUE U (i9.u165.p447==1))),TRUE),!(EX(!(((i3.u46.p122==1)||(i6.u94.p254==1))))))] != FALSE
(forward)formula 1,1,176.404,2201560,1,0,3.64549e+06,1918,5553,9.9962e+06,283,7644,4095791
FORMULA BusinessProcesses-PT-11-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(EX((EF(EG(((((((((i10.u109.p293==1)||(i8.u98.p262==1))||(i10.u195.p541==1))||(i16.i0.i0.u132.p355==1))||(i16.i1.i2.u63.p168==1))||(i14.u85.p233==1))||(((i10.u108.p85==1)&&(i10.u108.p292==1))&&(i9.u191.p533==1)))||(i5.u58.p156==1)))) * EF(((i9.u38.p99==1)||(i11.i1.i0.u125.p333==1))))))
=> equivalent forward existential formula: [FwdG(Init,EX((E(TRUE U EG(((((((((i10.u109.p293==1)||(i8.u98.p262==1))||(i10.u195.p541==1))||(i16.i0.i0.u132.p355==1))||(i16.i1.i2.u63.p168==1))||(i14.u85.p233==1))||(((i10.u108.p85==1)&&(i10.u108.p292==1))&&(i9.u191.p533==1)))||(i5.u58.p156==1)))) * E(TRUE U ((i9.u38.p99==1)||(i11.i1.i0.u125.p333==1))))))] != FALSE
(forward)formula 2,1,318.95,2432560,1,0,4.15509e+06,1918,4187,1.02165e+07,233,7644,3576366
FORMULA BusinessProcesses-PT-11-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(!(E(((((((i15.u171.p465==1)||(i15.u175.p480==1))||(i16.i0.i0.u133.p354==1))||(i14.u3.p7==1))||(i15.u174.p475==1)) + EF(EG(((((((((i3.u8.p17==1)||(i6.u121.p320==1))||(i0.u10.p21==1))||(i10.u109.p289==1))||(((i10.u108.p75==1)&&(i10.u108.p292==1))&&(i10.u163.p542==1)))||(i15.u169.p462==1))||(i10.u150.p429==1))||(i14.u76.p207==1))))) U EX(EX((((((((i3.u48.p126==1)&&(i6.u116.p312==1))&&(i3.u172.p469==1))||(i10.u150.p486==1))||(i6.u112.p300==1))||(i8.u13.p29==1))||(i12.u75.p204==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(((((((i15.u171.p465==1)||(i15.u175.p480==1))||(i16.i0.i0.u133.p354==1))||(i14.u3.p7==1))||(i15.u174.p475==1)) + E(TRUE U EG(((((((((i3.u8.p17==1)||(i6.u121.p320==1))||(i0.u10.p21==1))||(i10.u109.p289==1))||(((i10.u108.p75==1)&&(i10.u108.p292==1))&&(i10.u163.p542==1)))||(i15.u169.p462==1))||(i10.u150.p429==1))||(i14.u76.p207==1))))) U EX(EX((((((((i3.u48.p126==1)&&(i6.u116.p312==1))&&(i3.u172.p469==1))||(i10.u150.p486==1))||(i6.u112.p300==1))||(i8.u13.p29==1))||(i12.u75.p204==1))))))))] = FALSE
(forward)formula 3,0,866.351,3332928,1,0,6.43579e+06,1918,2609,1.3213e+07,195,7644,6995672
FORMULA BusinessProcesses-PT-11-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((((AF((((((((((((((i11.i1.i2.u128.p340==0)&&((i9.u30.p79==0)||(i9.u166.p455==0)))&&(i13.u68.p182==0))&&(i9.u32.p84==0))&&(i9.u191.p529==0))&&(i6.u117.p313==0))||(((((i3.u50.p132==0)&&(i16.i1.i2.u63.p169==0))&&(i13.u71.p191==0))&&(i6.u123.p328==0))&&(i15.u156.p424==0)))||(i14.u2.p5==1))||(i14.u83.p230==1))||(i15.u176.p481==1))||(i6.u120.p323==1))||(i9.u192.p532==1))||(i6.u113.p299==1))) * EF((EG((i15.u174.p475==1)) + ((((((i12.u138.p373==1)||(((i10.u108.p75==1)&&(i10.u108.p292==1))&&(i9.u191.p533==1)))||(i16.i1.i3.u202.p557==1))||(i1.u11.p22==1))||(i5.u58.p155==1))&&(((((((((i15.u154.p418==1)||(i0.u10.p20==1))||(i15.u175.p480==1))||(i16.i1.i3.u203.p560==1))||(((i10.u108.p75==1)&&(i10.u108.p292==1))&&(i10.u163.p542==1)))||(i15.u174.p476==1))||(((i2.u17.p44==1)&&(i7.u105.p281==1))&&(i15.u190.p528==1)))||((i10.u195.p540==1)&&(i10.u196.p543==1)))||(i11.i1.i0.u124.p330==1)))))) * AX(((((((((((i7.u97.p260==1)||(i14.u0.p0==1))||(i4.u144.p389==1))||(i11.i0.i0.u51.p134==1))||(i16.i1.i1.u62.p167==1))||(i6.u93.p252==1))||(i7.u106.p285==1))||((i9.u36.p92==1)&&(i10.u37.p95==1)))&&(((((((((((i3.u48.p126==1)&&(i6.u116.p312==1))&&(i3.u172.p469==1))||(i14.u77.p210==1))||(i11.i0.i1.u55.p147==1))||(i3.u8.p17==1))||(i3.u49.p129==1))||(i10.u108.p450==1))||(i1.u11.p23==1))||(i15.u190.p528==1))||(i5.u7.p14==1)))&&(((((((((i3.u49.p130==1)||(i7.u97.p261==1))||(i4.u144.p389==1))||(i12.u73.p198==1))||(i4.u143.p384==1))||(i1.u24.p57==1))||(((i10.u108.p94==1)&&(i10.u108.p292==1))&&(i9.u191.p533==1)))||(i9.u199.p550==1))||(i14.u81.p220==1))))) * EG((((i9.u201.p556==1)||(((i8.u13.p28==1)&&(i8.u101.p272==1))&&(i8.u155.p422==1)))||(i3.u46.p123==1)))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * ((!(EG(!((((((((((((((i11.i1.i2.u128.p340==0)&&((i9.u30.p79==0)||(i9.u166.p455==0)))&&(i13.u68.p182==0))&&(i9.u32.p84==0))&&(i9.u191.p529==0))&&(i6.u117.p313==0))||(((((i3.u50.p132==0)&&(i16.i1.i2.u63.p169==0))&&(i13.u71.p191==0))&&(i6.u123.p328==0))&&(i15.u156.p424==0)))||(i14.u2.p5==1))||(i14.u83.p230==1))||(i15.u176.p481==1))||(i6.u120.p323==1))||(i9.u192.p532==1))||(i6.u113.p299==1))))) * E(TRUE U (EG((i15.u174.p475==1)) + ((((((i12.u138.p373==1)||(((i10.u108.p75==1)&&(i10.u108.p292==1))&&(i9.u191.p533==1)))||(i16.i1.i3.u202.p557==1))||(i1.u11.p22==1))||(i5.u58.p155==1))&&(((((((((i15.u154.p418==1)||(i0.u10.p20==1))||(i15.u175.p480==1))||(i16.i1.i3.u203.p560==1))||(((i10.u108.p75==1)&&(i10.u108.p292==1))&&(i10.u163.p542==1)))||(i15.u174.p476==1))||(((i2.u17.p44==1)&&(i7.u105.p281==1))&&(i15.u190.p528==1)))||((i10.u195.p540==1)&&(i10.u196.p543==1)))||(i11.i1.i0.u124.p330==1)))))) * !(EX(!(((((((((((i7.u97.p260==1)||(i14.u0.p0==1))||(i4.u144.p389==1))||(i11.i0.i0.u51.p134==1))||(i16.i1.i1.u62.p167==1))||(i6.u93.p252==1))||(i7.u106.p285==1))||((i9.u36.p92==1)&&(i10.u37.p95==1)))&&(((((((((((i3.u48.p126==1)&&(i6.u116.p312==1))&&(i3.u172.p469==1))||(i14.u77.p210==1))||(i11.i0.i1.u55.p147==1))||(i3.u8.p17==1))||(i3.u49.p129==1))||(i10.u108.p450==1))||(i1.u11.p23==1))||(i15.u190.p528==1))||(i5.u7.p14==1)))&&(((((((((i3.u49.p130==1)||(i7.u97.p261==1))||(i4.u144.p389==1))||(i12.u73.p198==1))||(i4.u143.p384==1))||(i1.u24.p57==1))||(((i10.u108.p94==1)&&(i10.u108.p292==1))&&(i9.u191.p533==1)))||(i9.u199.p550==1))||(i14.u81.p220==1)))))))),(((i9.u201.p556==1)||(((i8.u13.p28==1)&&(i8.u101.p272==1))&&(i8.u155.p422==1)))||(i3.u46.p123==1)))] != FALSE
(forward)formula 4,1,946.654,3667576,1,0,6.77718e+06,1918,4275,1.3213e+07,265,7644,3357231
FORMULA BusinessProcesses-PT-11-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(EF(AG(A(((((((((i13.u140.p374==1)||(i10.u109.p289==1))||(i13.u88.p242==1))||(i16.i1.i3.u203.p560==1))||(i9.u198.p547==1))||(i16.i1.i0.u179.p492==1))||(i2.u21.p31==1))||(((i12.u75.p203==1)&&(i12.u138.p372==1))&&(i12.u184.p510==1))) U (((((((((i9.u27.p67==1)||(i9.u110.p294==1))||(i1.u22.p50==1))||(i5.u56.p150==1))||(i10.u150.p527==1))||(i12.u184.p511==1))||(i7.u107.p284==1))||((i9.u30.p79==1)&&(i9.u166.p455==1)))||(((i9.u28.p106==1)&&(i9.u111.p297==1))&&(i9.u162.p536==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U !(!((E(!((((((((((i9.u27.p67==1)||(i9.u110.p294==1))||(i1.u22.p50==1))||(i5.u56.p150==1))||(i10.u150.p527==1))||(i12.u184.p511==1))||(i7.u107.p284==1))||((i9.u30.p79==1)&&(i9.u166.p455==1)))||(((i9.u28.p106==1)&&(i9.u111.p297==1))&&(i9.u162.p536==1)))) U (!(((((((((i13.u140.p374==1)||(i10.u109.p289==1))||(i13.u88.p242==1))||(i16.i1.i3.u203.p560==1))||(i9.u198.p547==1))||(i16.i1.i0.u179.p492==1))||(i2.u21.p31==1))||(((i12.u75.p203==1)&&(i12.u138.p372==1))&&(i12.u184.p510==1)))) * !((((((((((i9.u27.p67==1)||(i9.u110.p294==1))||(i1.u22.p50==1))||(i5.u56.p150==1))||(i10.u150.p527==1))||(i12.u184.p511==1))||(i7.u107.p284==1))||((i9.u30.p79==1)&&(i9.u166.p455==1)))||(((i9.u28.p106==1)&&(i9.u111.p297==1))&&(i9.u162.p536==1)))))) + EG(!((((((((((i9.u27.p67==1)||(i9.u110.p294==1))||(i1.u22.p50==1))||(i5.u56.p150==1))||(i10.u150.p527==1))||(i12.u184.p511==1))||(i7.u107.p284==1))||((i9.u30.p79==1)&&(i9.u166.p455==1)))||(((i9.u28.p106==1)&&(i9.u111.p297==1))&&(i9.u162.p536==1)))))))))))))] = FALSE
(forward)formula 5,0,998.508,3667576,1,0,6.77718e+06,1918,5454,1.3213e+07,286,7644,4991310
FORMULA BusinessProcesses-PT-11-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((EF((((((((((((i9.u31.p81==0)&&(i8.u98.p263==0))&&(i2.u19.p37==0))&&(i10.u108.p290==0))&&(((i13.u70.p186==0)||(i13.u142.p381==0))||(i15.u190.p528==0)))&&(i10.u40.p105==0))&&(i2.u20.p42==0))&&(i9.u199.p550==0))||((((((i14.u76.p206==0)||(i4.u143.p386==0))||(i15.u190.p528==0))&&(i10.u150.p523==0))&&(i2.u18.p38==0))&&(i5.u130.p344==0))) * EX(((((((((((((i9.u27.p100==1)&&(i9.u111.p297==1))&&(i9.u162.p536==1))||(((i8.u13.p28==1)&&(i8.u101.p272==1))&&(i8.u155.p422==1)))||(i16.i0.i0.u133.p354==1))||(i12.u137.p365==1))||(i11.i1.i0.u125.p333==1))||(i15.u158.p431==1))||(i6.u120.p319==1))||(((i14.u77.p209==1)&&(i13.u142.p382==1))&&(i14.u186.p514==1)))||(i3.u119.p315==1))||(i8.u13.p30==1)))) * !(EG((((((i1.u23.p53==1)||(i16.i0.i0.u132.p355==1))||(i5.u56.p149==1))||(i1.u24.p56==1))||(i12.u4.p9==1)))))) * EX(((((((((((((((((((((((i0.u114.p305==0)&&(i0.u42.p110==0))||(((((i9.u29.p70==0)&&(i14.u85.p235==0))&&(i9.u165.p446==0))&&(i11.i1.i1.u126.p335==0))&&(i13.u5.p11==0)))||((((((((((i11.i1.i2.u129.p343==0)&&(i14.u148.p403==0))&&(i15.u175.p479==0))&&(i12.u136.p364==0))&&(i0.u168.p460==0))&&(i5.u57.p153==0))&&(((i10.u108.p94==0)||(i10.u108.p292==0))||(i10.u108.p451==0)))&&(i8.u13.p30==0))&&(i14.u81.p220==0))&&(i9.u26.p62==0)))||(i4.u78.p213==0))&&(i9.u110.p294==0))&&(i13.u88.p241==0))&&(((i8.u12.p25==0)||(i8.u103.p276==0))||(i15.u190.p528==0)))&&(i3.u50.p132==0))&&(((i5.u57.p151==0)||(i11.i1.i0.u124.p332==0))||(i5.u177.p483==0)))&&(i15.u153.p417==0))&&(i10.u150.p429==0))&&(((i2.u17.p44==0)||(i7.u105.p281==0))||(i15.u190.p528==0)))&&(((i10.u108.p75==0)||(i10.u108.p292==0))||(i9.u191.p533==0)))&&(i16.i1.i1.u67.p179==0))&&(((i3.u48.p126==0)||(i6.u116.p312==0))||(i3.u172.p469==0)))&&(i9.u162.p439==0))&&(i5.u91.p248==0))&&(((i16.i1.i2.u63.p177==0)||(i16.i0.i0.u132.p357==0))||(i16.i1.i3.u180.p564==0)))&&(i10.u150.p472==0))&&(((i16.i1.i1.u60.p160==0)||(i16.i0.i0.u132.p356==0))||(i15.u190.p528==0))) * !(EX((((((((((i9.u27.p100==1)&&(i9.u111.p297==1))&&(i9.u164.p554==1))||(i9.u27.p67==1))||(i15.u160.p434==1))||(i13.u5.p10==1))||(((i9.u35.p91==1)&&(i9.u99.p267==1))&&(i9.u191.p530==1)))||(i15.u187.p519==1))||(i12.u75.p204==1))))))))
=> equivalent forward existential formula: [((EY((FwdU(Init,TRUE) * E(TRUE U (((((((((((i9.u31.p81==0)&&(i8.u98.p263==0))&&(i2.u19.p37==0))&&(i10.u108.p290==0))&&(((i13.u70.p186==0)||(i13.u142.p381==0))||(i15.u190.p528==0)))&&(i10.u40.p105==0))&&(i2.u20.p42==0))&&(i9.u199.p550==0))||((((((i14.u76.p206==0)||(i4.u143.p386==0))||(i15.u190.p528==0))&&(i10.u150.p523==0))&&(i2.u18.p38==0))&&(i5.u130.p344==0))) * EX(((((((((((((i9.u27.p100==1)&&(i9.u111.p297==1))&&(i9.u162.p536==1))||(((i8.u13.p28==1)&&(i8.u101.p272==1))&&(i8.u155.p422==1)))||(i16.i0.i0.u133.p354==1))||(i12.u137.p365==1))||(i11.i1.i0.u125.p333==1))||(i15.u158.p431==1))||(i6.u120.p319==1))||(((i14.u77.p209==1)&&(i13.u142.p382==1))&&(i14.u186.p514==1)))||(i3.u119.p315==1))||(i8.u13.p30==1)))) * !(EG((((((i1.u23.p53==1)||(i16.i0.i0.u132.p355==1))||(i5.u56.p149==1))||(i1.u24.p56==1))||(i12.u4.p9==1)))))))) * (((((((((((((((((((((i0.u114.p305==0)&&(i0.u42.p110==0))||(((((i9.u29.p70==0)&&(i14.u85.p235==0))&&(i9.u165.p446==0))&&(i11.i1.i1.u126.p335==0))&&(i13.u5.p11==0)))||((((((((((i11.i1.i2.u129.p343==0)&&(i14.u148.p403==0))&&(i15.u175.p479==0))&&(i12.u136.p364==0))&&(i0.u168.p460==0))&&(i5.u57.p153==0))&&(((i10.u108.p94==0)||(i10.u108.p292==0))||(i10.u108.p451==0)))&&(i8.u13.p30==0))&&(i14.u81.p220==0))&&(i9.u26.p62==0)))||(i4.u78.p213==0))&&(i9.u110.p294==0))&&(i13.u88.p241==0))&&(((i8.u12.p25==0)||(i8.u103.p276==0))||(i15.u190.p528==0)))&&(i3.u50.p132==0))&&(((i5.u57.p151==0)||(i11.i1.i0.u124.p332==0))||(i5.u177.p483==0)))&&(i15.u153.p417==0))&&(i10.u150.p429==0))&&(((i2.u17.p44==0)||(i7.u105.p281==0))||(i15.u190.p528==0)))&&(((i10.u108.p75==0)||(i10.u108.p292==0))||(i9.u191.p533==0)))&&(i16.i1.i1.u67.p179==0))&&(((i3.u48.p126==0)||(i6.u116.p312==0))||(i3.u172.p469==0)))&&(i9.u162.p439==0))&&(i5.u91.p248==0))&&(((i16.i1.i2.u63.p177==0)||(i16.i0.i0.u132.p357==0))||(i16.i1.i3.u180.p564==0)))&&(i10.u150.p472==0))&&(((i16.i1.i1.u60.p160==0)||(i16.i0.i0.u132.p356==0))||(i15.u190.p528==0)))) * !(EX((((((((((i9.u27.p100==1)&&(i9.u111.p297==1))&&(i9.u164.p554==1))||(i9.u27.p67==1))||(i15.u160.p434==1))||(i13.u5.p10==1))||(((i9.u35.p91==1)&&(i9.u99.p267==1))&&(i9.u191.p530==1)))||(i15.u187.p519==1))||(i12.u75.p204==1)))))] != FALSE
(forward)formula 6,1,1077.07,3890832,1,0,6.77718e+06,1918,5869,1.5866e+07,296,7644,6833686
FORMULA BusinessProcesses-PT-11-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF((AX(AX((((((((((i14.u0.p1==1)||(((i4.u80.p217==1)&&(i4.u143.p387==1))&&(i4.u188.p520==1)))||(i7.u107.p284==1))||(i15.u169.p461==1))||(i13.u71.p191==1))||((i10.u195.p540==1)&&(i10.u196.p543==1)))||(i3.u119.p315==1))||(i11.i1.i0.u92.p250==1))||(i12.u75.p205==1)))) + (i11.i1.i0.u92.p251==1)))
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(!(EX(!((((((((((i14.u0.p1==1)||(((i4.u80.p217==1)&&(i4.u143.p387==1))&&(i4.u188.p520==1)))||(i7.u107.p284==1))||(i15.u169.p461==1))||(i13.u71.p191==1))||((i10.u195.p540==1)&&(i10.u196.p543==1)))||(i3.u119.p315==1))||(i11.i1.i0.u92.p250==1))||(i12.u75.p205==1)))))))) + (i11.i1.i0.u92.p251==1))))] = FALSE
(forward)formula 7,0,1109.24,4040256,1,0,6.77718e+06,1918,2566,1.63712e+07,191,7644,138357
FORMULA BusinessProcesses-PT-11-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EX(((E(EG((((((i9.u31.p82==0)||(i9.u99.p267==0))||(i10.u163.p539==0))&&(i15.u157.p426==0))&&(((i10.u108.p85==0)||(i10.u108.p292==0))||(i10.u108.p451==0)))) U (((((((((((((((((i3.u48.p126==1)&&(i6.u116.p312==1))&&(i3.u172.p469==1))||(i14.u1.p2==1))||(i11.i1.i2.u129.p339==1))||(i12.u183.p507==1))||(i7.u104.p283==1))||(((i3.u46.p121==1)&&(i6.u121.p321==1))&&(i15.u190.p528==1)))||(i3.u9.p19==1))||(i14.u189.p525==1))||(i14.u149.p400==1))||(i13.u88.p242==1))||(i7.u96.p259==1))||(((i16.i1.i1.u62.p166==1)&&(i16.i0.i1.u135.p361==1))&&(i15.u190.p528==1)))||(i0.u42.p111==1)) * EX(((((((i11.i0.i1.u55.p147==1)||((i9.u30.p79==1)&&(i9.u166.p455==1)))||(i13.u88.p241==1))||(i12.u136.p364==1))||(i15.u169.p461==1))||(i15.u187.p518==1)))) * AF((((((((i9.u35.p91==1)&&(i9.u99.p267==1))&&(i9.u165.p448==1))||(i9.u30.p80==1))||(i4.u143.p384==1))||(i12.u89.p243==1))||(i0.u42.p111==1))))) * ((((((((((i9.u27.p97==1)&&(i9.u99.p267==1))&&(i9.u197.p545==1))||(i9.u110.p294==1))||(((i9.u31.p82==1)&&(i9.u99.p267==1))&&(i9.u165.p448==1)))||(i9.u111.p295==1))||(i12.u136.p364==1))||(i12.u4.p9==1))||(((i14.u77.p209==1)&&(i13.u142.p382==1))&&(i14.u186.p514==1)))||(((i9.u26.p61==1)&&(i0.u114.p306==1))&&(i15.u190.p528==1)))) * EX((((((((((i10.u108.p75==1)&&(i10.u108.p292==1))&&(i10.u108.p451==1))||((i9.u30.p79==1)&&(i9.u166.p455==1)))||(i16.i0.i0.u133.p354==1))||(i9.u100.p268==1))||(i15.u169.p462==1))||(((i16.i1.i0.u61.p163==1)&&(i11.i1.i1.u126.p337==1))&&(i16.i1.i0.u179.p491==1)))||(((i11.i0.i0.u52.p142==1)&&(i11.i1.i1.u126.p336==1))&&(i15.u190.p528==1)))))))
=> equivalent forward existential formula: [(EY((EY(Init) * (E(EG((((((i9.u31.p82==0)||(i9.u99.p267==0))||(i10.u163.p539==0))&&(i15.u157.p426==0))&&(((i10.u108.p85==0)||(i10.u108.p292==0))||(i10.u108.p451==0)))) U (((((((((((((((((i3.u48.p126==1)&&(i6.u116.p312==1))&&(i3.u172.p469==1))||(i14.u1.p2==1))||(i11.i1.i2.u129.p339==1))||(i12.u183.p507==1))||(i7.u104.p283==1))||(((i3.u46.p121==1)&&(i6.u121.p321==1))&&(i15.u190.p528==1)))||(i3.u9.p19==1))||(i14.u189.p525==1))||(i14.u149.p400==1))||(i13.u88.p242==1))||(i7.u96.p259==1))||(((i16.i1.i1.u62.p166==1)&&(i16.i0.i1.u135.p361==1))&&(i15.u190.p528==1)))||(i0.u42.p111==1)) * EX(((((((i11.i0.i1.u55.p147==1)||((i9.u30.p79==1)&&(i9.u166.p455==1)))||(i13.u88.p241==1))||(i12.u136.p364==1))||(i15.u169.p461==1))||(i15.u187.p518==1)))) * !(EG(!((((((((i9.u35.p91==1)&&(i9.u99.p267==1))&&(i9.u165.p448==1))||(i9.u30.p80==1))||(i4.u143.p384==1))||(i12.u89.p243==1))||(i0.u42.p111==1))))))) * ((((((((((i9.u27.p97==1)&&(i9.u99.p267==1))&&(i9.u197.p545==1))||(i9.u110.p294==1))||(((i9.u31.p82==1)&&(i9.u99.p267==1))&&(i9.u165.p448==1)))||(i9.u111.p295==1))||(i12.u136.p364==1))||(i12.u4.p9==1))||(((i14.u77.p209==1)&&(i13.u142.p382==1))&&(i14.u186.p514==1)))||(((i9.u26.p61==1)&&(i0.u114.p306==1))&&(i15.u190.p528==1)))))) * (((((((((i10.u108.p75==1)&&(i10.u108.p292==1))&&(i10.u108.p451==1))||((i9.u30.p79==1)&&(i9.u166.p455==1)))||(i16.i0.i0.u133.p354==1))||(i9.u100.p268==1))||(i15.u169.p462==1))||(((i16.i1.i0.u61.p163==1)&&(i11.i1.i1.u126.p337==1))&&(i16.i1.i0.u179.p491==1)))||(((i11.i0.i0.u52.p142==1)&&(i11.i1.i1.u126.p336==1))&&(i15.u190.p528==1))))] = FALSE
(forward)formula 8,1,1212.91,4040256,1,0,6.77718e+06,1918,4257,1.63712e+07,246,7644,3889868
FORMULA BusinessProcesses-PT-11-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX((((((((((i16.i0.i0.u133.p358==1)||(i15.u171.p465==1))||(i9.u100.p268==1))||(i16.i1.i3.u203.p560==1))||(i11.i1.i1.u127.p334==1))||(i15.u157.p426==1))||(i0.u42.p111==1))||(((i10.u108.p94==1)&&(i10.u108.p292==1))&&(i10.u163.p542==1)))||(((i10.u108.p94==1)&&(i10.u108.p292==1))&&(i10.u108.p451==1))))
=> equivalent forward existential formula: [(EY(Init) * (((((((((i16.i0.i0.u133.p358==1)||(i15.u171.p465==1))||(i9.u100.p268==1))||(i16.i1.i3.u203.p560==1))||(i11.i1.i1.u127.p334==1))||(i15.u157.p426==1))||(i0.u42.p111==1))||(((i10.u108.p94==1)&&(i10.u108.p292==1))&&(i10.u163.p542==1)))||(((i10.u108.p94==1)&&(i10.u108.p292==1))&&(i10.u108.p451==1))))] != FALSE
(forward)formula 9,0,1212.93,4040256,1,0,6.77718e+06,1918,4310,1.63712e+07,252,7644,3895140
FORMULA BusinessProcesses-PT-11-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1620763508487

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-11"
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-11, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-tajo-162038143800402"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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