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-162038143800394.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-10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143800394
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 133K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K 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.5K 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 2.0K 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.7K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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 131K 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-10-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-10-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620762179526

Running Version 0
[2021-05-11 19:43:01] [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:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 19:43:01] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2021-05-11 19:43:01] [INFO ] Transformed 518 places.
[2021-05-11 19:43:01] [INFO ] Transformed 471 transitions.
[2021-05-11 19:43:01] [INFO ] Found NUPN structural information;
[2021-05-11 19:43:01] [INFO ] Parsed PT model containing 518 places and 471 transitions in 116 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 373 out of 518 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 518/518 places, 471/471 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 517 transition count 471
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 501 transition count 455
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 501 transition count 455
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 499 transition count 453
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 499 transition count 453
Applied a total of 37 rules in 58 ms. Remains 499 /518 variables (removed 19) and now considering 453/471 (removed 18) transitions.
// Phase 1: matrix 453 rows 499 cols
[2021-05-11 19:43:01] [INFO ] Computed 84 place invariants in 25 ms
[2021-05-11 19:43:02] [INFO ] Implicit Places using invariants in 262 ms returned []
// Phase 1: matrix 453 rows 499 cols
[2021-05-11 19:43:02] [INFO ] Computed 84 place invariants in 9 ms
[2021-05-11 19:43:02] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
// Phase 1: matrix 453 rows 499 cols
[2021-05-11 19:43:02] [INFO ] Computed 84 place invariants in 7 ms
[2021-05-11 19:43:02] [INFO ] Dead Transitions using invariants and state equation in 237 ms returned []
Finished structural reductions, in 1 iterations. Remains : 499/518 places, 453/471 transitions.
[2021-05-11 19:43:02] [INFO ] Flatten gal took : 66 ms
[2021-05-11 19:43:02] [INFO ] Flatten gal took : 34 ms
[2021-05-11 19:43:03] [INFO ] Input system was already deterministic with 453 transitions.
Incomplete random walk after 100000 steps, including 827 resets, run finished after 383 ms. (steps per millisecond=261 ) properties (out of 71) seen :69
Running SMT prover for 2 properties.
// Phase 1: matrix 453 rows 499 cols
[2021-05-11 19:43:03] [INFO ] Computed 84 place invariants in 23 ms
[2021-05-11 19:43:03] [INFO ] [Real]Absence check using 45 positive place invariants in 13 ms returned sat
[2021-05-11 19:43:03] [INFO ] [Real]Absence check using 45 positive and 39 generalized place invariants in 12 ms returned sat
[2021-05-11 19:43:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:03] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2021-05-11 19:43:03] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 3 ms to minimize.
[2021-05-11 19:43:04] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 1 ms to minimize.
[2021-05-11 19:43:04] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 1 ms to minimize.
[2021-05-11 19:43:04] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 2 ms to minimize.
[2021-05-11 19:43:04] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 1 ms to minimize.
[2021-05-11 19:43:04] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2021-05-11 19:43:04] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 0 ms to minimize.
[2021-05-11 19:43:04] [INFO ] Deduced a trap composed of 118 places in 107 ms of which 2 ms to minimize.
[2021-05-11 19:43:05] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 0 ms to minimize.
[2021-05-11 19:43:05] [INFO ] Deduced a trap composed of 116 places in 112 ms of which 1 ms to minimize.
[2021-05-11 19:43:05] [INFO ] Deduced a trap composed of 107 places in 112 ms of which 1 ms to minimize.
[2021-05-11 19:43:05] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 1 ms to minimize.
[2021-05-11 19:43:05] [INFO ] Deduced a trap composed of 111 places in 118 ms of which 0 ms to minimize.
[2021-05-11 19:43:05] [INFO ] Deduced a trap composed of 109 places in 120 ms of which 0 ms to minimize.
[2021-05-11 19:43:05] [INFO ] Deduced a trap composed of 107 places in 164 ms of which 0 ms to minimize.
[2021-05-11 19:43:06] [INFO ] Deduced a trap composed of 117 places in 136 ms of which 1 ms to minimize.
[2021-05-11 19:43:06] [INFO ] Deduced a trap composed of 113 places in 147 ms of which 1 ms to minimize.
[2021-05-11 19:43:06] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 0 ms to minimize.
[2021-05-11 19:43:06] [INFO ] Deduced a trap composed of 124 places in 120 ms of which 1 ms to minimize.
[2021-05-11 19:43:06] [INFO ] Deduced a trap composed of 57 places in 120 ms of which 0 ms to minimize.
[2021-05-11 19:43:06] [INFO ] Deduced a trap composed of 139 places in 95 ms of which 1 ms to minimize.
[2021-05-11 19:43:06] [INFO ] Deduced a trap composed of 113 places in 145 ms of which 1 ms to minimize.
[2021-05-11 19:43:07] [INFO ] Deduced a trap composed of 111 places in 128 ms of which 1 ms to minimize.
[2021-05-11 19:43:07] [INFO ] Deduced a trap composed of 56 places in 113 ms of which 0 ms to minimize.
[2021-05-11 19:43:07] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 1 ms to minimize.
[2021-05-11 19:43:07] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 0 ms to minimize.
[2021-05-11 19:43:07] [INFO ] Deduced a trap composed of 105 places in 118 ms of which 1 ms to minimize.
[2021-05-11 19:43:07] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 1 ms to minimize.
[2021-05-11 19:43:07] [INFO ] Deduced a trap composed of 108 places in 92 ms of which 0 ms to minimize.
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 107 places in 113 ms of which 0 ms to minimize.
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 123 places in 92 ms of which 0 ms to minimize.
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 106 places in 88 ms of which 0 ms to minimize.
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 120 places in 83 ms of which 0 ms to minimize.
[2021-05-11 19:43:08] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 4584 ms
[2021-05-11 19:43:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:43:08] [INFO ] [Nat]Absence check using 45 positive place invariants in 19 ms returned sat
[2021-05-11 19:43:08] [INFO ] [Nat]Absence check using 45 positive and 39 generalized place invariants in 14 ms returned sat
[2021-05-11 19:43:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:08] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 1 ms to minimize.
[2021-05-11 19:43:08] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 1 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 122 places in 155 ms of which 0 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 0 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 0 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 0 ms to minimize.
[2021-05-11 19:43:09] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 0 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 0 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 1 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 1 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 1 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 1 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 1 ms to minimize.
[2021-05-11 19:43:10] [INFO ] Deduced a trap composed of 118 places in 154 ms of which 1 ms to minimize.
[2021-05-11 19:43:11] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 1 ms to minimize.
[2021-05-11 19:43:11] [INFO ] Deduced a trap composed of 119 places in 96 ms of which 0 ms to minimize.
[2021-05-11 19:43:11] [INFO ] Deduced a trap composed of 121 places in 111 ms of which 1 ms to minimize.
[2021-05-11 19:43:11] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2021-05-11 19:43:11] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 1 ms to minimize.
[2021-05-11 19:43:11] [INFO ] Deduced a trap composed of 116 places in 94 ms of which 1 ms to minimize.
[2021-05-11 19:43:11] [INFO ] Deduced a trap composed of 119 places in 99 ms of which 0 ms to minimize.
[2021-05-11 19:43:11] [INFO ] Deduced a trap composed of 114 places in 96 ms of which 0 ms to minimize.
[2021-05-11 19:43:12] [INFO ] Deduced a trap composed of 122 places in 91 ms of which 0 ms to minimize.
[2021-05-11 19:43:12] [INFO ] Deduced a trap composed of 114 places in 123 ms of which 0 ms to minimize.
[2021-05-11 19:43:12] [INFO ] Deduced a trap composed of 111 places in 148 ms of which 1 ms to minimize.
[2021-05-11 19:43:12] [INFO ] Deduced a trap composed of 104 places in 129 ms of which 0 ms to minimize.
[2021-05-11 19:43:12] [INFO ] Deduced a trap composed of 119 places in 104 ms of which 1 ms to minimize.
[2021-05-11 19:43:12] [INFO ] Deduced a trap composed of 118 places in 93 ms of which 1 ms to minimize.
[2021-05-11 19:43:12] [INFO ] Deduced a trap composed of 119 places in 103 ms of which 1 ms to minimize.
[2021-05-11 19:43:13] [INFO ] Deduced a trap composed of 108 places in 88 ms of which 0 ms to minimize.
[2021-05-11 19:43:13] [INFO ] Deduced a trap composed of 115 places in 92 ms of which 0 ms to minimize.
[2021-05-11 19:43:13] [INFO ] Deduced a trap composed of 119 places in 107 ms of which 2 ms to minimize.
[2021-05-11 19:43:13] [INFO ] Deduced a trap composed of 122 places in 98 ms of which 2 ms to minimize.
[2021-05-11 19:43:13] [INFO ] Deduced a trap composed of 106 places in 178 ms of which 11 ms to minimize.
[2021-05-11 19:43:13] [INFO ] Deduced a trap composed of 115 places in 138 ms of which 1 ms to minimize.
[2021-05-11 19:43:13] [INFO ] Deduced a trap composed of 104 places in 106 ms of which 0 ms to minimize.
[2021-05-11 19:43:14] [INFO ] Deduced a trap composed of 110 places in 125 ms of which 0 ms to minimize.
[2021-05-11 19:43:14] [INFO ] Deduced a trap composed of 114 places in 127 ms of which 0 ms to minimize.
[2021-05-11 19:43:14] [INFO ] Deduced a trap composed of 119 places in 111 ms of which 3 ms to minimize.
[2021-05-11 19:43:14] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 1 ms to minimize.
[2021-05-11 19:43:14] [INFO ] Deduced a trap composed of 124 places in 107 ms of which 1 ms to minimize.
[2021-05-11 19:43:14] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2021-05-11 19:43:14] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 6044 ms
[2021-05-11 19:43:14] [INFO ] Computed and/alt/rep : 423/742/423 causal constraints (skipped 29 transitions) in 36 ms.
[2021-05-11 19:43:16] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2021-05-11 19:43:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2021-05-11 19:43:16] [INFO ] Added : 281 causal constraints over 57 iterations in 1570 ms. Result :sat
[2021-05-11 19:43:16] [INFO ] [Real]Absence check using 45 positive place invariants in 12 ms returned sat
[2021-05-11 19:43:16] [INFO ] [Real]Absence check using 45 positive and 39 generalized place invariants in 10 ms returned sat
[2021-05-11 19:43:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:16] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2021-05-11 19:43:16] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 1 ms to minimize.
[2021-05-11 19:43:16] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 0 ms to minimize.
[2021-05-11 19:43:16] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 0 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 0 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 0 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 1 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 0 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 0 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 0 ms to minimize.
[2021-05-11 19:43:17] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2021-05-11 19:43:18] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1474 ms
[2021-05-11 19:43:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 19:43:18] [INFO ] [Nat]Absence check using 45 positive place invariants in 18 ms returned sat
[2021-05-11 19:43:18] [INFO ] [Nat]Absence check using 45 positive and 39 generalized place invariants in 15 ms returned sat
[2021-05-11 19:43:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 19:43:18] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2021-05-11 19:43:18] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 0 ms to minimize.
[2021-05-11 19:43:18] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 0 ms to minimize.
[2021-05-11 19:43:18] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 0 ms to minimize.
[2021-05-11 19:43:18] [INFO ] Deduced a trap composed of 108 places in 107 ms of which 1 ms to minimize.
[2021-05-11 19:43:19] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 0 ms to minimize.
[2021-05-11 19:43:19] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 0 ms to minimize.
[2021-05-11 19:43:19] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 0 ms to minimize.
[2021-05-11 19:43:19] [INFO ] Deduced a trap composed of 109 places in 127 ms of which 0 ms to minimize.
[2021-05-11 19:43:19] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 0 ms to minimize.
[2021-05-11 19:43:19] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 1 ms to minimize.
[2021-05-11 19:43:20] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 0 ms to minimize.
[2021-05-11 19:43:20] [INFO ] Deduced a trap composed of 55 places in 113 ms of which 0 ms to minimize.
[2021-05-11 19:43:20] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 1 ms to minimize.
[2021-05-11 19:43:20] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 1 ms to minimize.
[2021-05-11 19:43:20] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 0 ms to minimize.
[2021-05-11 19:43:20] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 0 ms to minimize.
[2021-05-11 19:43:20] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 0 ms to minimize.
[2021-05-11 19:43:20] [INFO ] Deduced a trap composed of 107 places in 110 ms of which 1 ms to minimize.
[2021-05-11 19:43:21] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 0 ms to minimize.
[2021-05-11 19:43:21] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 0 ms to minimize.
[2021-05-11 19:43:21] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 1 ms to minimize.
[2021-05-11 19:43:21] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 1 ms to minimize.
[2021-05-11 19:43:21] [INFO ] Deduced a trap composed of 101 places in 144 ms of which 1 ms to minimize.
[2021-05-11 19:43:21] [INFO ] Deduced a trap composed of 116 places in 120 ms of which 0 ms to minimize.
[2021-05-11 19:43:21] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3551 ms
[2021-05-11 19:43:21] [INFO ] Computed and/alt/rep : 423/742/423 causal constraints (skipped 29 transitions) in 34 ms.
[2021-05-11 19:43:23] [INFO ] Added : 289 causal constraints over 59 iterations in 1549 ms. Result :sat
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 499 transition count 412
Reduce places removed 41 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 47 rules applied. Total rules applied 88 place count 458 transition count 406
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 94 place count 452 transition count 406
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 94 place count 452 transition count 322
Deduced a syphon composed of 84 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 270 place count 360 transition count 322
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 315 place count 315 transition count 277
Iterating global reduction 3 with 45 rules applied. Total rules applied 360 place count 315 transition count 277
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 360 place count 315 transition count 275
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 365 place count 312 transition count 275
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 499 place count 245 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 500 place count 245 transition count 207
Applied a total of 500 rules in 71 ms. Remains 245 /499 variables (removed 254) and now considering 207/453 (removed 246) transitions.
[2021-05-11 19:43:23] [INFO ] Flatten gal took : 14 ms
[2021-05-11 19:43:23] [INFO ] Flatten gal took : 14 ms
[2021-05-11 19:43:23] [INFO ] Input system was already deterministic with 207 transitions.
[2021-05-11 19:43:23] [INFO ] Flatten gal took : 14 ms
[2021-05-11 19:43:23] [INFO ] Flatten gal took : 12 ms
[2021-05-11 19:43:23] [INFO ] Time to serialize gal into /tmp/CTLFireability13203216652406149419.gal : 6 ms
[2021-05-11 19:43:23] [INFO ] Time to serialize properties into /tmp/CTLFireability14032093459396643942.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/CTLFireability13203216652406149419.gal, -t, CGAL, -ctl, /tmp/CTLFireability14032093459396643942.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/CTLFireability13203216652406149419.gal -t CGAL -ctl /tmp/CTLFireability14032093459396643942.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-05-11 19:43:53] [INFO ] Flatten gal took : 13 ms
[2021-05-11 19:43:53] [INFO ] Applying decomposition
[2021-05-11 19:43:53] [INFO ] Flatten gal took : 27 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/graph10951178406975608520.txt, -o, /tmp/graph10951178406975608520.bin, -w, /tmp/graph10951178406975608520.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/graph10951178406975608520.bin, -l, -1, -v, -w, /tmp/graph10951178406975608520.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 19:43:53] [INFO ] Decomposing Gal with order
[2021-05-11 19:43:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 19:43:53] [INFO ] Removed a total of 96 redundant transitions.
[2021-05-11 19:43:53] [INFO ] Flatten gal took : 43 ms
[2021-05-11 19:43:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 8 ms.
[2021-05-11 19:43:53] [INFO ] Time to serialize gal into /tmp/CTLFireability16957926164656038028.gal : 5 ms
[2021-05-11 19:43:53] [INFO ] Time to serialize properties into /tmp/CTLFireability6932792758639543581.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/CTLFireability16957926164656038028.gal, -t, CGAL, -ctl, /tmp/CTLFireability6932792758639543581.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/CTLFireability16957926164656038028.gal -t CGAL -ctl /tmp/CTLFireability6932792758639543581.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,1.50858e+14,3.28874,90360,1978,844,158585,5648,779,255817,206,38322,0


Converting to forward existential form...Done !
original formula: AG(EF((((((((i9.u55.p422==1)||(i8.u26.p3==1))||(i9.u63.p450==1))||(i1.u51.p197==1))||(i10.i0.u44.p312==1)) * (((((((((((i2.i0.u3.p49==1)||(i11.u49.p337==1))||(i12.u65.p465==1))||(i13.i1.u68.p480==1))||(i9.u55.p478==1))||(i5.u38.p287==1))||(i6.i0.u14.p110==1))||(((i10.i2.u6.p68==1)&&(i10.i0.u44.p314==1))&&(i10.i2.u58.p414==1)))||(((i13.i0.u11.p92==1)&&(i4.u41.p304==1))&&(i13.i1.u68.p484==1)))||(((i12.u50.p183==1)&&(i12.u50.p344==1))&&(i12.u50.p512==1))) + ((((((i3.u32.p260==0)&&(i12.u23.p194==0))&&(i13.i0.u11.p88==0)) * AG((((((((i10.i1.u46.p325==1)||(i9.u59.p438==1))||(i6.i1.u47.p327==1))||(((i1.u51.p167==1)&&(i1.u51.p349==1))&&(i1.u51.p509==1)))||(i2.i0.u4.p55==1))||(i13.i0.u10.p86==1))||(i1.u51.p346==1)))) * ((i12.u20.p168==0)||(i12.u66.p471==0))) * ((((((((((((((((i6.i0.u13.p112==1)||(u48.p160==1))||(i2.i0.u0.p18==1))||(i2.i0.u35.p272==1))||(i12.u65.p465==1))||(i10.i1.u27.p220==1))||(i5.u17.p130==1))||(i5.u8.p80==1))||(i12.u22.p176==1))||(i9.u63.p451==1))||(i0.u40.p300==1))||(i9.u67.p473==1))||(((u48.p161==1)&&(u48.p334==1))&&(u48.p506==1)))||(((u48.p180==1)&&(u48.p334==1))&&(u48.p506==1)))||(((i1.u51.p177==1)&&(i1.u51.p349==1))&&(i1.u51.p515==1)))||(((i1.u19.p150==1)&&(i8.u53.p353==1))&&(i9.u55.p479==1)))))) * (((((((((((((i12.u70.p455==1)||(i9.u56.p369==1))||(i1.u51.p499==1))||(i9.u55.p386==1))||(i9.u55.p460==1)) + EF((((((((((i0.u15.p115==1)||(i2.i1.u30.p246==1))||(i11.u64.p453==1))||(u48.p332==1))||(i6.i1.u45.p316==1))||(i1.u51.p459==1))||(i9.u55.p361==1))||(i10.i0.u43.p315==1))||(i10.i1.u27.p220==1)))) + (i2.i1.u1.p23==1)) + (i0.u7.p77==1)) + (i10.i1.u46.p321==1)) + (i4.u16.p121==1)) + (i8.u25.p207==1)) + (((u48.p171==1)&&(u48.p334==1))&&(u48.p500==1))) + (((u48.p492==1)&&(i12.u70.p495==1))&&(i1.u51.p498==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((i9.u55.p422==1)||(i8.u26.p3==1))||(i9.u63.p450==1))||(i1.u51.p197==1))||(i10.i0.u44.p312==1)) * (((((((((((i2.i0.u3.p49==1)||(i11.u49.p337==1))||(i12.u65.p465==1))||(i13.i1.u68.p480==1))||(i9.u55.p478==1))||(i5.u38.p287==1))||(i6.i0.u14.p110==1))||(((i10.i2.u6.p68==1)&&(i10.i0.u44.p314==1))&&(i10.i2.u58.p414==1)))||(((i13.i0.u11.p92==1)&&(i4.u41.p304==1))&&(i13.i1.u68.p484==1)))||(((i12.u50.p183==1)&&(i12.u50.p344==1))&&(i12.u50.p512==1))) + ((((((i3.u32.p260==0)&&(i12.u23.p194==0))&&(i13.i0.u11.p88==0)) * !(E(TRUE U !((((((((i10.i1.u46.p325==1)||(i9.u59.p438==1))||(i6.i1.u47.p327==1))||(((i1.u51.p167==1)&&(i1.u51.p349==1))&&(i1.u51.p509==1)))||(i2.i0.u4.p55==1))||(i13.i0.u10.p86==1))||(i1.u51.p346==1)))))) * ((i12.u20.p168==0)||(i12.u66.p471==0))) * ((((((((((((((((i6.i0.u13.p112==1)||(u48.p160==1))||(i2.i0.u0.p18==1))||(i2.i0.u35.p272==1))||(i12.u65.p465==1))||(i10.i1.u27.p220==1))||(i5.u17.p130==1))||(i5.u8.p80==1))||(i12.u22.p176==1))||(i9.u63.p451==1))||(i0.u40.p300==1))||(i9.u67.p473==1))||(((u48.p161==1)&&(u48.p334==1))&&(u48.p506==1)))||(((u48.p180==1)&&(u48.p334==1))&&(u48.p506==1)))||(((i1.u51.p177==1)&&(i1.u51.p349==1))&&(i1.u51.p515==1)))||(((i1.u19.p150==1)&&(i8.u53.p353==1))&&(i9.u55.p479==1)))))) * (((((((((((((i12.u70.p455==1)||(i9.u56.p369==1))||(i1.u51.p499==1))||(i9.u55.p386==1))||(i9.u55.p460==1)) + E(TRUE U (((((((((i0.u15.p115==1)||(i2.i1.u30.p246==1))||(i11.u64.p453==1))||(u48.p332==1))||(i6.i1.u45.p316==1))||(i1.u51.p459==1))||(i9.u55.p361==1))||(i10.i0.u43.p315==1))||(i10.i1.u27.p220==1)))) + (i2.i1.u1.p23==1)) + (i0.u7.p77==1)) + (i10.i1.u46.p321==1)) + (i4.u16.p121==1)) + (i8.u25.p207==1)) + (((u48.p171==1)&&(u48.p334==1))&&(u48.p500==1))) + (((u48.p492==1)&&(i12.u70.p495==1))&&(i1.u51.p498==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t46, t81, t128, t134, t139, t151, t152, t153, t154, t159, t162, t163, t165, t166, t171, t172, t173, t174, t175, t177, t185, t188, t189, t198, t199, t200, u48.t29, u48.t157, i0.u15.t58, i0.u40.t39, i1.u19.t47, i1.u51.t26, i2.t183, i2.t169, i2.i0.u0.t66, i2.i0.u35.t41, i2.i1.u1.t143, i2.i1.u30.t146, i3.u32.t43, i4.u16.t56, i5.u38.t40, i6.i0.t59, i6.i1.u45.t34, i6.i1.u47.t30, i8.t168, i8.u25.t145, i9.t24, i9.t19, i9.t17, i9.t4, i9.u55.t1, i9.u55.t2, i9.u55.t9, i9.u55.t21, i9.u55.t22, i9.u55.t164, i10.i0.t36, i10.i0.u44.t37, i10.i1.u46.t33, i11.u49.t28, i13.i1.u12.t148, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :26/107/63/196
Detected timeout of ITS tools.
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 498 transition count 380
Reduce places removed 72 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 73 rules applied. Total rules applied 145 place count 426 transition count 379
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 425 transition count 379
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 91 Pre rules applied. Total rules applied 146 place count 425 transition count 288
Deduced a syphon composed of 91 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 338 place count 324 transition count 288
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 399 place count 263 transition count 227
Iterating global reduction 3 with 61 rules applied. Total rules applied 460 place count 263 transition count 227
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 460 place count 263 transition count 220
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 476 place count 254 transition count 220
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 151 rules applied. Total rules applied 627 place count 177 transition count 146
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 3 with 2 rules applied. Total rules applied 629 place count 176 transition count 149
Applied a total of 629 rules in 108 ms. Remains 176 /499 variables (removed 323) and now considering 149/453 (removed 304) transitions.
[2021-05-11 19:44:24] [INFO ] Flatten gal took : 13 ms
[2021-05-11 19:44:24] [INFO ] Flatten gal took : 13 ms
[2021-05-11 19:44:24] [INFO ] Input system was already deterministic with 149 transitions.
[2021-05-11 19:44:24] [INFO ] Flatten gal took : 12 ms
[2021-05-11 19:44:24] [INFO ] Flatten gal took : 12 ms
[2021-05-11 19:44:24] [INFO ] Time to serialize gal into /tmp/CTLFireability14134217834927177697.gal : 1 ms
[2021-05-11 19:44:24] [INFO ] Time to serialize properties into /tmp/CTLFireability8792507352690625586.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/CTLFireability14134217834927177697.gal, -t, CGAL, -ctl, /tmp/CTLFireability8792507352690625586.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/CTLFireability14134217834927177697.gal -t CGAL -ctl /tmp/CTLFireability8792507352690625586.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,1.34703e+10,10.5469,273136,2,53332,5,1.28197e+06,6,0,853,877361,0


Converting to forward existential form...Done !
original formula: EF(AG((E(EG((((((((((p81==1)&&(p293==1))&&(p479==1))||(p134==1))||(p133==1))||(p366==1))||(p460==1))||(p13==1))||(((p167==1)&&(p349==1))&&(p470==1)))) U EF((((((p486==1)||(p148==1))||(p322==1))||(((p201==1)&&(p354==1))&&(p475==1)))||(p8==1)))) + AF(((((((p499==0)&&((p168==0)||(p471==0)))&&(p212==0))&&(p479==0))&&(p490==0))&&(p457==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((E(EG((((((((((p81==1)&&(p293==1))&&(p479==1))||(p134==1))||(p133==1))||(p366==1))||(p460==1))||(p13==1))||(((p167==1)&&(p349==1))&&(p470==1)))) U E(TRUE U (((((p486==1)||(p148==1))||(p322==1))||(((p201==1)&&(p354==1))&&(p475==1)))||(p8==1)))) + !(EG(!(((((((p499==0)&&((p168==0)||(p471==0)))&&(p212==0))&&(p479==0))&&(p490==0))&&(p457==0))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t14, t17, t19, t53, t54, t55, t56, t57, t63, t64, t65, t66, t67, t95, t96, t97, t98, t99, t100, t101, t103, t104, t105, t113, t117, t121, t126, t127, t128, t131, t132, t139, t140, t141, t142, t147, t148, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/75/38/149
Detected timeout of ITS tools.
[2021-05-11 19:44:54] [INFO ] Flatten gal took : 27 ms
[2021-05-11 19:44:54] [INFO ] Applying decomposition
[2021-05-11 19:44:54] [INFO ] Flatten gal took : 19 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/graph5917171178271089335.txt, -o, /tmp/graph5917171178271089335.bin, -w, /tmp/graph5917171178271089335.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/graph5917171178271089335.bin, -l, -1, -v, -w, /tmp/graph5917171178271089335.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 95 redundant transitions.
[2021-05-11 19:44:54] [INFO ] Flatten gal took : 26 ms
[2021-05-11 19:44:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 9 ms.
[2021-05-11 19:44:54] [INFO ] Time to serialize gal into /tmp/CTLFireability5861777365359326142.gal : 5 ms
[2021-05-11 19:44:54] [INFO ] Time to serialize properties into /tmp/CTLFireability6524041679053816293.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/CTLFireability5861777365359326142.gal, -t, CGAL, -ctl, /tmp/CTLFireability6524041679053816293.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/CTLFireability5861777365359326142.gal -t CGAL -ctl /tmp/CTLFireability6524041679053816293.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,1.34703e+10,1.29291,35344,991,470,61164,3568,590,114859,184,11951,0


Converting to forward existential form...Done !
original formula: EF(AG((E(EG((((((((((i2.i1.u4.p81==1)&&(i3.i1.u24.p293==1))&&(i7.i5.u48.p479==1))||(i4.i0.u9.p134==1))||(i4.i0.u9.p133==1))||(i7.i5.u37.p366==1))||(i7.i5.u48.p460==1))||(i7.i5.u2.p13==1))||(((i8.u34.p167==1)&&(i8.u34.p349==1))&&(i8.u34.p470==1)))) U EF((((((i3.i2.u49.p486==1)||(i6.u10.p148==1))||(i4.i1.u30.p322==1))||(((i1.u12.p201==1)&&(i1.u35.p354==1))&&(i1.u47.p475==1)))||(i4.i1.u1.p8==1)))) + AF(((((((i8.u51.p499==0)&&((i0.u11.p168==0)||(i0.u46.p471==0)))&&(i1.u0.p212==0))&&(i7.i5.u48.p479==0))&&(i0.u50.p490==0))&&(i0.u31.p457==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((E(EG((((((((((i2.i1.u4.p81==1)&&(i3.i1.u24.p293==1))&&(i7.i5.u48.p479==1))||(i4.i0.u9.p134==1))||(i4.i0.u9.p133==1))||(i7.i5.u37.p366==1))||(i7.i5.u48.p460==1))||(i7.i5.u2.p13==1))||(((i8.u34.p167==1)&&(i8.u34.p349==1))&&(i8.u34.p470==1)))) U E(TRUE U (((((i3.i2.u49.p486==1)||(i6.u10.p148==1))||(i4.i1.u30.p322==1))||(((i1.u12.p201==1)&&(i1.u35.p354==1))&&(i1.u47.p475==1)))||(i4.i1.u1.p8==1)))) + !(EG(!(((((((i8.u51.p499==0)&&((i0.u11.p168==0)||(i0.u46.p471==0)))&&(i1.u0.p212==0))&&(i7.i5.u48.p479==0))&&(i0.u50.p490==0))&&(i0.u31.p457==0))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t54, t55, t56, t57, t63, t64, t65, t66, t67, t95, t101, t103, t104, t105, t113, t117, t121, t131, t141, i3.i2.u5.t53, i4.i0.u9.t19, i4.i1.u1.t17, i4.i1.u30.t14, i7.t132, i7.t128, i7.t127, i7.t126, i7.t100, i7.t99, i7.t98, i7.t97, i7.t96, i7.i5.t140, i7.i5.t148, i7.i5.u48.t3, i8.t110, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :22/73/36/131
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 4
Fast SCC detection found a local SCC at level 5
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,1,3.63597,83448,1,0,111763,7906,3021,520274,1598,29623,202368
FORMULA BusinessProcesses-PT-10-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 499 transition count 395
Reduce places removed 58 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 67 rules applied. Total rules applied 125 place count 441 transition count 386
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 134 place count 432 transition count 386
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 134 place count 432 transition count 309
Deduced a syphon composed of 77 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 161 rules applied. Total rules applied 295 place count 348 transition count 309
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 341 place count 302 transition count 263
Iterating global reduction 3 with 46 rules applied. Total rules applied 387 place count 302 transition count 263
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 387 place count 302 transition count 260
Deduced a syphon composed of 3 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 394 place count 298 transition count 260
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 155 rules applied. Total rules applied 549 place count 220 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 550 place count 220 transition count 182
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 552 place count 219 transition count 185
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 557 place count 219 transition count 185
Applied a total of 557 rules in 102 ms. Remains 219 /499 variables (removed 280) and now considering 185/453 (removed 268) transitions.
[2021-05-11 19:44:58] [INFO ] Flatten gal took : 17 ms
[2021-05-11 19:44:58] [INFO ] Flatten gal took : 15 ms
[2021-05-11 19:44:58] [INFO ] Input system was already deterministic with 185 transitions.
[2021-05-11 19:44:58] [INFO ] Flatten gal took : 13 ms
[2021-05-11 19:44:58] [INFO ] Flatten gal took : 12 ms
[2021-05-11 19:44:58] [INFO ] Time to serialize gal into /tmp/CTLFireability15635018369961863180.gal : 2 ms
[2021-05-11 19:44:58] [INFO ] Time to serialize properties into /tmp/CTLFireability12047672994822557001.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/CTLFireability15635018369961863180.gal, -t, CGAL, -ctl, /tmp/CTLFireability12047672994822557001.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/CTLFireability15635018369961863180.gal -t CGAL -ctl /tmp/CTLFireability12047672994822557001.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,1.97229e+13,8.68992,235644,2,19708,5,1.212e+06,6,0,1061,782226,0


Converting to forward existential form...Done !
original formula: (E((EG((AG(((p473==1)||(p409==1))) + A((((((((((p33==1)||((p181==1)&&(p184==1)))||(p208==1))||(p389==1))||(p217==1))||(p127==1))||(p312==1))||(p156==1))||(p346==1)) U ((((((((p78==1)&&(p288==1))&&(p479==1))||(p403==1))||(p336==1))||(p165==1))||(p255==1))||(((p198==1)&&(p358==1))&&(p479==1)))))) * !(E((((((p215==1)||(p449==1))||(((p89==1)&&(p299==1))&&(p481==1)))||(p108==1))||(p267==1)) U EG(((p453==1)||(p505==1)))))) U !(EF((((((((((p97==1)||(p357==1))||(p406==1))||(p194==1))||(((p60==1)&&(p259==1))&&(p408==1)))||(((p195==1)&&(p349==1))&&(p470==1)))||(p306==1))||(p137==1))||(p14==1))))) * E(((((p245==1)||(p208==1))||(p335==1))||(p250==1)) U ((((((p0==1)||(p260==1))||(p276==1))||(p451==1))||(p397==1))||(p441==1))))
=> equivalent forward existential formula: [(FwdU((Init * E((EG((!(E(TRUE U !(((p473==1)||(p409==1))))) + !((E(!(((((((((p78==1)&&(p288==1))&&(p479==1))||(p403==1))||(p336==1))||(p165==1))||(p255==1))||(((p198==1)&&(p358==1))&&(p479==1)))) U (!((((((((((p33==1)||((p181==1)&&(p184==1)))||(p208==1))||(p389==1))||(p217==1))||(p127==1))||(p312==1))||(p156==1))||(p346==1))) * !(((((((((p78==1)&&(p288==1))&&(p479==1))||(p403==1))||(p336==1))||(p165==1))||(p255==1))||(((p198==1)&&(p358==1))&&(p479==1)))))) + EG(!(((((((((p78==1)&&(p288==1))&&(p479==1))||(p403==1))||(p336==1))||(p165==1))||(p255==1))||(((p198==1)&&(p358==1))&&(p479==1))))))))) * !(E((((((p215==1)||(p449==1))||(((p89==1)&&(p299==1))&&(p481==1)))||(p108==1))||(p267==1)) U EG(((p453==1)||(p505==1)))))) U !(E(TRUE U (((((((((p97==1)||(p357==1))||(p406==1))||(p194==1))||(((p60==1)&&(p259==1))&&(p408==1)))||(((p195==1)&&(p349==1))&&(p470==1)))||(p306==1))||(p137==1))||(p14==1)))))),((((p245==1)||(p208==1))||(p335==1))||(p250==1))) * ((((((p0==1)||(p260==1))||(p276==1))||(p451==1))||(p397==1))||(p441==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t11, t12, t14, t16, t18, t21, t22, t23, t24, t26, t27, t29, t31, t33, t35, t42, t83, t84, t89, t91, t92, t93, t94, t96, t97, t98, t99, t100, t101, t107, t108, t109, t110, t111, t112, t126, t127, t128, t131, t132, t133, t134, t135, t137, t142, t147, t149, t157, t158, t161, t166, t170, t171, t176, t177, t178, t179, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/90/59/185
Detected timeout of ITS tools.
[2021-05-11 19:45:28] [INFO ] Flatten gal took : 22 ms
[2021-05-11 19:45:28] [INFO ] Applying decomposition
[2021-05-11 19:45:28] [INFO ] Flatten gal took : 18 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/graph11839202549729686259.txt, -o, /tmp/graph11839202549729686259.bin, -w, /tmp/graph11839202549729686259.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/graph11839202549729686259.bin, -l, -1, -v, -w, /tmp/graph11839202549729686259.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 19:45:28] [INFO ] Decomposing Gal with order
[2021-05-11 19:45:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 19:45:28] [INFO ] Removed a total of 134 redundant transitions.
[2021-05-11 19:45:28] [INFO ] Flatten gal took : 27 ms
[2021-05-11 19:45:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 5 ms.
[2021-05-11 19:45:28] [INFO ] Time to serialize gal into /tmp/CTLFireability15765647299514258154.gal : 5 ms
[2021-05-11 19:45:28] [INFO ] Time to serialize properties into /tmp/CTLFireability10202962476089940879.ctl : 2 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/CTLFireability15765647299514258154.gal, -t, CGAL, -ctl, /tmp/CTLFireability10202962476089940879.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/CTLFireability15765647299514258154.gal -t CGAL -ctl /tmp/CTLFireability10202962476089940879.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,1.97229e+13,8.23686,160692,4817,462,266207,4916,725,586630,179,21668,0


Converting to forward existential form...Done !
original formula: (E((EG((AG(((i13.i1.u63.p473==1)||(i3.i1.u56.p409==1))) + A((((((((((i8.i1.u3.p33==1)||((i4.u44.p181==1)&&(u47.p184==1)))||(i2.i0.u23.p208==1))||(i8.i1.u51.p389==1))||(i5.i1.u24.p217==1))||(i1.u13.p127==1))||(i11.i2.u41.p312==1))||(i7.u18.p156==1))||(i7.u48.p346==1)) U ((((((((i12.u6.p78==1)&&(i1.u36.p288==1))&&(i13.i1.u64.p479==1))||(i13.i1.u64.p403==1))||(i5.i1.u46.p336==1))||(i7.u19.p165==1))||(i10.u28.p255==1))||(((i2.i1.u22.p198==1)&&(i2.i1.u50.p358==1))&&(i13.i1.u64.p479==1)))))) * !(E((((((i5.i1.u24.p215==1)||(i11.i1.u60.p449==1))||(((i0.u9.p89==1)&&(i12.u38.p299==1))&&(i0.u65.p481==1)))||(i13.i1.u11.p108==1))||(i3.i1.u32.p267==1)) U EG(((i5.i0.u61.p453==1)||(u47.p505==1)))))) U !(EF((((((((((i0.u10.p97==1)||(i2.i1.u50.p357==1))||(i13.i1.u55.p406==1))||(u47.p194==1))||(((i3.i1.u5.p60==1)&&(i3.i0.u30.p259==1))&&(i3.i1.u56.p408==1)))||(((i7.u21.p195==1)&&(i7.u48.p349==1))&&(i7.u62.p470==1)))||(i1.u40.p306==1))||(i11.i0.u15.p137==1))||(i0.u1.p14==1))))) * E(((((i8.i0.u26.p245==1)||(i2.i0.u23.p208==1))||(i4.u45.p335==1))||(i9.i1.u27.p250==1)) U ((((((i2.i1.u50.p0==1)||(i3.i0.u29.p260==1))||(i9.i0.u34.p276==1))||(i13.i1.u64.p451==1))||(i9.i1.u52.p397==1))||(i1.u59.p441==1))))
=> equivalent forward existential formula: [(FwdU((Init * E((EG((!(E(TRUE U !(((i13.i1.u63.p473==1)||(i3.i1.u56.p409==1))))) + !((E(!(((((((((i12.u6.p78==1)&&(i1.u36.p288==1))&&(i13.i1.u64.p479==1))||(i13.i1.u64.p403==1))||(i5.i1.u46.p336==1))||(i7.u19.p165==1))||(i10.u28.p255==1))||(((i2.i1.u22.p198==1)&&(i2.i1.u50.p358==1))&&(i13.i1.u64.p479==1)))) U (!((((((((((i8.i1.u3.p33==1)||((i4.u44.p181==1)&&(u47.p184==1)))||(i2.i0.u23.p208==1))||(i8.i1.u51.p389==1))||(i5.i1.u24.p217==1))||(i1.u13.p127==1))||(i11.i2.u41.p312==1))||(i7.u18.p156==1))||(i7.u48.p346==1))) * !(((((((((i12.u6.p78==1)&&(i1.u36.p288==1))&&(i13.i1.u64.p479==1))||(i13.i1.u64.p403==1))||(i5.i1.u46.p336==1))||(i7.u19.p165==1))||(i10.u28.p255==1))||(((i2.i1.u22.p198==1)&&(i2.i1.u50.p358==1))&&(i13.i1.u64.p479==1)))))) + EG(!(((((((((i12.u6.p78==1)&&(i1.u36.p288==1))&&(i13.i1.u64.p479==1))||(i13.i1.u64.p403==1))||(i5.i1.u46.p336==1))||(i7.u19.p165==1))||(i10.u28.p255==1))||(((i2.i1.u22.p198==1)&&(i2.i1.u50.p358==1))&&(i13.i1.u64.p479==1))))))))) * !(E((((((i5.i1.u24.p215==1)||(i11.i1.u60.p449==1))||(((i0.u9.p89==1)&&(i12.u38.p299==1))&&(i0.u65.p481==1)))||(i13.i1.u11.p108==1))||(i3.i1.u32.p267==1)) U EG(((i5.i0.u61.p453==1)||(u47.p505==1)))))) U !(E(TRUE U (((((((((i0.u10.p97==1)||(i2.i1.u50.p357==1))||(i13.i1.u55.p406==1))||(u47.p194==1))||(((i3.i1.u5.p60==1)&&(i3.i0.u30.p259==1))&&(i3.i1.u56.p408==1)))||(((i7.u21.p195==1)&&(i7.u48.p349==1))&&(i7.u62.p470==1)))||(i1.u40.p306==1))||(i11.i0.u15.p137==1))||(i0.u1.p14==1)))))),((((i8.i0.u26.p245==1)||(i2.i0.u23.p208==1))||(i4.u45.p335==1))||(i9.i1.u27.p250==1))) * ((((((i2.i1.u50.p0==1)||(i3.i0.u29.p260==1))||(i9.i0.u34.p276==1))||(i13.i1.u64.p451==1))||(i9.i1.u52.p397==1))||(i1.u59.p441==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t18, t35, t51, t83, t84, t91, t97, t98, t99, t101, t108, t109, t110, t111, t112, t126, t127, t128, t131, t132, t133, t135, t142, t147, t149, t157, t158, t161, t166, t176, t178, i0.t96, i1.u13.t42, i1.u40.t23, i2.i1.u22.t100, i2.i1.u50.t14, i3.i0.t26, i3.i0.u30.t27, i3.i1.u32.t24, i4.t21, i5.i1.u46.t93, i7.u48.t16, i8.i0.u26.t33, i8.i1.u3.t89, i8.i1.u51.t94, i9.i0.u34.t92, i9.i1.u27.t31, i10.u28.t29, i11.i2.u41.t22, i13.t134, i13.i1.t2, i13.i1.t11, i13.i1.u11.t170, i13.i1.u11.t171, i13.i1.u64.t5, i13.i1.u64.t12, i13.i1.u64.t107, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :27/89/57/173
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Detected timeout of ITS tools.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 498 transition count 390
Reduce places removed 62 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 67 rules applied. Total rules applied 129 place count 436 transition count 385
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 134 place count 431 transition count 385
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 134 place count 431 transition count 292
Deduced a syphon composed of 93 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 197 rules applied. Total rules applied 331 place count 327 transition count 292
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 387 place count 271 transition count 236
Iterating global reduction 3 with 56 rules applied. Total rules applied 443 place count 271 transition count 236
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 443 place count 271 transition count 231
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 454 place count 265 transition count 231
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 602 place count 191 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 603 place count 191 transition count 156
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 605 place count 190 transition count 159
Applied a total of 605 rules in 65 ms. Remains 190 /499 variables (removed 309) and now considering 159/453 (removed 294) transitions.
[2021-05-11 19:45:58] [INFO ] Flatten gal took : 7 ms
[2021-05-11 19:45:58] [INFO ] Flatten gal took : 19 ms
[2021-05-11 19:45:58] [INFO ] Input system was already deterministic with 159 transitions.
[2021-05-11 19:45:58] [INFO ] Flatten gal took : 15 ms
[2021-05-11 19:45:58] [INFO ] Flatten gal took : 19 ms
[2021-05-11 19:45:58] [INFO ] Time to serialize gal into /tmp/CTLFireability13322264032317198022.gal : 4 ms
[2021-05-11 19:45:58] [INFO ] Time to serialize properties into /tmp/CTLFireability15003546577003388425.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/CTLFireability13322264032317198022.gal, -t, CGAL, -ctl, /tmp/CTLFireability15003546577003388425.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/CTLFireability13322264032317198022.gal -t CGAL -ctl /tmp/CTLFireability15003546577003388425.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,9.33278e+11,20.2996,470508,2,37104,5,1.94131e+06,6,0,919,1.54245e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2021-05-11 19:46:28] [INFO ] Flatten gal took : 9 ms
[2021-05-11 19:46:28] [INFO ] Applying decomposition
[2021-05-11 19:46:28] [INFO ] Flatten gal took : 6 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/graph4518175278696084611.txt, -o, /tmp/graph4518175278696084611.bin, -w, /tmp/graph4518175278696084611.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/graph4518175278696084611.bin, -l, -1, -v, -w, /tmp/graph4518175278696084611.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 19:46:28] [INFO ] Decomposing Gal with order
[2021-05-11 19:46:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 19:46:28] [INFO ] Removed a total of 127 redundant transitions.
[2021-05-11 19:46:28] [INFO ] Flatten gal took : 27 ms
[2021-05-11 19:46:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 4 ms.
[2021-05-11 19:46:28] [INFO ] Time to serialize gal into /tmp/CTLFireability18323140081279525430.gal : 4 ms
[2021-05-11 19:46:28] [INFO ] Time to serialize properties into /tmp/CTLFireability17534588090697938639.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/CTLFireability18323140081279525430.gal, -t, CGAL, -ctl, /tmp/CTLFireability17534588090697938639.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/CTLFireability18323140081279525430.gal -t CGAL -ctl /tmp/CTLFireability17534588090697938639.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,9.33278e+11,2.03094,72932,959,735,130237,3036,691,366543,191,10648,0


Converting to forward existential form...Done !
original formula: AG(!(A(((((((((i6.u14.p130==1)||(i5.u2.p32==1))||(((i7.u40.p180==1)&&(i7.u40.p334==1))&&(i7.u40.p500==1)))||(i7.u40.p154==1))||(i0.i2.u24.p252==1))||(((i9.i1.u12.p101==1)&&(i9.i0.u39.p329==1))&&(i9.i1.u47.p371==1)))||(i1.i1.u15.p140==1))||(u43.p347==1)) U A(((i1.i0.u6.p66==1)||(i0.i0.u3.p40==1)) U (AF(((((i9.i1.u55.p423==1)||((i7.u17.p168==1)&&(i8.u54.p471==1)))||(((i2.i0.u10.p95==1)&&(i6.u35.p309==1))&&(i2.i0.u49.p487==1)))||(i5.u1.p28==1))) * (((((((((i0.i4.u31.p227==1)||(i9.i1.u50.p434==1))||(((i5.u2.p27==1)&&(i0.i1.u25.p258==1))&&(i9.i1.u55.p479==1)))||(i9.i1.u46.p403==1))||(i8.u42.p461==1))||(((i4.u20.p211==1)&&(i4.u45.p359==1))&&(i9.i1.u55.p479==1)))||(u43.p153==1))||(i9.i1.u46.p378==1))||(u43.p346==1)))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(!((E(!((!(EG(!(((((i9.i1.u55.p423==1)||((i7.u17.p168==1)&&(i8.u54.p471==1)))||(((i2.i0.u10.p95==1)&&(i6.u35.p309==1))&&(i2.i0.u49.p487==1)))||(i5.u1.p28==1))))) * (((((((((i0.i4.u31.p227==1)||(i9.i1.u50.p434==1))||(((i5.u2.p27==1)&&(i0.i1.u25.p258==1))&&(i9.i1.u55.p479==1)))||(i9.i1.u46.p403==1))||(i8.u42.p461==1))||(((i4.u20.p211==1)&&(i4.u45.p359==1))&&(i9.i1.u55.p479==1)))||(u43.p153==1))||(i9.i1.u46.p378==1))||(u43.p346==1)))) U (!(((i1.i0.u6.p66==1)||(i0.i0.u3.p40==1))) * !((!(EG(!(((((i9.i1.u55.p423==1)||((i7.u17.p168==1)&&(i8.u54.p471==1)))||(((i2.i0.u10.p95==1)&&(i6.u35.p309==1))&&(i2.i0.u49.p487==1)))||(i5.u1.p28==1))))) * (((((((((i0.i4.u31.p227==1)||(i9.i1.u50.p434==1))||(((i5.u2.p27==1)&&(i0.i1.u25.p258==1))&&(i9.i1.u55.p479==1)))||(i9.i1.u46.p403==1))||(i8.u42.p461==1))||(((i4.u20.p211==1)&&(i4.u45.p359==1))&&(i9.i1.u55.p479==1)))||(u43.p153==1))||(i9.i1.u46.p378==1))||(u43.p346==1)))))) + EG(!((!(EG(!(((((i9.i1.u55.p423==1)||((i7.u17.p168==1)&&(i8.u54.p471==1)))||(((i2.i0.u10.p95==1)&&(i6.u35.p309==1))&&(i2.i0.u49.p487==1)))||(i5.u1.p28==1))))) * (((((((((i0.i4.u31.p227==1)||(i9.i1.u50.p434==1))||(((i5.u2.p27==1)&&(i0.i1.u25.p258==1))&&(i9.i1.u55.p479==1)))||(i9.i1.u46.p403==1))||(i8.u42.p461==1))||(((i4.u20.p211==1)&&(i4.u45.p359==1))&&(i9.i1.u55.p479==1)))||(u43.p153==1))||(i9.i1.u46.p378==1))||(u43.p346==1))))))))))) * !(E(!(!((E(!((!(EG(!(((((i9.i1.u55.p423==1)||((i7.u17.p168==1)&&(i8.u54.p471==1)))||(((i2.i0.u10.p95==1)&&(i6.u35.p309==1))&&(i2.i0.u49.p487==1)))||(i5.u1.p28==1))))) * (((((((((i0.i4.u31.p227==1)||(i9.i1.u50.p434==1))||(((i5.u2.p27==1)&&(i0.i1.u25.p258==1))&&(i9.i1.u55.p479==1)))||(i9.i1.u46.p403==1))||(i8.u42.p461==1))||(((i4.u20.p211==1)&&(i4.u45.p359==1))&&(i9.i1.u55.p479==1)))||(u43.p153==1))||(i9.i1.u46.p378==1))||(u43.p346==1)))) U (!(((i1.i0.u6.p66==1)||(i0.i0.u3.p40==1))) * !((!(EG(!(((((i9.i1.u55.p423==1)||((i7.u17.p168==1)&&(i8.u54.p471==1)))||(((i2.i0.u10.p95==1)&&(i6.u35.p309==1))&&(i2.i0.u49.p487==1)))||(i5.u1.p28==1))))) * (((((((((i0.i4.u31.p227==1)||(i9.i1.u50.p434==1))||(((i5.u2.p27==1)&&(i0.i1.u25.p258==1))&&(i9.i1.u55.p479==1)))||(i9.i1.u46.p403==1))||(i8.u42.p461==1))||(((i4.u20.p211==1)&&(i4.u45.p359==1))&&(i9.i1.u55.p479==1)))||(u43.p153==1))||(i9.i1.u46.p378==1))||(u43.p346==1)))))) + EG(!((!(EG(!(((((i9.i1.u55.p423==1)||((i7.u17.p168==1)&&(i8.u54.p471==1)))||(((i2.i0.u10.p95==1)&&(i6.u35.p309==1))&&(i2.i0.u49.p487==1)))||(i5.u1.p28==1))))) * (((((((((i0.i4.u31.p227==1)||(i9.i1.u50.p434==1))||(((i5.u2.p27==1)&&(i0.i1.u25.p258==1))&&(i9.i1.u55.p479==1)))||(i9.i1.u46.p403==1))||(i8.u42.p461==1))||(((i4.u20.p211==1)&&(i4.u45.p359==1))&&(i9.i1.u55.p479==1)))||(u43.p153==1))||(i9.i1.u46.p378==1))||(u43.p346==1)))))))) U (!(((((((((i6.u14.p130==1)||(i5.u2.p32==1))||(((i7.u40.p180==1)&&(i7.u40.p334==1))&&(i7.u40.p500==1)))||(i7.u40.p154==1))||(i0.i2.u24.p252==1))||(((i9.i1.u12.p101==1)&&(i9.i0.u39.p329==1))&&(i9.i1.u47.p371==1)))||(i1.i1.u15.p140==1))||(u43.p347==1))) * !(!((E(!((!(EG(!(((((i9.i1.u55.p423==1)||((i7.u17.p168==1)&&(i8.u54.p471==1)))||(((i2.i0.u10.p95==1)&&(i6.u35.p309==1))&&(i2.i0.u49.p487==1)))||(i5.u1.p28==1))))) * (((((((((i0.i4.u31.p227==1)||(i9.i1.u50.p434==1))||(((i5.u2.p27==1)&&(i0.i1.u25.p258==1))&&(i9.i1.u55.p479==1)))||(i9.i1.u46.p403==1))||(i8.u42.p461==1))||(((i4.u20.p211==1)&&(i4.u45.p359==1))&&(i9.i1.u55.p479==1)))||(u43.p153==1))||(i9.i1.u46.p378==1))||(u43.p346==1)))) U (!(((i1.i0.u6.p66==1)||(i0.i0.u3.p40==1))) * !((!(EG(!(((((i9.i1.u55.p423==1)||((i7.u17.p168==1)&&(i8.u54.p471==1)))||(((i2.i0.u10.p95==1)&&(i6.u35.p309==1))&&(i2.i0.u49.p487==1)))||(i5.u1.p28==1))))) * (((((((((i0.i4.u31.p227==1)||(i9.i1.u50.p434==1))||(((i5.u2.p27==1)&&(i0.i1.u25.p258==1))&&(i9.i1.u55.p479==1)))||(i9.i1.u46.p403==1))||(i8.u42.p461==1))||(((i4.u20.p211==1)&&(i4.u45.p359==1))&&(i9.i1.u55.p479==1)))||(u43.p153==1))||(i9.i1.u46.p378==1))||(u43.p346==1)))))) + EG(!((!(EG(!(((((i9.i1.u55.p423==1)||((i7.u17.p168==1)&&(i8.u54.p471==1)))||(((i2.i0.u10.p95==1)&&(i6.u35.p309==1))&&(i2.i0.u49.p487==1)))||(i5.u1.p28==1))))) * (((((((((i0.i4.u31.p227==1)||(i9.i1.u50.p434==1))||(((i5.u2.p27==1)&&(i0.i1.u25.p258==1))&&(i9.i1.u55.p479==1)))||(i9.i1.u46.p403==1))||(i8.u42.p461==1))||(((i4.u20.p211==1)&&(i4.u45.p359==1))&&(i9.i1.u55.p479==1)))||(u43.p153==1))||(i9.i1.u46.p378==1))||(u43.p346==1))))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t64, t65, t76, t78, t79, t86, t87, t88, t89, t102, t103, t108, t110, t112, t114, t118, t128, t130, t131, t136, t138, t140, t141, t149, t150, t155, t156, u43.t9, u43.t15, u43.t74, i0.i0.u3.t72, i0.i2.u24.t12, i0.i4.u31.t11, i1.i0.u6.t19, i1.i1.u15.t73, i2.i0.u11.t75, i5.t20, i5.u1.t24, i5.u2.t22, i9.t115, i9.i1.t5, i9.i1.t157, i9.i1.t158, i9.i1.u46.t7, i9.i1.u46.t8, i9.i1.u55.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :25/76/46/147
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 6
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an 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
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an 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
(forward)formula 0,0,9.01909,168940,1,0,297617,11573,3376,732152,1689,40821,275089
FORMULA BusinessProcesses-PT-10-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Reduce places removed 1 places and 1 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 498 transition count 385
Reduce places removed 67 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 72 rules applied. Total rules applied 139 place count 431 transition count 380
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 144 place count 426 transition count 380
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 144 place count 426 transition count 286
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 201 rules applied. Total rules applied 345 place count 319 transition count 286
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 397 place count 267 transition count 234
Iterating global reduction 3 with 52 rules applied. Total rules applied 449 place count 267 transition count 234
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 449 place count 267 transition count 228
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 461 place count 261 transition count 228
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 169 rules applied. Total rules applied 630 place count 175 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 631 place count 175 transition count 144
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 633 place count 174 transition count 147
Applied a total of 633 rules in 88 ms. Remains 174 /499 variables (removed 325) and now considering 147/453 (removed 306) transitions.
[2021-05-11 19:46:38] [INFO ] Flatten gal took : 11 ms
[2021-05-11 19:46:38] [INFO ] Flatten gal took : 11 ms
[2021-05-11 19:46:38] [INFO ] Input system was already deterministic with 147 transitions.
[2021-05-11 19:46:38] [INFO ] Flatten gal took : 8 ms
[2021-05-11 19:46:38] [INFO ] Flatten gal took : 9 ms
[2021-05-11 19:46:38] [INFO ] Time to serialize gal into /tmp/CTLFireability15061046491756878804.gal : 2 ms
[2021-05-11 19:46:38] [INFO ] Time to serialize properties into /tmp/CTLFireability11276092978099105008.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/CTLFireability15061046491756878804.gal, -t, CGAL, -ctl, /tmp/CTLFireability11276092978099105008.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/CTLFireability15061046491756878804.gal -t CGAL -ctl /tmp/CTLFireability11276092978099105008.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,7.99547e+09,1.80577,64544,2,6131,5,363772,6,0,843,172184,0


Converting to forward existential form...Done !
original formula: AG(E((EG(AF((((((((p325==1)||(p469==1))||(p415==1))||(p286==1))||(p489==1))||(p266==1))||(((p84==1)&&(p313==1))&&(p479==1))))) * ((((((((p215==1)||(p166==1))||(p416==1))||(p252==1))||(p364==1))||(p223==1))||(p188==1))||(((p21==1)&&(p248==1))&&(p479==1)))) U EF(((p305==0)&&(p28==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((EG(!(EG(!((((((((p325==1)||(p469==1))||(p415==1))||(p286==1))||(p489==1))||(p266==1))||(((p84==1)&&(p313==1))&&(p479==1))))))) * ((((((((p215==1)||(p166==1))||(p416==1))||(p252==1))||(p364==1))||(p223==1))||(p188==1))||(((p21==1)&&(p248==1))&&(p479==1)))) U E(TRUE U ((p305==0)&&(p28==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t6, t8, t10, t11, t13, t15, t29, t30, t31, t32, t33, t34, t35, t36, t37, t40, t41, t42, t43, t44, t45, t86, t88, t89, t90, t91, t92, t93, t95, t96, t97, t98, t102, t106, t110, t111, t116, t122, t123, t124, t126, t128, t137, t138, t143, t144, t145, t146, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/60/51/147
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,20.3955,536152,1,0,478,3.42137e+06,297,219,6645,3.12843e+06,506
FORMULA BusinessProcesses-PT-10-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2021-05-11 19:46:58] [INFO ] Flatten gal took : 31 ms
[2021-05-11 19:46:58] [INFO ] Flatten gal took : 22 ms
[2021-05-11 19:46:58] [INFO ] Applying decomposition
[2021-05-11 19:46:58] [INFO ] Flatten gal took : 18 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/graph10080679726808990894.txt, -o, /tmp/graph10080679726808990894.bin, -w, /tmp/graph10080679726808990894.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/graph10080679726808990894.bin, -l, -1, -v, -w, /tmp/graph10080679726808990894.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 19:46:58] [INFO ] Decomposing Gal with order
[2021-05-11 19:46:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 19:46:59] [INFO ] Removed a total of 251 redundant transitions.
[2021-05-11 19:46:59] [INFO ] Flatten gal took : 48 ms
[2021-05-11 19:46:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2021-05-11 19:46:59] [INFO ] Time to serialize gal into /tmp/CTLFireability7077693331272231178.gal : 5 ms
[2021-05-11 19:46:59] [INFO ] Time to serialize properties into /tmp/CTLFireability25509187376648653.ctl : 4 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/CTLFireability7077693331272231178.gal, -t, CGAL, -ctl, /tmp/CTLFireability25509187376648653.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/CTLFireability7077693331272231178.gal -t CGAL -ctl /tmp/CTLFireability25509187376648653.ctl
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
Detected timeout of ITS tools.
[2021-05-11 20:08:18] [INFO ] Applying decomposition
[2021-05-11 20:08:18] [INFO ] Flatten gal took : 47 ms
[2021-05-11 20:08:18] [INFO ] Decomposing Gal with order
[2021-05-11 20:08:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 20:08:18] [INFO ] Removed a total of 118 redundant transitions.
[2021-05-11 20:08:18] [INFO ] Flatten gal took : 60 ms
[2021-05-11 20:08:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 20 ms.
[2021-05-11 20:08:18] [INFO ] Time to serialize gal into /tmp/CTLFireability7537569285503560165.gal : 5 ms
[2021-05-11 20:08:18] [INFO ] Time to serialize properties into /tmp/CTLFireability18218690046934208964.ctl : 4 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/CTLFireability7537569285503560165.gal, -t, CGAL, -ctl, /tmp/CTLFireability18218690046934208964.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/CTLFireability7537569285503560165.gal -t CGAL -ctl /tmp/CTLFireability18218690046934208964.ctl
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
Detected timeout of ITS tools.
[2021-05-11 20:29:39] [INFO ] Flatten gal took : 563 ms
[2021-05-11 20:29:40] [INFO ] Input system was already deterministic with 453 transitions.
[2021-05-11 20:29:40] [INFO ] Transformed 499 places.
[2021-05-11 20:29:40] [INFO ] Transformed 453 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-11 20:30:10] [INFO ] Time to serialize gal into /tmp/CTLFireability306371842919835136.gal : 5 ms
[2021-05-11 20:30:10] [INFO ] Time to serialize properties into /tmp/CTLFireability5016435367530975857.ctl : 16 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/CTLFireability306371842919835136.gal, -t, CGAL, -ctl, /tmp/CTLFireability5016435367530975857.ctl, --load-order, /home/mcc/execution/model.ord, --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/CTLFireability306371842919835136.gal -t CGAL -ctl /tmp/CTLFireability5016435367530975857.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

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