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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K 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.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K 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.9K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 12:15 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 148K 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-13-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-13-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620763303096

Running Version 0
[2021-05-11 20:01:45] [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 20:01:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 20:01:45] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2021-05-11 20:01:45] [INFO ] Transformed 593 places.
[2021-05-11 20:01:45] [INFO ] Transformed 536 transitions.
[2021-05-11 20:01:45] [INFO ] Found NUPN structural information;
[2021-05-11 20:01:45] [INFO ] Parsed PT model containing 593 places and 536 transitions in 134 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 29 ms.
[2021-05-11 20:01:45] [INFO ] Reduced 1 identical enabling conditions.
Deduced a syphon composed of 8 places in 14 ms
Reduce places removed 8 places and 8 transitions.
Support contains 399 out of 585 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 585/585 places, 528/528 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 580 transition count 528
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 22 place count 563 transition count 511
Iterating global reduction 1 with 17 rules applied. Total rules applied 39 place count 563 transition count 511
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 558 transition count 506
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 558 transition count 506
Applied a total of 49 rules in 74 ms. Remains 558 /585 variables (removed 27) and now considering 506/528 (removed 22) transitions.
// Phase 1: matrix 506 rows 558 cols
[2021-05-11 20:01:45] [INFO ] Computed 90 place invariants in 34 ms
[2021-05-11 20:01:45] [INFO ] Implicit Places using invariants in 333 ms returned []
// Phase 1: matrix 506 rows 558 cols
[2021-05-11 20:01:45] [INFO ] Computed 90 place invariants in 13 ms
[2021-05-11 20:01:46] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 801 ms to find 0 implicit places.
// Phase 1: matrix 506 rows 558 cols
[2021-05-11 20:01:46] [INFO ] Computed 90 place invariants in 6 ms
[2021-05-11 20:01:46] [INFO ] Dead Transitions using invariants and state equation in 336 ms returned []
Finished structural reductions, in 1 iterations. Remains : 558/585 places, 506/528 transitions.
[2021-05-11 20:01:46] [INFO ] Flatten gal took : 82 ms
[2021-05-11 20:01:46] [INFO ] Flatten gal took : 46 ms
[2021-05-11 20:01:47] [INFO ] Input system was already deterministic with 506 transitions.
Incomplete random walk after 100000 steps, including 711 resets, run finished after 457 ms. (steps per millisecond=218 ) properties (out of 85) seen :77
Running SMT prover for 8 properties.
// Phase 1: matrix 506 rows 558 cols
[2021-05-11 20:01:47] [INFO ] Computed 90 place invariants in 14 ms
[2021-05-11 20:01:47] [INFO ] [Real]Absence check using 52 positive place invariants in 16 ms returned sat
[2021-05-11 20:01:47] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 10 ms returned sat
[2021-05-11 20:01:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:01:47] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2021-05-11 20:01:48] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 6 ms to minimize.
[2021-05-11 20:01:48] [INFO ] Deduced a trap composed of 8 places in 236 ms of which 2 ms to minimize.
[2021-05-11 20:01:48] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 1 ms to minimize.
[2021-05-11 20:01:48] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 1 ms to minimize.
[2021-05-11 20:01:49] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 1 ms to minimize.
[2021-05-11 20:01:49] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 1 ms to minimize.
[2021-05-11 20:01:49] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 1 ms to minimize.
[2021-05-11 20:01:49] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 1 ms to minimize.
[2021-05-11 20:01:49] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 0 ms to minimize.
[2021-05-11 20:01:50] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 1 ms to minimize.
[2021-05-11 20:01:50] [INFO ] Deduced a trap composed of 142 places in 200 ms of which 13 ms to minimize.
[2021-05-11 20:01:50] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2021-05-11 20:01:50] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2021-05-11 20:01:50] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 0 ms to minimize.
[2021-05-11 20:01:50] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 1 ms to minimize.
[2021-05-11 20:01:50] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 0 ms to minimize.
[2021-05-11 20:01:51] [INFO ] Deduced a trap composed of 44 places in 179 ms of which 1 ms to minimize.
[2021-05-11 20:01:51] [INFO ] Deduced a trap composed of 145 places in 190 ms of which 1 ms to minimize.
[2021-05-11 20:01:51] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 1 ms to minimize.
[2021-05-11 20:01:51] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3625 ms
[2021-05-11 20:01:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:01:51] [INFO ] [Nat]Absence check using 52 positive place invariants in 22 ms returned sat
[2021-05-11 20:01:51] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 13 ms returned sat
[2021-05-11 20:01:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:01:51] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2021-05-11 20:01:52] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 1 ms to minimize.
[2021-05-11 20:01:52] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 1 ms to minimize.
[2021-05-11 20:01:52] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 1 ms to minimize.
[2021-05-11 20:01:52] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 1 ms to minimize.
[2021-05-11 20:01:52] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 0 ms to minimize.
[2021-05-11 20:01:53] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 1 ms to minimize.
[2021-05-11 20:01:53] [INFO ] Deduced a trap composed of 16 places in 192 ms of which 1 ms to minimize.
[2021-05-11 20:01:53] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 0 ms to minimize.
[2021-05-11 20:01:53] [INFO ] Deduced a trap composed of 32 places in 158 ms of which 1 ms to minimize.
[2021-05-11 20:01:53] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 1 ms to minimize.
[2021-05-11 20:01:54] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 1 ms to minimize.
[2021-05-11 20:01:54] [INFO ] Deduced a trap composed of 33 places in 172 ms of which 1 ms to minimize.
[2021-05-11 20:01:54] [INFO ] Deduced a trap composed of 54 places in 152 ms of which 1 ms to minimize.
[2021-05-11 20:01:54] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 0 ms to minimize.
[2021-05-11 20:01:54] [INFO ] Deduced a trap composed of 124 places in 200 ms of which 1 ms to minimize.
[2021-05-11 20:01:55] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 0 ms to minimize.
[2021-05-11 20:01:55] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 1 ms to minimize.
[2021-05-11 20:01:55] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 0 ms to minimize.
[2021-05-11 20:01:55] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2021-05-11 20:01:55] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 1 ms to minimize.
[2021-05-11 20:01:55] [INFO ] Deduced a trap composed of 132 places in 168 ms of which 2 ms to minimize.
[2021-05-11 20:01:55] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3772 ms
[2021-05-11 20:01:55] [INFO ] Computed and/alt/rep : 474/817/474 causal constraints (skipped 31 transitions) in 55 ms.
[2021-05-11 20:01:58] [INFO ] Added : 316 causal constraints over 64 iterations in 2304 ms. Result :sat
[2021-05-11 20:01:58] [INFO ] [Real]Absence check using 52 positive place invariants in 21 ms returned sat
[2021-05-11 20:01:58] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 10 ms returned sat
[2021-05-11 20:01:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:01:58] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2021-05-11 20:01:58] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 1 ms to minimize.
[2021-05-11 20:01:58] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 0 ms to minimize.
[2021-05-11 20:01:58] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2021-05-11 20:01:58] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2021-05-11 20:01:58] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 0 ms to minimize.
[2021-05-11 20:01:59] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 0 ms to minimize.
[2021-05-11 20:01:59] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2021-05-11 20:01:59] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2021-05-11 20:01:59] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 0 ms to minimize.
[2021-05-11 20:01:59] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2021-05-11 20:01:59] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2021-05-11 20:01:59] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2021-05-11 20:01:59] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2021-05-11 20:01:59] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1361 ms
[2021-05-11 20:01:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:01:59] [INFO ] [Nat]Absence check using 52 positive place invariants in 20 ms returned sat
[2021-05-11 20:01:59] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 21 ms returned sat
[2021-05-11 20:01:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:02:00] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2021-05-11 20:02:00] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 0 ms to minimize.
[2021-05-11 20:02:00] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 0 ms to minimize.
[2021-05-11 20:02:00] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2021-05-11 20:02:00] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2021-05-11 20:02:00] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2021-05-11 20:02:00] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2021-05-11 20:02:00] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 0 ms to minimize.
[2021-05-11 20:02:00] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2021-05-11 20:02:00] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2021-05-11 20:02:00] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2021-05-11 20:02:01] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2021-05-11 20:02:01] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 0 ms to minimize.
[2021-05-11 20:02:01] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 4 ms to minimize.
[2021-05-11 20:02:01] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1170 ms
[2021-05-11 20:02:01] [INFO ] Computed and/alt/rep : 474/817/474 causal constraints (skipped 31 transitions) in 34 ms.
[2021-05-11 20:02:02] [INFO ] Added : 227 causal constraints over 46 iterations in 1283 ms. Result :sat
[2021-05-11 20:02:02] [INFO ] [Real]Absence check using 52 positive place invariants in 14 ms returned sat
[2021-05-11 20:02:02] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 9 ms returned sat
[2021-05-11 20:02:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:02:02] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2021-05-11 20:02:03] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 0 ms to minimize.
[2021-05-11 20:02:03] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 3 ms to minimize.
[2021-05-11 20:02:03] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 15 ms to minimize.
[2021-05-11 20:02:03] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 1 ms to minimize.
[2021-05-11 20:02:03] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 0 ms to minimize.
[2021-05-11 20:02:03] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 1 ms to minimize.
[2021-05-11 20:02:04] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 1 ms to minimize.
[2021-05-11 20:02:04] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 1 ms to minimize.
[2021-05-11 20:02:04] [INFO ] Deduced a trap composed of 126 places in 121 ms of which 1 ms to minimize.
[2021-05-11 20:02:04] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 0 ms to minimize.
[2021-05-11 20:02:04] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 1 ms to minimize.
[2021-05-11 20:02:04] [INFO ] Deduced a trap composed of 142 places in 159 ms of which 1 ms to minimize.
[2021-05-11 20:02:05] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2021-05-11 20:02:05] [INFO ] Deduced a trap composed of 131 places in 159 ms of which 0 ms to minimize.
[2021-05-11 20:02:05] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 1 ms to minimize.
[2021-05-11 20:02:05] [INFO ] Deduced a trap composed of 144 places in 152 ms of which 1 ms to minimize.
[2021-05-11 20:02:05] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2737 ms
[2021-05-11 20:02:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:02:05] [INFO ] [Nat]Absence check using 52 positive place invariants in 33 ms returned sat
[2021-05-11 20:02:05] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 13 ms returned sat
[2021-05-11 20:02:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:02:06] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2021-05-11 20:02:06] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 0 ms to minimize.
[2021-05-11 20:02:06] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 1 ms to minimize.
[2021-05-11 20:02:06] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 0 ms to minimize.
[2021-05-11 20:02:06] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 1 ms to minimize.
[2021-05-11 20:02:07] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 1 ms to minimize.
[2021-05-11 20:02:07] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 0 ms to minimize.
[2021-05-11 20:02:07] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 1 ms to minimize.
[2021-05-11 20:02:07] [INFO ] Deduced a trap composed of 118 places in 157 ms of which 0 ms to minimize.
[2021-05-11 20:02:07] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 0 ms to minimize.
[2021-05-11 20:02:07] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 1 ms to minimize.
[2021-05-11 20:02:08] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 0 ms to minimize.
[2021-05-11 20:02:08] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 0 ms to minimize.
[2021-05-11 20:02:08] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 1 ms to minimize.
[2021-05-11 20:02:08] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 0 ms to minimize.
[2021-05-11 20:02:08] [INFO ] Deduced a trap composed of 132 places in 125 ms of which 1 ms to minimize.
[2021-05-11 20:02:08] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 1 ms to minimize.
[2021-05-11 20:02:09] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 0 ms to minimize.
[2021-05-11 20:02:09] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 0 ms to minimize.
[2021-05-11 20:02:09] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 0 ms to minimize.
[2021-05-11 20:02:09] [INFO ] Deduced a trap composed of 48 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:02:09] [INFO ] Deduced a trap composed of 141 places in 135 ms of which 1 ms to minimize.
[2021-05-11 20:02:09] [INFO ] Deduced a trap composed of 152 places in 147 ms of which 1 ms to minimize.
[2021-05-11 20:02:10] [INFO ] Deduced a trap composed of 115 places in 161 ms of which 0 ms to minimize.
[2021-05-11 20:02:10] [INFO ] Deduced a trap composed of 136 places in 135 ms of which 1 ms to minimize.
[2021-05-11 20:02:10] [INFO ] Deduced a trap composed of 120 places in 162 ms of which 4 ms to minimize.
[2021-05-11 20:02:10] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 1 ms to minimize.
[2021-05-11 20:02:10] [INFO ] Deduced a trap composed of 131 places in 141 ms of which 1 ms to minimize.
[2021-05-11 20:02:10] [INFO ] Deduced a trap composed of 139 places in 136 ms of which 1 ms to minimize.
[2021-05-11 20:02:11] [INFO ] Deduced a trap composed of 141 places in 166 ms of which 1 ms to minimize.
[2021-05-11 20:02:11] [INFO ] Deduced a trap composed of 130 places in 138 ms of which 0 ms to minimize.
[2021-05-11 20:02:11] [INFO ] Deduced a trap composed of 134 places in 143 ms of which 0 ms to minimize.
[2021-05-11 20:02:11] [INFO ] Deduced a trap composed of 128 places in 163 ms of which 0 ms to minimize.
[2021-05-11 20:02:11] [INFO ] Deduced a trap composed of 145 places in 165 ms of which 0 ms to minimize.
[2021-05-11 20:02:12] [INFO ] Deduced a trap composed of 122 places in 162 ms of which 0 ms to minimize.
[2021-05-11 20:02:12] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 6046 ms
[2021-05-11 20:02:12] [INFO ] Computed and/alt/rep : 474/817/474 causal constraints (skipped 31 transitions) in 35 ms.
[2021-05-11 20:02:14] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 1 ms to minimize.
[2021-05-11 20:02:14] [INFO ] Deduced a trap composed of 84 places in 159 ms of which 1 ms to minimize.
[2021-05-11 20:02:15] [INFO ] Deduced a trap composed of 122 places in 134 ms of which 1 ms to minimize.
[2021-05-11 20:02:15] [INFO ] Deduced a trap composed of 129 places in 123 ms of which 1 ms to minimize.
[2021-05-11 20:02:15] [INFO ] Deduced a trap composed of 121 places in 151 ms of which 1 ms to minimize.
[2021-05-11 20:02:15] [INFO ] Deduced a trap composed of 132 places in 168 ms of which 1 ms to minimize.
[2021-05-11 20:02:15] [INFO ] Deduced a trap composed of 91 places in 167 ms of which 1 ms to minimize.
[2021-05-11 20:02:16] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:02:16] [INFO ] Deduced a trap composed of 141 places in 164 ms of which 1 ms to minimize.
[2021-05-11 20:02:16] [INFO ] Deduced a trap composed of 130 places in 159 ms of which 0 ms to minimize.
[2021-05-11 20:02:16] [INFO ] Deduced a trap composed of 127 places in 160 ms of which 0 ms to minimize.
[2021-05-11 20:02:16] [INFO ] Deduced a trap composed of 143 places in 156 ms of which 1 ms to minimize.
[2021-05-11 20:02:17] [INFO ] Deduced a trap composed of 141 places in 144 ms of which 1 ms to minimize.
[2021-05-11 20:02:17] [INFO ] Deduced a trap composed of 132 places in 168 ms of which 0 ms to minimize.
[2021-05-11 20:02:17] [INFO ] Deduced a trap composed of 134 places in 162 ms of which 2 ms to minimize.
[2021-05-11 20:02:17] [INFO ] Deduced a trap composed of 139 places in 162 ms of which 1 ms to minimize.
[2021-05-11 20:02:18] [INFO ] Deduced a trap composed of 145 places in 174 ms of which 1 ms to minimize.
[2021-05-11 20:02:18] [INFO ] Deduced a trap composed of 142 places in 178 ms of which 1 ms to minimize.
[2021-05-11 20:02:18] [INFO ] Deduced a trap composed of 127 places in 167 ms of which 0 ms to minimize.
[2021-05-11 20:02:18] [INFO ] Deduced a trap composed of 137 places in 144 ms of which 1 ms to minimize.
[2021-05-11 20:02:18] [INFO ] Deduced a trap composed of 132 places in 153 ms of which 1 ms to minimize.
[2021-05-11 20:02:18] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 4466 ms
[2021-05-11 20:02:19] [INFO ] Added : 332 causal constraints over 67 iterations in 7101 ms. Result :sat
[2021-05-11 20:02:19] [INFO ] [Real]Absence check using 52 positive place invariants in 31 ms returned sat
[2021-05-11 20:02:19] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 14 ms returned sat
[2021-05-11 20:02:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:02:19] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2021-05-11 20:02:19] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 0 ms to minimize.
[2021-05-11 20:02:19] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 1 ms to minimize.
[2021-05-11 20:02:20] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 1 ms to minimize.
[2021-05-11 20:02:20] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 0 ms to minimize.
[2021-05-11 20:02:20] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 1 ms to minimize.
[2021-05-11 20:02:20] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 1 ms to minimize.
[2021-05-11 20:02:20] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 0 ms to minimize.
[2021-05-11 20:02:21] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 0 ms to minimize.
[2021-05-11 20:02:21] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 1 ms to minimize.
[2021-05-11 20:02:21] [INFO ] Deduced a trap composed of 126 places in 168 ms of which 1 ms to minimize.
[2021-05-11 20:02:21] [INFO ] Deduced a trap composed of 137 places in 145 ms of which 0 ms to minimize.
[2021-05-11 20:02:21] [INFO ] Deduced a trap composed of 134 places in 172 ms of which 1 ms to minimize.
[2021-05-11 20:02:22] [INFO ] Deduced a trap composed of 130 places in 155 ms of which 1 ms to minimize.
[2021-05-11 20:02:22] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2490 ms
[2021-05-11 20:02:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:02:22] [INFO ] [Nat]Absence check using 52 positive place invariants in 30 ms returned sat
[2021-05-11 20:02:22] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 16 ms returned sat
[2021-05-11 20:02:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:02:22] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2021-05-11 20:02:22] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 1 ms to minimize.
[2021-05-11 20:02:22] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 0 ms to minimize.
[2021-05-11 20:02:23] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:02:23] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 0 ms to minimize.
[2021-05-11 20:02:23] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 2 ms to minimize.
[2021-05-11 20:02:23] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 1 ms to minimize.
[2021-05-11 20:02:23] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 1 ms to minimize.
[2021-05-11 20:02:23] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 1 ms to minimize.
[2021-05-11 20:02:24] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 1 ms to minimize.
[2021-05-11 20:02:24] [INFO ] Deduced a trap composed of 126 places in 127 ms of which 1 ms to minimize.
[2021-05-11 20:02:24] [INFO ] Deduced a trap composed of 142 places in 130 ms of which 1 ms to minimize.
[2021-05-11 20:02:24] [INFO ] Deduced a trap composed of 132 places in 124 ms of which 0 ms to minimize.
[2021-05-11 20:02:24] [INFO ] Deduced a trap composed of 122 places in 123 ms of which 0 ms to minimize.
[2021-05-11 20:02:24] [INFO ] Deduced a trap composed of 132 places in 121 ms of which 0 ms to minimize.
[2021-05-11 20:02:24] [INFO ] Deduced a trap composed of 164 places in 144 ms of which 1 ms to minimize.
[2021-05-11 20:02:25] [INFO ] Deduced a trap composed of 133 places in 165 ms of which 0 ms to minimize.
[2021-05-11 20:02:25] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2774 ms
[2021-05-11 20:02:25] [INFO ] Computed and/alt/rep : 474/817/474 causal constraints (skipped 31 transitions) in 52 ms.
[2021-05-11 20:02:27] [INFO ] Deduced a trap composed of 143 places in 167 ms of which 0 ms to minimize.
[2021-05-11 20:02:27] [INFO ] Deduced a trap composed of 130 places in 164 ms of which 1 ms to minimize.
[2021-05-11 20:02:28] [INFO ] Deduced a trap composed of 137 places in 150 ms of which 0 ms to minimize.
[2021-05-11 20:02:28] [INFO ] Deduced a trap composed of 128 places in 142 ms of which 0 ms to minimize.
[2021-05-11 20:02:28] [INFO ] Deduced a trap composed of 134 places in 154 ms of which 1 ms to minimize.
[2021-05-11 20:02:28] [INFO ] Deduced a trap composed of 140 places in 154 ms of which 0 ms to minimize.
[2021-05-11 20:02:28] [INFO ] Deduced a trap composed of 148 places in 160 ms of which 1 ms to minimize.
[2021-05-11 20:02:29] [INFO ] Deduced a trap composed of 139 places in 160 ms of which 1 ms to minimize.
[2021-05-11 20:02:29] [INFO ] Deduced a trap composed of 133 places in 166 ms of which 0 ms to minimize.
[2021-05-11 20:02:29] [INFO ] Deduced a trap composed of 118 places in 145 ms of which 1 ms to minimize.
[2021-05-11 20:02:29] [INFO ] Deduced a trap composed of 134 places in 158 ms of which 1 ms to minimize.
[2021-05-11 20:02:29] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2364 ms
[2021-05-11 20:02:29] [INFO ] Added : 315 causal constraints over 64 iterations in 4762 ms. Result :sat
[2021-05-11 20:02:30] [INFO ] [Real]Absence check using 52 positive place invariants in 24 ms returned sat
[2021-05-11 20:02:30] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 16 ms returned sat
[2021-05-11 20:02:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:02:30] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2021-05-11 20:02:30] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2021-05-11 20:02:30] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 0 ms to minimize.
[2021-05-11 20:02:30] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2021-05-11 20:02:30] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2021-05-11 20:02:30] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 0 ms to minimize.
[2021-05-11 20:02:31] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 0 ms to minimize.
[2021-05-11 20:02:31] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2021-05-11 20:02:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 761 ms
[2021-05-11 20:02:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:02:31] [INFO ] [Nat]Absence check using 52 positive place invariants in 21 ms returned sat
[2021-05-11 20:02:31] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 14 ms returned sat
[2021-05-11 20:02:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:02:31] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2021-05-11 20:02:31] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 0 ms to minimize.
[2021-05-11 20:02:31] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 1 ms to minimize.
[2021-05-11 20:02:31] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 1 ms to minimize.
[2021-05-11 20:02:31] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 0 ms to minimize.
[2021-05-11 20:02:32] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2021-05-11 20:02:32] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2021-05-11 20:02:32] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 0 ms to minimize.
[2021-05-11 20:02:32] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 1 ms to minimize.
[2021-05-11 20:02:32] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 896 ms
[2021-05-11 20:02:32] [INFO ] Computed and/alt/rep : 474/817/474 causal constraints (skipped 31 transitions) in 38 ms.
[2021-05-11 20:02:33] [INFO ] Added : 196 causal constraints over 40 iterations in 1357 ms. Result :sat
[2021-05-11 20:02:33] [INFO ] [Real]Absence check using 52 positive place invariants in 21 ms returned sat
[2021-05-11 20:02:33] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 13 ms returned sat
[2021-05-11 20:02:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:02:34] [INFO ] [Real]Absence check using state equation in 209 ms returned unsat
[2021-05-11 20:02:34] [INFO ] [Real]Absence check using 52 positive place invariants in 22 ms returned sat
[2021-05-11 20:02:34] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 12 ms returned sat
[2021-05-11 20:02:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:02:34] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2021-05-11 20:02:34] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 1 ms to minimize.
[2021-05-11 20:02:34] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 1 ms to minimize.
[2021-05-11 20:02:34] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 1 ms to minimize.
[2021-05-11 20:02:35] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 0 ms to minimize.
[2021-05-11 20:02:35] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2021-05-11 20:02:35] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2021-05-11 20:02:35] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2021-05-11 20:02:35] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2021-05-11 20:02:35] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2021-05-11 20:02:35] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1145 ms
[2021-05-11 20:02:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:02:35] [INFO ] [Nat]Absence check using 52 positive place invariants in 21 ms returned sat
[2021-05-11 20:02:35] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 12 ms returned sat
[2021-05-11 20:02:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:02:35] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2021-05-11 20:02:36] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 1 ms to minimize.
[2021-05-11 20:02:36] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 0 ms to minimize.
[2021-05-11 20:02:36] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 1 ms to minimize.
[2021-05-11 20:02:36] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 0 ms to minimize.
[2021-05-11 20:02:36] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2021-05-11 20:02:36] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2021-05-11 20:02:36] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2021-05-11 20:02:36] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2021-05-11 20:02:36] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2021-05-11 20:02:36] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1068 ms
[2021-05-11 20:02:36] [INFO ] Computed and/alt/rep : 474/817/474 causal constraints (skipped 31 transitions) in 32 ms.
[2021-05-11 20:02:38] [INFO ] Added : 245 causal constraints over 50 iterations in 1459 ms. Result :sat
[2021-05-11 20:02:38] [INFO ] [Real]Absence check using 52 positive place invariants in 21 ms returned sat
[2021-05-11 20:02:38] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 17 ms returned sat
[2021-05-11 20:02:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:02:38] [INFO ] [Real]Absence check using state equation in 222 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 557 transition count 444
Reduce places removed 61 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 68 rules applied. Total rules applied 129 place count 496 transition count 437
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 136 place count 489 transition count 437
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 136 place count 489 transition count 327
Deduced a syphon composed of 110 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 233 rules applied. Total rules applied 369 place count 366 transition count 327
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 430 place count 305 transition count 266
Iterating global reduction 3 with 61 rules applied. Total rules applied 491 place count 305 transition count 266
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 491 place count 305 transition count 264
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 496 place count 302 transition count 264
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 626 place count 237 transition count 199
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 627 place count 236 transition count 198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 628 place count 235 transition count 198
Applied a total of 628 rules in 79 ms. Remains 235 /558 variables (removed 323) and now considering 198/506 (removed 308) transitions.
[2021-05-11 20:02:38] [INFO ] Flatten gal took : 13 ms
[2021-05-11 20:02:38] [INFO ] Flatten gal took : 14 ms
[2021-05-11 20:02:38] [INFO ] Input system was already deterministic with 198 transitions.
[2021-05-11 20:02:38] [INFO ] Flatten gal took : 11 ms
[2021-05-11 20:02:38] [INFO ] Flatten gal took : 11 ms
[2021-05-11 20:02:39] [INFO ] Time to serialize gal into /tmp/CTLFireability7260005708936300990.gal : 7 ms
[2021-05-11 20:02:39] [INFO ] Time to serialize properties into /tmp/CTLFireability7646716618669042515.ctl : 42 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/CTLFireability7260005708936300990.gal, -t, CGAL, -ctl, /tmp/CTLFireability7646716618669042515.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/CTLFireability7260005708936300990.gal -t CGAL -ctl /tmp/CTLFireability7646716618669042515.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.91028e+08,0.842205,36628,2,23050,5,102012,6,0,1138,116498,0


