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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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.7K 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 189K 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-19-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-19-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620765837275

Running Version 0
[2021-05-11 20:43:58] [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:43:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 20:43:58] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2021-05-11 20:43:58] [INFO ] Transformed 772 places.
[2021-05-11 20:43:58] [INFO ] Transformed 685 transitions.
[2021-05-11 20:43:58] [INFO ] Found NUPN structural information;
[2021-05-11 20:43:58] [INFO ] Parsed PT model containing 772 places and 685 transitions in 119 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Deduced a syphon composed of 15 places in 18 ms
Reduce places removed 15 places and 15 transitions.
Support contains 492 out of 757 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 757/757 places, 670/670 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 749 transition count 670
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 41 place count 716 transition count 637
Iterating global reduction 1 with 33 rules applied. Total rules applied 74 place count 716 transition count 637
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 77 place count 713 transition count 634
Iterating global reduction 1 with 3 rules applied. Total rules applied 80 place count 713 transition count 634
Applied a total of 80 rules in 76 ms. Remains 713 /757 variables (removed 44) and now considering 634/670 (removed 36) transitions.
// Phase 1: matrix 634 rows 713 cols
[2021-05-11 20:43:59] [INFO ] Computed 117 place invariants in 48 ms
[2021-05-11 20:43:59] [INFO ] Implicit Places using invariants in 350 ms returned []
// Phase 1: matrix 634 rows 713 cols
[2021-05-11 20:43:59] [INFO ] Computed 117 place invariants in 24 ms
[2021-05-11 20:43:59] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
// Phase 1: matrix 634 rows 713 cols
[2021-05-11 20:43:59] [INFO ] Computed 117 place invariants in 27 ms
[2021-05-11 20:44:00] [INFO ] Dead Transitions using invariants and state equation in 423 ms returned []
Finished structural reductions, in 1 iterations. Remains : 713/757 places, 634/670 transitions.
[2021-05-11 20:44:00] [INFO ] Flatten gal took : 77 ms
[2021-05-11 20:44:00] [INFO ] Flatten gal took : 39 ms
[2021-05-11 20:44:00] [INFO ] Input system was already deterministic with 634 transitions.
Incomplete random walk after 100000 steps, including 551 resets, run finished after 508 ms. (steps per millisecond=196 ) properties (out of 77) seen :67
Running SMT prover for 10 properties.
// Phase 1: matrix 634 rows 713 cols
[2021-05-11 20:44:01] [INFO ] Computed 117 place invariants in 14 ms
[2021-05-11 20:44:01] [INFO ] [Real]Absence check using 70 positive place invariants in 28 ms returned sat
[2021-05-11 20:44:01] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 18 ms returned sat
[2021-05-11 20:44:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:01] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2021-05-11 20:44:02] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 4 ms to minimize.
[2021-05-11 20:44:02] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 2 ms to minimize.
[2021-05-11 20:44:02] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 1 ms to minimize.
[2021-05-11 20:44:02] [INFO ] Deduced a trap composed of 146 places in 141 ms of which 1 ms to minimize.
[2021-05-11 20:44:02] [INFO ] Deduced a trap composed of 147 places in 138 ms of which 1 ms to minimize.
[2021-05-11 20:44:02] [INFO ] Deduced a trap composed of 151 places in 136 ms of which 1 ms to minimize.
[2021-05-11 20:44:03] [INFO ] Deduced a trap composed of 31 places in 175 ms of which 1 ms to minimize.
[2021-05-11 20:44:03] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 1 ms to minimize.
[2021-05-11 20:44:03] [INFO ] Deduced a trap composed of 158 places in 134 ms of which 0 ms to minimize.
[2021-05-11 20:44:03] [INFO ] Deduced a trap composed of 152 places in 151 ms of which 1 ms to minimize.
[2021-05-11 20:44:03] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 1 ms to minimize.
[2021-05-11 20:44:04] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 0 ms to minimize.
[2021-05-11 20:44:04] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 0 ms to minimize.
[2021-05-11 20:44:04] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 0 ms to minimize.
[2021-05-11 20:44:04] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2482 ms
[2021-05-11 20:44:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:44:04] [INFO ] [Nat]Absence check using 70 positive place invariants in 29 ms returned sat
[2021-05-11 20:44:04] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 16 ms returned sat
[2021-05-11 20:44:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:04] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2021-05-11 20:44:05] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 0 ms to minimize.
[2021-05-11 20:44:05] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 1 ms to minimize.
[2021-05-11 20:44:05] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 0 ms to minimize.
[2021-05-11 20:44:05] [INFO ] Deduced a trap composed of 149 places in 179 ms of which 1 ms to minimize.
[2021-05-11 20:44:05] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 1 ms to minimize.
[2021-05-11 20:44:06] [INFO ] Deduced a trap composed of 156 places in 189 ms of which 0 ms to minimize.
[2021-05-11 20:44:06] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 1 ms to minimize.
[2021-05-11 20:44:06] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 1 ms to minimize.
[2021-05-11 20:44:06] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 0 ms to minimize.
[2021-05-11 20:44:06] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 0 ms to minimize.
[2021-05-11 20:44:06] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2021-05-11 20:44:06] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2020 ms
[2021-05-11 20:44:06] [INFO ] Computed and/alt/rep : 592/941/592 causal constraints (skipped 41 transitions) in 45 ms.
[2021-05-11 20:44:10] [INFO ] Added : 389 causal constraints over 79 iterations in 3477 ms. Result :sat
[2021-05-11 20:44:10] [INFO ] [Real]Absence check using 70 positive place invariants in 24 ms returned sat
[2021-05-11 20:44:10] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 14 ms returned sat
[2021-05-11 20:44:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:10] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2021-05-11 20:44:10] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 1 ms to minimize.
[2021-05-11 20:44:11] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 0 ms to minimize.
[2021-05-11 20:44:11] [INFO ] Deduced a trap composed of 56 places in 181 ms of which 1 ms to minimize.
[2021-05-11 20:44:11] [INFO ] Deduced a trap composed of 160 places in 235 ms of which 1 ms to minimize.
[2021-05-11 20:44:11] [INFO ] Deduced a trap composed of 154 places in 204 ms of which 1 ms to minimize.
[2021-05-11 20:44:12] [INFO ] Deduced a trap composed of 153 places in 194 ms of which 1 ms to minimize.
[2021-05-11 20:44:12] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 1 ms to minimize.
[2021-05-11 20:44:12] [INFO ] Deduced a trap composed of 168 places in 188 ms of which 1 ms to minimize.
[2021-05-11 20:44:12] [INFO ] Deduced a trap composed of 166 places in 166 ms of which 2 ms to minimize.
[2021-05-11 20:44:13] [INFO ] Deduced a trap composed of 151 places in 198 ms of which 0 ms to minimize.
[2021-05-11 20:44:13] [INFO ] Deduced a trap composed of 163 places in 166 ms of which 1 ms to minimize.
[2021-05-11 20:44:13] [INFO ] Deduced a trap composed of 150 places in 176 ms of which 0 ms to minimize.
[2021-05-11 20:44:13] [INFO ] Deduced a trap composed of 148 places in 172 ms of which 1 ms to minimize.
[2021-05-11 20:44:13] [INFO ] Deduced a trap composed of 151 places in 167 ms of which 0 ms to minimize.
[2021-05-11 20:44:14] [INFO ] Deduced a trap composed of 177 places in 175 ms of which 0 ms to minimize.
[2021-05-11 20:44:14] [INFO ] Deduced a trap composed of 147 places in 185 ms of which 1 ms to minimize.
[2021-05-11 20:44:14] [INFO ] Deduced a trap composed of 166 places in 169 ms of which 1 ms to minimize.
[2021-05-11 20:44:14] [INFO ] Deduced a trap composed of 155 places in 202 ms of which 1 ms to minimize.
[2021-05-11 20:44:14] [INFO ] Deduced a trap composed of 152 places in 191 ms of which 1 ms to minimize.
[2021-05-11 20:44:15] [INFO ] Deduced a trap composed of 174 places in 174 ms of which 0 ms to minimize.
[2021-05-11 20:44:15] [INFO ] Deduced a trap composed of 168 places in 185 ms of which 0 ms to minimize.
[2021-05-11 20:44:15] [INFO ] Deduced a trap composed of 165 places in 163 ms of which 1 ms to minimize.
[2021-05-11 20:44:15] [INFO ] Deduced a trap composed of 162 places in 183 ms of which 1 ms to minimize.
[2021-05-11 20:44:15] [INFO ] Deduced a trap composed of 154 places in 198 ms of which 1 ms to minimize.
[2021-05-11 20:44:16] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 0 ms to minimize.
[2021-05-11 20:44:16] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 1 ms to minimize.
[2021-05-11 20:44:16] [INFO ] Deduced a trap composed of 171 places in 175 ms of which 1 ms to minimize.
[2021-05-11 20:44:16] [INFO ] Deduced a trap composed of 156 places in 188 ms of which 1 ms to minimize.
[2021-05-11 20:44:16] [INFO ] Deduced a trap composed of 174 places in 166 ms of which 1 ms to minimize.
[2021-05-11 20:44:17] [INFO ] Deduced a trap composed of 172 places in 173 ms of which 1 ms to minimize.
[2021-05-11 20:44:17] [INFO ] Deduced a trap composed of 150 places in 187 ms of which 0 ms to minimize.
[2021-05-11 20:44:17] [INFO ] Deduced a trap composed of 160 places in 188 ms of which 2 ms to minimize.
[2021-05-11 20:44:17] [INFO ] Deduced a trap composed of 151 places in 162 ms of which 0 ms to minimize.
[2021-05-11 20:44:18] [INFO ] Deduced a trap composed of 174 places in 175 ms of which 0 ms to minimize.
[2021-05-11 20:44:18] [INFO ] Deduced a trap composed of 159 places in 181 ms of which 1 ms to minimize.
[2021-05-11 20:44:18] [INFO ] Deduced a trap composed of 164 places in 175 ms of which 0 ms to minimize.
[2021-05-11 20:44:18] [INFO ] Deduced a trap composed of 165 places in 198 ms of which 0 ms to minimize.
[2021-05-11 20:44:18] [INFO ] Deduced a trap composed of 158 places in 225 ms of which 0 ms to minimize.
[2021-05-11 20:44:19] [INFO ] Deduced a trap composed of 167 places in 197 ms of which 1 ms to minimize.
[2021-05-11 20:44:19] [INFO ] Deduced a trap composed of 157 places in 181 ms of which 0 ms to minimize.
[2021-05-11 20:44:19] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 3 ms to minimize.
[2021-05-11 20:44:19] [INFO ] Deduced a trap composed of 159 places in 174 ms of which 0 ms to minimize.
[2021-05-11 20:44:20] [INFO ] Deduced a trap composed of 173 places in 178 ms of which 3 ms to minimize.
[2021-05-11 20:44:20] [INFO ] Deduced a trap composed of 156 places in 196 ms of which 11 ms to minimize.
[2021-05-11 20:44:20] [INFO ] Deduced a trap composed of 166 places in 191 ms of which 2 ms to minimize.
[2021-05-11 20:44:20] [INFO ] Deduced a trap composed of 164 places in 184 ms of which 1 ms to minimize.
[2021-05-11 20:44:20] [INFO ] Deduced a trap composed of 171 places in 166 ms of which 0 ms to minimize.
[2021-05-11 20:44:21] [INFO ] Deduced a trap composed of 166 places in 173 ms of which 0 ms to minimize.
[2021-05-11 20:44:21] [INFO ] Deduced a trap composed of 163 places in 173 ms of which 1 ms to minimize.
[2021-05-11 20:44:21] [INFO ] Deduced a trap composed of 155 places in 150 ms of which 1 ms to minimize.
[2021-05-11 20:44:21] [INFO ] Deduced a trap composed of 161 places in 183 ms of which 1 ms to minimize.
[2021-05-11 20:44:21] [INFO ] Deduced a trap composed of 166 places in 161 ms of which 1 ms to minimize.
[2021-05-11 20:44:22] [INFO ] Deduced a trap composed of 174 places in 177 ms of which 0 ms to minimize.
[2021-05-11 20:44:22] [INFO ] Deduced a trap composed of 171 places in 173 ms of which 1 ms to minimize.
[2021-05-11 20:44:22] [INFO ] Deduced a trap composed of 168 places in 153 ms of which 1 ms to minimize.
[2021-05-11 20:44:22] [INFO ] Deduced a trap composed of 164 places in 150 ms of which 1 ms to minimize.
[2021-05-11 20:44:22] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 0 ms to minimize.
[2021-05-11 20:44:23] [INFO ] Deduced a trap composed of 161 places in 205 ms of which 1 ms to minimize.
[2021-05-11 20:44:23] [INFO ] Deduced a trap composed of 159 places in 158 ms of which 1 ms to minimize.
[2021-05-11 20:44:23] [INFO ] Deduced a trap composed of 176 places in 175 ms of which 1 ms to minimize.
[2021-05-11 20:44:23] [INFO ] Deduced a trap composed of 163 places in 166 ms of which 1 ms to minimize.
[2021-05-11 20:44:24] [INFO ] Deduced a trap composed of 162 places in 169 ms of which 0 ms to minimize.
[2021-05-11 20:44:24] [INFO ] Deduced a trap composed of 165 places in 176 ms of which 1 ms to minimize.
[2021-05-11 20:44:24] [INFO ] Deduced a trap composed of 160 places in 161 ms of which 0 ms to minimize.
[2021-05-11 20:44:24] [INFO ] Deduced a trap composed of 158 places in 180 ms of which 1 ms to minimize.
[2021-05-11 20:44:24] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 1 ms to minimize.
[2021-05-11 20:44:25] [INFO ] Deduced a trap composed of 157 places in 194 ms of which 1 ms to minimize.
[2021-05-11 20:44:25] [INFO ] Deduced a trap composed of 165 places in 176 ms of which 1 ms to minimize.
[2021-05-11 20:44:25] [INFO ] Deduced a trap composed of 166 places in 215 ms of which 1 ms to minimize.
[2021-05-11 20:44:25] [INFO ] Deduced a trap composed of 168 places in 193 ms of which 1 ms to minimize.
[2021-05-11 20:44:26] [INFO ] Deduced a trap composed of 153 places in 212 ms of which 1 ms to minimize.
[2021-05-11 20:44:26] [INFO ] Deduced a trap composed of 155 places in 182 ms of which 1 ms to minimize.
[2021-05-11 20:44:26] [INFO ] Deduced a trap composed of 175 places in 167 ms of which 1 ms to minimize.
[2021-05-11 20:44:26] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 0 ms to minimize.
[2021-05-11 20:44:27] [INFO ] Deduced a trap composed of 155 places in 195 ms of which 1 ms to minimize.
[2021-05-11 20:44:27] [INFO ] Deduced a trap composed of 154 places in 177 ms of which 1 ms to minimize.
[2021-05-11 20:44:27] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 1 ms to minimize.
[2021-05-11 20:44:27] [INFO ] Deduced a trap composed of 41 places in 195 ms of which 1 ms to minimize.
[2021-05-11 20:44:27] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 1 ms to minimize.
[2021-05-11 20:44:28] [INFO ] Deduced a trap composed of 152 places in 195 ms of which 1 ms to minimize.
[2021-05-11 20:44:28] [INFO ] Deduced a trap composed of 58 places in 212 ms of which 0 ms to minimize.
[2021-05-11 20:44:28] [INFO ] Deduced a trap composed of 168 places in 194 ms of which 1 ms to minimize.
[2021-05-11 20:44:28] [INFO ] Deduced a trap composed of 156 places in 187 ms of which 0 ms to minimize.
[2021-05-11 20:44:29] [INFO ] Deduced a trap composed of 45 places in 172 ms of which 0 ms to minimize.
[2021-05-11 20:44:29] [INFO ] Deduced a trap composed of 187 places in 173 ms of which 1 ms to minimize.
[2021-05-11 20:44:29] [INFO ] Deduced a trap composed of 158 places in 170 ms of which 0 ms to minimize.
[2021-05-11 20:44:29] [INFO ] Deduced a trap composed of 180 places in 186 ms of which 1 ms to minimize.
[2021-05-11 20:44:29] [INFO ] Deduced a trap composed of 166 places in 190 ms of which 0 ms to minimize.
[2021-05-11 20:44:30] [INFO ] Deduced a trap composed of 152 places in 186 ms of which 0 ms to minimize.
[2021-05-11 20:44:30] [INFO ] Deduced a trap composed of 155 places in 155 ms of which 0 ms to minimize.
[2021-05-11 20:44:30] [INFO ] Deduced a trap composed of 8 places in 270 ms of which 1 ms to minimize.
[2021-05-11 20:44:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2021-05-11 20:44:30] [INFO ] [Real]Absence check using 70 positive place invariants in 27 ms returned sat
[2021-05-11 20:44:30] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 17 ms returned sat
[2021-05-11 20:44:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:31] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2021-05-11 20:44:31] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 1 ms to minimize.
[2021-05-11 20:44:31] [INFO ] Deduced a trap composed of 149 places in 141 ms of which 1 ms to minimize.
[2021-05-11 20:44:31] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2021-05-11 20:44:31] [INFO ] Deduced a trap composed of 181 places in 203 ms of which 1 ms to minimize.
[2021-05-11 20:44:31] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 0 ms to minimize.
[2021-05-11 20:44:32] [INFO ] Deduced a trap composed of 34 places in 191 ms of which 1 ms to minimize.
[2021-05-11 20:44:32] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 0 ms to minimize.
[2021-05-11 20:44:32] [INFO ] Deduced a trap composed of 148 places in 188 ms of which 1 ms to minimize.
[2021-05-11 20:44:32] [INFO ] Deduced a trap composed of 166 places in 191 ms of which 1 ms to minimize.
[2021-05-11 20:44:33] [INFO ] Deduced a trap composed of 53 places in 166 ms of which 1 ms to minimize.
[2021-05-11 20:44:33] [INFO ] Deduced a trap composed of 147 places in 170 ms of which 1 ms to minimize.
[2021-05-11 20:44:33] [INFO ] Deduced a trap composed of 152 places in 190 ms of which 0 ms to minimize.
[2021-05-11 20:44:33] [INFO ] Deduced a trap composed of 157 places in 171 ms of which 1 ms to minimize.
[2021-05-11 20:44:33] [INFO ] Deduced a trap composed of 178 places in 190 ms of which 1 ms to minimize.
[2021-05-11 20:44:34] [INFO ] Deduced a trap composed of 153 places in 167 ms of which 1 ms to minimize.
[2021-05-11 20:44:34] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 1 ms to minimize.
[2021-05-11 20:44:34] [INFO ] Deduced a trap composed of 150 places in 164 ms of which 0 ms to minimize.
[2021-05-11 20:44:34] [INFO ] Deduced a trap composed of 189 places in 177 ms of which 0 ms to minimize.
[2021-05-11 20:44:34] [INFO ] Deduced a trap composed of 163 places in 193 ms of which 1 ms to minimize.
[2021-05-11 20:44:35] [INFO ] Deduced a trap composed of 167 places in 194 ms of which 1 ms to minimize.
[2021-05-11 20:44:35] [INFO ] Deduced a trap composed of 162 places in 163 ms of which 1 ms to minimize.
[2021-05-11 20:44:35] [INFO ] Deduced a trap composed of 169 places in 162 ms of which 0 ms to minimize.
[2021-05-11 20:44:35] [INFO ] Deduced a trap composed of 178 places in 188 ms of which 1 ms to minimize.
[2021-05-11 20:44:35] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 1 ms to minimize.
[2021-05-11 20:44:36] [INFO ] Deduced a trap composed of 153 places in 189 ms of which 0 ms to minimize.
[2021-05-11 20:44:36] [INFO ] Deduced a trap composed of 152 places in 184 ms of which 0 ms to minimize.
[2021-05-11 20:44:36] [INFO ] Deduced a trap composed of 152 places in 183 ms of which 0 ms to minimize.
[2021-05-11 20:44:36] [INFO ] Deduced a trap composed of 151 places in 166 ms of which 1 ms to minimize.
[2021-05-11 20:44:36] [INFO ] Deduced a trap composed of 149 places in 185 ms of which 1 ms to minimize.
[2021-05-11 20:44:37] [INFO ] Deduced a trap composed of 158 places in 186 ms of which 1 ms to minimize.
[2021-05-11 20:44:37] [INFO ] Deduced a trap composed of 151 places in 158 ms of which 1 ms to minimize.
[2021-05-11 20:44:37] [INFO ] Deduced a trap composed of 150 places in 165 ms of which 1 ms to minimize.
[2021-05-11 20:44:37] [INFO ] Deduced a trap composed of 159 places in 162 ms of which 0 ms to minimize.
[2021-05-11 20:44:37] [INFO ] Deduced a trap composed of 155 places in 193 ms of which 1 ms to minimize.
[2021-05-11 20:44:38] [INFO ] Deduced a trap composed of 159 places in 165 ms of which 1 ms to minimize.
[2021-05-11 20:44:38] [INFO ] Deduced a trap composed of 159 places in 156 ms of which 1 ms to minimize.
[2021-05-11 20:44:38] [INFO ] Deduced a trap composed of 147 places in 186 ms of which 1 ms to minimize.
[2021-05-11 20:44:38] [INFO ] Deduced a trap composed of 148 places in 158 ms of which 1 ms to minimize.
[2021-05-11 20:44:38] [INFO ] Deduced a trap composed of 148 places in 181 ms of which 1 ms to minimize.
[2021-05-11 20:44:39] [INFO ] Deduced a trap composed of 149 places in 197 ms of which 0 ms to minimize.
[2021-05-11 20:44:39] [INFO ] Deduced a trap composed of 158 places in 212 ms of which 0 ms to minimize.
[2021-05-11 20:44:39] [INFO ] Deduced a trap composed of 163 places in 181 ms of which 1 ms to minimize.
[2021-05-11 20:44:39] [INFO ] Deduced a trap composed of 162 places in 184 ms of which 1 ms to minimize.
[2021-05-11 20:44:40] [INFO ] Deduced a trap composed of 157 places in 183 ms of which 1 ms to minimize.
[2021-05-11 20:44:40] [INFO ] Deduced a trap composed of 161 places in 162 ms of which 1 ms to minimize.
[2021-05-11 20:44:40] [INFO ] Deduced a trap composed of 160 places in 183 ms of which 1 ms to minimize.
[2021-05-11 20:44:40] [INFO ] Deduced a trap composed of 157 places in 184 ms of which 0 ms to minimize.
[2021-05-11 20:44:40] [INFO ] Deduced a trap composed of 152 places in 183 ms of which 1 ms to minimize.
[2021-05-11 20:44:41] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 1 ms to minimize.
[2021-05-11 20:44:41] [INFO ] Deduced a trap composed of 153 places in 187 ms of which 1 ms to minimize.
[2021-05-11 20:44:41] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 1 ms to minimize.
[2021-05-11 20:44:41] [INFO ] Deduced a trap composed of 156 places in 180 ms of which 1 ms to minimize.
[2021-05-11 20:44:41] [INFO ] Deduced a trap composed of 165 places in 184 ms of which 0 ms to minimize.
[2021-05-11 20:44:42] [INFO ] Deduced a trap composed of 159 places in 154 ms of which 0 ms to minimize.
[2021-05-11 20:44:42] [INFO ] Deduced a trap composed of 165 places in 165 ms of which 1 ms to minimize.
[2021-05-11 20:44:42] [INFO ] Deduced a trap composed of 155 places in 185 ms of which 1 ms to minimize.
[2021-05-11 20:44:42] [INFO ] Deduced a trap composed of 157 places in 185 ms of which 1 ms to minimize.
[2021-05-11 20:44:42] [INFO ] Deduced a trap composed of 169 places in 174 ms of which 1 ms to minimize.
[2021-05-11 20:44:43] [INFO ] Deduced a trap composed of 176 places in 186 ms of which 0 ms to minimize.
[2021-05-11 20:44:43] [INFO ] Deduced a trap composed of 158 places in 188 ms of which 1 ms to minimize.
[2021-05-11 20:44:43] [INFO ] Deduced a trap composed of 159 places in 184 ms of which 1 ms to minimize.
[2021-05-11 20:44:43] [INFO ] Deduced a trap composed of 159 places in 189 ms of which 1 ms to minimize.
[2021-05-11 20:44:44] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 1 ms to minimize.
[2021-05-11 20:44:44] [INFO ] Deduced a trap composed of 156 places in 155 ms of which 1 ms to minimize.
[2021-05-11 20:44:44] [INFO ] Deduced a trap composed of 161 places in 143 ms of which 0 ms to minimize.
[2021-05-11 20:44:44] [INFO ] Deduced a trap composed of 162 places in 146 ms of which 1 ms to minimize.
[2021-05-11 20:44:44] [INFO ] Deduced a trap composed of 156 places in 151 ms of which 0 ms to minimize.
[2021-05-11 20:44:44] [INFO ] Deduced a trap composed of 152 places in 150 ms of which 1 ms to minimize.
[2021-05-11 20:44:45] [INFO ] Deduced a trap composed of 148 places in 124 ms of which 0 ms to minimize.
[2021-05-11 20:44:45] [INFO ] Deduced a trap composed of 173 places in 130 ms of which 0 ms to minimize.
[2021-05-11 20:44:45] [INFO ] Trap strengthening (SAT) tested/added 71/70 trap constraints in 14285 ms
[2021-05-11 20:44:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:44:45] [INFO ] [Nat]Absence check using 70 positive place invariants in 48 ms returned sat
[2021-05-11 20:44:45] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 19 ms returned sat
[2021-05-11 20:44:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:45] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2021-05-11 20:44:45] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 1 ms to minimize.
[2021-05-11 20:44:46] [INFO ] Deduced a trap composed of 149 places in 196 ms of which 1 ms to minimize.
[2021-05-11 20:44:46] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2021-05-11 20:44:46] [INFO ] Deduced a trap composed of 181 places in 195 ms of which 1 ms to minimize.
[2021-05-11 20:44:46] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 1 ms to minimize.
[2021-05-11 20:44:46] [INFO ] Deduced a trap composed of 34 places in 195 ms of which 0 ms to minimize.
[2021-05-11 20:44:47] [INFO ] Deduced a trap composed of 45 places in 188 ms of which 0 ms to minimize.
[2021-05-11 20:44:47] [INFO ] Deduced a trap composed of 148 places in 168 ms of which 0 ms to minimize.
[2021-05-11 20:44:47] [INFO ] Deduced a trap composed of 166 places in 115 ms of which 1 ms to minimize.
[2021-05-11 20:44:47] [INFO ] Deduced a trap composed of 152 places in 191 ms of which 1 ms to minimize.
[2021-05-11 20:44:47] [INFO ] Deduced a trap composed of 148 places in 187 ms of which 1 ms to minimize.
[2021-05-11 20:44:48] [INFO ] Deduced a trap composed of 38 places in 207 ms of which 2 ms to minimize.
[2021-05-11 20:44:48] [INFO ] Deduced a trap composed of 155 places in 197 ms of which 0 ms to minimize.
[2021-05-11 20:44:48] [INFO ] Deduced a trap composed of 151 places in 190 ms of which 0 ms to minimize.
[2021-05-11 20:44:48] [INFO ] Deduced a trap composed of 149 places in 192 ms of which 1 ms to minimize.
[2021-05-11 20:44:49] [INFO ] Deduced a trap composed of 170 places in 194 ms of which 0 ms to minimize.
[2021-05-11 20:44:49] [INFO ] Deduced a trap composed of 43 places in 161 ms of which 1 ms to minimize.
[2021-05-11 20:44:49] [INFO ] Deduced a trap composed of 169 places in 207 ms of which 1 ms to minimize.
[2021-05-11 20:44:49] [INFO ] Deduced a trap composed of 155 places in 194 ms of which 0 ms to minimize.
[2021-05-11 20:44:49] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2021-05-11 20:44:49] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3976 ms
[2021-05-11 20:44:49] [INFO ] Computed and/alt/rep : 592/941/592 causal constraints (skipped 41 transitions) in 41 ms.
[2021-05-11 20:44:52] [INFO ] Added : 394 causal constraints over 79 iterations in 3133 ms. Result :sat
[2021-05-11 20:44:53] [INFO ] [Real]Absence check using 70 positive place invariants in 31 ms returned sat
[2021-05-11 20:44:53] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 19 ms returned sat
[2021-05-11 20:44:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:53] [INFO ] [Real]Absence check using state equation in 625 ms returned sat
[2021-05-11 20:44:53] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 1 ms to minimize.
[2021-05-11 20:44:54] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 1 ms to minimize.
[2021-05-11 20:44:54] [INFO ] Deduced a trap composed of 176 places in 229 ms of which 1 ms to minimize.
[2021-05-11 20:44:54] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 1 ms to minimize.
[2021-05-11 20:44:54] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 0 ms to minimize.
[2021-05-11 20:44:54] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 0 ms to minimize.
[2021-05-11 20:44:55] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 0 ms to minimize.
[2021-05-11 20:44:55] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 0 ms to minimize.
[2021-05-11 20:44:55] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2021-05-11 20:44:55] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2021-05-11 20:44:55] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 0 ms to minimize.
[2021-05-11 20:44:55] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 0 ms to minimize.
[2021-05-11 20:44:55] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 0 ms to minimize.
[2021-05-11 20:44:56] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 0 ms to minimize.
[2021-05-11 20:44:56] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2435 ms
[2021-05-11 20:44:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:44:56] [INFO ] [Nat]Absence check using 70 positive place invariants in 32 ms returned sat
[2021-05-11 20:44:56] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 20 ms returned sat
[2021-05-11 20:44:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:56] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2021-05-11 20:44:56] [INFO ] Deduced a trap composed of 16 places in 246 ms of which 1 ms to minimize.
[2021-05-11 20:44:57] [INFO ] Deduced a trap composed of 19 places in 258 ms of which 1 ms to minimize.
[2021-05-11 20:44:57] [INFO ] Deduced a trap composed of 8 places in 217 ms of which 1 ms to minimize.
[2021-05-11 20:44:58] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 0 ms to minimize.
[2021-05-11 20:44:58] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 0 ms to minimize.
[2021-05-11 20:44:58] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 1 ms to minimize.
[2021-05-11 20:44:58] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 1 ms to minimize.
[2021-05-11 20:44:58] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 0 ms to minimize.
[2021-05-11 20:44:58] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 0 ms to minimize.
[2021-05-11 20:44:58] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2021-05-11 20:44:58] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 1 ms to minimize.
[2021-05-11 20:44:59] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2367 ms
[2021-05-11 20:44:59] [INFO ] Computed and/alt/rep : 592/941/592 causal constraints (skipped 41 transitions) in 30 ms.
[2021-05-11 20:45:01] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2021-05-11 20:45:01] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 0 ms to minimize.
[2021-05-11 20:45:01] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2021-05-11 20:45:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 331 ms
[2021-05-11 20:45:01] [INFO ] Added : 310 causal constraints over 63 iterations in 2703 ms. Result :sat
[2021-05-11 20:45:01] [INFO ] [Real]Absence check using 70 positive place invariants in 30 ms returned sat
[2021-05-11 20:45:01] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 18 ms returned sat
[2021-05-11 20:45:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:45:02] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2021-05-11 20:45:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:45:02] [INFO ] [Nat]Absence check using 70 positive place invariants in 22 ms returned sat
[2021-05-11 20:45:02] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 14 ms returned sat
[2021-05-11 20:45:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:45:02] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2021-05-11 20:45:02] [INFO ] Deduced a trap composed of 188 places in 130 ms of which 0 ms to minimize.
[2021-05-11 20:45:02] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 1 ms to minimize.
[2021-05-11 20:45:03] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 1 ms to minimize.
[2021-05-11 20:45:03] [INFO ] Deduced a trap composed of 50 places in 143 ms of which 0 ms to minimize.
[2021-05-11 20:45:03] [INFO ] Deduced a trap composed of 33 places in 190 ms of which 0 ms to minimize.
[2021-05-11 20:45:03] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 1 ms to minimize.
[2021-05-11 20:45:03] [INFO ] Deduced a trap composed of 175 places in 172 ms of which 1 ms to minimize.
[2021-05-11 20:45:04] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 1 ms to minimize.
[2021-05-11 20:45:04] [INFO ] Deduced a trap composed of 46 places in 170 ms of which 1 ms to minimize.
[2021-05-11 20:45:04] [INFO ] Deduced a trap composed of 178 places in 193 ms of which 1 ms to minimize.
[2021-05-11 20:45:04] [INFO ] Deduced a trap composed of 151 places in 165 ms of which 1 ms to minimize.
[2021-05-11 20:45:04] [INFO ] Deduced a trap composed of 181 places in 153 ms of which 1 ms to minimize.
[2021-05-11 20:45:05] [INFO ] Deduced a trap composed of 157 places in 146 ms of which 0 ms to minimize.
[2021-05-11 20:45:05] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 1 ms to minimize.
[2021-05-11 20:45:05] [INFO ] Deduced a trap composed of 156 places in 145 ms of which 1 ms to minimize.
[2021-05-11 20:45:05] [INFO ] Deduced a trap composed of 158 places in 185 ms of which 1 ms to minimize.
[2021-05-11 20:45:05] [INFO ] Deduced a trap composed of 162 places in 168 ms of which 0 ms to minimize.
[2021-05-11 20:45:05] [INFO ] Deduced a trap composed of 161 places in 141 ms of which 1 ms to minimize.
[2021-05-11 20:45:06] [INFO ] Deduced a trap composed of 156 places in 183 ms of which 0 ms to minimize.
[2021-05-11 20:45:06] [INFO ] Deduced a trap composed of 185 places in 123 ms of which 0 ms to minimize.
[2021-05-11 20:45:06] [INFO ] Deduced a trap composed of 162 places in 170 ms of which 2 ms to minimize.
[2021-05-11 20:45:06] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 12 ms to minimize.
[2021-05-11 20:45:06] [INFO ] Deduced a trap composed of 184 places in 159 ms of which 0 ms to minimize.
[2021-05-11 20:45:07] [INFO ] Deduced a trap composed of 161 places in 305 ms of which 2 ms to minimize.
[2021-05-11 20:45:07] [INFO ] Deduced a trap composed of 178 places in 272 ms of which 1 ms to minimize.
[2021-05-11 20:45:07] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2021-05-11 20:45:08] [INFO ] Deduced a trap composed of 50 places in 208 ms of which 1 ms to minimize.
[2021-05-11 20:45:08] [INFO ] Deduced a trap composed of 159 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:45:08] [INFO ] Deduced a trap composed of 185 places in 156 ms of which 0 ms to minimize.
[2021-05-11 20:45:08] [INFO ] Deduced a trap composed of 178 places in 160 ms of which 1 ms to minimize.
[2021-05-11 20:45:08] [INFO ] Deduced a trap composed of 161 places in 163 ms of which 1 ms to minimize.
[2021-05-11 20:45:08] [INFO ] Deduced a trap composed of 163 places in 142 ms of which 1 ms to minimize.
[2021-05-11 20:45:09] [INFO ] Deduced a trap composed of 153 places in 161 ms of which 1 ms to minimize.
[2021-05-11 20:45:09] [INFO ] Deduced a trap composed of 150 places in 154 ms of which 0 ms to minimize.
[2021-05-11 20:45:09] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 0 ms to minimize.
[2021-05-11 20:45:09] [INFO ] Deduced a trap composed of 153 places in 149 ms of which 0 ms to minimize.
[2021-05-11 20:45:09] [INFO ] Deduced a trap composed of 157 places in 142 ms of which 1 ms to minimize.
[2021-05-11 20:45:10] [INFO ] Deduced a trap composed of 156 places in 146 ms of which 1 ms to minimize.
[2021-05-11 20:45:10] [INFO ] Deduced a trap composed of 158 places in 156 ms of which 0 ms to minimize.
[2021-05-11 20:45:10] [INFO ] Deduced a trap composed of 167 places in 158 ms of which 1 ms to minimize.
[2021-05-11 20:45:10] [INFO ] Deduced a trap composed of 175 places in 157 ms of which 0 ms to minimize.
[2021-05-11 20:45:10] [INFO ] Deduced a trap composed of 170 places in 141 ms of which 1 ms to minimize.
[2021-05-11 20:45:11] [INFO ] Deduced a trap composed of 176 places in 168 ms of which 0 ms to minimize.
[2021-05-11 20:45:11] [INFO ] Deduced a trap composed of 158 places in 160 ms of which 1 ms to minimize.
[2021-05-11 20:45:11] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 1 ms to minimize.
[2021-05-11 20:45:11] [INFO ] Deduced a trap composed of 162 places in 154 ms of which 0 ms to minimize.
[2021-05-11 20:45:11] [INFO ] Deduced a trap composed of 163 places in 155 ms of which 1 ms to minimize.
[2021-05-11 20:45:12] [INFO ] Deduced a trap composed of 154 places in 149 ms of which 1 ms to minimize.
[2021-05-11 20:45:12] [INFO ] Deduced a trap composed of 163 places in 155 ms of which 1 ms to minimize.
[2021-05-11 20:45:12] [INFO ] Deduced a trap composed of 164 places in 183 ms of which 1 ms to minimize.
[2021-05-11 20:45:12] [INFO ] Deduced a trap composed of 153 places in 177 ms of which 1 ms to minimize.
[2021-05-11 20:45:12] [INFO ] Deduced a trap composed of 153 places in 188 ms of which 0 ms to minimize.
[2021-05-11 20:45:13] [INFO ] Deduced a trap composed of 156 places in 176 ms of which 1 ms to minimize.
[2021-05-11 20:45:13] [INFO ] Deduced a trap composed of 175 places in 154 ms of which 1 ms to minimize.
[2021-05-11 20:45:13] [INFO ] Deduced a trap composed of 153 places in 151 ms of which 1 ms to minimize.
[2021-05-11 20:45:13] [INFO ] Deduced a trap composed of 170 places in 156 ms of which 0 ms to minimize.
[2021-05-11 20:45:13] [INFO ] Deduced a trap composed of 170 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:45:14] [INFO ] Deduced a trap composed of 183 places in 159 ms of which 0 ms to minimize.
[2021-05-11 20:45:14] [INFO ] Deduced a trap composed of 172 places in 155 ms of which 1 ms to minimize.
[2021-05-11 20:45:14] [INFO ] Deduced a trap composed of 158 places in 158 ms of which 1 ms to minimize.
[2021-05-11 20:45:14] [INFO ] Deduced a trap composed of 169 places in 196 ms of which 1 ms to minimize.
[2021-05-11 20:45:15] [INFO ] Deduced a trap composed of 165 places in 173 ms of which 0 ms to minimize.
[2021-05-11 20:45:15] [INFO ] Deduced a trap composed of 167 places in 161 ms of which 0 ms to minimize.
[2021-05-11 20:45:15] [INFO ] Deduced a trap composed of 162 places in 175 ms of which 1 ms to minimize.
[2021-05-11 20:45:15] [INFO ] Deduced a trap composed of 168 places in 150 ms of which 0 ms to minimize.
[2021-05-11 20:45:16] [INFO ] Deduced a trap composed of 156 places in 148 ms of which 1 ms to minimize.
[2021-05-11 20:45:16] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 0 ms to minimize.
[2021-05-11 20:45:16] [INFO ] Deduced a trap composed of 158 places in 185 ms of which 1 ms to minimize.
[2021-05-11 20:45:16] [INFO ] Deduced a trap composed of 160 places in 185 ms of which 0 ms to minimize.
[2021-05-11 20:45:16] [INFO ] Deduced a trap composed of 156 places in 190 ms of which 1 ms to minimize.
[2021-05-11 20:45:17] [INFO ] Deduced a trap composed of 162 places in 159 ms of which 0 ms to minimize.
[2021-05-11 20:45:17] [INFO ] Deduced a trap composed of 155 places in 150 ms of which 0 ms to minimize.
[2021-05-11 20:45:17] [INFO ] Deduced a trap composed of 159 places in 175 ms of which 1 ms to minimize.
[2021-05-11 20:45:17] [INFO ] Deduced a trap composed of 170 places in 146 ms of which 0 ms to minimize.
[2021-05-11 20:45:17] [INFO ] Deduced a trap composed of 174 places in 136 ms of which 0 ms to minimize.
[2021-05-11 20:45:18] [INFO ] Deduced a trap composed of 153 places in 193 ms of which 1 ms to minimize.
[2021-05-11 20:45:18] [INFO ] Deduced a trap composed of 173 places in 190 ms of which 1 ms to minimize.
[2021-05-11 20:45:18] [INFO ] Deduced a trap composed of 176 places in 146 ms of which 1 ms to minimize.
[2021-05-11 20:45:18] [INFO ] Deduced a trap composed of 151 places in 180 ms of which 0 ms to minimize.
[2021-05-11 20:45:19] [INFO ] Deduced a trap composed of 156 places in 169 ms of which 1 ms to minimize.
[2021-05-11 20:45:19] [INFO ] Deduced a trap composed of 151 places in 165 ms of which 0 ms to minimize.
[2021-05-11 20:45:19] [INFO ] Deduced a trap composed of 154 places in 152 ms of which 0 ms to minimize.
[2021-05-11 20:45:19] [INFO ] Deduced a trap composed of 149 places in 168 ms of which 0 ms to minimize.
[2021-05-11 20:45:20] [INFO ] Deduced a trap composed of 150 places in 162 ms of which 1 ms to minimize.
[2021-05-11 20:45:20] [INFO ] Deduced a trap composed of 164 places in 173 ms of which 1 ms to minimize.
[2021-05-11 20:45:20] [INFO ] Deduced a trap composed of 164 places in 159 ms of which 0 ms to minimize.
[2021-05-11 20:45:20] [INFO ] Deduced a trap composed of 165 places in 139 ms of which 0 ms to minimize.
[2021-05-11 20:45:20] [INFO ] Deduced a trap composed of 163 places in 180 ms of which 1 ms to minimize.
[2021-05-11 20:45:21] [INFO ] Deduced a trap composed of 158 places in 152 ms of which 0 ms to minimize.
[2021-05-11 20:45:21] [INFO ] Deduced a trap composed of 168 places in 163 ms of which 0 ms to minimize.
[2021-05-11 20:45:21] [INFO ] Deduced a trap composed of 166 places in 177 ms of which 0 ms to minimize.
[2021-05-11 20:45:21] [INFO ] Deduced a trap composed of 168 places in 160 ms of which 1 ms to minimize.
[2021-05-11 20:45:22] [INFO ] Deduced a trap composed of 167 places in 180 ms of which 0 ms to minimize.
[2021-05-11 20:45:22] [INFO ] Deduced a trap composed of 169 places in 240 ms of which 0 ms to minimize.
[2021-05-11 20:45:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2021-05-11 20:45:22] [INFO ] [Real]Absence check using 70 positive place invariants in 27 ms returned sat
[2021-05-11 20:45:22] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 20 ms returned sat
[2021-05-11 20:45:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:45:23] [INFO ] [Real]Absence check using state equation in 936 ms returned sat
[2021-05-11 20:45:23] [INFO ] Deduced a trap composed of 18 places in 254 ms of which 1 ms to minimize.
[2021-05-11 20:45:24] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 1 ms to minimize.
[2021-05-11 20:45:24] [INFO ] Deduced a trap composed of 16 places in 216 ms of which 1 ms to minimize.
[2021-05-11 20:45:24] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 1 ms to minimize.
[2021-05-11 20:45:24] [INFO ] Deduced a trap composed of 20 places in 233 ms of which 1 ms to minimize.
[2021-05-11 20:45:25] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 1 ms to minimize.
[2021-05-11 20:45:25] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 0 ms to minimize.
[2021-05-11 20:45:25] [INFO ] Deduced a trap composed of 159 places in 149 ms of which 0 ms to minimize.
[2021-05-11 20:45:25] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 1 ms to minimize.
[2021-05-11 20:45:25] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 0 ms to minimize.
[2021-05-11 20:45:26] [INFO ] Deduced a trap composed of 173 places in 139 ms of which 1 ms to minimize.
[2021-05-11 20:45:26] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 1 ms to minimize.
[2021-05-11 20:45:26] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 0 ms to minimize.
[2021-05-11 20:45:26] [INFO ] Deduced a trap composed of 152 places in 122 ms of which 0 ms to minimize.
[2021-05-11 20:45:26] [INFO ] Deduced a trap composed of 143 places in 125 ms of which 1 ms to minimize.
[2021-05-11 20:45:26] [INFO ] Deduced a trap composed of 152 places in 116 ms of which 0 ms to minimize.
[2021-05-11 20:45:26] [INFO ] Deduced a trap composed of 54 places in 151 ms of which 0 ms to minimize.
[2021-05-11 20:45:27] [INFO ] Deduced a trap composed of 146 places in 119 ms of which 0 ms to minimize.
[2021-05-11 20:45:27] [INFO ] Deduced a trap composed of 147 places in 116 ms of which 0 ms to minimize.
[2021-05-11 20:45:27] [INFO ] Deduced a trap composed of 148 places in 115 ms of which 0 ms to minimize.
[2021-05-11 20:45:27] [INFO ] Deduced a trap composed of 152 places in 120 ms of which 0 ms to minimize.
[2021-05-11 20:45:27] [INFO ] Deduced a trap composed of 150 places in 120 ms of which 1 ms to minimize.
[2021-05-11 20:45:27] [INFO ] Deduced a trap composed of 157 places in 116 ms of which 0 ms to minimize.
[2021-05-11 20:45:28] [INFO ] Deduced a trap composed of 155 places in 118 ms of which 0 ms to minimize.
[2021-05-11 20:45:28] [INFO ] Deduced a trap composed of 151 places in 117 ms of which 0 ms to minimize.
[2021-05-11 20:45:28] [INFO ] Deduced a trap composed of 152 places in 116 ms of which 1 ms to minimize.
[2021-05-11 20:45:28] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 0 ms to minimize.
[2021-05-11 20:45:28] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 4784 ms
[2021-05-11 20:45:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:45:28] [INFO ] [Nat]Absence check using 70 positive place invariants in 18 ms returned sat
[2021-05-11 20:45:28] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 13 ms returned sat
[2021-05-11 20:45:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:45:29] [INFO ] [Nat]Absence check using state equation in 833 ms returned sat
[2021-05-11 20:45:29] [INFO ] Deduced a trap composed of 14 places in 207 ms of which 1 ms to minimize.
[2021-05-11 20:45:29] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 0 ms to minimize.
[2021-05-11 20:45:30] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 0 ms to minimize.
[2021-05-11 20:45:30] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 1 ms to minimize.
[2021-05-11 20:45:30] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 1 ms to minimize.
[2021-05-11 20:45:30] [INFO ] Deduced a trap composed of 157 places in 140 ms of which 1 ms to minimize.
[2021-05-11 20:45:30] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 1 ms to minimize.
[2021-05-11 20:45:30] [INFO ] Deduced a trap composed of 160 places in 182 ms of which 1 ms to minimize.
[2021-05-11 20:45:31] [INFO ] Deduced a trap composed of 157 places in 150 ms of which 1 ms to minimize.
[2021-05-11 20:45:31] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 0 ms to minimize.
[2021-05-11 20:45:31] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 1 ms to minimize.
[2021-05-11 20:45:31] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 1 ms to minimize.
[2021-05-11 20:45:31] [INFO ] Deduced a trap composed of 142 places in 138 ms of which 1 ms to minimize.
[2021-05-11 20:45:31] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 1 ms to minimize.
[2021-05-11 20:45:32] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:45:32] [INFO ] Deduced a trap composed of 156 places in 150 ms of which 0 ms to minimize.
[2021-05-11 20:45:32] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 0 ms to minimize.
[2021-05-11 20:45:32] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 0 ms to minimize.
[2021-05-11 20:45:32] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 1 ms to minimize.
[2021-05-11 20:45:32] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 0 ms to minimize.
[2021-05-11 20:45:33] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 1 ms to minimize.
[2021-05-11 20:45:33] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 0 ms to minimize.
[2021-05-11 20:45:33] [INFO ] Deduced a trap composed of 158 places in 143 ms of which 0 ms to minimize.
[2021-05-11 20:45:33] [INFO ] Deduced a trap composed of 147 places in 128 ms of which 1 ms to minimize.
[2021-05-11 20:45:33] [INFO ] Deduced a trap composed of 140 places in 147 ms of which 1 ms to minimize.
[2021-05-11 20:45:33] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 0 ms to minimize.
[2021-05-11 20:45:34] [INFO ] Deduced a trap composed of 144 places in 135 ms of which 1 ms to minimize.
[2021-05-11 20:45:34] [INFO ] Deduced a trap composed of 52 places in 144 ms of which 0 ms to minimize.
[2021-05-11 20:45:34] [INFO ] Deduced a trap composed of 148 places in 129 ms of which 1 ms to minimize.
[2021-05-11 20:45:34] [INFO ] Deduced a trap composed of 156 places in 139 ms of which 1 ms to minimize.
[2021-05-11 20:45:34] [INFO ] Deduced a trap composed of 151 places in 139 ms of which 1 ms to minimize.
[2021-05-11 20:45:34] [INFO ] Deduced a trap composed of 64 places in 120 ms of which 1 ms to minimize.
[2021-05-11 20:45:35] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 0 ms to minimize.
[2021-05-11 20:45:35] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 0 ms to minimize.
[2021-05-11 20:45:35] [INFO ] Deduced a trap composed of 153 places in 134 ms of which 1 ms to minimize.
[2021-05-11 20:45:35] [INFO ] Deduced a trap composed of 153 places in 132 ms of which 1 ms to minimize.
[2021-05-11 20:45:35] [INFO ] Deduced a trap composed of 151 places in 124 ms of which 0 ms to minimize.
[2021-05-11 20:45:35] [INFO ] Deduced a trap composed of 157 places in 132 ms of which 1 ms to minimize.
[2021-05-11 20:45:35] [INFO ] Deduced a trap composed of 160 places in 127 ms of which 0 ms to minimize.
[2021-05-11 20:45:36] [INFO ] Deduced a trap composed of 169 places in 120 ms of which 0 ms to minimize.
[2021-05-11 20:45:36] [INFO ] Deduced a trap composed of 147 places in 117 ms of which 0 ms to minimize.
[2021-05-11 20:45:36] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 1 ms to minimize.
[2021-05-11 20:45:36] [INFO ] Deduced a trap composed of 151 places in 125 ms of which 0 ms to minimize.
[2021-05-11 20:45:36] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 0 ms to minimize.
[2021-05-11 20:45:36] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 0 ms to minimize.
[2021-05-11 20:45:36] [INFO ] Deduced a trap composed of 153 places in 120 ms of which 1 ms to minimize.
[2021-05-11 20:45:37] [INFO ] Deduced a trap composed of 150 places in 111 ms of which 0 ms to minimize.
[2021-05-11 20:45:37] [INFO ] Deduced a trap composed of 156 places in 122 ms of which 0 ms to minimize.
[2021-05-11 20:45:37] [INFO ] Deduced a trap composed of 166 places in 119 ms of which 0 ms to minimize.
[2021-05-11 20:45:37] [INFO ] Deduced a trap composed of 151 places in 115 ms of which 1 ms to minimize.
[2021-05-11 20:45:37] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 0 ms to minimize.
[2021-05-11 20:45:37] [INFO ] Deduced a trap composed of 148 places in 108 ms of which 1 ms to minimize.
[2021-05-11 20:45:37] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 0 ms to minimize.
[2021-05-11 20:45:37] [INFO ] Deduced a trap composed of 155 places in 129 ms of which 0 ms to minimize.
[2021-05-11 20:45:38] [INFO ] Deduced a trap composed of 150 places in 120 ms of which 1 ms to minimize.
[2021-05-11 20:45:38] [INFO ] Deduced a trap composed of 154 places in 118 ms of which 1 ms to minimize.
[2021-05-11 20:45:38] [INFO ] Deduced a trap composed of 155 places in 116 ms of which 1 ms to minimize.
[2021-05-11 20:45:38] [INFO ] Deduced a trap composed of 148 places in 120 ms of which 0 ms to minimize.
[2021-05-11 20:45:38] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 1 ms to minimize.
[2021-05-11 20:45:38] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 0 ms to minimize.
[2021-05-11 20:45:38] [INFO ] Deduced a trap composed of 65 places in 117 ms of which 0 ms to minimize.
[2021-05-11 20:45:39] [INFO ] Deduced a trap composed of 43 places in 107 ms of which 1 ms to minimize.
[2021-05-11 20:45:39] [INFO ] Deduced a trap composed of 157 places in 134 ms of which 0 ms to minimize.
[2021-05-11 20:45:39] [INFO ] Deduced a trap composed of 149 places in 152 ms of which 0 ms to minimize.
[2021-05-11 20:45:39] [INFO ] Deduced a trap composed of 151 places in 120 ms of which 0 ms to minimize.
[2021-05-11 20:45:39] [INFO ] Deduced a trap composed of 154 places in 125 ms of which 0 ms to minimize.
[2021-05-11 20:45:39] [INFO ] Deduced a trap composed of 149 places in 127 ms of which 1 ms to minimize.
[2021-05-11 20:45:39] [INFO ] Deduced a trap composed of 145 places in 112 ms of which 1 ms to minimize.
[2021-05-11 20:45:40] [INFO ] Deduced a trap composed of 152 places in 135 ms of which 0 ms to minimize.
[2021-05-11 20:45:40] [INFO ] Deduced a trap composed of 156 places in 123 ms of which 1 ms to minimize.
[2021-05-11 20:45:40] [INFO ] Deduced a trap composed of 151 places in 125 ms of which 0 ms to minimize.
[2021-05-11 20:45:40] [INFO ] Deduced a trap composed of 54 places in 122 ms of which 0 ms to minimize.
[2021-05-11 20:45:40] [INFO ] Deduced a trap composed of 156 places in 106 ms of which 0 ms to minimize.
[2021-05-11 20:45:40] [INFO ] Deduced a trap composed of 153 places in 111 ms of which 1 ms to minimize.
[2021-05-11 20:45:40] [INFO ] Deduced a trap composed of 152 places in 121 ms of which 0 ms to minimize.
[2021-05-11 20:45:41] [INFO ] Deduced a trap composed of 152 places in 122 ms of which 1 ms to minimize.
[2021-05-11 20:45:41] [INFO ] Deduced a trap composed of 166 places in 122 ms of which 0 ms to minimize.
[2021-05-11 20:45:41] [INFO ] Deduced a trap composed of 168 places in 123 ms of which 0 ms to minimize.
[2021-05-11 20:45:41] [INFO ] Deduced a trap composed of 163 places in 132 ms of which 1 ms to minimize.
[2021-05-11 20:45:41] [INFO ] Deduced a trap composed of 155 places in 118 ms of which 0 ms to minimize.
[2021-05-11 20:45:41] [INFO ] Deduced a trap composed of 173 places in 142 ms of which 1 ms to minimize.
[2021-05-11 20:45:41] [INFO ] Deduced a trap composed of 167 places in 117 ms of which 1 ms to minimize.
[2021-05-11 20:45:42] [INFO ] Deduced a trap composed of 148 places in 139 ms of which 1 ms to minimize.
[2021-05-11 20:45:42] [INFO ] Deduced a trap composed of 147 places in 144 ms of which 13 ms to minimize.
[2021-05-11 20:45:42] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 0 ms to minimize.
[2021-05-11 20:45:42] [INFO ] Deduced a trap composed of 156 places in 150 ms of which 0 ms to minimize.
[2021-05-11 20:45:42] [INFO ] Deduced a trap composed of 159 places in 124 ms of which 0 ms to minimize.
[2021-05-11 20:45:43] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 1 ms to minimize.
[2021-05-11 20:45:43] [INFO ] Deduced a trap composed of 68 places in 161 ms of which 0 ms to minimize.
[2021-05-11 20:45:43] [INFO ] Deduced a trap composed of 147 places in 113 ms of which 1 ms to minimize.
[2021-05-11 20:45:43] [INFO ] Deduced a trap composed of 149 places in 133 ms of which 1 ms to minimize.
[2021-05-11 20:45:43] [INFO ] Deduced a trap composed of 47 places in 132 ms of which 1 ms to minimize.
[2021-05-11 20:45:43] [INFO ] Deduced a trap composed of 175 places in 129 ms of which 1 ms to minimize.
[2021-05-11 20:45:43] [INFO ] Deduced a trap composed of 164 places in 122 ms of which 1 ms to minimize.
[2021-05-11 20:45:44] [INFO ] Deduced a trap composed of 170 places in 109 ms of which 0 ms to minimize.
[2021-05-11 20:45:44] [INFO ] Deduced a trap composed of 152 places in 139 ms of which 0 ms to minimize.
[2021-05-11 20:45:44] [INFO ] Deduced a trap composed of 160 places in 114 ms of which 1 ms to minimize.
[2021-05-11 20:45:44] [INFO ] Deduced a trap composed of 165 places in 149 ms of which 0 ms to minimize.
[2021-05-11 20:45:44] [INFO ] Deduced a trap composed of 154 places in 131 ms of which 1 ms to minimize.
[2021-05-11 20:45:44] [INFO ] Deduced a trap composed of 166 places in 114 ms of which 1 ms to minimize.
[2021-05-11 20:45:44] [INFO ] Deduced a trap composed of 149 places in 118 ms of which 0 ms to minimize.
[2021-05-11 20:45:45] [INFO ] Deduced a trap composed of 167 places in 109 ms of which 1 ms to minimize.
[2021-05-11 20:45:45] [INFO ] Deduced a trap composed of 153 places in 123 ms of which 0 ms to minimize.
[2021-05-11 20:45:45] [INFO ] Deduced a trap composed of 151 places in 111 ms of which 0 ms to minimize.
[2021-05-11 20:45:45] [INFO ] Deduced a trap composed of 148 places in 113 ms of which 1 ms to minimize.
[2021-05-11 20:45:45] [INFO ] Deduced a trap composed of 151 places in 133 ms of which 1 ms to minimize.
[2021-05-11 20:45:45] [INFO ] Deduced a trap composed of 158 places in 133 ms of which 0 ms to minimize.
[2021-05-11 20:45:45] [INFO ] Deduced a trap composed of 155 places in 123 ms of which 1 ms to minimize.
[2021-05-11 20:45:46] [INFO ] Deduced a trap composed of 153 places in 173 ms of which 0 ms to minimize.
[2021-05-11 20:45:46] [INFO ] Deduced a trap composed of 192 places in 116 ms of which 1 ms to minimize.
[2021-05-11 20:45:46] [INFO ] Deduced a trap composed of 156 places in 164 ms of which 0 ms to minimize.
[2021-05-11 20:45:46] [INFO ] Deduced a trap composed of 148 places in 135 ms of which 1 ms to minimize.
[2021-05-11 20:45:46] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 1 ms to minimize.
[2021-05-11 20:45:47] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 1 ms to minimize.
[2021-05-11 20:45:47] [INFO ] Deduced a trap composed of 151 places in 134 ms of which 0 ms to minimize.
[2021-05-11 20:45:47] [INFO ] Deduced a trap composed of 151 places in 134 ms of which 1 ms to minimize.
[2021-05-11 20:45:47] [INFO ] Deduced a trap composed of 152 places in 162 ms of which 0 ms to minimize.
[2021-05-11 20:45:47] [INFO ] Deduced a trap composed of 150 places in 135 ms of which 1 ms to minimize.
[2021-05-11 20:45:47] [INFO ] Deduced a trap composed of 166 places in 122 ms of which 0 ms to minimize.
[2021-05-11 20:45:47] [INFO ] Deduced a trap composed of 155 places in 115 ms of which 0 ms to minimize.
[2021-05-11 20:45:48] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 0 ms to minimize.
[2021-05-11 20:45:48] [INFO ] Deduced a trap composed of 165 places in 117 ms of which 0 ms to minimize.
[2021-05-11 20:45:48] [INFO ] Deduced a trap composed of 152 places in 141 ms of which 0 ms to minimize.
[2021-05-11 20:45:48] [INFO ] Deduced a trap composed of 8 places in 250 ms of which 1 ms to minimize.
[2021-05-11 20:45:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2021-05-11 20:45:48] [INFO ] [Real]Absence check using 70 positive place invariants in 27 ms returned sat
[2021-05-11 20:45:48] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 20 ms returned sat
[2021-05-11 20:45:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:45:49] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2021-05-11 20:45:49] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 0 ms to minimize.
[2021-05-11 20:45:49] [INFO ] Deduced a trap composed of 169 places in 182 ms of which 1 ms to minimize.
[2021-05-11 20:45:49] [INFO ] Deduced a trap composed of 57 places in 152 ms of which 1 ms to minimize.
[2021-05-11 20:45:49] [INFO ] Deduced a trap composed of 54 places in 126 ms of which 1 ms to minimize.
[2021-05-11 20:45:50] [INFO ] Deduced a trap composed of 56 places in 168 ms of which 1 ms to minimize.
[2021-05-11 20:45:50] [INFO ] Deduced a trap composed of 161 places in 160 ms of which 0 ms to minimize.
[2021-05-11 20:45:50] [INFO ] Deduced a trap composed of 45 places in 205 ms of which 0 ms to minimize.
[2021-05-11 20:45:50] [INFO ] Deduced a trap composed of 166 places in 170 ms of which 1 ms to minimize.
[2021-05-11 20:45:50] [INFO ] Deduced a trap composed of 168 places in 170 ms of which 0 ms to minimize.
[2021-05-11 20:45:51] [INFO ] Deduced a trap composed of 170 places in 178 ms of which 0 ms to minimize.
[2021-05-11 20:45:51] [INFO ] Deduced a trap composed of 163 places in 141 ms of which 0 ms to minimize.
[2021-05-11 20:45:51] [INFO ] Deduced a trap composed of 171 places in 150 ms of which 1 ms to minimize.
[2021-05-11 20:45:51] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 0 ms to minimize.
[2021-05-11 20:45:51] [INFO ] Deduced a trap composed of 169 places in 183 ms of which 1 ms to minimize.
[2021-05-11 20:45:52] [INFO ] Deduced a trap composed of 160 places in 173 ms of which 1 ms to minimize.
[2021-05-11 20:45:52] [INFO ] Deduced a trap composed of 154 places in 172 ms of which 1 ms to minimize.
[2021-05-11 20:45:52] [INFO ] Deduced a trap composed of 153 places in 159 ms of which 1 ms to minimize.
[2021-05-11 20:45:52] [INFO ] Deduced a trap composed of 156 places in 139 ms of which 0 ms to minimize.
[2021-05-11 20:45:52] [INFO ] Deduced a trap composed of 166 places in 132 ms of which 0 ms to minimize.
[2021-05-11 20:45:53] [INFO ] Deduced a trap composed of 162 places in 138 ms of which 0 ms to minimize.
[2021-05-11 20:45:53] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 1 ms to minimize.
[2021-05-11 20:45:53] [INFO ] Deduced a trap composed of 159 places in 127 ms of which 0 ms to minimize.
[2021-05-11 20:45:53] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 1 ms to minimize.
[2021-05-11 20:45:53] [INFO ] Deduced a trap composed of 153 places in 111 ms of which 1 ms to minimize.
[2021-05-11 20:45:53] [INFO ] Deduced a trap composed of 148 places in 146 ms of which 1 ms to minimize.
[2021-05-11 20:45:54] [INFO ] Deduced a trap composed of 173 places in 178 ms of which 0 ms to minimize.
[2021-05-11 20:45:54] [INFO ] Deduced a trap composed of 160 places in 152 ms of which 0 ms to minimize.
[2021-05-11 20:45:54] [INFO ] Deduced a trap composed of 156 places in 150 ms of which 1 ms to minimize.
[2021-05-11 20:45:54] [INFO ] Deduced a trap composed of 169 places in 131 ms of which 1 ms to minimize.
[2021-05-11 20:45:54] [INFO ] Deduced a trap composed of 165 places in 127 ms of which 1 ms to minimize.
[2021-05-11 20:45:54] [INFO ] Deduced a trap composed of 162 places in 136 ms of which 0 ms to minimize.
[2021-05-11 20:45:55] [INFO ] Deduced a trap composed of 159 places in 130 ms of which 0 ms to minimize.
[2021-05-11 20:45:55] [INFO ] Deduced a trap composed of 162 places in 127 ms of which 2 ms to minimize.
[2021-05-11 20:45:55] [INFO ] Deduced a trap composed of 158 places in 136 ms of which 1 ms to minimize.
[2021-05-11 20:45:55] [INFO ] Deduced a trap composed of 156 places in 115 ms of which 1 ms to minimize.
[2021-05-11 20:45:55] [INFO ] Deduced a trap composed of 160 places in 139 ms of which 0 ms to minimize.
[2021-05-11 20:45:55] [INFO ] Deduced a trap composed of 166 places in 132 ms of which 0 ms to minimize.
[2021-05-11 20:45:56] [INFO ] Deduced a trap composed of 168 places in 135 ms of which 0 ms to minimize.
[2021-05-11 20:45:56] [INFO ] Deduced a trap composed of 168 places in 107 ms of which 0 ms to minimize.
[2021-05-11 20:45:56] [INFO ] Deduced a trap composed of 167 places in 140 ms of which 1 ms to minimize.
[2021-05-11 20:45:56] [INFO ] Deduced a trap composed of 160 places in 164 ms of which 0 ms to minimize.
[2021-05-11 20:45:56] [INFO ] Deduced a trap composed of 149 places in 152 ms of which 1 ms to minimize.
[2021-05-11 20:45:56] [INFO ] Deduced a trap composed of 180 places in 159 ms of which 1 ms to minimize.
[2021-05-11 20:45:57] [INFO ] Deduced a trap composed of 165 places in 161 ms of which 1 ms to minimize.
[2021-05-11 20:45:57] [INFO ] Deduced a trap composed of 158 places in 163 ms of which 1 ms to minimize.
[2021-05-11 20:45:57] [INFO ] Deduced a trap composed of 170 places in 193 ms of which 0 ms to minimize.
[2021-05-11 20:45:57] [INFO ] Deduced a trap composed of 178 places in 187 ms of which 1 ms to minimize.
[2021-05-11 20:45:58] [INFO ] Deduced a trap composed of 163 places in 180 ms of which 0 ms to minimize.
[2021-05-11 20:45:58] [INFO ] Deduced a trap composed of 185 places in 191 ms of which 0 ms to minimize.
[2021-05-11 20:45:58] [INFO ] Deduced a trap composed of 163 places in 185 ms of which 1 ms to minimize.
[2021-05-11 20:45:58] [INFO ] Deduced a trap composed of 156 places in 195 ms of which 1 ms to minimize.
[2021-05-11 20:45:58] [INFO ] Deduced a trap composed of 161 places in 184 ms of which 0 ms to minimize.
[2021-05-11 20:45:59] [INFO ] Deduced a trap composed of 161 places in 173 ms of which 0 ms to minimize.
[2021-05-11 20:45:59] [INFO ] Deduced a trap composed of 162 places in 157 ms of which 0 ms to minimize.
[2021-05-11 20:45:59] [INFO ] Deduced a trap composed of 177 places in 142 ms of which 0 ms to minimize.
[2021-05-11 20:45:59] [INFO ] Deduced a trap composed of 164 places in 165 ms of which 0 ms to minimize.
[2021-05-11 20:45:59] [INFO ] Deduced a trap composed of 164 places in 140 ms of which 1 ms to minimize.
[2021-05-11 20:46:00] [INFO ] Deduced a trap composed of 167 places in 183 ms of which 1 ms to minimize.
[2021-05-11 20:46:00] [INFO ] Deduced a trap composed of 169 places in 140 ms of which 0 ms to minimize.
[2021-05-11 20:46:00] [INFO ] Deduced a trap composed of 168 places in 151 ms of which 1 ms to minimize.
[2021-05-11 20:46:00] [INFO ] Deduced a trap composed of 176 places in 126 ms of which 0 ms to minimize.
[2021-05-11 20:46:00] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 0 ms to minimize.
[2021-05-11 20:46:00] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 0 ms to minimize.
[2021-05-11 20:46:01] [INFO ] Deduced a trap composed of 152 places in 123 ms of which 1 ms to minimize.
[2021-05-11 20:46:01] [INFO ] Deduced a trap composed of 159 places in 124 ms of which 0 ms to minimize.
[2021-05-11 20:46:01] [INFO ] Deduced a trap composed of 34 places in 186 ms of which 1 ms to minimize.
[2021-05-11 20:46:01] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 0 ms to minimize.
[2021-05-11 20:46:01] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 1 ms to minimize.
[2021-05-11 20:46:01] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 1 ms to minimize.
[2021-05-11 20:46:01] [INFO ] Deduced a trap composed of 166 places in 120 ms of which 1 ms to minimize.
[2021-05-11 20:46:02] [INFO ] Deduced a trap composed of 171 places in 120 ms of which 1 ms to minimize.
[2021-05-11 20:46:02] [INFO ] Deduced a trap composed of 181 places in 120 ms of which 0 ms to minimize.
[2021-05-11 20:46:02] [INFO ] Deduced a trap composed of 171 places in 120 ms of which 0 ms to minimize.
[2021-05-11 20:46:02] [INFO ] Deduced a trap composed of 152 places in 119 ms of which 0 ms to minimize.
[2021-05-11 20:46:02] [INFO ] Deduced a trap composed of 179 places in 131 ms of which 1 ms to minimize.
[2021-05-11 20:46:02] [INFO ] Deduced a trap composed of 158 places in 120 ms of which 0 ms to minimize.
[2021-05-11 20:46:02] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 1 ms to minimize.
[2021-05-11 20:46:03] [INFO ] Deduced a trap composed of 184 places in 115 ms of which 0 ms to minimize.
[2021-05-11 20:46:03] [INFO ] Deduced a trap composed of 174 places in 119 ms of which 0 ms to minimize.
[2021-05-11 20:46:03] [INFO ] Deduced a trap composed of 157 places in 115 ms of which 1 ms to minimize.
[2021-05-11 20:46:03] [INFO ] Deduced a trap composed of 163 places in 167 ms of which 0 ms to minimize.
[2021-05-11 20:46:03] [INFO ] Deduced a trap composed of 158 places in 132 ms of which 1 ms to minimize.
[2021-05-11 20:46:03] [INFO ] Deduced a trap composed of 157 places in 147 ms of which 1 ms to minimize.
[2021-05-11 20:46:04] [INFO ] Deduced a trap composed of 165 places in 138 ms of which 1 ms to minimize.
[2021-05-11 20:46:04] [INFO ] Deduced a trap composed of 184 places in 131 ms of which 0 ms to minimize.
[2021-05-11 20:46:04] [INFO ] Deduced a trap composed of 157 places in 145 ms of which 1 ms to minimize.
[2021-05-11 20:46:04] [INFO ] Deduced a trap composed of 182 places in 150 ms of which 0 ms to minimize.
[2021-05-11 20:46:04] [INFO ] Deduced a trap composed of 174 places in 149 ms of which 0 ms to minimize.
[2021-05-11 20:46:04] [INFO ] Deduced a trap composed of 164 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:46:05] [INFO ] Deduced a trap composed of 159 places in 141 ms of which 0 ms to minimize.
[2021-05-11 20:46:05] [INFO ] Deduced a trap composed of 157 places in 121 ms of which 1 ms to minimize.
[2021-05-11 20:46:05] [INFO ] Deduced a trap composed of 159 places in 120 ms of which 1 ms to minimize.
[2021-05-11 20:46:05] [INFO ] Deduced a trap composed of 168 places in 132 ms of which 1 ms to minimize.
[2021-05-11 20:46:05] [INFO ] Deduced a trap composed of 181 places in 123 ms of which 0 ms to minimize.
[2021-05-11 20:46:05] [INFO ] Deduced a trap composed of 167 places in 120 ms of which 1 ms to minimize.
[2021-05-11 20:46:06] [INFO ] Deduced a trap composed of 164 places in 119 ms of which 0 ms to minimize.
[2021-05-11 20:46:06] [INFO ] Deduced a trap composed of 161 places in 116 ms of which 1 ms to minimize.
[2021-05-11 20:46:06] [INFO ] Deduced a trap composed of 168 places in 117 ms of which 0 ms to minimize.
[2021-05-11 20:46:06] [INFO ] Deduced a trap composed of 165 places in 144 ms of which 1 ms to minimize.
[2021-05-11 20:46:06] [INFO ] Deduced a trap composed of 161 places in 145 ms of which 1 ms to minimize.
[2021-05-11 20:46:06] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 0 ms to minimize.
[2021-05-11 20:46:06] [INFO ] Deduced a trap composed of 152 places in 132 ms of which 0 ms to minimize.
[2021-05-11 20:46:07] [INFO ] Deduced a trap composed of 171 places in 132 ms of which 1 ms to minimize.
[2021-05-11 20:46:07] [INFO ] Deduced a trap composed of 183 places in 132 ms of which 0 ms to minimize.
[2021-05-11 20:46:07] [INFO ] Deduced a trap composed of 179 places in 148 ms of which 0 ms to minimize.
[2021-05-11 20:46:07] [INFO ] Deduced a trap composed of 173 places in 176 ms of which 1 ms to minimize.
[2021-05-11 20:46:07] [INFO ] Deduced a trap composed of 160 places in 181 ms of which 0 ms to minimize.
[2021-05-11 20:46:08] [INFO ] Deduced a trap composed of 157 places in 150 ms of which 1 ms to minimize.
[2021-05-11 20:46:08] [INFO ] Deduced a trap composed of 168 places in 187 ms of which 0 ms to minimize.
[2021-05-11 20:46:08] [INFO ] Deduced a trap composed of 175 places in 189 ms of which 1 ms to minimize.
[2021-05-11 20:46:08] [INFO ] Deduced a trap composed of 157 places in 198 ms of which 1 ms to minimize.
[2021-05-11 20:46:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2021-05-11 20:46:08] [INFO ] [Real]Absence check using 70 positive place invariants in 20 ms returned sat
[2021-05-11 20:46:08] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 15 ms returned sat
[2021-05-11 20:46:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:46:09] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2021-05-11 20:46:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:46:09] [INFO ] [Nat]Absence check using 70 positive place invariants in 26 ms returned sat
[2021-05-11 20:46:09] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 18 ms returned sat
[2021-05-11 20:46:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:46:09] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2021-05-11 20:46:09] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 1 ms to minimize.
[2021-05-11 20:46:10] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 1 ms to minimize.
[2021-05-11 20:46:10] [INFO ] Deduced a trap composed of 33 places in 167 ms of which 1 ms to minimize.
[2021-05-11 20:46:10] [INFO ] Deduced a trap composed of 153 places in 163 ms of which 1 ms to minimize.
[2021-05-11 20:46:10] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 0 ms to minimize.
[2021-05-11 20:46:10] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 1 ms to minimize.
[2021-05-11 20:46:10] [INFO ] Deduced a trap composed of 148 places in 132 ms of which 1 ms to minimize.
[2021-05-11 20:46:11] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 0 ms to minimize.
[2021-05-11 20:46:11] [INFO ] Deduced a trap composed of 163 places in 128 ms of which 0 ms to minimize.
[2021-05-11 20:46:11] [INFO ] Deduced a trap composed of 160 places in 133 ms of which 0 ms to minimize.
[2021-05-11 20:46:11] [INFO ] Deduced a trap composed of 150 places in 125 ms of which 0 ms to minimize.
[2021-05-11 20:46:11] [INFO ] Deduced a trap composed of 150 places in 153 ms of which 1 ms to minimize.
[2021-05-11 20:46:11] [INFO ] Deduced a trap composed of 147 places in 129 ms of which 1 ms to minimize.
[2021-05-11 20:46:12] [INFO ] Deduced a trap composed of 147 places in 133 ms of which 1 ms to minimize.
[2021-05-11 20:46:12] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2468 ms
[2021-05-11 20:46:12] [INFO ] Computed and/alt/rep : 592/941/592 causal constraints (skipped 41 transitions) in 35 ms.
[2021-05-11 20:46:15] [INFO ] Deduced a trap composed of 152 places in 200 ms of which 0 ms to minimize.
[2021-05-11 20:46:16] [INFO ] Deduced a trap composed of 145 places in 190 ms of which 1 ms to minimize.
[2021-05-11 20:46:16] [INFO ] Deduced a trap composed of 155 places in 186 ms of which 1 ms to minimize.
[2021-05-11 20:46:16] [INFO ] Deduced a trap composed of 153 places in 173 ms of which 1 ms to minimize.
[2021-05-11 20:46:16] [INFO ] Deduced a trap composed of 157 places in 178 ms of which 1 ms to minimize.
[2021-05-11 20:46:17] [INFO ] Deduced a trap composed of 165 places in 214 ms of which 0 ms to minimize.
[2021-05-11 20:46:17] [INFO ] Deduced a trap composed of 161 places in 168 ms of which 1 ms to minimize.
[2021-05-11 20:46:17] [INFO ] Deduced a trap composed of 155 places in 169 ms of which 1 ms to minimize.
[2021-05-11 20:46:17] [INFO ] Deduced a trap composed of 160 places in 181 ms of which 0 ms to minimize.
[2021-05-11 20:46:18] [INFO ] Deduced a trap composed of 159 places in 168 ms of which 0 ms to minimize.
[2021-05-11 20:46:18] [INFO ] Deduced a trap composed of 142 places in 170 ms of which 1 ms to minimize.
[2021-05-11 20:46:18] [INFO ] Deduced a trap composed of 159 places in 166 ms of which 1 ms to minimize.
[2021-05-11 20:46:18] [INFO ] Deduced a trap composed of 155 places in 187 ms of which 0 ms to minimize.
[2021-05-11 20:46:18] [INFO ] Deduced a trap composed of 151 places in 194 ms of which 0 ms to minimize.
[2021-05-11 20:46:19] [INFO ] Deduced a trap composed of 153 places in 193 ms of which 1 ms to minimize.
[2021-05-11 20:46:19] [INFO ] Deduced a trap composed of 154 places in 197 ms of which 1 ms to minimize.
[2021-05-11 20:46:19] [INFO ] Deduced a trap composed of 156 places in 172 ms of which 1 ms to minimize.
[2021-05-11 20:46:19] [INFO ] Deduced a trap composed of 165 places in 190 ms of which 1 ms to minimize.
[2021-05-11 20:46:20] [INFO ] Deduced a trap composed of 150 places in 175 ms of which 0 ms to minimize.
[2021-05-11 20:46:20] [INFO ] Deduced a trap composed of 157 places in 206 ms of which 1 ms to minimize.
[2021-05-11 20:46:20] [INFO ] Deduced a trap composed of 167 places in 197 ms of which 1 ms to minimize.
[2021-05-11 20:46:20] [INFO ] Deduced a trap composed of 151 places in 195 ms of which 0 ms to minimize.
[2021-05-11 20:46:21] [INFO ] Deduced a trap composed of 145 places in 193 ms of which 0 ms to minimize.
[2021-05-11 20:46:21] [INFO ] Deduced a trap composed of 151 places in 196 ms of which 0 ms to minimize.
[2021-05-11 20:46:21] [INFO ] Deduced a trap composed of 163 places in 168 ms of which 1 ms to minimize.
[2021-05-11 20:46:21] [INFO ] Deduced a trap composed of 152 places in 211 ms of which 0 ms to minimize.
[2021-05-11 20:46:22] [INFO ] Deduced a trap composed of 152 places in 200 ms of which 0 ms to minimize.
[2021-05-11 20:46:22] [INFO ] Deduced a trap composed of 154 places in 171 ms of which 1 ms to minimize.
[2021-05-11 20:46:22] [INFO ] Deduced a trap composed of 150 places in 186 ms of which 0 ms to minimize.
[2021-05-11 20:46:22] [INFO ] Deduced a trap composed of 149 places in 203 ms of which 2 ms to minimize.
[2021-05-11 20:46:23] [INFO ] Deduced a trap composed of 178 places in 223 ms of which 1 ms to minimize.
[2021-05-11 20:46:23] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 1 ms to minimize.
[2021-05-11 20:46:23] [INFO ] Deduced a trap composed of 166 places in 185 ms of which 1 ms to minimize.
[2021-05-11 20:46:23] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
[2021-05-11 20:46:24] [INFO ] Deduced a trap composed of 156 places in 193 ms of which 1 ms to minimize.
[2021-05-11 20:46:24] [INFO ] Deduced a trap composed of 159 places in 168 ms of which 1 ms to minimize.
[2021-05-11 20:46:24] [INFO ] Deduced a trap composed of 154 places in 176 ms of which 0 ms to minimize.
[2021-05-11 20:46:25] [INFO ] Deduced a trap composed of 155 places in 193 ms of which 1 ms to minimize.
[2021-05-11 20:46:25] [INFO ] Deduced a trap composed of 166 places in 184 ms of which 1 ms to minimize.
[2021-05-11 20:46:25] [INFO ] Deduced a trap composed of 163 places in 197 ms of which 0 ms to minimize.
[2021-05-11 20:46:25] [INFO ] Deduced a trap composed of 153 places in 177 ms of which 0 ms to minimize.
[2021-05-11 20:46:26] [INFO ] Deduced a trap composed of 153 places in 202 ms of which 1 ms to minimize.
[2021-05-11 20:46:26] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 10773 ms
[2021-05-11 20:46:26] [INFO ] Added : 389 causal constraints over 79 iterations in 14630 ms. Result :sat
[2021-05-11 20:46:26] [INFO ] [Real]Absence check using 70 positive place invariants in 27 ms returned sat
[2021-05-11 20:46:26] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 18 ms returned sat
[2021-05-11 20:46:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:46:27] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2021-05-11 20:46:27] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2021-05-11 20:46:27] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2021-05-11 20:46:27] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2021-05-11 20:46:27] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 1 ms to minimize.
[2021-05-11 20:46:27] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 1 ms to minimize.
[2021-05-11 20:46:28] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 1 ms to minimize.
[2021-05-11 20:46:28] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 1 ms to minimize.
[2021-05-11 20:46:28] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 0 ms to minimize.
[2021-05-11 20:46:28] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 0 ms to minimize.
[2021-05-11 20:46:28] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2021-05-11 20:46:28] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 0 ms to minimize.
[2021-05-11 20:46:28] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 0 ms to minimize.
[2021-05-11 20:46:28] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
[2021-05-11 20:46:28] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 0 ms to minimize.
[2021-05-11 20:46:29] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 0 ms to minimize.
[2021-05-11 20:46:29] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 0 ms to minimize.
[2021-05-11 20:46:29] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 0 ms to minimize.
[2021-05-11 20:46:29] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 1 ms to minimize.
[2021-05-11 20:46:29] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2021-05-11 20:46:29] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2256 ms
[2021-05-11 20:46:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:46:29] [INFO ] [Nat]Absence check using 70 positive place invariants in 26 ms returned sat
[2021-05-11 20:46:29] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 17 ms returned sat
[2021-05-11 20:46:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:46:29] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2021-05-11 20:46:29] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2021-05-11 20:46:30] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2021-05-11 20:46:30] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2021-05-11 20:46:30] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 0 ms to minimize.
[2021-05-11 20:46:30] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 1 ms to minimize.
[2021-05-11 20:46:30] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 0 ms to minimize.
[2021-05-11 20:46:30] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 0 ms to minimize.
[2021-05-11 20:46:30] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 0 ms to minimize.
[2021-05-11 20:46:30] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 1 ms to minimize.
[2021-05-11 20:46:30] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2021-05-11 20:46:31] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 0 ms to minimize.
[2021-05-11 20:46:31] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2021-05-11 20:46:31] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 0 ms to minimize.
[2021-05-11 20:46:31] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2021-05-11 20:46:31] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 1 ms to minimize.
[2021-05-11 20:46:31] [INFO ] Deduced a trap composed of 104 places in 87 ms of which 0 ms to minimize.
[2021-05-11 20:46:31] [INFO ] Deduced a trap composed of 91 places in 61 ms of which 0 ms to minimize.
[2021-05-11 20:46:31] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 1 ms to minimize.
[2021-05-11 20:46:31] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 0 ms to minimize.
[2021-05-11 20:46:31] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2021-05-11 20:46:32] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2021-05-11 20:46:32] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 1 ms to minimize.
[2021-05-11 20:46:32] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 1 ms to minimize.
[2021-05-11 20:46:32] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 0 ms to minimize.
[2021-05-11 20:46:32] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 1 ms to minimize.
[2021-05-11 20:46:32] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2655 ms
[2021-05-11 20:46:32] [INFO ] Computed and/alt/rep : 592/941/592 causal constraints (skipped 41 transitions) in 34 ms.
[2021-05-11 20:46:35] [INFO ] Added : 370 causal constraints over 75 iterations in 2899 ms. Result :sat
[2021-05-11 20:46:35] [INFO ] [Real]Absence check using 70 positive place invariants in 22 ms returned sat
[2021-05-11 20:46:35] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 16 ms returned sat
[2021-05-11 20:46:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:46:35] [INFO ] [Real]Absence check using state equation in 488 ms returned sat
[2021-05-11 20:46:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:46:36] [INFO ] [Nat]Absence check using 70 positive place invariants in 25 ms returned sat
[2021-05-11 20:46:36] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 17 ms returned sat
[2021-05-11 20:46:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:46:36] [INFO ] [Nat]Absence check using state equation in 659 ms returned sat
[2021-05-11 20:46:37] [INFO ] Deduced a trap composed of 25 places in 256 ms of which 1 ms to minimize.
[2021-05-11 20:46:37] [INFO ] Deduced a trap composed of 8 places in 213 ms of which 1 ms to minimize.
[2021-05-11 20:46:37] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2021-05-11 20:46:37] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 0 ms to minimize.
[2021-05-11 20:46:37] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 0 ms to minimize.
[2021-05-11 20:46:37] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2021-05-11 20:46:37] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2021-05-11 20:46:38] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
[2021-05-11 20:46:38] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 0 ms to minimize.
[2021-05-11 20:46:38] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 0 ms to minimize.
[2021-05-11 20:46:38] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2021-05-11 20:46:38] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 0 ms to minimize.
[2021-05-11 20:46:38] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2021-05-11 20:46:38] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2021-05-11 20:46:38] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2021-05-11 20:46:38] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 0 ms to minimize.
[2021-05-11 20:46:38] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2062 ms
[2021-05-11 20:46:38] [INFO ] Computed and/alt/rep : 592/941/592 causal constraints (skipped 41 transitions) in 43 ms.
[2021-05-11 20:46:43] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 1 ms to minimize.
[2021-05-11 20:46:43] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 1 ms to minimize.
[2021-05-11 20:46:43] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 0 ms to minimize.
[2021-05-11 20:46:43] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 0 ms to minimize.
[2021-05-11 20:46:43] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 1 ms to minimize.
[2021-05-11 20:46:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 792 ms
[2021-05-11 20:46:43] [INFO ] Added : 420 causal constraints over 85 iterations in 5100 ms. Result :sat
Graph (trivial) has 370 edges and 713 vertex of which 7 / 713 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.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 707 transition count 507
Reduce places removed 120 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 122 rules applied. Total rules applied 243 place count 587 transition count 505
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 245 place count 585 transition count 505
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 116 Pre rules applied. Total rules applied 245 place count 585 transition count 389
Deduced a syphon composed of 116 places in 32 ms
Ensure Unique test removed 21 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 253 rules applied. Total rules applied 498 place count 448 transition count 389
Discarding 81 places :
Symmetric choice reduction at 3 with 81 rule applications. Total rules 579 place count 367 transition count 308
Iterating global reduction 3 with 81 rules applied. Total rules applied 660 place count 367 transition count 308
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 660 place count 367 transition count 304
Deduced a syphon composed of 4 places in 1 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 670 place count 361 transition count 304
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 671 place count 360 transition count 303
Iterating global reduction 3 with 1 rules applied. Total rules applied 672 place count 360 transition count 303
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 3 ms
Ensure Unique test removed 3 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 243 rules applied. Total rules applied 915 place count 237 transition count 183
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 917 place count 236 transition count 186
Applied a total of 917 rules in 294 ms. Remains 236 /713 variables (removed 477) and now considering 186/634 (removed 448) transitions.
[2021-05-11 20:46:44] [INFO ] Flatten gal took : 27 ms
[2021-05-11 20:46:44] [INFO ] Flatten gal took : 32 ms
[2021-05-11 20:46:44] [INFO ] Input system was already deterministic with 186 transitions.
[2021-05-11 20:46:44] [INFO ] Flatten gal took : 29 ms
[2021-05-11 20:46:44] [INFO ] Flatten gal took : 17 ms
[2021-05-11 20:46:44] [INFO ] Time to serialize gal into /tmp/CTLFireability6723128908211085173.gal : 9 ms
[2021-05-11 20:46:44] [INFO ] Time to serialize properties into /tmp/CTLFireability18058622129129125674.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/CTLFireability6723128908211085173.gal, -t, CGAL, -ctl, /tmp/CTLFireability18058622129129125674.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/CTLFireability6723128908211085173.gal -t CGAL -ctl /tmp/CTLFireability18058622129129125674.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,5.92757e+07,6.32513,199448,2,64896,5,756798,6,0,1129,592128,0


Converting to forward existential form...Done !
original formula: !(EG(((((((((!(E(((((((((((p187==1)&&(p498==1))&&(p763==1))||(p1==1))||(((p200==1)&&(p483==1))&&(p668==1)))||(((p108==1)&&(p448==1))&&(p624==1)))||(p86==1))||(p317==1))||(p264==1))||(p711==1)) U ((((p374==1)||(p691==1))||(p446==1))||(((p197==1)&&(p498==1))&&(p674==1))))) * (p747==0)) * (p469==0)) * (p605==0)) * (p449==0)) * (p6==0)) * ((p188==0)||(p675==0))) * (p185==0)) + AG((((p64==0)&&(((p47==0)||(p378==0))||(p584==0)))&&(p711==0))))))
=> equivalent forward existential formula: [FwdG(Init,((((((((!(E(((((((((((p187==1)&&(p498==1))&&(p763==1))||(p1==1))||(((p200==1)&&(p483==1))&&(p668==1)))||(((p108==1)&&(p448==1))&&(p624==1)))||(p86==1))||(p317==1))||(p264==1))||(p711==1)) U ((((p374==1)||(p691==1))||(p446==1))||(((p197==1)&&(p498==1))&&(p674==1))))) * (p747==0)) * (p469==0)) * (p605==0)) * (p449==0)) * (p6==0)) * ((p188==0)||(p675==0))) * (p185==0)) + !(E(TRUE U !((((p64==0)&&(((p47==0)||(p378==0))||(p584==0)))&&(p711==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t9, t16, t18, t19, t21, t24, t29, t79, t87, t88, t89, t90, t91, t106, t107, t108, t109, t110, t124, t137, t144, t145, t146, t147, t148, t149, t150, t155, t156, t169, t178, t179, t180, t181, t182, t183, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/112/38/186
Detected timeout of ITS tools.
[2021-05-11 20:47:14] [INFO ] Flatten gal took : 28 ms
[2021-05-11 20:47:14] [INFO ] Applying decomposition
[2021-05-11 20:47:14] [INFO ] Flatten gal took : 25 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/graph3511981780320241388.txt, -o, /tmp/graph3511981780320241388.bin, -w, /tmp/graph3511981780320241388.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/graph3511981780320241388.bin, -l, -1, -v, -w, /tmp/graph3511981780320241388.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 20:47:14] [INFO ] Decomposing Gal with order
[2021-05-11 20:47:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 20:47:14] [INFO ] Removed a total of 151 redundant transitions.
[2021-05-11 20:47:14] [INFO ] Flatten gal took : 69 ms
[2021-05-11 20:47:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 35 ms.
[2021-05-11 20:47:15] [INFO ] Time to serialize gal into /tmp/CTLFireability6850886261543725915.gal : 14 ms
[2021-05-11 20:47:15] [INFO ] Time to serialize properties into /tmp/CTLFireability7323436032057236961.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/CTLFireability6850886261543725915.gal, -t, CGAL, -ctl, /tmp/CTLFireability7323436032057236961.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/CTLFireability6850886261543725915.gal -t CGAL -ctl /tmp/CTLFireability7323436032057236961.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,5.92757e+07,0.2061,14404,955,612,19133,2555,770,27225,196,7022,0


Converting to forward existential form...Done !
original formula: !(EG(((((((((!(E(((((((((((i11.u45.p187==1)&&(i11.u45.p498==1))&&(i11.u45.p763==1))||(i4.i2.u0.p1==1))||(((i7.u42.p200==1)&&(i7.u42.p483==1))&&(i7.u42.p668==1)))||(((i6.i2.u9.p108==1)&&(i5.i1.u34.p448==1))&&(i6.i2.u64.p624==1)))||(i10.i0.u6.p86==1))||(i12.i1.u19.p317==1))||(i1.i2.u17.p264==1))||(i4.i2.u74.p711==1)) U ((((i2.i0.u22.p374==1)||(i4.i2.u72.p691==1))||(i5.i1.u34.p446==1))||(((i11.u45.p197==1)&&(i11.u45.p498==1))&&(i11.u45.p674==1))))) * (i7.u42.p747==0)) * (i9.u39.p469==0)) * (i4.i2.u62.p605==0)) * (i5.i1.u35.p449==0)) * (i8.u1.p6==0)) * ((i7.u14.p188==0)||(i11.u68.p675==0))) * (i11.u45.p185==0)) + AG((((i10.i1.u3.p64==0)&&(((i3.u2.p47==0)||(i3.u23.p378==0))||(i3.u59.p584==0)))&&(i4.i2.u74.p711==0))))))
=> equivalent forward existential formula: [FwdG(Init,((((((((!(E(((((((((((i11.u45.p187==1)&&(i11.u45.p498==1))&&(i11.u45.p763==1))||(i4.i2.u0.p1==1))||(((i7.u42.p200==1)&&(i7.u42.p483==1))&&(i7.u42.p668==1)))||(((i6.i2.u9.p108==1)&&(i5.i1.u34.p448==1))&&(i6.i2.u64.p624==1)))||(i10.i0.u6.p86==1))||(i12.i1.u19.p317==1))||(i1.i2.u17.p264==1))||(i4.i2.u74.p711==1)) U ((((i2.i0.u22.p374==1)||(i4.i2.u72.p691==1))||(i5.i1.u34.p446==1))||(((i11.u45.p197==1)&&(i11.u45.p498==1))&&(i11.u45.p674==1))))) * (i7.u42.p747==0)) * (i9.u39.p469==0)) * (i4.i2.u62.p605==0)) * (i5.i1.u35.p449==0)) * (i8.u1.p6==0)) * ((i7.u14.p188==0)||(i11.u68.p675==0))) * (i11.u45.p185==0)) + !(E(TRUE U !((((i10.i1.u3.p64==0)&&(((i3.u2.p47==0)||(i3.u23.p378==0))||(i3.u59.p584==0)))&&(i4.i2.u74.p711==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t24, t79, t88, t89, t90, t91, t107, t108, t109, t110, t124, t127, t144, t145, t146, t147, t148, t149, t155, t156, t169, t179, t181, i2.i0.u22.t21, i4.i2.t1, i4.i2.t3, i4.i2.t9, i4.i2.t137, i4.i2.t150, i4.i2.u80.t106, i5.i1.t18, i5.i1.u34.t19, i9.u39.t16, i10.i0.t87, i10.i1.u3.t29, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :26/107/35/168
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,0,1.00974,49104,1,0,87061,11540,4124,133539,1800,54972,173856
FORMULA BusinessProcesses-PT-19-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Graph (trivial) has 389 edges and 713 vertex of which 7 / 713 are part of one of the 1 SCC in 2 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 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 131 place count 706 transition count 496
Reduce places removed 130 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 131 rules applied. Total rules applied 262 place count 576 transition count 495
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 263 place count 575 transition count 495
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 115 Pre rules applied. Total rules applied 263 place count 575 transition count 380
Deduced a syphon composed of 115 places in 3 ms
Ensure Unique test removed 23 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 3 with 253 rules applied. Total rules applied 516 place count 437 transition count 380
Discarding 83 places :
Symmetric choice reduction at 3 with 83 rule applications. Total rules 599 place count 354 transition count 297
Iterating global reduction 3 with 83 rules applied. Total rules applied 682 place count 354 transition count 297
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 682 place count 354 transition count 291
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 696 place count 346 transition count 291
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 261 rules applied. Total rules applied 957 place count 214 transition count 162
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 961 place count 212 transition count 164
Applied a total of 961 rules in 120 ms. Remains 212 /713 variables (removed 501) and now considering 164/634 (removed 470) transitions.
[2021-05-11 20:47:16] [INFO ] Flatten gal took : 18 ms
[2021-05-11 20:47:16] [INFO ] Flatten gal took : 17 ms
[2021-05-11 20:47:16] [INFO ] Input system was already deterministic with 164 transitions.
[2021-05-11 20:47:16] [INFO ] Flatten gal took : 27 ms
[2021-05-11 20:47:16] [INFO ] Flatten gal took : 22 ms
[2021-05-11 20:47:16] [INFO ] Time to serialize gal into /tmp/CTLFireability2306516440859595293.gal : 4 ms
[2021-05-11 20:47:16] [INFO ] Time to serialize properties into /tmp/CTLFireability8441694075013154118.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/CTLFireability2306516440859595293.gal, -t, CGAL, -ctl, /tmp/CTLFireability8441694075013154118.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/CTLFireability2306516440859595293.gal -t CGAL -ctl /tmp/CTLFireability8441694075013154118.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,8.73109e+07,5.72167,170908,2,53720,5,654480,6,0,1011,454656,0


Converting to forward existential form...Done !
original formula: AG(!(AF(AG(((((((((((p95==1)&&(p438==1))&&(p614==1))||(p401==1))||(p364==1))||(p394==1))||(p613==1))||(((p42==1)&&(p358==1))&&(p580==1)))||(p140==1))||(p534==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EG(!(!(E(TRUE U !(((((((((((p95==1)&&(p438==1))&&(p614==1))||(p401==1))||(p364==1))||(p394==1))||(p613==1))||(((p42==1)&&(p358==1))&&(p580==1)))||(p140==1))||(p534==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t8, t10, t12, t39, t43, t44, t45, t46, t47, t61, t62, t63, t64, t65, t104, t105, t108, t109, t123, t130, t131, t132, t133, t134, t135, t141, t142, t143, t160, t161, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/97/31/164
Detected timeout of ITS tools.
[2021-05-11 20:47:46] [INFO ] Flatten gal took : 28 ms
[2021-05-11 20:47:46] [INFO ] Applying decomposition
[2021-05-11 20:47:46] [INFO ] Flatten gal took : 21 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/graph2237087634600928546.txt, -o, /tmp/graph2237087634600928546.bin, -w, /tmp/graph2237087634600928546.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/graph2237087634600928546.bin, -l, -1, -v, -w, /tmp/graph2237087634600928546.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 20:47:46] [INFO ] Decomposing Gal with order
[2021-05-11 20:47:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 20:47:46] [INFO ] Removed a total of 188 redundant transitions.
[2021-05-11 20:47:46] [INFO ] Flatten gal took : 26 ms
[2021-05-11 20:47:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 10 ms.
[2021-05-11 20:47:46] [INFO ] Time to serialize gal into /tmp/CTLFireability7855688959559414576.gal : 4 ms
[2021-05-11 20:47:46] [INFO ] Time to serialize properties into /tmp/CTLFireability13234953190456725569.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/CTLFireability7855688959559414576.gal, -t, CGAL, -ctl, /tmp/CTLFireability13234953190456725569.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/CTLFireability7855688959559414576.gal -t CGAL -ctl /tmp/CTLFireability13234953190456725569.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,8.73109e+07,0.601789,22824,966,348,35333,1870,628,72933,174,6729,0


Converting to forward existential form...Done !
original formula: AG(!(AF(AG(((((((((((i9.u4.p95==1)&&(i9.u29.p438==1))&&(i9.u58.p614==1))||(i0.u24.p401==1))||(i3.u16.p364==1))||(i2.u22.p394==1))||(i4.u71.p613==1))||(((i0.u0.p42==1)&&(i0.u15.p358==1))&&(i0.u53.p580==1)))||(i5.u8.p140==1))||(i1.i1.i0.u47.p534==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EG(!(!(E(TRUE U !(((((((((((i9.u4.p95==1)&&(i9.u29.p438==1))&&(i9.u58.p614==1))||(i0.u24.p401==1))||(i3.u16.p364==1))||(i2.u22.p394==1))||(i4.u71.p613==1))||(((i0.u0.p42==1)&&(i0.u15.p358==1))&&(i0.u53.p580==1)))||(i5.u8.p140==1))||(i1.i1.i0.u47.p534==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t39, t44, t45, t46, t47, t62, t63, t64, t65, t108, t115, t123, t130, t142, t143, t160, i0.u24.t8, i2.u22.t10, i3.u3.t43, i3.u16.t12, i4.t135, i4.t134, i4.t133, i4.t132, i4.t131, i4.u71.t1, i4.u71.t61, i5.u8.t104, i5.u8.t105, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :25/94/29/148
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 7
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,1,1.22902,41096,1,0,71912,4425,3483,150001,1530,17004,156660
FORMULA BusinessProcesses-PT-19-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Graph (trivial) has 370 edges and 713 vertex of which 7 / 713 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 706 transition count 505
Reduce places removed 121 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 126 rules applied. Total rules applied 248 place count 585 transition count 500
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 253 place count 580 transition count 500
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 112 Pre rules applied. Total rules applied 253 place count 580 transition count 388
Deduced a syphon composed of 112 places in 2 ms
Ensure Unique test removed 22 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 3 with 246 rules applied. Total rules applied 499 place count 446 transition count 388
Discarding 77 places :
Symmetric choice reduction at 3 with 77 rule applications. Total rules 576 place count 369 transition count 311
Iterating global reduction 3 with 77 rules applied. Total rules applied 653 place count 369 transition count 311
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 653 place count 369 transition count 306
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 665 place count 362 transition count 306
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 666 place count 361 transition count 305
Iterating global reduction 3 with 1 rules applied. Total rules applied 667 place count 361 transition count 305
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 241 rules applied. Total rules applied 908 place count 239 transition count 186
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 912 place count 237 transition count 188
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 918 place count 237 transition count 188
Applied a total of 918 rules in 128 ms. Remains 237 /713 variables (removed 476) and now considering 188/634 (removed 446) transitions.
[2021-05-11 20:47:48] [INFO ] Flatten gal took : 11 ms
[2021-05-11 20:47:48] [INFO ] Flatten gal took : 11 ms
[2021-05-11 20:47:48] [INFO ] Input system was already deterministic with 188 transitions.
[2021-05-11 20:47:48] [INFO ] Flatten gal took : 18 ms
[2021-05-11 20:47:48] [INFO ] Flatten gal took : 21 ms
[2021-05-11 20:47:48] [INFO ] Time to serialize gal into /tmp/CTLFireability7268763112515308855.gal : 4 ms
[2021-05-11 20:47:48] [INFO ] Time to serialize properties into /tmp/CTLFireability5452503748977509798.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/CTLFireability7268763112515308855.gal, -t, CGAL, -ctl, /tmp/CTLFireability5452503748977509798.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/CTLFireability7268763112515308855.gal -t CGAL -ctl /tmp/CTLFireability5452503748977509798.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.06843e+09,5.01963,109324,2,41600,5,442794,6,0,1135,290497,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2021-05-11 20:48:18] [INFO ] Flatten gal took : 10 ms
[2021-05-11 20:48:18] [INFO ] Applying decomposition
[2021-05-11 20:48:18] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5150580151291142914.txt, -o, /tmp/graph5150580151291142914.bin, -w, /tmp/graph5150580151291142914.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/graph5150580151291142914.bin, -l, -1, -v, -w, /tmp/graph5150580151291142914.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 20:48:18] [INFO ] Decomposing Gal with order
[2021-05-11 20:48:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 20:48:18] [INFO ] Removed a total of 193 redundant transitions.
[2021-05-11 20:48:18] [INFO ] Flatten gal took : 20 ms
[2021-05-11 20:48:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 5 ms.
[2021-05-11 20:48:18] [INFO ] Time to serialize gal into /tmp/CTLFireability2841154985726548833.gal : 4 ms
[2021-05-11 20:48:18] [INFO ] Time to serialize properties into /tmp/CTLFireability6037722541575134284.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/CTLFireability2841154985726548833.gal, -t, CGAL, -ctl, /tmp/CTLFireability6037722541575134284.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/CTLFireability2841154985726548833.gal -t CGAL -ctl /tmp/CTLFireability6037722541575134284.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.06843e+09,2.63361,83348,1534,484,101179,2861,777,614767,180,10425,0


Converting to forward existential form...Done !
original formula: AG(EF(((((((((i14.u68.p586==1)||(i11.u53.p183==1))||(i12.u22.p254==1))||(i11.u53.p673==1))||(((i13.u25.p268==1)&&(i2.u60.p533==1))&&(i13.u78.p717==1)))||(((i12.u23.p257==1)&&(i13.u63.p548==1))&&(i12.u77.p709==1)))||(((i10.u16.p184==1)&&(i10.u52.p493==1))&&(i10.u74.p766==1))) * (!(E((((i2.u29.p321==1)||(i14.u80.p704==1))||(i3.u36.p395==1)) U (((i5.i0.i1.u32.p352==1)||(i7.u9.p117==1))||(i13.u25.p270==1)))) + AF(((((((((((u44.p454==1)||(i14.u73.p654==1))||(i14.u80.p716==1))||(i4.u28.p291==1))||(i1.u62.p544==1))||(i8.u10.p139==1))||(i7.u8.p114==1))||(i8.u47.p469==1))||(i5.i1.i0.u5.p86==1))||(((i11.u53.p215==1)&&(i11.u53.p498==1))&&(i11.u53.p751==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((((i14.u68.p586==1)||(i11.u53.p183==1))||(i12.u22.p254==1))||(i11.u53.p673==1))||(((i13.u25.p268==1)&&(i2.u60.p533==1))&&(i13.u78.p717==1)))||(((i12.u23.p257==1)&&(i13.u63.p548==1))&&(i12.u77.p709==1)))||(((i10.u16.p184==1)&&(i10.u52.p493==1))&&(i10.u74.p766==1))) * (!(E((((i2.u29.p321==1)||(i14.u80.p704==1))||(i3.u36.p395==1)) U (((i5.i0.i1.u32.p352==1)||(i7.u9.p117==1))||(i13.u25.p270==1)))) + !(EG(!(((((((((((u44.p454==1)||(i14.u73.p654==1))||(i14.u80.p716==1))||(i4.u28.p291==1))||(i1.u62.p544==1))||(i8.u10.p139==1))||(i7.u8.p114==1))||(i8.u47.p469==1))||(i5.i1.i0.u5.p86==1))||(((i11.u53.p215==1)&&(i11.u53.p498==1))&&(i11.u53.p751==1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t34, t36, t86, t87, t88, t89, t97, t98, t99, t100, t124, t126, t135, t143, t158, t159, t164, t177, t179, u44.t20, i1.u62.t14, i3.u36.t84, i4.u28.t83, i5.i1.i0.t85, i7.u8.t80, i8.u10.t130, i8.u10.t131, i8.u47.t18, i11.u53.t82, i12.u22.t120, i14.t160, i14.t157, i14.t156, i14.t155, i14.t148, i14.t9, i14.t7, i14.u80.t1, i14.u80.t3, i14.u80.t96, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :29/106/41/176
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 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 a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,3.81283,83348,1,0,143449,7227,4176,614767,1458,23227,266584
FORMULA BusinessProcesses-PT-19-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Reduce places removed 1 places and 1 transitions.
Drop transitions removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 712 transition count 548
Reduce places removed 85 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 93 rules applied. Total rules applied 178 place count 627 transition count 540
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 186 place count 619 transition count 540
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 132 Pre rules applied. Total rules applied 186 place count 619 transition count 408
Deduced a syphon composed of 132 places in 2 ms
Ensure Unique test removed 22 places
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 286 rules applied. Total rules applied 472 place count 465 transition count 408
Discarding 70 places :
Symmetric choice reduction at 3 with 70 rule applications. Total rules 542 place count 395 transition count 338
Iterating global reduction 3 with 70 rules applied. Total rules applied 612 place count 395 transition count 338
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 612 place count 395 transition count 333
Deduced a syphon composed of 5 places in 2 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 623 place count 389 transition count 333
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 219 rules applied. Total rules applied 842 place count 278 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 843 place count 278 transition count 224
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 845 place count 277 transition count 226
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 849 place count 277 transition count 226
Applied a total of 849 rules in 96 ms. Remains 277 /713 variables (removed 436) and now considering 226/634 (removed 408) transitions.
[2021-05-11 20:48:22] [INFO ] Flatten gal took : 12 ms
[2021-05-11 20:48:22] [INFO ] Flatten gal took : 11 ms
[2021-05-11 20:48:22] [INFO ] Input system was already deterministic with 226 transitions.
[2021-05-11 20:48:22] [INFO ] Flatten gal took : 10 ms
[2021-05-11 20:48:22] [INFO ] Flatten gal took : 10 ms
[2021-05-11 20:48:22] [INFO ] Time to serialize gal into /tmp/CTLFireability1813445400274052575.gal : 1 ms
[2021-05-11 20:48:22] [INFO ] Time to serialize properties into /tmp/CTLFireability17702277347552756564.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/CTLFireability1813445400274052575.gal, -t, CGAL, -ctl, /tmp/CTLFireability17702277347552756564.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/CTLFireability1813445400274052575.gal -t CGAL -ctl /tmp/CTLFireability17702277347552756564.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.65929e+11,8.12121,180408,2,38286,5,705005,6,0,1334,498704,0


Converting to forward existential form...Done !
original formula: AF(!(A((E(((((((((p406==1)||(p293==1))||(p176==1))||(p4==1))||(p322==1))||(p104==1))||(p172==1))||(((p197==1)&&(p498==1))&&(p769==1))) U (((((((((((((p455==1)||(((p212==1)&&(p493==1))&&(p748==1)))||(((p44==1)&&(p387==1))&&(p737==1)))||(p569==1))||(p122==1))||(p640==1))||(p9==1))||(p599==1))||(p173==1))||(p661==1))||(p520==1))||(p753==1))||(p736==1))) * E((((((((((((((((((((p404==1)||(p556==1))||(p151==1))||(p291==1))||(p704==1))||(p126==1))||(p92==1))||(p205==1))||(p489==1))||(p569==1))||(p144==1))||(p35==1))||(p199==1))||(p384==1))||(p623==1))||(p349==1))||(p361==1))||(((p164==1)&&(p497==1))&&(p737==1)))||(p315==1)) U ((((((((p654==1)||(p765==1))||(p606==1))||(p723==1))||(p59==1))||(p395==1))||(p237==1))||(((p209==1)&&(p498==1))&&(p763==1))))) U AF((((((p110==1)&&(p462==1))&&(p737==1))||(((p212==1)&&(p493==1))&&(p766==1)))||(p479==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(!(EG(!((((((p110==1)&&(p462==1))&&(p737==1))||(((p212==1)&&(p493==1))&&(p766==1)))||(p479==1)))))) U (!((E(((((((((p406==1)||(p293==1))||(p176==1))||(p4==1))||(p322==1))||(p104==1))||(p172==1))||(((p197==1)&&(p498==1))&&(p769==1))) U (((((((((((((p455==1)||(((p212==1)&&(p493==1))&&(p748==1)))||(((p44==1)&&(p387==1))&&(p737==1)))||(p569==1))||(p122==1))||(p640==1))||(p9==1))||(p599==1))||(p173==1))||(p661==1))||(p520==1))||(p753==1))||(p736==1))) * E((((((((((((((((((((p404==1)||(p556==1))||(p151==1))||(p291==1))||(p704==1))||(p126==1))||(p92==1))||(p205==1))||(p489==1))||(p569==1))||(p144==1))||(p35==1))||(p199==1))||(p384==1))||(p623==1))||(p349==1))||(p361==1))||(((p164==1)&&(p497==1))&&(p737==1)))||(p315==1)) U ((((((((p654==1)||(p765==1))||(p606==1))||(p723==1))||(p59==1))||(p395==1))||(p237==1))||(((p209==1)&&(p498==1))&&(p763==1)))))) * !(!(EG(!((((((p110==1)&&(p462==1))&&(p737==1))||(((p212==1)&&(p493==1))&&(p766==1)))||(p479==1)))))))) + EG(!(!(EG(!((((((p110==1)&&(p462==1))&&(p737==1))||(((p212==1)&&(p493==1))&&(p766==1)))||(p479==1))))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t12, t14, t15, t16, t18, t19, t20, t24, t26, t27, t28, t30, t35, t44, t48, t51, t53, t105, t106, t108, t109, t111, t112, t113, t115, t116, t118, t119, t123, t128, t129, t130, t131, t132, t148, t152, t153, t154, t156, t161, t169, t182, t183, t186, t188, t195, t196, t197, t200, t201, t208, t214, t215, t220, t221, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/132/58/226
Detected timeout of ITS tools.
[2021-05-11 20:48:52] [INFO ] Flatten gal took : 25 ms
[2021-05-11 20:48:52] [INFO ] Applying decomposition
[2021-05-11 20:48:52] [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/graph17310568561650327142.txt, -o, /tmp/graph17310568561650327142.bin, -w, /tmp/graph17310568561650327142.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/graph17310568561650327142.bin, -l, -1, -v, -w, /tmp/graph17310568561650327142.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 20:48:52] [INFO ] Decomposing Gal with order
[2021-05-11 20:48:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 20:48:52] [INFO ] Removed a total of 118 redundant transitions.
[2021-05-11 20:48:52] [INFO ] Flatten gal took : 26 ms
[2021-05-11 20:48:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 7 ms.
[2021-05-11 20:48:52] [INFO ] Time to serialize gal into /tmp/CTLFireability18349188602236252817.gal : 4 ms
[2021-05-11 20:48:52] [INFO ] Time to serialize properties into /tmp/CTLFireability8372549319649765382.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/CTLFireability18349188602236252817.gal, -t, CGAL, -ctl, /tmp/CTLFireability8372549319649765382.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/CTLFireability18349188602236252817.gal -t CGAL -ctl /tmp/CTLFireability8372549319649765382.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.65929e+11,0.975372,34176,1372,681,55030,6902,902,97345,220,19537,0


Converting to forward existential form...Done !
original formula: AF(!(A((E(((((((((i7.u42.p406==1)||(i14.i1.u29.p293==1))||(i3.u80.p176==1))||(i14.i1.u30.p4==1))||(i4.i0.u32.p322==1))||(i1.i1.u11.p104==1))||(i3.u21.p172==1))||(((i3.u21.p197==1)&&(i3.u57.p498==1))&&(i3.u57.p769==1))) U (((((((((((((i2.u49.p455==1)||(((u56.p212==1)&&(u56.p493==1))&&(u56.p748==1)))||(((i0.i1.u3.p44==1)&&(i6.i1.u39.p387==1))&&(i13.i2.u79.p737==1)))||(i13.i2.u79.p569==1))||(i9.u14.p122==1))||(i13.i2.u70.p640==1))||(i14.i1.u0.p9==1))||(i13.i2.u69.p599==1))||(i15.u54.p173==1))||(u56.p661==1))||(i4.i0.u62.p520==1))||(i3.u57.p753==1))||(i13.i2.u79.p736==1))) * E((((((((((((((((((((i0.i1.u41.p404==1)||(i5.u68.p556==1))||(i8.u18.p151==1))||(i14.i1.u28.p291==1))||(i13.i2.u79.p704==1))||(i8.u15.p126==1))||(i1.i0.u9.p92==1))||(u56.p205==1))||(i11.u55.p489==1))||(i13.i2.u79.p569==1))||(i9.u16.p144==1))||(i0.i0.u1.p35==1))||(i3.u21.p199==1))||(i0.i0.u38.p384==1))||(i13.i2.u79.p623==1))||(i6.i0.u33.p349==1))||(i7.u34.p361==1))||(((i10.u20.p164==1)&&(i3.u57.p497==1))&&(i13.i2.u79.p737==1)))||(i14.i1.u31.p315==1)) U ((((((((i13.i2.u72.p654==1)||(i3.u57.p765==1))||(i13.i2.u79.p606==1))||(i13.i2.u77.p723==1))||(i0.i0.u4.p59==1))||(i6.i0.u40.p395==1))||(i4.i1.u24.p237==1))||(((i3.u57.p209==1)&&(i3.u57.p498==1))&&(i3.u57.p763==1))))) U AF((((((i2.u12.p110==1)&&(i2.u50.p462==1))&&(i13.i2.u79.p737==1))||(((u56.p212==1)&&(u56.p493==1))&&(u56.p766==1)))||(i10.u53.p479==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(!(EG(!((((((i2.u12.p110==1)&&(i2.u50.p462==1))&&(i13.i2.u79.p737==1))||(((u56.p212==1)&&(u56.p493==1))&&(u56.p766==1)))||(i10.u53.p479==1)))))) U (!((E(((((((((i7.u42.p406==1)||(i14.i1.u29.p293==1))||(i3.u80.p176==1))||(i14.i1.u30.p4==1))||(i4.i0.u32.p322==1))||(i1.i1.u11.p104==1))||(i3.u21.p172==1))||(((i3.u21.p197==1)&&(i3.u57.p498==1))&&(i3.u57.p769==1))) U (((((((((((((i2.u49.p455==1)||(((u56.p212==1)&&(u56.p493==1))&&(u56.p748==1)))||(((i0.i1.u3.p44==1)&&(i6.i1.u39.p387==1))&&(i13.i2.u79.p737==1)))||(i13.i2.u79.p569==1))||(i9.u14.p122==1))||(i13.i2.u70.p640==1))||(i14.i1.u0.p9==1))||(i13.i2.u69.p599==1))||(i15.u54.p173==1))||(u56.p661==1))||(i4.i0.u62.p520==1))||(i3.u57.p753==1))||(i13.i2.u79.p736==1))) * E((((((((((((((((((((i0.i1.u41.p404==1)||(i5.u68.p556==1))||(i8.u18.p151==1))||(i14.i1.u28.p291==1))||(i13.i2.u79.p704==1))||(i8.u15.p126==1))||(i1.i0.u9.p92==1))||(u56.p205==1))||(i11.u55.p489==1))||(i13.i2.u79.p569==1))||(i9.u16.p144==1))||(i0.i0.u1.p35==1))||(i3.u21.p199==1))||(i0.i0.u38.p384==1))||(i13.i2.u79.p623==1))||(i6.i0.u33.p349==1))||(i7.u34.p361==1))||(((i10.u20.p164==1)&&(i3.u57.p497==1))&&(i13.i2.u79.p737==1)))||(i14.i1.u31.p315==1)) U ((((((((i13.i2.u72.p654==1)||(i3.u57.p765==1))||(i13.i2.u79.p606==1))||(i13.i2.u77.p723==1))||(i0.i0.u4.p59==1))||(i6.i0.u40.p395==1))||(i4.i1.u24.p237==1))||(((i3.u57.p209==1)&&(i3.u57.p498==1))&&(i3.u57.p763==1)))))) * !(!(EG(!((((((i2.u12.p110==1)&&(i2.u50.p462==1))&&(i13.i2.u79.p737==1))||(((u56.p212==1)&&(u56.p493==1))&&(u56.p766==1)))||(i10.u53.p479==1)))))))) + EG(!(!(EG(!((((((i2.u12.p110==1)&&(i2.u50.p462==1))&&(i13.i2.u79.p737==1))||(((u56.p212==1)&&(u56.p493==1))&&(u56.p766==1)))||(i10.u53.p479==1))))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t116, t118, t119, t123, t129, t130, t131, t132, t140, t148, t152, t154, t156, t161, t182, t183, t186, t188, t195, t196, t197, t201, t208, t220, i0.i0.u4.t51, i0.i1.t53, i0.i1.u3.t111, i0.i1.u41.t30, i1.i0.u9.t153, i1.i1.u11.t48, i2.u12.t113, i2.u49.t27, i5.u68.t20, i6.i0.u40.t109, i7.u8.t112, i7.u34.t35, i7.u42.t28, i8.u15.t106, i9.u16.t214, i9.u16.t215, i10.u20.t115, i10.u53.t26, i11.u55.t24, i13.i2.t3, i13.i2.t12, i13.i2.t14, i13.i2.t18, i13.i2.u79.t1, i13.i2.u79.t4, i13.i2.u79.t15, i13.i2.u79.t16, i13.i2.u79.t19, i13.i2.u79.t128, i14.i1.t105, i14.i1.u28.t108, i15.u54.t44, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :24/127/56/207
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 6
Fast SCC detection found a local SCC at level 2
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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 6
Fast SCC detection found a local SCC at level 2
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
(forward)formula 0,1,16.6919,470160,1,0,943369,17161,4864,1.36507e+06,1838,116992,1200949
FORMULA BusinessProcesses-PT-19-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2021-05-11 20:49:09] [INFO ] Flatten gal took : 15 ms
[2021-05-11 20:49:09] [INFO ] Flatten gal took : 14 ms
[2021-05-11 20:49:09] [INFO ] Applying decomposition
[2021-05-11 20:49:09] [INFO ] Flatten gal took : 23 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/graph1825470374178737535.txt, -o, /tmp/graph1825470374178737535.bin, -w, /tmp/graph1825470374178737535.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/graph1825470374178737535.bin, -l, -1, -v, -w, /tmp/graph1825470374178737535.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 20:49:09] [INFO ] Decomposing Gal with order
[2021-05-11 20:49:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 20:49:09] [INFO ] Removed a total of 277 redundant transitions.
[2021-05-11 20:49:09] [INFO ] Flatten gal took : 70 ms
[2021-05-11 20:49:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2021-05-11 20:49:09] [INFO ] Time to serialize gal into /tmp/CTLFireability14552460991648676274.gal : 15 ms
[2021-05-11 20:49:09] [INFO ] Time to serialize properties into /tmp/CTLFireability6384530525927975091.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/CTLFireability14552460991648676274.gal, -t, CGAL, -ctl, /tmp/CTLFireability6384530525927975091.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/CTLFireability14552460991648676274.gal -t CGAL -ctl /tmp/CTLFireability6384530525927975091.ctl
No direction supplied, using forward translation only.
Parsed 12 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.46961e+33,55.4931,1067524,22725,218,1.828e+06,3589,1344,3.84334e+06,135,20913,0


Converting to forward existential form...Done !
original formula: EG(AG(!(EG(AX(((i11.u35.p83==1)||(i14.u63.p166==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(!(EG(!(EX(!(((i11.u35.p83==1)||(i14.u63.p166==1)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t56, t58, t309, t430, t436, t473, t606, i0.t254, i0.u113.t302, i0.u109.t312, i0.u111.t305, i0.u154.t255, i1.i0.i0.u20.t476, i1.i0.i0.u22.t472, i1.i0.i0.u25.t466, i1.i0.i0.u212.t120, i1.i0.i0.u212.t123, i1.i0.i1.t468, i1.i0.i1.u26.t464, i1.i0.i2.t281, i1.i0.i2.u141.t282, i1.i1.i0.t289, i1.i1.i0.u137.t290, i1.i1.i1.t285, i1.i1.i1.u140.t286, i2.t456, i2.t440, i2.u38.t442, i2.u38.t443, i2.u38.t444, i3.t247, i3.u49.t421, i3.u57.t402, i3.u158.t248, i4.t413, i4.t411, i4.t406, i4.t405, i4.u52.t417, i4.u54.t412, i4.u56.t409, i5.t386, i5.t368, i5.t366, i5.t206, i5.t195, i5.t5, i5.t2, i5.u65.t376, i5.u65.t380, i5.u70.t369, i5.u181.t196, i5.u180.t198, i5.u177.t207, i6.u99.t332, i6.u101.t328, i7.t218, i7.t214, i7.t210, i7.t202, i7.u170.t219, i7.u172.t215, i7.u175.t211, i7.u178.t203, i8.t433, i8.t229, i8.u42.t435, i8.u167.t225, i8.u165.t230, i9.t460, i9.t277, i9.t273, i9.t269, i9.t265, i9.u27.t462, i9.u153.t257, i9.u144.t278, i9.u146.t274, i9.u148.t270, i9.u149.t266, i10.t481, i10.t297, i10.t293, i10.u18.t479, i10.u133.t298, i10.u136.t294, i11.t261, i11.u34.t450, i11.u152.t262, i12.t237, i12.t233, i12.u161.t238, i12.u164.t234, i13.t426, i13.t422, i13.t222, i13.u40.t439, i13.u45.t429, i13.u47.t425, i13.u169.t223, i14.u59.t398, i14.u61.t394, i14.u63.t390, i15.t188, i15.u88.t354, i15.u183.t191, i15.u185.t189, i15.u186.t184, i16.t350, i16.t181, i16.t177, i16.t40, i16.u84.t362, i16.u86.t358, i16.u91.t348, i16.u92.t346, i16.u188.t182, i16.u190.t178, i16.u249.t44, i17.t173, i17.t169, i17.t35, i17.u93.t343, i17.u94.t342, i17.u195.t165, i17.u191.t174, i17.u194.t170, i17.u252.t38, i18.t339, i18.t162, i18.t158, i18.t154, i18.t150, i18.u96.t337, i18.u96.t338, i18.u97.t336, i18.u197.t163, i18.u198.t159, i18.u201.t155, i18.u202.t151, i19.u103.t324, i19.u105.t320, i19.u107.t316, i20.u204.t26, i20.u204.t31, i20.u204.t32, i20.u204.t33, i20.u204.t36, i20.u204.t46, i20.u204.t54, i20.u204.t100, i20.u204.t105, i20.u204.t106, i20.u204.t119, i20.u204.t129, i20.u204.t133, i20.u204.t134, i20.u204.t138, i20.u204.t144, i21.t132, i21.t127, i21.t122, i21.t118, i21.t115, i21.t113, i21.t103, i21.t98, i21.t95, i21.t92, i21.t89, i21.t87, i21.t84, i21.t81, i21.t78, i21.t52, i21.t49, i21.t42, i21.t29, i21.t23, i21.t20, i21.t17, i21.t14, i21.u266.t12, i21.u266.t62, i21.u266.t69, i21.u266.t75, i21.u266.t111, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/410/188/634
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 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 an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2021-05-11 21:10:52] [INFO ] Applying decomposition
[2021-05-11 21:10:52] [INFO ] Flatten gal took : 46 ms
[2021-05-11 21:10:52] [INFO ] Decomposing Gal with order
[2021-05-11 21:10:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 21:10:53] [INFO ] Removed a total of 118 redundant transitions.
[2021-05-11 21:10:53] [INFO ] Flatten gal took : 46 ms
[2021-05-11 21:10:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2021-05-11 21:10:53] [INFO ] Time to serialize gal into /tmp/CTLFireability3572965704809443444.gal : 9 ms
[2021-05-11 21:10:53] [INFO ] Time to serialize properties into /tmp/CTLFireability6605876737013954674.ctl : 5 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/CTLFireability3572965704809443444.gal, -t, CGAL, -ctl, /tmp/CTLFireability6605876737013954674.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/CTLFireability3572965704809443444.gal -t CGAL -ctl /tmp/CTLFireability6605876737013954674.ctl
No direction supplied, using forward translation only.
Parsed 12 CTL formulae.
Detected timeout of ITS tools.
[2021-05-11 21:32:38] [INFO ] Flatten gal took : 231 ms
[2021-05-11 21:32:40] [INFO ] Input system was already deterministic with 634 transitions.
[2021-05-11 21:32:40] [INFO ] Transformed 713 places.
[2021-05-11 21:32:40] [INFO ] Transformed 634 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 21:33:10] [INFO ] Time to serialize gal into /tmp/CTLFireability18397355798457530806.gal : 11 ms
[2021-05-11 21:33:10] [INFO ] Time to serialize properties into /tmp/CTLFireability9231986140145406628.ctl : 16 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability18397355798457530806.gal, -t, CGAL, -ctl, /tmp/CTLFireability9231986140145406628.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/CTLFireability18397355798457530806.gal -t CGAL -ctl /tmp/CTLFireability9231986140145406628.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 12 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-19"
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-19, 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-162038143900466"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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