Converting to forward existential form...Done !
original formula: A(!(E((((((((((p51==1)||(p35==1))||(((p194==1)&&(p395==1))&&(p584==1)))||(((p197==1)&&(p390==1))&&(p587==1)))||(p434==1))||(p401==1))||(p252==1))||(((p176==1)&&(p385==1))&&(p531==1)))||(((p169==1)&&(p390==1))&&(p587==1))) U ((((((((((!(E(((((((((p485==1)||(p434==1))||(p21==1))||(p558==1))||(p175==1))||(p549==1))||(p159==1))||(((p46==1)&&(p300==1))&&(p455==1))) U ((((p568==1)||(p257==1))||(p287==1))||(p93==1)))) + (p245==1)) + (((p62==1)&&(p409==1))&&(p558==1))) + (p51==1)) + (p69==1)) + (p57==1)) + (p269==1)) + (p56==1)) + (p121==1)) + (p580==1)) + (p79==1)))) U (!(AG(!(EG(((((((((p539==1)||(p321==1))||(p544==1))||(p171==1))||(p11==1))||(p565==1))||(p490==1))||(((p46==1)&&(p300==1))&&(p455==1))))))) + AF(EG((((((((((p469==1)||((p582==1)&&(p585==1)))||(p528==1))||(p494==1))||(p367==1))||(p207==1))||(p45==1))||(((p113==1)&&(p370==1))&&(p559==1)))||(p156==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!((!(!(E(TRUE U !(!(EG(((((((((p539==1)||(p321==1))||(p544==1))||(p171==1))||(p11==1))||(p565==1))||(p490==1))||(((p46==1)&&(p300==1))&&(p455==1))))))))) + !(EG(!(EG((((((((((p469==1)||((p582==1)&&(p585==1)))||(p528==1))||(p494==1))||(p367==1))||(p207==1))||(p45==1))||(((p113==1)&&(p370==1))&&(p559==1)))||(p156==1))))))))))) * !(E(!((!(!(E(TRUE U !(!(EG(((((((((p539==1)||(p321==1))||(p544==1))||(p171==1))||(p11==1))||(p565==1))||(p490==1))||(((p46==1)&&(p300==1))&&(p455==1))))))))) + !(EG(!(EG((((((((((p469==1)||((p582==1)&&(p585==1)))||(p528==1))||(p494==1))||(p367==1))||(p207==1))||(p45==1))||(((p113==1)&&(p370==1))&&(p559==1)))||(p156==1)))))))) U (!(!(E((((((((((p51==1)||(p35==1))||(((p194==1)&&(p395==1))&&(p584==1)))||(((p197==1)&&(p390==1))&&(p587==1)))||(p434==1))||(p401==1))||(p252==1))||(((p176==1)&&(p385==1))&&(p531==1)))||(((p169==1)&&(p390==1))&&(p587==1))) U ((((((((((!(E(((((((((p485==1)||(p434==1))||(p21==1))||(p558==1))||(p175==1))||(p549==1))||(p159==1))||(((p46==1)&&(p300==1))&&(p455==1))) U ((((p568==1)||(p257==1))||(p287==1))||(p93==1)))) + (p245==1)) + (((p62==1)&&(p409==1))&&(p558==1))) + (p51==1)) + (p69==1)) + (p57==1)) + (p269==1)) + (p56==1)) + (p121==1)) + (p580==1)) + (p79==1))))) * !((!(!(E(TRUE U !(!(EG(((((((((p539==1)||(p321==1))||(p544==1))||(p171==1))||(p11==1))||(p565==1))||(p490==1))||(((p46==1)&&(p300==1))&&(p455==1))))))))) + !(EG(!(EG((((((((((p469==1)||((p582==1)&&(p585==1)))||(p528==1))||(p494==1))||(p367==1))||(p207==1))||(p45==1))||(((p113==1)&&(p370==1))&&(p559==1)))||(p156==1))))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t14, t16, t17, t24, t26, t29, t33, t34, t42, t48, t50, t53, t105, t106, t110, t114, t116, t117, t118, t119, t120, t121, t124, t132, t133, t134, t146, t147, t148, t151, t153, t154, t161, t162, t173, t176, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/123/39/198
Detected timeout of ITS tools.
[2021-05-11 20:03:09] [INFO ] Flatten gal took : 23 ms
[2021-05-11 20:03:09] [INFO ] Applying decomposition
[2021-05-11 20:03:09] [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/graph13745870429118570897.txt, -o, /tmp/graph13745870429118570897.bin, -w, /tmp/graph13745870429118570897.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/graph13745870429118570897.bin, -l, -1, -v, -w, /tmp/graph13745870429118570897.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 20:03:09] [INFO ] Decomposing Gal with order
[2021-05-11 20:03:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 20:03:09] [INFO ] Removed a total of 89 redundant transitions.
[2021-05-11 20:03:09] [INFO ] Flatten gal took : 62 ms
[2021-05-11 20:03:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 14 ms.
[2021-05-11 20:03:09] [INFO ] Time to serialize gal into /tmp/CTLFireability8085398568174603380.gal : 8 ms
[2021-05-11 20:03:09] [INFO ] Time to serialize properties into /tmp/CTLFireability8269782109158498935.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/CTLFireability8085398568174603380.gal, -t, CGAL, -ctl, /tmp/CTLFireability8269782109158498935.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/CTLFireability8085398568174603380.gal -t CGAL -ctl /tmp/CTLFireability8269782109158498935.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.91028e+08,0.55121,21132,1404,881,25087,5423,805,58585,226,20242,0


Converting to forward existential form...Done !
original formula: A(!(E((((((((((i5.i0.u5.p51==1)||(i1.i0.u2.p35==1))||(((u42.p194==1)&&(u42.p395==1))&&(u42.p584==1)))||(((i0.u41.p197==1)&&(i0.u41.p390==1))&&(i0.u41.p587==1)))||(i8.i2.u48.p434==1))||(i3.i2.u43.p401==1))||(i6.i2.u20.p252==1))||(((i7.u40.p176==1)&&(i7.u40.p385==1))&&(i7.u40.p531==1)))||(((i0.u41.p169==1)&&(i0.u41.p390==1))&&(i0.u41.p587==1))) U ((((((((((!(E(((((((((i8.i2.u47.p485==1)||(i8.i2.u48.p434==1))||(i4.u9.p21==1))||(i8.i2.u47.p558==1))||(i7.u16.p175==1))||(i8.i2.u47.p549==1))||(i7.u40.p159==1))||(((i1.i1.u4.p46==1)&&(i9.i1.u25.p300==1))&&(i1.i1.u50.p455==1))) U ((((i7.u40.p568==1)||(i4.u21.p257==1))||(i10.i0.u24.p287==1))||(i4.u10.p93==1)))) + (i5.i1.u19.p245==1)) + (((i3.i0.u7.p62==1)&&(i3.i0.u45.p409==1))&&(i8.i2.u47.p558==1))) + (i5.i0.u5.p51==1)) + (i4.u8.p69==1)) + (i9.i0.u6.p57==1)) + (i10.i0.u22.p269==1)) + (i9.i0.u6.p56==1)) + (i6.i2.u14.p121==1)) + (i0.u41.p580==1)) + (i4.u10.p79==1)))) U (!(AG(!(EG(((((((((i7.u59.p539==1)||(i2.u29.p321==1))||(i8.i2.u61.p544==1))||(u42.p171==1))||(i0.u0.p11==1))||(i7.u65.p565==1))||(i8.i2.u52.p490==1))||(((i1.i1.u4.p46==1)&&(i9.i1.u25.p300==1))&&(i1.i1.u50.p455==1))))))) + AF(EG((((((((((i9.i0.u51.p469==1)||((i7.u40.p582==1)&&(u42.p585==1)))||(u42.p528==1))||(i8.i2.u64.p494==1))||(i6.i3.u38.p367==1))||(i3.i1.u17.p207==1))||(i1.i1.u3.p45==1))||(((i6.i0.u13.p113==1)&&(i6.i3.u38.p370==1))&&(i6.i0.u54.p559==1)))||(i0.u41.p156==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!((!(!(E(TRUE U !(!(EG(((((((((i7.u59.p539==1)||(i2.u29.p321==1))||(i8.i2.u61.p544==1))||(u42.p171==1))||(i0.u0.p11==1))||(i7.u65.p565==1))||(i8.i2.u52.p490==1))||(((i1.i1.u4.p46==1)&&(i9.i1.u25.p300==1))&&(i1.i1.u50.p455==1))))))))) + !(EG(!(EG((((((((((i9.i0.u51.p469==1)||((i7.u40.p582==1)&&(u42.p585==1)))||(u42.p528==1))||(i8.i2.u64.p494==1))||(i6.i3.u38.p367==1))||(i3.i1.u17.p207==1))||(i1.i1.u3.p45==1))||(((i6.i0.u13.p113==1)&&(i6.i3.u38.p370==1))&&(i6.i0.u54.p559==1)))||(i0.u41.p156==1))))))))))) * !(E(!((!(!(E(TRUE U !(!(EG(((((((((i7.u59.p539==1)||(i2.u29.p321==1))||(i8.i2.u61.p544==1))||(u42.p171==1))||(i0.u0.p11==1))||(i7.u65.p565==1))||(i8.i2.u52.p490==1))||(((i1.i1.u4.p46==1)&&(i9.i1.u25.p300==1))&&(i1.i1.u50.p455==1))))))))) + !(EG(!(EG((((((((((i9.i0.u51.p469==1)||((i7.u40.p582==1)&&(u42.p585==1)))||(u42.p528==1))||(i8.i2.u64.p494==1))||(i6.i3.u38.p367==1))||(i3.i1.u17.p207==1))||(i1.i1.u3.p45==1))||(((i6.i0.u13.p113==1)&&(i6.i3.u38.p370==1))&&(i6.i0.u54.p559==1)))||(i0.u41.p156==1)))))))) U (!(!(E((((((((((i5.i0.u5.p51==1)||(i1.i0.u2.p35==1))||(((u42.p194==1)&&(u42.p395==1))&&(u42.p584==1)))||(((i0.u41.p197==1)&&(i0.u41.p390==1))&&(i0.u41.p587==1)))||(i8.i2.u48.p434==1))||(i3.i2.u43.p401==1))||(i6.i2.u20.p252==1))||(((i7.u40.p176==1)&&(i7.u40.p385==1))&&(i7.u40.p531==1)))||(((i0.u41.p169==1)&&(i0.u41.p390==1))&&(i0.u41.p587==1))) U ((((((((((!(E(((((((((i8.i2.u47.p485==1)||(i8.i2.u48.p434==1))||(i4.u9.p21==1))||(i8.i2.u47.p558==1))||(i7.u16.p175==1))||(i8.i2.u47.p549==1))||(i7.u40.p159==1))||(((i1.i1.u4.p46==1)&&(i9.i1.u25.p300==1))&&(i1.i1.u50.p455==1))) U ((((i7.u40.p568==1)||(i4.u21.p257==1))||(i10.i0.u24.p287==1))||(i4.u10.p93==1)))) + (i5.i1.u19.p245==1)) + (((i3.i0.u7.p62==1)&&(i3.i0.u45.p409==1))&&(i8.i2.u47.p558==1))) + (i5.i0.u5.p51==1)) + (i4.u8.p69==1)) + (i9.i0.u6.p57==1)) + (i10.i0.u22.p269==1)) + (i9.i0.u6.p56==1)) + (i6.i2.u14.p121==1)) + (i0.u41.p580==1)) + (i4.u10.p79==1))))) * !((!(!(E(TRUE U !(!(EG(((((((((i7.u59.p539==1)||(i2.u29.p321==1))||(i8.i2.u61.p544==1))||(u42.p171==1))||(i0.u0.p11==1))||(i7.u65.p565==1))||(i8.i2.u52.p490==1))||(((i1.i1.u4.p46==1)&&(i9.i1.u25.p300==1))&&(i1.i1.u50.p455==1))))))))) + !(EG(!(EG((((((((((i9.i0.u51.p469==1)||((i7.u40.p582==1)&&(u42.p585==1)))||(u42.p528==1))||(i8.i2.u64.p494==1))||(i6.i3.u38.p367==1))||(i3.i1.u17.p207==1))||(i1.i1.u3.p45==1))||(((i6.i0.u13.p113==1)&&(i6.i3.u38.p370==1))&&(i6.i0.u54.p559==1)))||(i0.u41.p156==1))))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t60, t106, t110, t118, t132, t133, t134, t146, t147, t148, t151, t153, t154, t162, t176, t184, i0.u41.t42, i1.i0.u2.t53, i1.i1.u3.t114, i2.u29.t33, i3.i0.u7.t120, i3.i2.u43.t26, i4.u8.t121, i4.u10.t116, i5.i0.u5.t50, i5.i1.u19.t24, i6.i0.u12.t124, i6.i2.u14.t117, i6.i3.u38.t29, i8.i2.t4, i8.i2.t14, i8.i2.t16, i8.i2.t173, i8.i2.u47.t2, i8.i2.u47.t17, i9.i0.u6.t48, i10.i0.u22.t34, i10.i0.u24.t119, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :26/119/39/184
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found 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 a local SCC at level 2
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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found 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 a local SCC at level 2
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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found 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 a local SCC at level 2
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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,1,13.1689,325908,1,0,654611,22715,4385,962625,2000,149469,980966
FORMULA BusinessProcesses-PT-13-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Reduce places removed 1 places and 1 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 557 transition count 440
Reduce places removed 65 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 74 rules applied. Total rules applied 139 place count 492 transition count 431
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 148 place count 483 transition count 431
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 148 place count 483 transition count 343
Deduced a syphon composed of 88 places in 2 ms
Ensure Unique test removed 11 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 187 rules applied. Total rules applied 335 place count 384 transition count 343
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 392 place count 327 transition count 286
Iterating global reduction 3 with 57 rules applied. Total rules applied 449 place count 327 transition count 286
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 449 place count 327 transition count 282
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 459 place count 321 transition count 282
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 611 place count 244 transition count 207
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 3 with 2 rules applied. Total rules applied 613 place count 243 transition count 211
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 618 place count 243 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 619 place count 242 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 620 place count 241 transition count 210
Applied a total of 620 rules in 124 ms. Remains 241 /558 variables (removed 317) and now considering 210/506 (removed 296) transitions.
[2021-05-11 20:03:22] [INFO ] Flatten gal took : 16 ms
[2021-05-11 20:03:22] [INFO ] Flatten gal took : 17 ms
[2021-05-11 20:03:22] [INFO ] Input system was already deterministic with 210 transitions.
[2021-05-11 20:03:22] [INFO ] Flatten gal took : 15 ms
[2021-05-11 20:03:22] [INFO ] Flatten gal took : 14 ms
[2021-05-11 20:03:22] [INFO ] Time to serialize gal into /tmp/CTLFireability17530562568270910602.gal : 3 ms
[2021-05-11 20:03:22] [INFO ] Time to serialize properties into /tmp/CTLFireability12099016038205581481.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/CTLFireability17530562568270910602.gal, -t, CGAL, -ctl, /tmp/CTLFireability12099016038205581481.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/CTLFireability17530562568270910602.gal -t CGAL -ctl /tmp/CTLFireability12099016038205581481.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,6.61356e+08,1.00669,40404,2,15697,5,94447,6,0,1174,104375,0


Converting to forward existential form...Done !
original formula: (!(EF((((((p185==1)&&(p385==1))&&(p566==1))||(p37==1))||(p90==1)))) * !(E(((((((AF(E(((((((((p292==1)||(p454==1))||(p33==1))||(((p567==1)&&(p570==1))&&(p573==1)))||(p342==1))||(p529==1))||(p504==1))||(p283==1)) U ((((((((((p7==1)||(p102==1))||(p509==1))||(((p137==1)&&(p404==1))&&(p558==1)))||(p58==1))||(p105==1))||(p506==1))||(p443==1))||(p63==1))||(p392==1)))) + (p276==1)) + (p428==1)) + (p26==1)) + (p459==1)) + (((p176==1)&&(p385==1))&&(p531==1))) + (p392==1)) U !(E(((((((((((p162==0)&&(((p169==0)||(p390==0))||(p569==0)))&&(((p169==0)||(p390==0))||(p587==0)))&&((p576==0)||(p579==0)))&&(p165==0))&&(p322==0))&&(p252==0))&&((p582==0)||(p585==0)))&&(p254==0))&&(((p197==0)||(p390==0))||(p578==0))) U (((((((((((p96==0)&&(p115==0))&&(p311==0))&&(((p218==0)||(p325==0))||(p550==0)))&&(((p179==0)||(p390==0))||(p587==0)))&&(p268==0))&&(p348==0))&&(p142==0))&&(p516==0))&&(p30==0))||(((p17==0)&&(p287==0))&&(((p188==0)||(p390==0))||(p578==0)))))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (((((p185==1)&&(p385==1))&&(p566==1))||(p37==1))||(p90==1)))] = FALSE * [(FwdU(Init,((((((!(EG(!(E(((((((((p292==1)||(p454==1))||(p33==1))||(((p567==1)&&(p570==1))&&(p573==1)))||(p342==1))||(p529==1))||(p504==1))||(p283==1)) U ((((((((((p7==1)||(p102==1))||(p509==1))||(((p137==1)&&(p404==1))&&(p558==1)))||(p58==1))||(p105==1))||(p506==1))||(p443==1))||(p63==1))||(p392==1)))))) + (p276==1)) + (p428==1)) + (p26==1)) + (p459==1)) + (((p176==1)&&(p385==1))&&(p531==1))) + (p392==1))) * !(E(((((((((((p162==0)&&(((p169==0)||(p390==0))||(p569==0)))&&(((p169==0)||(p390==0))||(p587==0)))&&((p576==0)||(p579==0)))&&(p165==0))&&(p322==0))&&(p252==0))&&((p582==0)||(p585==0)))&&(p254==0))&&(((p197==0)||(p390==0))||(p578==0))) U (((((((((((p96==0)&&(p115==0))&&(p311==0))&&(((p218==0)||(p325==0))||(p550==0)))&&(((p179==0)||(p390==0))||(p587==0)))&&(p268==0))&&(p348==0))&&(p142==0))&&(p516==0))&&(p30==0))||(((p17==0)&&(p287==0))&&(((p188==0)||(p390==0))||(p578==0)))))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t19, t20, t23, t24, t29, t30, t33, t34, t36, t40, t48, t50, t51, t52, t54, t57, t109, t114, t116, t117, t118, t119, t120, t121, t122, t123, t124, t125, t126, t138, t139, t140, t142, t145, t147, t152, t163, t167, t168, t170, t186, t193, t194, t195, t196, t201, t202, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/123/51/210
Detected timeout of ITS tools.
[2021-05-11 20:03:53] [INFO ] Flatten gal took : 26 ms
[2021-05-11 20:03:53] [INFO ] Applying decomposition
[2021-05-11 20:03:53] [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/graph8911931245373185969.txt, -o, /tmp/graph8911931245373185969.bin, -w, /tmp/graph8911931245373185969.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/graph8911931245373185969.bin, -l, -1, -v, -w, /tmp/graph8911931245373185969.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 20:03:53] [INFO ] Decomposing Gal with order
[2021-05-11 20:03:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 20:03:53] [INFO ] Removed a total of 196 redundant transitions.
[2021-05-11 20:03:53] [INFO ] Flatten gal took : 29 ms
[2021-05-11 20:03:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 11 ms.
[2021-05-11 20:03:53] [INFO ] Time to serialize gal into /tmp/CTLFireability16878760229604937862.gal : 10 ms
[2021-05-11 20:03:53] [INFO ] Time to serialize properties into /tmp/CTLFireability8547336528190551432.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/CTLFireability16878760229604937862.gal, -t, CGAL, -ctl, /tmp/CTLFireability8547336528190551432.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/CTLFireability16878760229604937862.gal -t CGAL -ctl /tmp/CTLFireability8547336528190551432.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,6.61356e+08,0.296115,13084,1563,353,16315,1702,938,25029,182,3149,0


Converting to forward existential form...Done !
original formula: (!(EF((((((i1.u26.p185==1)&&(i10.i1.u51.p385==1))&&(i10.i2.u69.p566==1))||(i0.u5.p37==1))||(i4.u12.p90==1)))) * !(E(((((((AF(E(((((((((i2.i1.u36.p292==1)||(i8.i1.u59.p454==1))||(i2.i0.u4.p33==1))||(((i10.i2.u70.p567==1)&&(i10.i2.u71.p570==1))&&(i1.u53.p573==1)))||(i8.i0.u46.p342==1))||(i10.i1.u67.p529==1))||(i5.i0.u63.p504==1))||(i3.i2.u34.p283==1)) U ((((((((((i7.u0.p7==1)||(i9.i1.u13.p102==1))||(i8.i1.u64.p509==1))||(((i6.i1.u18.p137==1)&&(i6.i1.u55.p404==1))&&(i8.i1.u59.p558==1)))||(i3.i0.u8.p58==1))||(i5.i1.u14.p105==1))||(i8.i1.u59.p506==1))||(i2.i0.u60.p443==1))||(i6.i2.u9.p63==1))||(i1.u53.p392==1)))) + (i2.i1.u33.p276==1)) + (i8.i1.u59.p428==1)) + (i0.u2.p26==1)) + (i8.i1.u61.p459==1)) + (((i10.i0.u25.p176==1)&&(i10.i1.u51.p385==1))&&(i10.i1.u24.p531==1))) + (i1.u53.p392==1)) U !(E(((((((((((i1.u22.p162==0)&&(((i10.i1.u24.p169==0)||(i10.i0.u52.p390==0))||(i10.i2.u69.p569==0)))&&(((i10.i1.u24.p169==0)||(i10.i0.u52.p390==0))||(i10.i0.u66.p587==0)))&&((i10.i1.u73.p576==0)||(i10.i0.u74.p579==0)))&&(i1.u22.p165==0))&&(i3.i2.u41.p322==0))&&(i9.i0.u31.p252==0))&&((i10.i1.u75.p582==0)||(i1.u53.p585==0)))&&(i5.i1.u50.p254==0))&&(((i10.i0.u23.p197==0)||(i10.i0.u52.p390==0))||(i10.i0.u72.p578==0))) U (((((((((((i4.u12.p96==0)&&(i9.i0.u15.p115==0))&&(i0.u38.p311==0))&&(((i7.u30.p218==0)||(i3.i2.u41.p325==0))||(i7.u68.p550==0)))&&(((i10.i0.u25.p179==0)||(i10.i0.u52.p390==0))||(i10.i0.u66.p587==0)))&&(i2.i1.u32.p268==0))&&(i5.i0.u47.p348==0))&&(i6.i1.u19.p142==0))&&(i6.i0.u65.p516==0))&&(i2.i0.u3.p30==0))||(((i5.i0.u1.p17==0)&&(i2.i0.u35.p287==0))&&(((i1.u26.p188==0)||(i10.i0.u52.p390==0))||(i10.i0.u72.p578==0)))))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (((((i1.u26.p185==1)&&(i10.i1.u51.p385==1))&&(i10.i2.u69.p566==1))||(i0.u5.p37==1))||(i4.u12.p90==1)))] = FALSE * [(FwdU(Init,((((((!(EG(!(E(((((((((i2.i1.u36.p292==1)||(i8.i1.u59.p454==1))||(i2.i0.u4.p33==1))||(((i10.i2.u70.p567==1)&&(i10.i2.u71.p570==1))&&(i1.u53.p573==1)))||(i8.i0.u46.p342==1))||(i10.i1.u67.p529==1))||(i5.i0.u63.p504==1))||(i3.i2.u34.p283==1)) U ((((((((((i7.u0.p7==1)||(i9.i1.u13.p102==1))||(i8.i1.u64.p509==1))||(((i6.i1.u18.p137==1)&&(i6.i1.u55.p404==1))&&(i8.i1.u59.p558==1)))||(i3.i0.u8.p58==1))||(i5.i1.u14.p105==1))||(i8.i1.u59.p506==1))||(i2.i0.u60.p443==1))||(i6.i2.u9.p63==1))||(i1.u53.p392==1)))))) + (i2.i1.u33.p276==1)) + (i8.i1.u59.p428==1)) + (i0.u2.p26==1)) + (i8.i1.u61.p459==1)) + (((i10.i0.u25.p176==1)&&(i10.i1.u51.p385==1))&&(i10.i1.u24.p531==1))) + (i1.u53.p392==1))) * !(E(((((((((((i1.u22.p162==0)&&(((i10.i1.u24.p169==0)||(i10.i0.u52.p390==0))||(i10.i2.u69.p569==0)))&&(((i10.i1.u24.p169==0)||(i10.i0.u52.p390==0))||(i10.i0.u66.p587==0)))&&((i10.i1.u73.p576==0)||(i10.i0.u74.p579==0)))&&(i1.u22.p165==0))&&(i3.i2.u41.p322==0))&&(i9.i0.u31.p252==0))&&((i10.i1.u75.p582==0)||(i1.u53.p585==0)))&&(i5.i1.u50.p254==0))&&(((i10.i0.u23.p197==0)||(i10.i0.u52.p390==0))||(i10.i0.u72.p578==0))) U (((((((((((i4.u12.p96==0)&&(i9.i0.u15.p115==0))&&(i0.u38.p311==0))&&(((i7.u30.p218==0)||(i3.i2.u41.p325==0))||(i7.u68.p550==0)))&&(((i10.i0.u25.p179==0)||(i10.i0.u52.p390==0))||(i10.i0.u66.p587==0)))&&(i2.i1.u32.p268==0))&&(i5.i0.u47.p348==0))&&(i6.i1.u19.p142==0))&&(i6.i0.u65.p516==0))&&(i2.i0.u3.p30==0))||(((i5.i0.u1.p17==0)&&(i2.i0.u35.p287==0))&&(((i1.u26.p188==0)||(i10.i0.u52.p390==0))||(i10.i0.u72.p578==0)))))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t6, t52, t110, t124, t126, t139, t140, t142, t145, t147, t152, t163, t167, t168, t170, t186, t202, i0.t51, i0.u5.t54, i0.u38.t33, i1.u22.t40, i1.u22.t116, i1.u22.t125, i1.u53.t120, i2.i0.u3.t57, i2.i0.u35.t117, i2.i1.u32.t34, i2.i1.u36.t118, i3.i0.u8.t50, i3.i2.u34.t36, i3.i2.u41.t30, i4.u12.t193, i4.u12.t194, i4.u12.t195, i4.u12.t196, i5.i0.u47.t29, i5.i1.u14.t114, i6.i1.u18.t123, i6.i2.u9.t48, i7.u0.t121, i8.i0.u46.t119, i8.i1.t19, i8.i1.t23, i8.i1.u59.t20, i8.i1.u59.t24, i8.i1.u59.t138, i9.i0.t122, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :30/120/50/200
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 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
Fast SCC detection found an SCC at level 10
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 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
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,6.58909,200644,1,0,380366,5425,4800,741847,1161,13647,620430
FORMULA BusinessProcesses-PT-13-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Graph (trivial) has 311 edges and 558 vertex of which 7 / 558 are part of one of the 1 SCC in 19 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 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 551 transition count 387
Reduce places removed 111 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 112 rules applied. Total rules applied 224 place count 440 transition count 386
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 225 place count 439 transition count 386
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 225 place count 439 transition count 298
Deduced a syphon composed of 88 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 193 rules applied. Total rules applied 418 place count 334 transition count 298
Discarding 67 places :
Symmetric choice reduction at 3 with 67 rule applications. Total rules 485 place count 267 transition count 231
Iterating global reduction 3 with 67 rules applied. Total rules applied 552 place count 267 transition count 231
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 552 place count 267 transition count 223
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 570 place count 257 transition count 223
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 2 places
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 754 place count 164 transition count 132
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 758 place count 162 transition count 135
Applied a total of 758 rules in 100 ms. Remains 162 /558 variables (removed 396) and now considering 135/506 (removed 371) transitions.
[2021-05-11 20:03:59] [INFO ] Flatten gal took : 8 ms
[2021-05-11 20:03:59] [INFO ] Flatten gal took : 7 ms
[2021-05-11 20:03:59] [INFO ] Input system was already deterministic with 135 transitions.
[2021-05-11 20:04:00] [INFO ] Flatten gal took : 24 ms
[2021-05-11 20:04:00] [INFO ] Flatten gal took : 15 ms
[2021-05-11 20:04:00] [INFO ] Time to serialize gal into /tmp/CTLFireability5702686027141623575.gal : 2 ms
[2021-05-11 20:04:00] [INFO ] Time to serialize properties into /tmp/CTLFireability11327887903636124021.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/CTLFireability5702686027141623575.gal, -t, CGAL, -ctl, /tmp/CTLFireability11327887903636124021.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/CTLFireability5702686027141623575.gal -t CGAL -ctl /tmp/CTLFireability11327887903636124021.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,39295,0.378971,23444,2,7630,5,71787,6,0,782,45503,0


Converting to forward existential form...Done !
original formula: !(EF((((p356==1)||(p545==1))||(p505==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (((p356==1)||(p545==1))||(p505==1)))] = FALSE
(forward)formula 0,0,0.386158,23828,1,0,7,71787,8,1,791,45503,1
FORMULA BusinessProcesses-PT-13-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Reduce places removed 1 places and 1 transitions.
Drop transitions removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 557 transition count 431
Reduce places removed 74 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 82 rules applied. Total rules applied 156 place count 483 transition count 423
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 164 place count 475 transition count 423
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 164 place count 475 transition count 327
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 203 rules applied. Total rules applied 367 place count 368 transition count 327
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 424 place count 311 transition count 270
Iterating global reduction 3 with 57 rules applied. Total rules applied 481 place count 311 transition count 270
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 481 place count 311 transition count 265
Deduced a syphon composed of 5 places in 1 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 492 place count 305 transition count 265
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 646 place count 227 transition count 189
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 652 place count 227 transition count 189
Applied a total of 652 rules in 61 ms. Remains 227 /558 variables (removed 331) and now considering 189/506 (removed 317) transitions.
[2021-05-11 20:04:00] [INFO ] Flatten gal took : 12 ms
[2021-05-11 20:04:00] [INFO ] Flatten gal took : 11 ms
[2021-05-11 20:04:00] [INFO ] Input system was already deterministic with 189 transitions.
[2021-05-11 20:04:00] [INFO ] Flatten gal took : 23 ms
[2021-05-11 20:04:00] [INFO ] Flatten gal took : 9 ms
[2021-05-11 20:04:00] [INFO ] Time to serialize gal into /tmp/CTLFireability9748472860324174011.gal : 14 ms
[2021-05-11 20:04:00] [INFO ] Time to serialize properties into /tmp/CTLFireability7014906609229851865.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/CTLFireability9748472860324174011.gal, -t, CGAL, -ctl, /tmp/CTLFireability7014906609229851865.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/CTLFireability9748472860324174011.gal -t CGAL -ctl /tmp/CTLFireability7014906609229851865.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.51397e+07,0.738038,34152,2,18016,5,83650,6,0,1098,117990,0


Converting to forward existential form...Done !
original formula: EF((AF((((((((!(EF(((((((p520==1)||(p407==1))||(((p191==1)&&(p385==1))&&(p581==1)))||(p449==1))||(p8==1))||(p190==1)))) * (((p200==0)||(p395==0))||(p584==0))) * (p245==0)) * (p358==0)) * (p70==0)) * (p79==0)) * (p237==0)) * (p363==0))) * !(A(((((((E((((((((p453==1)||(p523==1))||(p500==1))||(((p194==1)&&(p395==1))&&(p584==1)))||(p526==1))||(p475==1))||(p489==1)) U ((((((p64==1)||(p226==1))||(((p73==1)&&(p359==1))&&(p558==1)))||(p543==1))||(p544==1))||(p250==1))) * EG(((((((p178==1)||(p555==1))||(p241==1))||(((p76==1)&&(p364==1))&&(p558==1)))||(p548==1))||(p427==1)))) + (((p92==1)&&(p354==1))&&(p558==1))) + (p498==1)) + (p529==1)) + (p312==1)) + (p78==1)) U (((((((p245==1)||(p2==1))||(p262==1))||(p51==1))||(p4==1))||(p164==1))||(p472==1))))))
=> equivalent forward existential formula: (([(((((((FwdU((FwdU(Init,TRUE) * !(EG(!((((((((!(E(TRUE U ((((((p520==1)||(p407==1))||(((p191==1)&&(p385==1))&&(p581==1)))||(p449==1))||(p8==1))||(p190==1)))) * (((p200==0)||(p395==0))||(p584==0))) * (p245==0)) * (p358==0)) * (p70==0)) * (p79==0)) * (p237==0)) * (p363==0)))))),!((((((((p245==1)||(p2==1))||(p262==1))||(p51==1))||(p4==1))||(p164==1))||(p472==1)))) * !((((((((p245==1)||(p2==1))||(p262==1))||(p51==1))||(p4==1))||(p164==1))||(p472==1)))) * !((p78==1))) * !((p312==1))) * !((p529==1))) * !((p498==1))) * !((((p92==1)&&(p354==1))&&(p558==1)))) * !(E((((((((p453==1)||(p523==1))||(p500==1))||(((p194==1)&&(p395==1))&&(p584==1)))||(p526==1))||(p475==1))||(p489==1)) U ((((((p64==1)||(p226==1))||(((p73==1)&&(p359==1))&&(p558==1)))||(p543==1))||(p544==1))||(p250==1)))))] != FALSE + [(((((((FwdU((FwdU(Init,TRUE) * !(EG(!((((((((!(E(TRUE U ((((((p520==1)||(p407==1))||(((p191==1)&&(p385==1))&&(p581==1)))||(p449==1))||(p8==1))||(p190==1)))) * (((p200==0)||(p395==0))||(p584==0))) * (p245==0)) * (p358==0)) * (p70==0)) * (p79==0)) * (p237==0)) * (p363==0)))))),!((((((((p245==1)||(p2==1))||(p262==1))||(p51==1))||(p4==1))||(p164==1))||(p472==1)))) * !((((((((p245==1)||(p2==1))||(p262==1))||(p51==1))||(p4==1))||(p164==1))||(p472==1)))) * !((p78==1))) * !((p312==1))) * !((p529==1))) * !((p498==1))) * !((((p92==1)&&(p354==1))&&(p558==1)))) * !(EG(((((((p178==1)||(p555==1))||(p241==1))||(((p76==1)&&(p364==1))&&(p558==1)))||(p548==1))||(p427==1)))))] != FALSE) + [FwdG((FwdU(Init,TRUE) * !(EG(!((((((((!(E(TRUE U ((((((p520==1)||(p407==1))||(((p191==1)&&(p385==1))&&(p581==1)))||(p449==1))||(p8==1))||(p190==1)))) * (((p200==0)||(p395==0))||(p584==0))) * (p245==0)) * (p358==0)) * (p70==0)) * (p79==0)) * (p237==0)) * (p363==0)))))),!((((((((p245==1)||(p2==1))||(p262==1))||(p51==1))||(p4==1))||(p164==1))||(p472==1))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t8, t10, t13, t17, t19, t21, t26, t28, t29, t32, t35, t37, t45, t47, t86, t87, t90, t95, t96, t97, t99, t100, t101, t102, t103, t104, t105, t106, t113, t114, t116, t117, t134, t135, t138, t151, t159, t162, t168, t178, t181, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/110/43/189
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 175/84/14
(forward)formula 0,1,27.8557,662184,1,0,488,3.46321e+06,401,252,8455,2.88929e+06,523
FORMULA BusinessProcesses-PT-13-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Reduce places removed 1 places and 1 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 557 transition count 421
Reduce places removed 84 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 88 rules applied. Total rules applied 172 place count 473 transition count 417
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 176 place count 469 transition count 417
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 109 Pre rules applied. Total rules applied 176 place count 469 transition count 308
Deduced a syphon composed of 109 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 235 rules applied. Total rules applied 411 place count 343 transition count 308
Discarding 66 places :
Symmetric choice reduction at 3 with 66 rule applications. Total rules 477 place count 277 transition count 242
Iterating global reduction 3 with 66 rules applied. Total rules applied 543 place count 277 transition count 242
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 543 place count 277 transition count 235
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 559 place count 268 transition count 235
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 2 places
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 743 place count 175 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 744 place count 175 transition count 143
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 746 place count 174 transition count 147
Applied a total of 746 rules in 52 ms. Remains 174 /558 variables (removed 384) and now considering 147/506 (removed 359) transitions.
[2021-05-11 20:04:28] [INFO ] Flatten gal took : 6 ms
[2021-05-11 20:04:28] [INFO ] Flatten gal took : 6 ms
[2021-05-11 20:04:28] [INFO ] Input system was already deterministic with 147 transitions.
[2021-05-11 20:04:28] [INFO ] Flatten gal took : 7 ms
[2021-05-11 20:04:28] [INFO ] Flatten gal took : 6 ms
[2021-05-11 20:04:28] [INFO ] Time to serialize gal into /tmp/CTLFireability12573370414912800393.gal : 8 ms
[2021-05-11 20:04:28] [INFO ] Time to serialize properties into /tmp/CTLFireability17448381561126292891.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/CTLFireability12573370414912800393.gal, -t, CGAL, -ctl, /tmp/CTLFireability17448381561126292891.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/CTLFireability12573370414912800393.gal -t CGAL -ctl /tmp/CTLFireability17448381561126292891.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,368384,0.495358,18856,2,6417,5,46787,6,0,843,50495,0


Converting to forward existential form...Done !
original formula: E(EG((((((((((p438==0)&&(p193==0))&&(p272==0))&&(p558==0))&&(p86==0))&&(p301==0))&&(p175==0))&&(p29==0))&&(p251==0))) U ((p574==1)||(p323==1)))
=> equivalent forward existential formula: [(FwdU(Init,EG((((((((((p438==0)&&(p193==0))&&(p272==0))&&(p558==0))&&(p86==0))&&(p301==0))&&(p175==0))&&(p29==0))&&(p251==0)))) * ((p574==1)||(p323==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t7, t28, t33, t35, t36, t37, t38, t39, t43, t44, t45, t46, t47, t84, t95, t100, t110, t122, t135, t136, t137, t138, t141, t142, t143, t144, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/83/28/147
(forward)formula 0,0,4.8945,163564,1,0,288,844564,285,132,6649,591591,347
FORMULA BusinessProcesses-PT-13-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2021-05-11 20:04:33] [INFO ] Flatten gal took : 34 ms
[2021-05-11 20:04:33] [INFO ] Flatten gal took : 23 ms
[2021-05-11 20:04:33] [INFO ] Applying decomposition
[2021-05-11 20:04:33] [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/graph4823301858480698127.txt, -o, /tmp/graph4823301858480698127.bin, -w, /tmp/graph4823301858480698127.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/graph4823301858480698127.bin, -l, -1, -v, -w, /tmp/graph4823301858480698127.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 20:04:33] [INFO ] Decomposing Gal with order
[2021-05-11 20:04:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 20:04:34] [INFO ] Removed a total of 267 redundant transitions.
[2021-05-11 20:04:34] [INFO ] Flatten gal took : 35 ms
[2021-05-11 20:04:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2021-05-11 20:04:34] [INFO ] Time to serialize gal into /tmp/CTLFireability1034232150227407746.gal : 8 ms
[2021-05-11 20:04:34] [INFO ] Time to serialize properties into /tmp/CTLFireability2918706161779416950.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/CTLFireability1034232150227407746.gal, -t, CGAL, -ctl, /tmp/CTLFireability2918706161779416950.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/CTLFireability1034232150227407746.gal -t CGAL -ctl /tmp/CTLFireability2918706161779416950.ctl
No direction supplied, using forward translation only.
Parsed 11 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,2.89268e+25,26.3069,568780,14972,80,765004,1187,1128,2.71328e+06,86,4042,0


Converting to forward existential form...Done !
original formula: EX(EF((AG((((((((i18.u163.p436==1)||(i12.u104.p272==1))||(i4.u30.p71==1))||(i0.u0.p243==1))||(((i15.u82.p209==1)&&(i10.u121.p319==1))&&(i18.u210.p558==1)))||(i7.u218.p580==1))||(i18.u165.p441==1))) * (((EG(AX(((i7.u75.p193==1)||(i16.i1.i0.u211.p561==1)))) + (i4.u42.p99==1)) + (i12.u24.p56==1)) + (i9.u132.p347==1)))))
=> equivalent forward existential formula: ((([FwdG((FwdU(EY(Init),TRUE) * !(E(TRUE U !((((((((i18.u163.p436==1)||(i12.u104.p272==1))||(i4.u30.p71==1))||(i0.u0.p243==1))||(((i15.u82.p209==1)&&(i10.u121.p319==1))&&(i18.u210.p558==1)))||(i7.u218.p580==1))||(i18.u165.p441==1)))))),!(EX(!(((i7.u75.p193==1)||(i16.i1.i0.u211.p561==1))))))] != FALSE + [((FwdU(EY(Init),TRUE) * !(E(TRUE U !((((((((i18.u163.p436==1)||(i12.u104.p272==1))||(i4.u30.p71==1))||(i0.u0.p243==1))||(((i15.u82.p209==1)&&(i10.u121.p319==1))&&(i18.u210.p558==1)))||(i7.u218.p580==1))||(i18.u165.p441==1)))))) * (i4.u42.p99==1))] != FALSE) + [((FwdU(EY(Init),TRUE) * !(E(TRUE U !((((((((i18.u163.p436==1)||(i12.u104.p272==1))||(i4.u30.p71==1))||(i0.u0.p243==1))||(((i15.u82.p209==1)&&(i10.u121.p319==1))&&(i18.u210.p558==1)))||(i7.u218.p580==1))||(i18.u165.p441==1)))))) * (i12.u24.p56==1))] != FALSE) + [((FwdU(EY(Init),TRUE) * !(E(TRUE U !((((((((i18.u163.p436==1)||(i12.u104.p272==1))||(i4.u30.p71==1))||(i0.u0.p243==1))||(((i15.u82.p209==1)&&(i10.u121.p319==1))&&(i18.u210.p558==1)))||(i7.u218.p580==1))||(i18.u165.p441==1)))))) * (i9.u132.p347==1))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t7, t29, t244, t364, t370, i0.u159.t123, i0.u86.t247, i0.u90.t238, i0.u88.t241, i1.t222, i1.t190, i1.u58.t291, i1.u110.t223, i1.u127.t191, i2.u56.t295, i2.u80.t259, i2.u60.t287, i3.t170, i3.u50.t307, i3.u52.t303, i3.u54.t299, i3.u137.t171, i4.t166, i4.u30.t345, i4.u42.t321, i4.u44.t317, i4.u139.t167, i5.t375, i5.t363, i5.t358, i5.t89, i5.u16.t373, i5.u22.t361, i5.u17.t371, i5.u23.t359, i5.u171.t93, i6.t339, i6.t335, i6.t333, i6.t331, i6.t329, i6.t326, i6.t324, i7.t277, i7.t266, i7.t263, i7.t151, i7.t147, i7.t143, i7.t4, i7.t3, i7.u62.t270, i7.u62.t283, i7.u63.t264, i7.u147.t148, i7.u146.t152, i7.u150.t144, i8.t349, i8.t139, i8.t135, i8.t131, i8.t127, i8.u27.t351, i8.u151.t140, i8.u153.t136, i8.u156.t132, i8.u158.t128, i9.t186, i9.t182, i9.t178, i9.t174, i9.u128.t187, i9.u131.t183, i9.u133.t179, i9.u135.t175, i10.t206, i10.t202, i10.t198, i10.t194, i10.u118.t207, i10.u121.t203, i10.u123.t199, i10.u125.t195, i11.t367, i11.t218, i11.t214, i11.t210, i11.u18.t369, i11.u112.t219, i11.u114.t215, i11.u117.t211, i12.t357, i12.t230, i12.u25.t355, i12.u107.t231, i13.t380, i13.t226, i13.u13.t378, i13.u108.t227, i14.t101, i14.u168.t98, i15.t248, i15.u82.t255, i15.u84.t251, i16.i0.i1.t155, i16.i0.i1.u144.t156, i16.i1.i0.u46.t313, i16.i1.i1.u140.t162, i16.i1.i2.t159, i16.i1.i2.u142.t160, i17.u160.t63, i17.u160.t73, i17.u160.t78, i17.u160.t79, i17.u160.t99, i17.u160.t112, i17.u160.t118, i18.t108, i18.t106, i18.t104, i18.t96, i18.t91, i18.t87, i18.t84, i18.t82, i18.t77, i18.t75, i18.t71, i18.t61, i18.t58, i18.t55, i18.t52, i18.t49, i18.t24, i18.t21, i18.t18, i18.t15, i18.u210.t12, i18.u210.t33, i18.u210.t37, i18.u210.t41, i18.u210.t68, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/327/142/505
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,0,103.652,1501712,1,0,2.1198e+06,1187,8769,5.58148e+06,436,4042,4712663
FORMULA BusinessProcesses-PT-13-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
Detected timeout of ITS tools.
[2021-05-11 20:25:30] [INFO ] Applying decomposition
[2021-05-11 20:25:30] [INFO ] Flatten gal took : 34 ms
[2021-05-11 20:25:30] [INFO ] Decomposing Gal with order
[2021-05-11 20:25:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 20:25:30] [INFO ] Removed a total of 118 redundant transitions.
[2021-05-11 20:25:30] [INFO ] Flatten gal took : 52 ms
[2021-05-11 20:25:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 57 ms.
[2021-05-11 20:25:30] [INFO ] Time to serialize gal into /tmp/CTLFireability16347861542265532313.gal : 20 ms
[2021-05-11 20:25:30] [INFO ] Time to serialize properties into /tmp/CTLFireability261467710871762738.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/CTLFireability16347861542265532313.gal, -t, CGAL, -ctl, /tmp/CTLFireability261467710871762738.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/CTLFireability16347861542265532313.gal -t CGAL -ctl /tmp/CTLFireability261467710871762738.ctl
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
Detected timeout of ITS tools.
[2021-05-11 20:46:28] [INFO ] Flatten gal took : 344 ms
[2021-05-11 20:46:30] [INFO ] Input system was already deterministic with 506 transitions.
[2021-05-11 20:46:30] [INFO ] Transformed 558 places.
[2021-05-11 20:46:30] [INFO ] Transformed 506 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:47:00] [INFO ] Time to serialize gal into /tmp/CTLFireability9503068691778567279.gal : 8 ms
[2021-05-11 20:47:00] [INFO ] Time to serialize properties into /tmp/CTLFireability10729639900135521560.ctl : 17 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/CTLFireability9503068691778567279.gal, -t, CGAL, -ctl, /tmp/CTLFireability10729639900135521560.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/CTLFireability9503068691778567279.gal -t CGAL -ctl /tmp/CTLFireability10729639900135521560.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 10 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-13"
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-13, 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-162038143900418"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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