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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 9.4K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K 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.3K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 177K 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-18-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-18-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620765812750

Running Version 0
[2021-05-11 20:43:34] [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:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 20:43:34] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2021-05-11 20:43:34] [INFO ] Transformed 717 places.
[2021-05-11 20:43:34] [INFO ] Transformed 642 transitions.
[2021-05-11 20:43:34] [INFO ] Found NUPN structural information;
[2021-05-11 20:43:34] [INFO ] Parsed PT model containing 717 places and 642 transitions in 118 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Deduced a syphon composed of 15 places in 16 ms
Reduce places removed 15 places and 15 transitions.
Support contains 376 out of 702 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 702/702 places, 627/627 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 694 transition count 627
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 39 place count 663 transition count 596
Iterating global reduction 1 with 31 rules applied. Total rules applied 70 place count 663 transition count 596
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 82 place count 651 transition count 584
Iterating global reduction 1 with 12 rules applied. Total rules applied 94 place count 651 transition count 584
Applied a total of 94 rules in 76 ms. Remains 651 /702 variables (removed 51) and now considering 584/627 (removed 43) transitions.
// Phase 1: matrix 584 rows 651 cols
[2021-05-11 20:43:34] [INFO ] Computed 106 place invariants in 39 ms
[2021-05-11 20:43:34] [INFO ] Implicit Places using invariants in 315 ms returned []
// Phase 1: matrix 584 rows 651 cols
[2021-05-11 20:43:34] [INFO ] Computed 106 place invariants in 9 ms
[2021-05-11 20:43:35] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
// Phase 1: matrix 584 rows 651 cols
[2021-05-11 20:43:35] [INFO ] Computed 106 place invariants in 8 ms
[2021-05-11 20:43:35] [INFO ] Dead Transitions using invariants and state equation in 245 ms returned []
Finished structural reductions, in 1 iterations. Remains : 651/702 places, 584/627 transitions.
[2021-05-11 20:43:35] [INFO ] Flatten gal took : 68 ms
[2021-05-11 20:43:35] [INFO ] Flatten gal took : 37 ms
[2021-05-11 20:43:35] [INFO ] Input system was already deterministic with 584 transitions.
Incomplete random walk after 100000 steps, including 519 resets, run finished after 308 ms. (steps per millisecond=324 ) properties (out of 73) seen :65
Running SMT prover for 8 properties.
// Phase 1: matrix 584 rows 651 cols
[2021-05-11 20:43:36] [INFO ] Computed 106 place invariants in 20 ms
[2021-05-11 20:43:36] [INFO ] [Real]Absence check using 65 positive place invariants in 18 ms returned sat
[2021-05-11 20:43:36] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 9 ms returned sat
[2021-05-11 20:43:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:43:36] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2021-05-11 20:43:36] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 5 ms to minimize.
[2021-05-11 20:43:36] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 1 ms to minimize.
[2021-05-11 20:43:36] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 1 ms to minimize.
[2021-05-11 20:43:37] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 1 ms to minimize.
[2021-05-11 20:43:37] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 0 ms to minimize.
[2021-05-11 20:43:37] [INFO ] Deduced a trap composed of 110 places in 108 ms of which 0 ms to minimize.
[2021-05-11 20:43:37] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 1 ms to minimize.
[2021-05-11 20:43:37] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 1 ms to minimize.
[2021-05-11 20:43:37] [INFO ] Deduced a trap composed of 119 places in 134 ms of which 1 ms to minimize.
[2021-05-11 20:43:37] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 1 ms to minimize.
[2021-05-11 20:43:38] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 0 ms to minimize.
[2021-05-11 20:43:38] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2021-05-11 20:43:38] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2021-05-11 20:43:38] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1790 ms
[2021-05-11 20:43:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:43:38] [INFO ] [Nat]Absence check using 65 positive place invariants in 27 ms returned sat
[2021-05-11 20:43:38] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 8 ms returned sat
[2021-05-11 20:43:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:43:38] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2021-05-11 20:43:38] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 0 ms to minimize.
[2021-05-11 20:43:38] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 0 ms to minimize.
[2021-05-11 20:43:38] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 0 ms to minimize.
[2021-05-11 20:43:39] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 1 ms to minimize.
[2021-05-11 20:43:39] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 1 ms to minimize.
[2021-05-11 20:43:39] [INFO ] Deduced a trap composed of 110 places in 167 ms of which 0 ms to minimize.
[2021-05-11 20:43:39] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 1 ms to minimize.
[2021-05-11 20:43:39] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 0 ms to minimize.
[2021-05-11 20:43:39] [INFO ] Deduced a trap composed of 119 places in 180 ms of which 1 ms to minimize.
[2021-05-11 20:43:40] [INFO ] Deduced a trap composed of 27 places in 194 ms of which 0 ms to minimize.
[2021-05-11 20:43:40] [INFO ] Deduced a trap composed of 31 places in 155 ms of which 0 ms to minimize.
[2021-05-11 20:43:40] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 1 ms to minimize.
[2021-05-11 20:43:40] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 1 ms to minimize.
[2021-05-11 20:43:40] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2099 ms
[2021-05-11 20:43:40] [INFO ] Computed and/alt/rep : 544/884/544 causal constraints (skipped 39 transitions) in 55 ms.
[2021-05-11 20:43:43] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 3 ms to minimize.
[2021-05-11 20:43:43] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2021-05-11 20:43:43] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 0 ms to minimize.
[2021-05-11 20:43:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 465 ms
[2021-05-11 20:43:44] [INFO ] Added : 367 causal constraints over 74 iterations in 3441 ms. Result :sat
[2021-05-11 20:43:44] [INFO ] [Real]Absence check using 65 positive place invariants in 25 ms returned sat
[2021-05-11 20:43:44] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 12 ms returned sat
[2021-05-11 20:43:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:43:44] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2021-05-11 20:43:44] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 0 ms to minimize.
[2021-05-11 20:43:44] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 1 ms to minimize.
[2021-05-11 20:43:44] [INFO ] Deduced a trap composed of 113 places in 132 ms of which 1 ms to minimize.
[2021-05-11 20:43:45] [INFO ] Deduced a trap composed of 109 places in 140 ms of which 1 ms to minimize.
[2021-05-11 20:43:45] [INFO ] Deduced a trap composed of 124 places in 139 ms of which 1 ms to minimize.
[2021-05-11 20:43:45] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 1 ms to minimize.
[2021-05-11 20:43:45] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 1 ms to minimize.
[2021-05-11 20:43:45] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 0 ms to minimize.
[2021-05-11 20:43:45] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 0 ms to minimize.
[2021-05-11 20:43:46] [INFO ] Deduced a trap composed of 130 places in 169 ms of which 0 ms to minimize.
[2021-05-11 20:43:46] [INFO ] Deduced a trap composed of 142 places in 151 ms of which 1 ms to minimize.
[2021-05-11 20:43:46] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 0 ms to minimize.
[2021-05-11 20:43:46] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 0 ms to minimize.
[2021-05-11 20:43:46] [INFO ] Deduced a trap composed of 144 places in 136 ms of which 0 ms to minimize.
[2021-05-11 20:43:46] [INFO ] Deduced a trap composed of 117 places in 109 ms of which 1 ms to minimize.
[2021-05-11 20:43:47] [INFO ] Deduced a trap composed of 34 places in 164 ms of which 1 ms to minimize.
[2021-05-11 20:43:47] [INFO ] Deduced a trap composed of 58 places in 125 ms of which 0 ms to minimize.
[2021-05-11 20:43:47] [INFO ] Deduced a trap composed of 57 places in 106 ms of which 1 ms to minimize.
[2021-05-11 20:43:47] [INFO ] Deduced a trap composed of 151 places in 159 ms of which 0 ms to minimize.
[2021-05-11 20:43:47] [INFO ] Deduced a trap composed of 130 places in 160 ms of which 0 ms to minimize.
[2021-05-11 20:43:47] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 1 ms to minimize.
[2021-05-11 20:43:48] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 1 ms to minimize.
[2021-05-11 20:43:48] [INFO ] Deduced a trap composed of 145 places in 129 ms of which 0 ms to minimize.
[2021-05-11 20:43:48] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 1 ms to minimize.
[2021-05-11 20:43:48] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 1 ms to minimize.
[2021-05-11 20:43:48] [INFO ] Deduced a trap composed of 28 places in 180 ms of which 1 ms to minimize.
[2021-05-11 20:43:49] [INFO ] Deduced a trap composed of 127 places in 164 ms of which 1 ms to minimize.
[2021-05-11 20:43:49] [INFO ] Deduced a trap composed of 130 places in 134 ms of which 4 ms to minimize.
[2021-05-11 20:43:49] [INFO ] Deduced a trap composed of 124 places in 156 ms of which 1 ms to minimize.
[2021-05-11 20:43:49] [INFO ] Deduced a trap composed of 115 places in 132 ms of which 0 ms to minimize.
[2021-05-11 20:43:49] [INFO ] Deduced a trap composed of 140 places in 136 ms of which 1 ms to minimize.
[2021-05-11 20:43:49] [INFO ] Deduced a trap composed of 124 places in 169 ms of which 1 ms to minimize.
[2021-05-11 20:43:50] [INFO ] Deduced a trap composed of 121 places in 172 ms of which 1 ms to minimize.
[2021-05-11 20:43:50] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 1 ms to minimize.
[2021-05-11 20:43:50] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 0 ms to minimize.
[2021-05-11 20:43:50] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 0 ms to minimize.
[2021-05-11 20:43:50] [INFO ] Deduced a trap composed of 51 places in 138 ms of which 3 ms to minimize.
[2021-05-11 20:43:50] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 1 ms to minimize.
[2021-05-11 20:43:51] [INFO ] Deduced a trap composed of 138 places in 161 ms of which 2 ms to minimize.
[2021-05-11 20:43:51] [INFO ] Deduced a trap composed of 144 places in 113 ms of which 1 ms to minimize.
[2021-05-11 20:43:51] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 1 ms to minimize.
[2021-05-11 20:43:51] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 0 ms to minimize.
[2021-05-11 20:43:51] [INFO ] Deduced a trap composed of 50 places in 144 ms of which 0 ms to minimize.
[2021-05-11 20:43:51] [INFO ] Deduced a trap composed of 124 places in 100 ms of which 1 ms to minimize.
[2021-05-11 20:43:52] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 0 ms to minimize.
[2021-05-11 20:43:52] [INFO ] Deduced a trap composed of 130 places in 101 ms of which 0 ms to minimize.
[2021-05-11 20:43:52] [INFO ] Deduced a trap composed of 61 places in 153 ms of which 1 ms to minimize.
[2021-05-11 20:43:52] [INFO ] Deduced a trap composed of 125 places in 158 ms of which 1 ms to minimize.
[2021-05-11 20:43:52] [INFO ] Deduced a trap composed of 133 places in 130 ms of which 1 ms to minimize.
[2021-05-11 20:43:52] [INFO ] Deduced a trap composed of 132 places in 149 ms of which 1 ms to minimize.
[2021-05-11 20:43:53] [INFO ] Deduced a trap composed of 132 places in 124 ms of which 1 ms to minimize.
[2021-05-11 20:43:53] [INFO ] Deduced a trap composed of 137 places in 116 ms of which 1 ms to minimize.
[2021-05-11 20:43:53] [INFO ] Deduced a trap composed of 133 places in 123 ms of which 0 ms to minimize.
[2021-05-11 20:43:53] [INFO ] Deduced a trap composed of 46 places in 146 ms of which 0 ms to minimize.
[2021-05-11 20:43:53] [INFO ] Deduced a trap composed of 135 places in 126 ms of which 0 ms to minimize.
[2021-05-11 20:43:53] [INFO ] Deduced a trap composed of 129 places in 122 ms of which 0 ms to minimize.
[2021-05-11 20:43:53] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 1 ms to minimize.
[2021-05-11 20:43:54] [INFO ] Deduced a trap composed of 132 places in 121 ms of which 1 ms to minimize.
[2021-05-11 20:43:54] [INFO ] Deduced a trap composed of 133 places in 132 ms of which 0 ms to minimize.
[2021-05-11 20:43:54] [INFO ] Deduced a trap composed of 58 places in 166 ms of which 1 ms to minimize.
[2021-05-11 20:43:54] [INFO ] Deduced a trap composed of 127 places in 129 ms of which 0 ms to minimize.
[2021-05-11 20:43:54] [INFO ] Deduced a trap composed of 147 places in 163 ms of which 0 ms to minimize.
[2021-05-11 20:43:55] [INFO ] Deduced a trap composed of 150 places in 145 ms of which 0 ms to minimize.
[2021-05-11 20:43:55] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 1 ms to minimize.
[2021-05-11 20:43:55] [INFO ] Deduced a trap composed of 133 places in 151 ms of which 1 ms to minimize.
[2021-05-11 20:43:55] [INFO ] Deduced a trap composed of 56 places in 150 ms of which 0 ms to minimize.
[2021-05-11 20:43:55] [INFO ] Deduced a trap composed of 131 places in 201 ms of which 0 ms to minimize.
[2021-05-11 20:43:56] [INFO ] Deduced a trap composed of 134 places in 170 ms of which 0 ms to minimize.
[2021-05-11 20:43:56] [INFO ] Deduced a trap composed of 57 places in 175 ms of which 0 ms to minimize.
[2021-05-11 20:43:56] [INFO ] Deduced a trap composed of 59 places in 168 ms of which 1 ms to minimize.
[2021-05-11 20:43:56] [INFO ] Deduced a trap composed of 138 places in 141 ms of which 1 ms to minimize.
[2021-05-11 20:43:56] [INFO ] Deduced a trap composed of 57 places in 149 ms of which 1 ms to minimize.
[2021-05-11 20:43:57] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 0 ms to minimize.
[2021-05-11 20:43:57] [INFO ] Deduced a trap composed of 141 places in 168 ms of which 0 ms to minimize.
[2021-05-11 20:43:57] [INFO ] Deduced a trap composed of 142 places in 159 ms of which 1 ms to minimize.
[2021-05-11 20:43:57] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 0 ms to minimize.
[2021-05-11 20:43:57] [INFO ] Deduced a trap composed of 148 places in 149 ms of which 1 ms to minimize.
[2021-05-11 20:43:58] [INFO ] Deduced a trap composed of 138 places in 117 ms of which 1 ms to minimize.
[2021-05-11 20:43:58] [INFO ] Deduced a trap composed of 136 places in 155 ms of which 1 ms to minimize.
[2021-05-11 20:43:58] [INFO ] Deduced a trap composed of 144 places in 132 ms of which 1 ms to minimize.
[2021-05-11 20:43:58] [INFO ] Deduced a trap composed of 144 places in 176 ms of which 0 ms to minimize.
[2021-05-11 20:43:58] [INFO ] Deduced a trap composed of 148 places in 124 ms of which 0 ms to minimize.
[2021-05-11 20:43:58] [INFO ] Deduced a trap composed of 142 places in 130 ms of which 1 ms to minimize.
[2021-05-11 20:43:59] [INFO ] Deduced a trap composed of 132 places in 125 ms of which 1 ms to minimize.
[2021-05-11 20:43:59] [INFO ] Deduced a trap composed of 136 places in 121 ms of which 0 ms to minimize.
[2021-05-11 20:43:59] [INFO ] Deduced a trap composed of 147 places in 146 ms of which 0 ms to minimize.
[2021-05-11 20:43:59] [INFO ] Deduced a trap composed of 136 places in 156 ms of which 1 ms to minimize.
[2021-05-11 20:43:59] [INFO ] Deduced a trap composed of 132 places in 155 ms of which 0 ms to minimize.
[2021-05-11 20:44:00] [INFO ] Deduced a trap composed of 133 places in 161 ms of which 1 ms to minimize.
[2021-05-11 20:44:00] [INFO ] Deduced a trap composed of 134 places in 164 ms of which 0 ms to minimize.
[2021-05-11 20:44:00] [INFO ] Deduced a trap composed of 142 places in 132 ms of which 1 ms to minimize.
[2021-05-11 20:44:00] [INFO ] Deduced a trap composed of 139 places in 170 ms of which 1 ms to minimize.
[2021-05-11 20:44:00] [INFO ] Deduced a trap composed of 141 places in 172 ms of which 0 ms to minimize.
[2021-05-11 20:44:00] [INFO ] Deduced a trap composed of 140 places in 170 ms of which 0 ms to minimize.
[2021-05-11 20:44:01] [INFO ] Deduced a trap composed of 138 places in 175 ms of which 1 ms to minimize.
[2021-05-11 20:44:01] [INFO ] Deduced a trap composed of 128 places in 156 ms of which 0 ms to minimize.
[2021-05-11 20:44:01] [INFO ] Deduced a trap composed of 131 places in 122 ms of which 1 ms to minimize.
[2021-05-11 20:44:01] [INFO ] Deduced a trap composed of 136 places in 119 ms of which 1 ms to minimize.
[2021-05-11 20:44:01] [INFO ] Deduced a trap composed of 139 places in 166 ms of which 1 ms to minimize.
[2021-05-11 20:44:02] [INFO ] Deduced a trap composed of 142 places in 140 ms of which 1 ms to minimize.
[2021-05-11 20:44:02] [INFO ] Deduced a trap composed of 145 places in 145 ms of which 0 ms to minimize.
[2021-05-11 20:44:02] [INFO ] Deduced a trap composed of 150 places in 142 ms of which 1 ms to minimize.
[2021-05-11 20:44:02] [INFO ] Deduced a trap composed of 145 places in 138 ms of which 1 ms to minimize.
[2021-05-11 20:44:02] [INFO ] Deduced a trap composed of 140 places in 125 ms of which 0 ms to minimize.
[2021-05-11 20:44:03] [INFO ] Deduced a trap composed of 144 places in 137 ms of which 0 ms to minimize.
[2021-05-11 20:44:03] [INFO ] Deduced a trap composed of 146 places in 180 ms of which 0 ms to minimize.
[2021-05-11 20:44:03] [INFO ] Deduced a trap composed of 153 places in 157 ms of which 1 ms to minimize.
[2021-05-11 20:44:03] [INFO ] Deduced a trap composed of 150 places in 131 ms of which 0 ms to minimize.
[2021-05-11 20:44:03] [INFO ] Deduced a trap composed of 140 places in 158 ms of which 0 ms to minimize.
[2021-05-11 20:44:03] [INFO ] Deduced a trap composed of 143 places in 144 ms of which 0 ms to minimize.
[2021-05-11 20:44:04] [INFO ] Deduced a trap composed of 143 places in 167 ms of which 0 ms to minimize.
[2021-05-11 20:44:04] [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:04] [INFO ] [Real]Absence check using 65 positive place invariants in 23 ms returned sat
[2021-05-11 20:44:04] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 9 ms returned sat
[2021-05-11 20:44:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:04] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2021-05-11 20:44:04] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 0 ms to minimize.
[2021-05-11 20:44:04] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
[2021-05-11 20:44:04] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 2 ms to minimize.
[2021-05-11 20:44:05] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2021-05-11 20:44:05] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 0 ms to minimize.
[2021-05-11 20:44:05] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 0 ms to minimize.
[2021-05-11 20:44:05] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 0 ms to minimize.
[2021-05-11 20:44:05] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 0 ms to minimize.
[2021-05-11 20:44:05] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 0 ms to minimize.
[2021-05-11 20:44:05] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 0 ms to minimize.
[2021-05-11 20:44:05] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 0 ms to minimize.
[2021-05-11 20:44:05] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2021-05-11 20:44:05] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1430 ms
[2021-05-11 20:44:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:44:06] [INFO ] [Nat]Absence check using 65 positive place invariants in 33 ms returned sat
[2021-05-11 20:44:06] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 9 ms returned sat
[2021-05-11 20:44:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:06] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2021-05-11 20:44:06] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 1 ms to minimize.
[2021-05-11 20:44:06] [INFO ] Deduced a trap composed of 14 places in 130 ms of which 0 ms to minimize.
[2021-05-11 20:44:06] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 1 ms to minimize.
[2021-05-11 20:44:06] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
[2021-05-11 20:44:07] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 1 ms to minimize.
[2021-05-11 20:44:07] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 1 ms to minimize.
[2021-05-11 20:44:07] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 0 ms to minimize.
[2021-05-11 20:44:07] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 1 ms to minimize.
[2021-05-11 20:44:07] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 0 ms to minimize.
[2021-05-11 20:44:07] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
[2021-05-11 20:44:07] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 1 ms to minimize.
[2021-05-11 20:44:07] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 1 ms to minimize.
[2021-05-11 20:44:07] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1625 ms
[2021-05-11 20:44:08] [INFO ] Computed and/alt/rep : 544/884/544 causal constraints (skipped 39 transitions) in 34 ms.
[2021-05-11 20:44:10] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 1 ms to minimize.
[2021-05-11 20:44:10] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 1 ms to minimize.
[2021-05-11 20:44:10] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 0 ms to minimize.
[2021-05-11 20:44:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 421 ms
[2021-05-11 20:44:11] [INFO ] Added : 356 causal constraints over 72 iterations in 3140 ms. Result :sat
[2021-05-11 20:44:11] [INFO ] [Real]Absence check using 65 positive place invariants in 23 ms returned sat
[2021-05-11 20:44:11] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 9 ms returned sat
[2021-05-11 20:44:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:11] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2021-05-11 20:44:11] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 1 ms to minimize.
[2021-05-11 20:44:11] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 1 ms to minimize.
[2021-05-11 20:44:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 397 ms
[2021-05-11 20:44:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:44:12] [INFO ] [Nat]Absence check using 65 positive place invariants in 25 ms returned sat
[2021-05-11 20:44:12] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-11 20:44:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:12] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2021-05-11 20:44:12] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 0 ms to minimize.
[2021-05-11 20:44:12] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 1 ms to minimize.
[2021-05-11 20:44:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 325 ms
[2021-05-11 20:44:12] [INFO ] Computed and/alt/rep : 544/884/544 causal constraints (skipped 39 transitions) in 33 ms.
[2021-05-11 20:44:13] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 0 ms to minimize.
[2021-05-11 20:44:14] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 0 ms to minimize.
[2021-05-11 20:44:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 321 ms
[2021-05-11 20:44:14] [INFO ] Added : 163 causal constraints over 33 iterations in 1441 ms. Result :sat
[2021-05-11 20:44:14] [INFO ] [Real]Absence check using 65 positive place invariants in 25 ms returned sat
[2021-05-11 20:44:14] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-11 20:44:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:14] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2021-05-11 20:44:14] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 1 ms to minimize.
[2021-05-11 20:44:14] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 1 ms to minimize.
[2021-05-11 20:44:15] [INFO ] Deduced a trap composed of 21 places in 180 ms of which 0 ms to minimize.
[2021-05-11 20:44:15] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 1 ms to minimize.
[2021-05-11 20:44:15] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 1 ms to minimize.
[2021-05-11 20:44:15] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 1 ms to minimize.
[2021-05-11 20:44:15] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 0 ms to minimize.
[2021-05-11 20:44:16] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 1 ms to minimize.
[2021-05-11 20:44:16] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 0 ms to minimize.
[2021-05-11 20:44:16] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 0 ms to minimize.
[2021-05-11 20:44:16] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 0 ms to minimize.
[2021-05-11 20:44:16] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 1 ms to minimize.
[2021-05-11 20:44:16] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 1 ms to minimize.
[2021-05-11 20:44:17] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 1 ms to minimize.
[2021-05-11 20:44:17] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 0 ms to minimize.
[2021-05-11 20:44:17] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 0 ms to minimize.
[2021-05-11 20:44:17] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 1 ms to minimize.
[2021-05-11 20:44:17] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 1 ms to minimize.
[2021-05-11 20:44:17] [INFO ] Deduced a trap composed of 58 places in 135 ms of which 1 ms to minimize.
[2021-05-11 20:44:18] [INFO ] Deduced a trap composed of 128 places in 125 ms of which 1 ms to minimize.
[2021-05-11 20:44:18] [INFO ] Deduced a trap composed of 128 places in 132 ms of which 0 ms to minimize.
[2021-05-11 20:44:18] [INFO ] Deduced a trap composed of 137 places in 125 ms of which 0 ms to minimize.
[2021-05-11 20:44:18] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 1 ms to minimize.
[2021-05-11 20:44:18] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 0 ms to minimize.
[2021-05-11 20:44:18] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 1 ms to minimize.
[2021-05-11 20:44:18] [INFO ] Deduced a trap composed of 142 places in 111 ms of which 0 ms to minimize.
[2021-05-11 20:44:19] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 0 ms to minimize.
[2021-05-11 20:44:19] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 0 ms to minimize.
[2021-05-11 20:44:19] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 0 ms to minimize.
[2021-05-11 20:44:19] [INFO ] Deduced a trap composed of 120 places in 105 ms of which 1 ms to minimize.
[2021-05-11 20:44:19] [INFO ] Deduced a trap composed of 118 places in 99 ms of which 1 ms to minimize.
[2021-05-11 20:44:19] [INFO ] Deduced a trap composed of 120 places in 109 ms of which 0 ms to minimize.
[2021-05-11 20:44:19] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 0 ms to minimize.
[2021-05-11 20:44:20] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 1 ms to minimize.
[2021-05-11 20:44:20] [INFO ] Deduced a trap composed of 154 places in 113 ms of which 0 ms to minimize.
[2021-05-11 20:44:20] [INFO ] Deduced a trap composed of 150 places in 101 ms of which 0 ms to minimize.
[2021-05-11 20:44:20] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 0 ms to minimize.
[2021-05-11 20:44:20] [INFO ] Deduced a trap composed of 147 places in 156 ms of which 0 ms to minimize.
[2021-05-11 20:44:20] [INFO ] Deduced a trap composed of 152 places in 101 ms of which 1 ms to minimize.
[2021-05-11 20:44:20] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 1 ms to minimize.
[2021-05-11 20:44:21] [INFO ] Deduced a trap composed of 142 places in 131 ms of which 0 ms to minimize.
[2021-05-11 20:44:21] [INFO ] Deduced a trap composed of 52 places in 152 ms of which 0 ms to minimize.
[2021-05-11 20:44:21] [INFO ] Deduced a trap composed of 62 places in 131 ms of which 1 ms to minimize.
[2021-05-11 20:44:21] [INFO ] Deduced a trap composed of 148 places in 131 ms of which 0 ms to minimize.
[2021-05-11 20:44:21] [INFO ] Deduced a trap composed of 64 places in 165 ms of which 1 ms to minimize.
[2021-05-11 20:44:21] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 0 ms to minimize.
[2021-05-11 20:44:22] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 1 ms to minimize.
[2021-05-11 20:44:22] [INFO ] Deduced a trap composed of 60 places in 149 ms of which 0 ms to minimize.
[2021-05-11 20:44:22] [INFO ] Deduced a trap composed of 63 places in 115 ms of which 1 ms to minimize.
[2021-05-11 20:44:22] [INFO ] Deduced a trap composed of 134 places in 118 ms of which 1 ms to minimize.
[2021-05-11 20:44:22] [INFO ] Deduced a trap composed of 58 places in 118 ms of which 0 ms to minimize.
[2021-05-11 20:44:22] [INFO ] Deduced a trap composed of 62 places in 150 ms of which 1 ms to minimize.
[2021-05-11 20:44:22] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 1 ms to minimize.
[2021-05-11 20:44:23] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 1 ms to minimize.
[2021-05-11 20:44:23] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 1 ms to minimize.
[2021-05-11 20:44:23] [INFO ] Deduced a trap composed of 54 places in 137 ms of which 1 ms to minimize.
[2021-05-11 20:44:23] [INFO ] Deduced a trap composed of 118 places in 128 ms of which 1 ms to minimize.
[2021-05-11 20:44:23] [INFO ] Deduced a trap composed of 114 places in 133 ms of which 1 ms to minimize.
[2021-05-11 20:44:23] [INFO ] Deduced a trap composed of 120 places in 123 ms of which 1 ms to minimize.
[2021-05-11 20:44:23] [INFO ] Deduced a trap composed of 51 places in 111 ms of which 0 ms to minimize.
[2021-05-11 20:44:24] [INFO ] Deduced a trap composed of 119 places in 120 ms of which 0 ms to minimize.
[2021-05-11 20:44:24] [INFO ] Deduced a trap composed of 127 places in 120 ms of which 0 ms to minimize.
[2021-05-11 20:44:24] [INFO ] Deduced a trap composed of 134 places in 123 ms of which 0 ms to minimize.
[2021-05-11 20:44:24] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 1 ms to minimize.
[2021-05-11 20:44:24] [INFO ] Deduced a trap composed of 139 places in 118 ms of which 1 ms to minimize.
[2021-05-11 20:44:24] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 0 ms to minimize.
[2021-05-11 20:44:24] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 0 ms to minimize.
[2021-05-11 20:44:25] [INFO ] Deduced a trap composed of 116 places in 112 ms of which 1 ms to minimize.
[2021-05-11 20:44:25] [INFO ] Deduced a trap composed of 66 places in 110 ms of which 0 ms to minimize.
[2021-05-11 20:44:25] [INFO ] Deduced a trap composed of 132 places in 105 ms of which 0 ms to minimize.
[2021-05-11 20:44:25] [INFO ] Deduced a trap composed of 118 places in 116 ms of which 0 ms to minimize.
[2021-05-11 20:44:25] [INFO ] Deduced a trap composed of 115 places in 133 ms of which 1 ms to minimize.
[2021-05-11 20:44:25] [INFO ] Deduced a trap composed of 130 places in 99 ms of which 0 ms to minimize.
[2021-05-11 20:44:25] [INFO ] Deduced a trap composed of 129 places in 90 ms of which 0 ms to minimize.
[2021-05-11 20:44:26] [INFO ] Deduced a trap composed of 118 places in 88 ms of which 2 ms to minimize.
[2021-05-11 20:44:26] [INFO ] Deduced a trap composed of 135 places in 90 ms of which 1 ms to minimize.
[2021-05-11 20:44:26] [INFO ] Deduced a trap composed of 132 places in 91 ms of which 0 ms to minimize.
[2021-05-11 20:44:26] [INFO ] Deduced a trap composed of 118 places in 88 ms of which 0 ms to minimize.
[2021-05-11 20:44:26] [INFO ] Deduced a trap composed of 128 places in 92 ms of which 0 ms to minimize.
[2021-05-11 20:44:26] [INFO ] Deduced a trap composed of 126 places in 88 ms of which 0 ms to minimize.
[2021-05-11 20:44:26] [INFO ] Deduced a trap composed of 122 places in 91 ms of which 0 ms to minimize.
[2021-05-11 20:44:26] [INFO ] Deduced a trap composed of 137 places in 95 ms of which 1 ms to minimize.
[2021-05-11 20:44:26] [INFO ] Deduced a trap composed of 118 places in 90 ms of which 2 ms to minimize.
[2021-05-11 20:44:27] [INFO ] Deduced a trap composed of 115 places in 88 ms of which 0 ms to minimize.
[2021-05-11 20:44:27] [INFO ] Deduced a trap composed of 134 places in 99 ms of which 0 ms to minimize.
[2021-05-11 20:44:27] [INFO ] Deduced a trap composed of 133 places in 92 ms of which 0 ms to minimize.
[2021-05-11 20:44:27] [INFO ] Deduced a trap composed of 122 places in 87 ms of which 0 ms to minimize.
[2021-05-11 20:44:27] [INFO ] Deduced a trap composed of 118 places in 86 ms of which 0 ms to minimize.
[2021-05-11 20:44:27] [INFO ] Deduced a trap composed of 132 places in 91 ms of which 1 ms to minimize.
[2021-05-11 20:44:27] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 1 ms to minimize.
[2021-05-11 20:44:27] [INFO ] Deduced a trap composed of 126 places in 87 ms of which 0 ms to minimize.
[2021-05-11 20:44:27] [INFO ] Deduced a trap composed of 119 places in 87 ms of which 1 ms to minimize.
[2021-05-11 20:44:28] [INFO ] Deduced a trap composed of 113 places in 91 ms of which 1 ms to minimize.
[2021-05-11 20:44:28] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 0 ms to minimize.
[2021-05-11 20:44:28] [INFO ] Deduced a trap composed of 127 places in 89 ms of which 1 ms to minimize.
[2021-05-11 20:44:28] [INFO ] Deduced a trap composed of 133 places in 85 ms of which 0 ms to minimize.
[2021-05-11 20:44:28] [INFO ] Deduced a trap composed of 128 places in 88 ms of which 1 ms to minimize.
[2021-05-11 20:44:28] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 1 ms to minimize.
[2021-05-11 20:44:28] [INFO ] Deduced a trap composed of 134 places in 114 ms of which 0 ms to minimize.
[2021-05-11 20:44:28] [INFO ] Deduced a trap composed of 136 places in 89 ms of which 0 ms to minimize.
[2021-05-11 20:44:28] [INFO ] Deduced a trap composed of 135 places in 92 ms of which 1 ms to minimize.
[2021-05-11 20:44:29] [INFO ] Deduced a trap composed of 131 places in 88 ms of which 0 ms to minimize.
[2021-05-11 20:44:29] [INFO ] Deduced a trap composed of 134 places in 122 ms of which 0 ms to minimize.
[2021-05-11 20:44:29] [INFO ] Deduced a trap composed of 138 places in 145 ms of which 1 ms to minimize.
[2021-05-11 20:44:29] [INFO ] Deduced a trap composed of 141 places in 98 ms of which 1 ms to minimize.
[2021-05-11 20:44:29] [INFO ] Deduced a trap composed of 143 places in 97 ms of which 1 ms to minimize.
[2021-05-11 20:44:29] [INFO ] Deduced a trap composed of 131 places in 104 ms of which 0 ms to minimize.
[2021-05-11 20:44:29] [INFO ] Deduced a trap composed of 133 places in 114 ms of which 0 ms to minimize.
[2021-05-11 20:44:30] [INFO ] Deduced a trap composed of 130 places in 120 ms of which 1 ms to minimize.
[2021-05-11 20:44:30] [INFO ] Deduced a trap composed of 144 places in 108 ms of which 1 ms to minimize.
[2021-05-11 20:44:30] [INFO ] Deduced a trap composed of 125 places in 109 ms of which 1 ms to minimize.
[2021-05-11 20:44:30] [INFO ] Deduced a trap composed of 124 places in 109 ms of which 1 ms to minimize.
[2021-05-11 20:44:30] [INFO ] Deduced a trap composed of 118 places in 123 ms of which 0 ms to minimize.
[2021-05-11 20:44:30] [INFO ] Deduced a trap composed of 143 places in 101 ms of which 0 ms to minimize.
[2021-05-11 20:44:30] [INFO ] Deduced a trap composed of 133 places in 100 ms of which 0 ms to minimize.
[2021-05-11 20:44:31] [INFO ] Deduced a trap composed of 118 places in 101 ms of which 1 ms to minimize.
[2021-05-11 20:44:31] [INFO ] Deduced a trap composed of 117 places in 114 ms of which 0 ms to minimize.
[2021-05-11 20:44:31] [INFO ] Deduced a trap composed of 119 places in 110 ms of which 1 ms to minimize.
[2021-05-11 20:44:31] [INFO ] Deduced a trap composed of 122 places in 130 ms of which 0 ms to minimize.
[2021-05-11 20:44:31] [INFO ] Deduced a trap composed of 122 places in 101 ms of which 0 ms to minimize.
[2021-05-11 20:44:31] [INFO ] Deduced a trap composed of 118 places in 103 ms of which 1 ms to minimize.
[2021-05-11 20:44:31] [INFO ] Deduced a trap composed of 114 places in 107 ms of which 0 ms to minimize.
[2021-05-11 20:44:31] [INFO ] Deduced a trap composed of 116 places in 110 ms of which 1 ms to minimize.
[2021-05-11 20:44:32] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 1 ms to minimize.
[2021-05-11 20:44:32] [INFO ] Deduced a trap composed of 121 places in 89 ms of which 1 ms to minimize.
[2021-05-11 20:44:32] [INFO ] Deduced a trap composed of 121 places in 115 ms of which 1 ms to minimize.
[2021-05-11 20:44:32] [INFO ] Deduced a trap composed of 118 places in 87 ms of which 1 ms to minimize.
[2021-05-11 20:44:32] [INFO ] Deduced a trap composed of 120 places in 109 ms of which 1 ms to minimize.
[2021-05-11 20:44:32] [INFO ] Deduced a trap composed of 123 places in 111 ms of which 0 ms to minimize.
[2021-05-11 20:44:32] [INFO ] Deduced a trap composed of 125 places in 101 ms of which 0 ms to minimize.
[2021-05-11 20:44:33] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 1 ms to minimize.
[2021-05-11 20:44:33] [INFO ] Deduced a trap composed of 133 places in 97 ms of which 0 ms to minimize.
[2021-05-11 20:44:33] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 0 ms to minimize.
[2021-05-11 20:44:33] [INFO ] Deduced a trap composed of 119 places in 114 ms of which 0 ms to minimize.
[2021-05-11 20:44:33] [INFO ] Deduced a trap composed of 123 places in 88 ms of which 1 ms to minimize.
[2021-05-11 20:44:33] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 0 ms to minimize.
[2021-05-11 20:44:33] [INFO ] Deduced a trap composed of 141 places in 100 ms of which 0 ms to minimize.
[2021-05-11 20:44:33] [INFO ] Deduced a trap composed of 135 places in 122 ms of which 0 ms to minimize.
[2021-05-11 20:44:34] [INFO ] Deduced a trap composed of 139 places in 98 ms of which 0 ms to minimize.
[2021-05-11 20:44:34] [INFO ] Deduced a trap composed of 133 places in 124 ms of which 0 ms to minimize.
[2021-05-11 20:44:34] [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:44:34] [INFO ] [Real]Absence check using 65 positive place invariants in 22 ms returned sat
[2021-05-11 20:44:34] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 12 ms returned sat
[2021-05-11 20:44:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:34] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2021-05-11 20:44:34] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 0 ms to minimize.
[2021-05-11 20:44:34] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 0 ms to minimize.
[2021-05-11 20:44:34] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 0 ms to minimize.
[2021-05-11 20:44:34] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 0 ms to minimize.
[2021-05-11 20:44:35] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 0 ms to minimize.
[2021-05-11 20:44:35] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2021-05-11 20:44:35] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 0 ms to minimize.
[2021-05-11 20:44:35] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 0 ms to minimize.
[2021-05-11 20:44:35] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 0 ms to minimize.
[2021-05-11 20:44:35] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2021-05-11 20:44:35] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 0 ms to minimize.
[2021-05-11 20:44:35] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2021-05-11 20:44:35] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1216 ms
[2021-05-11 20:44:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:44:35] [INFO ] [Nat]Absence check using 65 positive place invariants in 28 ms returned sat
[2021-05-11 20:44:35] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 11 ms returned sat
[2021-05-11 20:44:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:36] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2021-05-11 20:44:36] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 0 ms to minimize.
[2021-05-11 20:44:36] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 1 ms to minimize.
[2021-05-11 20:44:36] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 0 ms to minimize.
[2021-05-11 20:44:36] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 1 ms to minimize.
[2021-05-11 20:44:36] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 0 ms to minimize.
[2021-05-11 20:44:36] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 1 ms to minimize.
[2021-05-11 20:44:37] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 0 ms to minimize.
[2021-05-11 20:44:37] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 0 ms to minimize.
[2021-05-11 20:44:37] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 0 ms to minimize.
[2021-05-11 20:44:37] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 1 ms to minimize.
[2021-05-11 20:44:37] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 0 ms to minimize.
[2021-05-11 20:44:37] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 1 ms to minimize.
[2021-05-11 20:44:37] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 0 ms to minimize.
[2021-05-11 20:44:38] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 1 ms to minimize.
[2021-05-11 20:44:38] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 1 ms to minimize.
[2021-05-11 20:44:38] [INFO ] Deduced a trap composed of 132 places in 117 ms of which 1 ms to minimize.
[2021-05-11 20:44:38] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 0 ms to minimize.
[2021-05-11 20:44:38] [INFO ] Deduced a trap composed of 132 places in 108 ms of which 0 ms to minimize.
[2021-05-11 20:44:38] [INFO ] Deduced a trap composed of 139 places in 140 ms of which 1 ms to minimize.
[2021-05-11 20:44:38] [INFO ] Deduced a trap composed of 151 places in 132 ms of which 0 ms to minimize.
[2021-05-11 20:44:39] [INFO ] Deduced a trap composed of 124 places in 146 ms of which 1 ms to minimize.
[2021-05-11 20:44:39] [INFO ] Deduced a trap composed of 129 places in 121 ms of which 1 ms to minimize.
[2021-05-11 20:44:39] [INFO ] Deduced a trap composed of 163 places in 129 ms of which 0 ms to minimize.
[2021-05-11 20:44:39] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 0 ms to minimize.
[2021-05-11 20:44:39] [INFO ] Deduced a trap composed of 134 places in 129 ms of which 0 ms to minimize.
[2021-05-11 20:44:39] [INFO ] Deduced a trap composed of 126 places in 124 ms of which 0 ms to minimize.
[2021-05-11 20:44:40] [INFO ] Deduced a trap composed of 134 places in 120 ms of which 0 ms to minimize.
[2021-05-11 20:44:40] [INFO ] Deduced a trap composed of 129 places in 108 ms of which 1 ms to minimize.
[2021-05-11 20:44:40] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 1 ms to minimize.
[2021-05-11 20:44:40] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 0 ms to minimize.
[2021-05-11 20:44:40] [INFO ] Deduced a trap composed of 163 places in 118 ms of which 0 ms to minimize.
[2021-05-11 20:44:40] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 4485 ms
[2021-05-11 20:44:40] [INFO ] Computed and/alt/rep : 544/884/544 causal constraints (skipped 39 transitions) in 43 ms.
[2021-05-11 20:44:43] [INFO ] Deduced a trap composed of 135 places in 167 ms of which 1 ms to minimize.
[2021-05-11 20:44:43] [INFO ] Deduced a trap composed of 148 places in 147 ms of which 0 ms to minimize.
[2021-05-11 20:44:43] [INFO ] Deduced a trap composed of 139 places in 129 ms of which 0 ms to minimize.
[2021-05-11 20:44:43] [INFO ] Deduced a trap composed of 138 places in 139 ms of which 1 ms to minimize.
[2021-05-11 20:44:44] [INFO ] Deduced a trap composed of 136 places in 129 ms of which 1 ms to minimize.
[2021-05-11 20:44:44] [INFO ] Deduced a trap composed of 143 places in 170 ms of which 0 ms to minimize.
[2021-05-11 20:44:44] [INFO ] Deduced a trap composed of 139 places in 152 ms of which 1 ms to minimize.
[2021-05-11 20:44:44] [INFO ] Deduced a trap composed of 129 places in 137 ms of which 1 ms to minimize.
[2021-05-11 20:44:44] [INFO ] Deduced a trap composed of 141 places in 152 ms of which 1 ms to minimize.
[2021-05-11 20:44:45] [INFO ] Deduced a trap composed of 144 places in 164 ms of which 0 ms to minimize.
[2021-05-11 20:44:45] [INFO ] Deduced a trap composed of 153 places in 128 ms of which 1 ms to minimize.
[2021-05-11 20:44:45] [INFO ] Deduced a trap composed of 127 places in 160 ms of which 1 ms to minimize.
[2021-05-11 20:44:45] [INFO ] Deduced a trap composed of 143 places in 159 ms of which 0 ms to minimize.
[2021-05-11 20:44:45] [INFO ] Deduced a trap composed of 133 places in 138 ms of which 1 ms to minimize.
[2021-05-11 20:44:46] [INFO ] Deduced a trap composed of 136 places in 151 ms of which 1 ms to minimize.
[2021-05-11 20:44:46] [INFO ] Deduced a trap composed of 138 places in 178 ms of which 0 ms to minimize.
[2021-05-11 20:44:46] [INFO ] Deduced a trap composed of 136 places in 139 ms of which 1 ms to minimize.
[2021-05-11 20:44:46] [INFO ] Deduced a trap composed of 141 places in 149 ms of which 1 ms to minimize.
[2021-05-11 20:44:46] [INFO ] Deduced a trap composed of 157 places in 130 ms of which 0 ms to minimize.
[2021-05-11 20:44:47] [INFO ] Deduced a trap composed of 144 places in 144 ms of which 1 ms to minimize.
[2021-05-11 20:44:47] [INFO ] Deduced a trap composed of 168 places in 158 ms of which 0 ms to minimize.
[2021-05-11 20:44:47] [INFO ] Deduced a trap composed of 163 places in 150 ms of which 0 ms to minimize.
[2021-05-11 20:44:47] [INFO ] Deduced a trap composed of 138 places in 139 ms of which 1 ms to minimize.
[2021-05-11 20:44:47] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4632 ms
[2021-05-11 20:44:48] [INFO ] Added : 363 causal constraints over 74 iterations in 7406 ms. Result :sat
[2021-05-11 20:44:48] [INFO ] [Real]Absence check using 65 positive place invariants in 29 ms returned sat
[2021-05-11 20:44:48] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 13 ms returned sat
[2021-05-11 20:44:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:48] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2021-05-11 20:44:48] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 1 ms to minimize.
[2021-05-11 20:44:48] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 1 ms to minimize.
[2021-05-11 20:44:48] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 1 ms to minimize.
[2021-05-11 20:44:48] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
[2021-05-11 20:44:49] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 0 ms to minimize.
[2021-05-11 20:44:49] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2021-05-11 20:44:49] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2021-05-11 20:44:49] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 0 ms to minimize.
[2021-05-11 20:44:49] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 1 ms to minimize.
[2021-05-11 20:44:49] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 1 ms to minimize.
[2021-05-11 20:44:49] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2021-05-11 20:44:49] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1306 ms
[2021-05-11 20:44:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 20:44:49] [INFO ] [Nat]Absence check using 65 positive place invariants in 27 ms returned sat
[2021-05-11 20:44:49] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 12 ms returned sat
[2021-05-11 20:44:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:50] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2021-05-11 20:44:50] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2021-05-11 20:44:50] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2021-05-11 20:44:50] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 0 ms to minimize.
[2021-05-11 20:44:50] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 0 ms to minimize.
[2021-05-11 20:44:50] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2021-05-11 20:44:50] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 0 ms to minimize.
[2021-05-11 20:44:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 656 ms
[2021-05-11 20:44:50] [INFO ] Computed and/alt/rep : 544/884/544 causal constraints (skipped 39 transitions) in 32 ms.
[2021-05-11 20:44:53] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2021-05-11 20:44:53] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2021-05-11 20:44:53] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2021-05-11 20:44:53] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2021-05-11 20:44:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 402 ms
[2021-05-11 20:44:53] [INFO ] Added : 387 causal constraints over 78 iterations in 2876 ms. Result :sat
[2021-05-11 20:44:53] [INFO ] [Real]Absence check using 65 positive place invariants in 26 ms returned sat
[2021-05-11 20:44:53] [INFO ] [Real]Absence check using 65 positive and 41 generalized place invariants in 10 ms returned sat
[2021-05-11 20:44:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 20:44:54] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2021-05-11 20:44:54] [INFO ] Deduced a trap composed of 22 places in 181 ms of which 0 ms to minimize.
[2021-05-11 20:44:54] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 0 ms to minimize.
[2021-05-11 20:44:54] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 0 ms to minimize.
[2021-05-11 20:44:54] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 1 ms to minimize.
[2021-05-11 20:44:54] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 0 ms to minimize.
[2021-05-11 20:44:55] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 0 ms to minimize.
[2021-05-11 20:44:55] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 1 ms to minimize.
[2021-05-11 20:44:55] [INFO ] Deduced a trap composed of 123 places in 129 ms of which 0 ms to minimize.
[2021-05-11 20:44:55] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 1 ms to minimize.
[2021-05-11 20:44:55] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 0 ms to minimize.
[2021-05-11 20:44:55] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 0 ms to minimize.
[2021-05-11 20:44:56] [INFO ] Deduced a trap composed of 132 places in 122 ms of which 1 ms to minimize.
[2021-05-11 20:44:56] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 0 ms to minimize.
[2021-05-11 20:44:56] [INFO ] Deduced a trap composed of 50 places in 154 ms of which 1 ms to minimize.
[2021-05-11 20:44:56] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 0 ms to minimize.
[2021-05-11 20:44:56] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 1 ms to minimize.
[2021-05-11 20:44:56] [INFO ] Deduced a trap composed of 144 places in 111 ms of which 1 ms to minimize.
[2021-05-11 20:44:56] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 1 ms to minimize.
[2021-05-11 20:44:57] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 1 ms to minimize.
[2021-05-11 20:44:57] [INFO ] Deduced a trap composed of 134 places in 111 ms of which 0 ms to minimize.
[2021-05-11 20:44:57] [INFO ] Deduced a trap composed of 144 places in 119 ms of which 0 ms to minimize.
[2021-05-11 20:44:57] [INFO ] Deduced a trap composed of 137 places in 111 ms of which 1 ms to minimize.
[2021-05-11 20:44:57] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 1 ms to minimize.
[2021-05-11 20:44:57] [INFO ] Deduced a trap composed of 133 places in 110 ms of which 1 ms to minimize.
[2021-05-11 20:44:57] [INFO ] Deduced a trap composed of 136 places in 111 ms of which 0 ms to minimize.
[2021-05-11 20:44:57] [INFO ] Deduced a trap composed of 137 places in 109 ms of which 0 ms to minimize.
[2021-05-11 20:44:58] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 0 ms to minimize.
[2021-05-11 20:44:58] [INFO ] Deduced a trap composed of 136 places in 115 ms of which 1 ms to minimize.
[2021-05-11 20:44:58] [INFO ] Deduced a trap composed of 138 places in 131 ms of which 1 ms to minimize.
[2021-05-11 20:44:58] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 1 ms to minimize.
[2021-05-11 20:44:58] [INFO ] Deduced a trap composed of 137 places in 107 ms of which 0 ms to minimize.
[2021-05-11 20:44:58] [INFO ] Deduced a trap composed of 140 places in 110 ms of which 1 ms to minimize.
[2021-05-11 20:44:58] [INFO ] Deduced a trap composed of 133 places in 114 ms of which 1 ms to minimize.
[2021-05-11 20:44:59] [INFO ] Deduced a trap composed of 137 places in 146 ms of which 0 ms to minimize.
[2021-05-11 20:44:59] [INFO ] Deduced a trap composed of 131 places in 109 ms of which 0 ms to minimize.
[2021-05-11 20:44:59] [INFO ] Deduced a trap composed of 133 places in 108 ms of which 1 ms to minimize.
[2021-05-11 20:44:59] [INFO ] Deduced a trap composed of 131 places in 106 ms of which 0 ms to minimize.
[2021-05-11 20:44:59] [INFO ] Deduced a trap composed of 143 places in 107 ms of which 1 ms to minimize.
[2021-05-11 20:44:59] [INFO ] Deduced a trap composed of 141 places in 106 ms of which 1 ms to minimize.
[2021-05-11 20:44:59] [INFO ] Deduced a trap composed of 141 places in 112 ms of which 0 ms to minimize.
[2021-05-11 20:44:59] [INFO ] Deduced a trap composed of 133 places in 112 ms of which 0 ms to minimize.
[2021-05-11 20:45:00] [INFO ] Deduced a trap composed of 137 places in 110 ms of which 0 ms to minimize.
[2021-05-11 20:45:00] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 1 ms to minimize.
[2021-05-11 20:45:00] [INFO ] Deduced a trap composed of 137 places in 107 ms of which 0 ms to minimize.
[2021-05-11 20:45:00] [INFO ] Deduced a trap composed of 136 places in 106 ms of which 0 ms to minimize.
[2021-05-11 20:45:00] [INFO ] Deduced a trap composed of 137 places in 106 ms of which 0 ms to minimize.
[2021-05-11 20:45:00] [INFO ] Deduced a trap composed of 139 places in 135 ms of which 1 ms to minimize.
[2021-05-11 20:45:00] [INFO ] Deduced a trap composed of 136 places in 116 ms of which 1 ms to minimize.
[2021-05-11 20:45:01] [INFO ] Deduced a trap composed of 134 places in 120 ms of which 0 ms to minimize.
[2021-05-11 20:45:01] [INFO ] Deduced a trap composed of 134 places in 140 ms of which 1 ms to minimize.
[2021-05-11 20:45:01] [INFO ] Deduced a trap composed of 144 places in 136 ms of which 0 ms to minimize.
[2021-05-11 20:45:01] [INFO ] Deduced a trap composed of 136 places in 125 ms of which 1 ms to minimize.
[2021-05-11 20:45:01] [INFO ] Deduced a trap composed of 59 places in 176 ms of which 1 ms to minimize.
[2021-05-11 20:45:01] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 0 ms to minimize.
[2021-05-11 20:45:02] [INFO ] Deduced a trap composed of 143 places in 133 ms of which 1 ms to minimize.
[2021-05-11 20:45:02] [INFO ] Deduced a trap composed of 135 places in 113 ms of which 0 ms to minimize.
[2021-05-11 20:45:02] [INFO ] Deduced a trap composed of 132 places in 132 ms of which 1 ms to minimize.
[2021-05-11 20:45:02] [INFO ] Deduced a trap composed of 124 places in 118 ms of which 0 ms to minimize.
[2021-05-11 20:45:02] [INFO ] Deduced a trap composed of 140 places in 116 ms of which 0 ms to minimize.
[2021-05-11 20:45:02] [INFO ] Deduced a trap composed of 141 places in 112 ms of which 0 ms to minimize.
[2021-05-11 20:45:02] [INFO ] Deduced a trap composed of 136 places in 131 ms of which 1 ms to minimize.
[2021-05-11 20:45:03] [INFO ] Deduced a trap composed of 142 places in 141 ms of which 1 ms to minimize.
[2021-05-11 20:45:03] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 0 ms to minimize.
[2021-05-11 20:45:03] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 1 ms to minimize.
[2021-05-11 20:45:03] [INFO ] Deduced a trap composed of 125 places in 107 ms of which 1 ms to minimize.
[2021-05-11 20:45:03] [INFO ] Deduced a trap composed of 133 places in 106 ms of which 1 ms to minimize.
[2021-05-11 20:45:03] [INFO ] Deduced a trap composed of 129 places in 104 ms of which 1 ms to minimize.
[2021-05-11 20:45:03] [INFO ] Deduced a trap composed of 128 places in 124 ms of which 1 ms to minimize.
[2021-05-11 20:45:03] [INFO ] Deduced a trap composed of 125 places in 112 ms of which 0 ms to minimize.
[2021-05-11 20:45:04] [INFO ] Deduced a trap composed of 130 places in 114 ms of which 1 ms to minimize.
[2021-05-11 20:45:04] [INFO ] Deduced a trap composed of 127 places in 104 ms of which 0 ms to minimize.
[2021-05-11 20:45:04] [INFO ] Deduced a trap composed of 134 places in 103 ms of which 0 ms to minimize.
[2021-05-11 20:45:04] [INFO ] Deduced a trap composed of 130 places in 116 ms of which 1 ms to minimize.
[2021-05-11 20:45:04] [INFO ] Deduced a trap composed of 131 places in 104 ms of which 1 ms to minimize.
[2021-05-11 20:45:04] [INFO ] Deduced a trap composed of 130 places in 101 ms of which 1 ms to minimize.
[2021-05-11 20:45:04] [INFO ] Deduced a trap composed of 130 places in 103 ms of which 0 ms to minimize.
[2021-05-11 20:45:05] [INFO ] Deduced a trap composed of 125 places in 103 ms of which 0 ms to minimize.
[2021-05-11 20:45:05] [INFO ] Deduced a trap composed of 137 places in 107 ms of which 1 ms to minimize.
[2021-05-11 20:45:05] [INFO ] Deduced a trap composed of 138 places in 107 ms of which 1 ms to minimize.
[2021-05-11 20:45:05] [INFO ] Deduced a trap composed of 137 places in 104 ms of which 1 ms to minimize.
[2021-05-11 20:45:05] [INFO ] Deduced a trap composed of 132 places in 102 ms of which 0 ms to minimize.
[2021-05-11 20:45:05] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 1 ms to minimize.
[2021-05-11 20:45:05] [INFO ] Deduced a trap composed of 135 places in 107 ms of which 0 ms to minimize.
[2021-05-11 20:45:05] [INFO ] Deduced a trap composed of 132 places in 104 ms of which 1 ms to minimize.
[2021-05-11 20:45:06] [INFO ] Deduced a trap composed of 139 places in 102 ms of which 0 ms to minimize.
[2021-05-11 20:45:06] [INFO ] Deduced a trap composed of 126 places in 101 ms of which 1 ms to minimize.
[2021-05-11 20:45:06] [INFO ] Deduced a trap composed of 146 places in 109 ms of which 0 ms to minimize.
[2021-05-11 20:45:06] [INFO ] Deduced a trap composed of 142 places in 106 ms of which 0 ms to minimize.
[2021-05-11 20:45:06] [INFO ] Deduced a trap composed of 149 places in 117 ms of which 1 ms to minimize.
[2021-05-11 20:45:06] [INFO ] Deduced a trap composed of 139 places in 108 ms of which 0 ms to minimize.
[2021-05-11 20:45:06] [INFO ] Deduced a trap composed of 134 places in 96 ms of which 1 ms to minimize.
[2021-05-11 20:45:06] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 0 ms to minimize.
[2021-05-11 20:45:07] [INFO ] Deduced a trap composed of 136 places in 85 ms of which 0 ms to minimize.
[2021-05-11 20:45:07] [INFO ] Deduced a trap composed of 130 places in 86 ms of which 0 ms to minimize.
[2021-05-11 20:45:07] [INFO ] Deduced a trap composed of 129 places in 91 ms of which 0 ms to minimize.
[2021-05-11 20:45:07] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 0 ms to minimize.
[2021-05-11 20:45:07] [INFO ] Deduced a trap composed of 140 places in 86 ms of which 0 ms to minimize.
[2021-05-11 20:45:07] [INFO ] Deduced a trap composed of 134 places in 87 ms of which 1 ms to minimize.
[2021-05-11 20:45:07] [INFO ] Deduced a trap composed of 143 places in 96 ms of which 0 ms to minimize.
[2021-05-11 20:45:07] [INFO ] Deduced a trap composed of 130 places in 91 ms of which 1 ms to minimize.
[2021-05-11 20:45:07] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 0 ms to minimize.
[2021-05-11 20:45:08] [INFO ] Deduced a trap composed of 141 places in 94 ms of which 0 ms to minimize.
[2021-05-11 20:45:08] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 1 ms to minimize.
[2021-05-11 20:45:08] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 1 ms to minimize.
[2021-05-11 20:45:08] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 1 ms to minimize.
[2021-05-11 20:45:08] [INFO ] Deduced a trap composed of 137 places in 106 ms of which 0 ms to minimize.
[2021-05-11 20:45:08] [INFO ] Deduced a trap composed of 131 places in 101 ms of which 0 ms to minimize.
[2021-05-11 20:45:08] [INFO ] Deduced a trap composed of 136 places in 112 ms of which 1 ms to minimize.
[2021-05-11 20:45:08] [INFO ] Deduced a trap composed of 143 places in 121 ms of which 0 ms to minimize.
[2021-05-11 20:45:09] [INFO ] Deduced a trap composed of 134 places in 119 ms of which 0 ms to minimize.
[2021-05-11 20:45:09] [INFO ] Deduced a trap composed of 140 places in 117 ms of which 1 ms to minimize.
[2021-05-11 20:45:09] [INFO ] Deduced a trap composed of 127 places in 129 ms of which 13 ms to minimize.
[2021-05-11 20:45:09] [INFO ] Deduced a trap composed of 140 places in 113 ms of which 0 ms to minimize.
[2021-05-11 20:45:09] [INFO ] Deduced a trap composed of 142 places in 114 ms of which 0 ms to minimize.
[2021-05-11 20:45:09] [INFO ] Deduced a trap composed of 136 places in 101 ms of which 0 ms to minimize.
[2021-05-11 20:45:09] [INFO ] Deduced a trap composed of 142 places in 101 ms of which 0 ms to minimize.
[2021-05-11 20:45:09] [INFO ] Deduced a trap composed of 128 places in 94 ms of which 1 ms to minimize.
[2021-05-11 20:45:10] [INFO ] Deduced a trap composed of 147 places in 96 ms of which 1 ms to minimize.
[2021-05-11 20:45:10] [INFO ] Deduced a trap composed of 140 places in 92 ms of which 1 ms to minimize.
[2021-05-11 20:45:10] [INFO ] Deduced a trap composed of 130 places in 95 ms of which 0 ms to minimize.
[2021-05-11 20:45:10] [INFO ] Deduced a trap composed of 150 places in 96 ms of which 0 ms to minimize.
[2021-05-11 20:45:10] [INFO ] Deduced a trap composed of 138 places in 95 ms of which 1 ms to minimize.
[2021-05-11 20:45:10] [INFO ] Deduced a trap composed of 142 places in 98 ms of which 1 ms to minimize.
[2021-05-11 20:45:10] [INFO ] Deduced a trap composed of 136 places in 86 ms of which 0 ms to minimize.
[2021-05-11 20:45:10] [INFO ] Deduced a trap composed of 143 places in 88 ms of which 0 ms to minimize.
[2021-05-11 20:45:11] [INFO ] Deduced a trap composed of 139 places in 92 ms of which 1 ms to minimize.
[2021-05-11 20:45:11] [INFO ] Deduced a trap composed of 159 places in 95 ms of which 1 ms to minimize.
[2021-05-11 20:45:11] [INFO ] Deduced a trap composed of 131 places in 95 ms of which 1 ms to minimize.
[2021-05-11 20:45:11] [INFO ] Deduced a trap composed of 134 places in 92 ms of which 0 ms to minimize.
[2021-05-11 20:45:11] [INFO ] Deduced a trap composed of 141 places in 100 ms of which 1 ms to minimize.
[2021-05-11 20:45:11] [INFO ] Deduced a trap composed of 140 places in 98 ms of which 1 ms to minimize.
[2021-05-11 20:45:11] [INFO ] Deduced a trap composed of 138 places in 89 ms of which 0 ms to minimize.
[2021-05-11 20:45:11] [INFO ] Deduced a trap composed of 138 places in 94 ms of which 1 ms to minimize.
[2021-05-11 20:45:11] [INFO ] Deduced a trap composed of 134 places in 94 ms of which 0 ms to minimize.
[2021-05-11 20:45:12] [INFO ] Deduced a trap composed of 136 places in 92 ms of which 1 ms to minimize.
[2021-05-11 20:45:12] [INFO ] Deduced a trap composed of 142 places in 91 ms of which 1 ms to minimize.
[2021-05-11 20:45:12] [INFO ] Deduced a trap composed of 132 places in 113 ms of which 0 ms to minimize.
[2021-05-11 20:45:12] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 7 ms to minimize.
[2021-05-11 20:45:12] [INFO ] Deduced a trap composed of 135 places in 96 ms of which 1 ms to minimize.
[2021-05-11 20:45:12] [INFO ] Deduced a trap composed of 148 places in 97 ms of which 1 ms to minimize.
[2021-05-11 20:45:12] [INFO ] Deduced a trap composed of 139 places in 95 ms of which 0 ms to minimize.
[2021-05-11 20:45:12] [INFO ] Deduced a trap composed of 132 places in 100 ms of which 1 ms to minimize.
[2021-05-11 20:45:13] [INFO ] Deduced a trap composed of 139 places in 95 ms of which 0 ms to minimize.
[2021-05-11 20:45:13] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 0 ms to minimize.
[2021-05-11 20:45:13] [INFO ] Deduced a trap composed of 131 places in 85 ms of which 1 ms to minimize.
[2021-05-11 20:45:13] [INFO ] Deduced a trap composed of 147 places in 126 ms of which 0 ms to minimize.
[2021-05-11 20:45:13] [INFO ] Deduced a trap composed of 132 places in 135 ms of which 0 ms to minimize.
[2021-05-11 20:45:13] [INFO ] Deduced a trap composed of 132 places in 139 ms of which 1 ms to minimize.
[2021-05-11 20:45:13] [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 7
Graph (trivial) has 367 edges and 651 vertex of which 7 / 651 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 133 place count 644 transition count 443
Reduce places removed 132 places and 0 transitions.
Iterating post reduction 1 with 132 rules applied. Total rules applied 265 place count 512 transition count 443
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 265 place count 512 transition count 340
Deduced a syphon composed of 103 places in 2 ms
Ensure Unique test removed 23 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 229 rules applied. Total rules applied 494 place count 386 transition count 340
Discarding 76 places :
Symmetric choice reduction at 2 with 76 rule applications. Total rules 570 place count 310 transition count 264
Ensure Unique test removed 1 places
Iterating global reduction 2 with 77 rules applied. Total rules applied 647 place count 309 transition count 264
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 647 place count 309 transition count 255
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 667 place count 298 transition count 255
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 668 place count 297 transition count 254
Iterating global reduction 2 with 1 rules applied. Total rules applied 669 place count 297 transition count 254
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 893 place count 185 transition count 142
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 2 with 2 rules applied. Total rules applied 895 place count 184 transition count 145
Applied a total of 895 rules in 94 ms. Remains 184 /651 variables (removed 467) and now considering 145/584 (removed 439) transitions.
[2021-05-11 20:45:13] [INFO ] Flatten gal took : 13 ms
[2021-05-11 20:45:13] [INFO ] Flatten gal took : 29 ms
[2021-05-11 20:45:13] [INFO ] Input system was already deterministic with 145 transitions.
[2021-05-11 20:45:14] [INFO ] Flatten gal took : 11 ms
[2021-05-11 20:45:14] [INFO ] Flatten gal took : 12 ms
[2021-05-11 20:45:14] [INFO ] Time to serialize gal into /tmp/CTLFireability18440919658671492167.gal : 7 ms
[2021-05-11 20:45:14] [INFO ] Time to serialize properties into /tmp/CTLFireability16325946454065696257.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/CTLFireability18440919658671492167.gal, -t, CGAL, -ctl, /tmp/CTLFireability16325946454065696257.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/CTLFireability18440919658671492167.gal -t CGAL -ctl /tmp/CTLFireability16325946454065696257.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,830978,1.35817,49236,2,17360,5,229768,6,0,880,102109,0


Converting to forward existential form...Done !
original formula: !(EF(((((p148==1)||(p511==1))||(p126==1))||(p549==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((((p148==1)||(p511==1))||(p126==1))||(p549==1)))] = FALSE
(forward)formula 0,0,1.37033,49236,1,0,7,229768,8,1,892,102109,1
FORMULA BusinessProcesses-PT-18-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Graph (trivial) has 362 edges and 651 vertex of which 7 / 651 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 644 transition count 447
Reduce places removed 128 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 129 rules applied. Total rules applied 258 place count 516 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 259 place count 515 transition count 446
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 259 place count 515 transition count 342
Deduced a syphon composed of 104 places in 2 ms
Ensure Unique test removed 23 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 231 rules applied. Total rules applied 490 place count 388 transition count 342
Discarding 75 places :
Symmetric choice reduction at 3 with 75 rule applications. Total rules 565 place count 313 transition count 267
Ensure Unique test removed 1 places
Iterating global reduction 3 with 76 rules applied. Total rules applied 641 place count 312 transition count 267
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 641 place count 312 transition count 258
Deduced a syphon composed of 9 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 661 place count 301 transition count 258
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 662 place count 300 transition count 257
Iterating global reduction 3 with 1 rules applied. Total rules applied 663 place count 300 transition count 257
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 226 rules applied. Total rules applied 889 place count 187 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 891 place count 186 transition count 147
Applied a total of 891 rules in 113 ms. Remains 186 /651 variables (removed 465) and now considering 147/584 (removed 437) transitions.
[2021-05-11 20:45:15] [INFO ] Flatten gal took : 16 ms
[2021-05-11 20:45:15] [INFO ] Flatten gal took : 17 ms
[2021-05-11 20:45:15] [INFO ] Input system was already deterministic with 147 transitions.
Finished random walk after 285 steps, including 48 resets, run visited all 1 properties in 6 ms. (steps per millisecond=47 )
FORMULA BusinessProcesses-PT-18-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Graph (trivial) has 340 edges and 651 vertex of which 6 / 651 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 123 place count 645 transition count 455
Reduce places removed 122 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 126 rules applied. Total rules applied 249 place count 523 transition count 451
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 253 place count 519 transition count 451
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 253 place count 519 transition count 353
Deduced a syphon composed of 98 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 217 rules applied. Total rules applied 470 place count 400 transition count 353
Discarding 65 places :
Symmetric choice reduction at 3 with 65 rule applications. Total rules 535 place count 335 transition count 288
Ensure Unique test removed 1 places
Iterating global reduction 3 with 66 rules applied. Total rules applied 601 place count 334 transition count 288
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 601 place count 334 transition count 283
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 612 place count 328 transition count 283
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 613 place count 327 transition count 282
Iterating global reduction 3 with 1 rules applied. Total rules applied 614 place count 327 transition count 282
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: 105
Deduced a syphon composed of 105 places in 1 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 824 place count 222 transition count 177
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 826 place count 221 transition count 180
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 827 place count 220 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 828 place count 219 transition count 179
Applied a total of 828 rules in 96 ms. Remains 219 /651 variables (removed 432) and now considering 179/584 (removed 405) transitions.
[2021-05-11 20:45:15] [INFO ] Flatten gal took : 18 ms
[2021-05-11 20:45:15] [INFO ] Flatten gal took : 16 ms
[2021-05-11 20:45:15] [INFO ] Input system was already deterministic with 179 transitions.
[2021-05-11 20:45:15] [INFO ] Flatten gal took : 13 ms
[2021-05-11 20:45:15] [INFO ] Flatten gal took : 12 ms
[2021-05-11 20:45:15] [INFO ] Time to serialize gal into /tmp/CTLFireability16956305381697380376.gal : 2 ms
[2021-05-11 20:45:15] [INFO ] Time to serialize properties into /tmp/CTLFireability15408620221698820883.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/CTLFireability16956305381697380376.gal, -t, CGAL, -ctl, /tmp/CTLFireability15408620221698820883.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/CTLFireability16956305381697380376.gal -t CGAL -ctl /tmp/CTLFireability15408620221698820883.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.9131e+07,2.15067,79380,2,11623,5,395646,6,0,1054,166072,0


Converting to forward existential form...Done !
original formula: !(EG(E((((((((EF(((p698==1)||(p654==1))) + (p16==1)) + (p19==1)) + (p320==1)) + (p196==1)) + (p75==1)) + (p172==1)) + (p109==1)) U (EG((((((((((p149==0)||(p413==0))||(p699==0))&&(p604==0))&&(((p170==0)||(p423==0))||(p693==0)))&&(p673==0))&&(p642==0))&&(p30==0))&&(((p139==0)||(p413==0))||(p602==0)))) * AF((((((((((((p406==1)||(p554==1))||(p522==1))||(p98==1))||((p146==1)&&(p609==1)))||(((p119==1)&&(p418==1))&&(p586==1)))||(p592==1))||(p577==1))||(p506==1))||(p661==1))&&((((p146==1)&&(p609==1))||(p481==1))||(p506==1))))))))
=> equivalent forward existential formula: [FwdG(Init,E((((((((E(TRUE U ((p698==1)||(p654==1))) + (p16==1)) + (p19==1)) + (p320==1)) + (p196==1)) + (p75==1)) + (p172==1)) + (p109==1)) U (EG((((((((((p149==0)||(p413==0))||(p699==0))&&(p604==0))&&(((p170==0)||(p423==0))||(p693==0)))&&(p673==0))&&(p642==0))&&(p30==0))&&(((p139==0)||(p413==0))||(p602==0)))) * !(EG(!((((((((((((p406==1)||(p554==1))||(p522==1))||(p98==1))||((p146==1)&&(p609==1)))||(((p119==1)&&(p418==1))&&(p586==1)))||(p592==1))||(p577==1))||(p506==1))||(p661==1))&&((((p146==1)&&(p609==1))||(p481==1))||(p506==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t6, t10, t12, t14, t19, t20, t21, t22, t29, t34, t42, t86, t88, t89, t90, t91, t96, t97, t98, t109, t128, t136, t139, t140, t141, t142, t143, t144, t148, t149, t164, t169, t170, t173, t174, t175, t176, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/102/41/179
Detected timeout of ITS tools.
[2021-05-11 20:45:45] [INFO ] Flatten gal took : 25 ms
[2021-05-11 20:45:45] [INFO ] Applying decomposition
[2021-05-11 20:45:45] [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/graph8019504249210570430.txt, -o, /tmp/graph8019504249210570430.bin, -w, /tmp/graph8019504249210570430.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/graph8019504249210570430.bin, -l, -1, -v, -w, /tmp/graph8019504249210570430.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 20:45:46] [INFO ] Decomposing Gal with order
[2021-05-11 20:45:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 20:45:46] [INFO ] Removed a total of 116 redundant transitions.
[2021-05-11 20:45:46] [INFO ] Flatten gal took : 49 ms
[2021-05-11 20:45:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 14 ms.
[2021-05-11 20:45:46] [INFO ] Time to serialize gal into /tmp/CTLFireability5607785600744698514.gal : 6 ms
[2021-05-11 20:45:46] [INFO ] Time to serialize properties into /tmp/CTLFireability11898255133945453235.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/CTLFireability5607785600744698514.gal, -t, CGAL, -ctl, /tmp/CTLFireability11898255133945453235.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/CTLFireability5607785600744698514.gal -t CGAL -ctl /tmp/CTLFireability11898255133945453235.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.9131e+07,0.509195,22488,770,675,33516,3799,686,68799,194,11788,0


Converting to forward existential form...Done !
original formula: !(EG(E((((((((EF(((u29.p698==1)||(i9.i3.u69.p654==1))) + (i1.i2.u0.p16==1)) + (i7.i1.u1.p19==1)) + (i2.i1.u15.p320==1)) + (i7.i1.u11.p196==1)) + (i2.i2.u3.p75==1)) + (u28.p172==1)) + (i8.i0.u7.p109==1)) U (EG((((((((((i4.u26.p149==0)||(i4.u26.p413==0))||(i4.u26.p699==0))&&(u28.p604==0))&&(((u28.p170==0)||(u28.p423==0))||(u28.p693==0)))&&(i9.i3.u69.p673==0))&&(i9.i3.u69.p642==0))&&(i2.i2.u4.p30==0))&&(((i4.u26.p139==0)||(i4.u26.p413==0))||(i4.u26.p602==0)))) * AF((((((((((((i3.i1.u25.p406==1)||(i9.i3.u52.p554==1))||(i9.i3.u69.p522==1))||(i3.i0.u5.p98==1))||((i4.u9.p146==1)&&(i4.u58.p609==1)))||(((i5.i0.u8.p119==1)&&(i5.i1.u27.p418==1))&&(i5.i0.u56.p586==1)))||(i9.i3.u69.p592==1))||(i9.i3.u69.p577==1))||(i9.i0.u45.p506==1))||(i9.i3.u65.p661==1))&&((((i4.u9.p146==1)&&(i4.u58.p609==1))||(i1.i3.u40.p481==1))||(i9.i0.u45.p506==1))))))))
=> equivalent forward existential formula: [FwdG(Init,E((((((((E(TRUE U ((u29.p698==1)||(i9.i3.u69.p654==1))) + (i1.i2.u0.p16==1)) + (i7.i1.u1.p19==1)) + (i2.i1.u15.p320==1)) + (i7.i1.u11.p196==1)) + (i2.i2.u3.p75==1)) + (u28.p172==1)) + (i8.i0.u7.p109==1)) U (EG((((((((((i4.u26.p149==0)||(i4.u26.p413==0))||(i4.u26.p699==0))&&(u28.p604==0))&&(((u28.p170==0)||(u28.p423==0))||(u28.p693==0)))&&(i9.i3.u69.p673==0))&&(i9.i3.u69.p642==0))&&(i2.i2.u4.p30==0))&&(((i4.u26.p139==0)||(i4.u26.p413==0))||(i4.u26.p602==0)))) * !(EG(!((((((((((((i3.i1.u25.p406==1)||(i9.i3.u52.p554==1))||(i9.i3.u69.p522==1))||(i3.i0.u5.p98==1))||((i4.u9.p146==1)&&(i4.u58.p609==1)))||(((i5.i0.u8.p119==1)&&(i5.i1.u27.p418==1))&&(i5.i0.u56.p586==1)))||(i9.i3.u69.p592==1))||(i9.i3.u69.p577==1))||(i9.i0.u45.p506==1))||(i9.i3.u65.p661==1))&&((((i4.u9.p146==1)&&(i4.u58.p609==1))||(i1.i3.u40.p481==1))||(i9.i0.u45.p506==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t42, t88, t89, t90, t91, t96, t97, t98, t109, t119, t128, t135, t139, t140, t141, t142, t143, t144, t148, t164, t174, t176, i1.i3.u40.t20, i2.i1.u15.t22, i2.i2.u4.t29, i3.i0.u5.t169, i3.i0.u5.t170, i3.i1.u25.t21, i7.i1.u11.t86, i9.t34, i9.i0.u45.t19, i9.i3.t2, i9.i3.t14, i9.i3.t136, i9.i3.u69.t0, i9.i3.u69.t3, i9.i3.u69.t4, i9.i3.u69.t10, i9.i3.u69.t12, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :26/99/40/165
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 an SCC at level 13
Fast SCC detection found a local SCC at level 3
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,11.8592,312212,1,0,681472,13195,3632,1.1677e+06,1810,98032,843510
FORMULA BusinessProcesses-PT-18-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Graph (trivial) has 364 edges and 651 vertex of which 7 / 651 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 644 transition count 445
Reduce places removed 130 places and 0 transitions.
Iterating post reduction 1 with 130 rules applied. Total rules applied 261 place count 514 transition count 445
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 107 Pre rules applied. Total rules applied 261 place count 514 transition count 338
Deduced a syphon composed of 107 places in 3 ms
Ensure Unique test removed 25 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 239 rules applied. Total rules applied 500 place count 382 transition count 338
Discarding 75 places :
Symmetric choice reduction at 2 with 75 rule applications. Total rules 575 place count 307 transition count 263
Ensure Unique test removed 1 places
Iterating global reduction 2 with 76 rules applied. Total rules applied 651 place count 306 transition count 263
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 651 place count 306 transition count 257
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 664 place count 299 transition count 257
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 665 place count 298 transition count 256
Iterating global reduction 2 with 1 rules applied. Total rules applied 666 place count 298 transition count 256
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 1 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 878 place count 192 transition count 150
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 2 with 2 rules applied. Total rules applied 880 place count 191 transition count 153
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 886 place count 191 transition count 153
Applied a total of 886 rules in 101 ms. Remains 191 /651 variables (removed 460) and now considering 153/584 (removed 431) transitions.
[2021-05-11 20:45:58] [INFO ] Flatten gal took : 11 ms
[2021-05-11 20:45:58] [INFO ] Flatten gal took : 11 ms
[2021-05-11 20:45:58] [INFO ] Input system was already deterministic with 153 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
FORMULA BusinessProcesses-PT-18-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2021-05-11 20:45:58] [INFO ] Flatten gal took : 25 ms
[2021-05-11 20:45:58] [INFO ] Flatten gal took : 25 ms
[2021-05-11 20:45:58] [INFO ] Applying decomposition
[2021-05-11 20:45:58] [INFO ] Flatten gal took : 24 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/graph17288449757736900638.txt, -o, /tmp/graph17288449757736900638.bin, -w, /tmp/graph17288449757736900638.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/graph17288449757736900638.bin, -l, -1, -v, -w, /tmp/graph17288449757736900638.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 20:45:58] [INFO ] Decomposing Gal with order
[2021-05-11 20:45:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 20:45:58] [INFO ] Removed a total of 280 redundant transitions.
[2021-05-11 20:45:58] [INFO ] Flatten gal took : 56 ms
[2021-05-11 20:45:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2021-05-11 20:45:58] [INFO ] Time to serialize gal into /tmp/CTLFireability9404080958129423946.gal : 17 ms
[2021-05-11 20:45:58] [INFO ] Time to serialize properties into /tmp/CTLFireability1542908749075869371.ctl : 7 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/CTLFireability9404080958129423946.gal, -t, CGAL, -ctl, /tmp/CTLFireability1542908749075869371.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/CTLFireability9404080958129423946.gal -t CGAL -ctl /tmp/CTLFireability1542908749075869371.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,3.06345e+31,43.9303,1100752,8650,142,1.81002e+06,2480,1455,4.00807e+06,97,9642,0


Converting to forward existential form...Done !
original formula: (!(E(((((((((i9.i1.u27.p67==0)&&(i8.i1.u135.p369==0))&&(((i18.i1.u97.p252==0)||(i5.i2.u183.p498==0))||(i5.i5.u241.p669==0)))&&(i12.i0.u150.p414==0))&&(i9.i2.u141.p380==0))&&(i1.i0.u48.p126==0))&&(i19.u196.p533==0))&&(i9.i1.u25.p62==0)) U EX(((((i13.i1.u161.p436==1)||(((i4.i1.u79.p201==1)&&(i15.i1.u172.p467==1))&&(i19.u194.p688==1)))||(((i12.i1.u58.p149==1)&&(i12.i0.u151.p413==1))&&(i12.i1.u220.p699==1)))||(i3.i1.u40.p88==1))))) * !(EG(((((((((((i7.i0.u123.p327==1)||(i13.i0.u225.p618==1))||(i19.u231.p637==1))||(i13.i0.u227.p622==1))||(i12.i0.u54.p138==1))||(i16.i1.u85.p219==1))||(i4.i3.u228.p624==1))||(i3.i2.u195.p530==1))||(((i2.i0.u19.p45==1)&&(i2.i2.u128.p343==1))&&(i2.i0.u200.p542==1)))||(i3.i2.u213.p642==1)))))
=> equivalent forward existential formula: ([(EY(FwdU(Init,((((((((i9.i1.u27.p67==0)&&(i8.i1.u135.p369==0))&&(((i18.i1.u97.p252==0)||(i5.i2.u183.p498==0))||(i5.i5.u241.p669==0)))&&(i12.i0.u150.p414==0))&&(i9.i2.u141.p380==0))&&(i1.i0.u48.p126==0))&&(i19.u196.p533==0))&&(i9.i1.u25.p62==0)))) * ((((i13.i1.u161.p436==1)||(((i4.i1.u79.p201==1)&&(i15.i1.u172.p467==1))&&(i19.u194.p688==1)))||(((i12.i1.u58.p149==1)&&(i12.i0.u151.p413==1))&&(i12.i1.u220.p699==1)))||(i3.i1.u40.p88==1)))] = FALSE * [FwdG(Init,((((((((((i7.i0.u123.p327==1)||(i13.i0.u225.p618==1))||(i19.u231.p637==1))||(i13.i0.u227.p622==1))||(i12.i0.u54.p138==1))||(i16.i1.u85.p219==1))||(i4.i3.u228.p624==1))||(i3.i2.u195.p530==1))||(((i2.i0.u19.p45==1)&&(i2.i2.u128.p343==1))&&(i2.i0.u200.p542==1)))||(i3.i2.u213.p642==1)))] = FALSE)
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 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
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 a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
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
(forward)formula 0,0,47.6531,1100752,1,0,1.81002e+06,3393,5800,4.00807e+06,397,19890,308799
FORMULA BusinessProcesses-PT-18-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(AX(((((i7.i0.u123.p328==0) * !(E(((i14.i3.u167.p451==1)||(((i4.i0.u76.p199==1)&&(i14.i1.u163.p443==1))&&(i4.i3.u228.p627==1))) U ((((i19.u199.p540==1)||(((i6.i1.u44.p113==1)&&(i11.i0.u147.p403==1))&&(i6.i0.u216.p582==1)))||(((i2.i0.u18.p42==1)&&(i7.i2.u130.p347==1))&&(i19.u194.p688==1)))||(i19.u212.p574==1))))) * (((i18.i0.u101.p263==1)||(i0.i1.u2.p4==1))||(i19.u194.p688==1))) * ((((((i16.i2.u174.p471==1)||(i19.u206.p557==1))||(i13.i0.u71.p186==1))||(i9.i2.u140.p381==1))||(i19.u209.p564==1))||(((i9.i1.u26.p61==1)&&(i9.i3.u143.p387==1))&&(i19.u194.p688==1))))) U EF(EG((((((((((AG(((((((i12.i0.u52.p167==1)&&(i12.i2.u157.p428==1))&&(i12.i2.u221.p708==1))||(i5.i4.u188.p509==1))||(i12.i0.u54.p137==1))||(i10.i0.u30.p77==1))) * (i1.i0.u68.p178==0)) * (i16.i0.u81.p209==0)) * (i8.i0.u22.p54==0)) * (i5.i4.u188.p509==0)) * (i19.u194.p688==0)) * (i14.i0.u116.p312==0)) * (((i12.i1.u55.p142==0)||(i12.i1.u154.p423==0))||(i12.i1.u249.p693==0))) * ((i12.i1.u57.p146==0)||(i12.i1.u223.p609==0))) * (((i12.i0.u52.p167==0)||(i12.i2.u157.p428==0))||(i12.i1.u222.p714==0))))))
=> equivalent forward existential formula: [FwdG(FwdU(FwdU(Init,!(EX(!(((((i7.i0.u123.p328==0) * !(E(((i14.i3.u167.p451==1)||(((i4.i0.u76.p199==1)&&(i14.i1.u163.p443==1))&&(i4.i3.u228.p627==1))) U ((((i19.u199.p540==1)||(((i6.i1.u44.p113==1)&&(i11.i0.u147.p403==1))&&(i6.i0.u216.p582==1)))||(((i2.i0.u18.p42==1)&&(i7.i2.u130.p347==1))&&(i19.u194.p688==1)))||(i19.u212.p574==1))))) * (((i18.i0.u101.p263==1)||(i0.i1.u2.p4==1))||(i19.u194.p688==1))) * ((((((i16.i2.u174.p471==1)||(i19.u206.p557==1))||(i13.i0.u71.p186==1))||(i9.i2.u140.p381==1))||(i19.u209.p564==1))||(((i9.i1.u26.p61==1)&&(i9.i3.u143.p387==1))&&(i19.u194.p688==1)))))))),TRUE),(((((((((!(E(TRUE U !(((((((i12.i0.u52.p167==1)&&(i12.i2.u157.p428==1))&&(i12.i2.u221.p708==1))||(i5.i4.u188.p509==1))||(i12.i0.u54.p137==1))||(i10.i0.u30.p77==1))))) * (i1.i0.u68.p178==0)) * (i16.i0.u81.p209==0)) * (i8.i0.u22.p54==0)) * (i5.i4.u188.p509==0)) * (i19.u194.p688==0)) * (i14.i0.u116.p312==0)) * (((i12.i1.u55.p142==0)||(i12.i1.u154.p423==0))||(i12.i1.u249.p693==0))) * ((i12.i1.u57.p146==0)||(i12.i1.u223.p609==0))) * (((i12.i0.u52.p167==0)||(i12.i2.u157.p428==0))||(i12.i1.u222.p714==0))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t409, t419, t423, t561, t567, i0.i0.u107.t268, i0.i1.u103.t278, i0.i2.u105.t271, i0.i4.t125, i0.i4.u191.t126, i1.i0.u47.t374, i1.i0.u68.t346, i1.i1.t192, i1.i1.u159.t193, i2.t429, i2.i0.u18.t432, i2.i1.t437, i2.i1.u16.t435, i2.i2.t259, i2.i2.u128.t260, i3.t394, i3.i0.t392, i3.i0.t396, i3.i1.t389, i3.i1.t400, i3.i2.u213.t14, i3.i2.u213.t18, i3.i2.u213.t29, i3.i2.u213.t31, i3.i2.u213.t37, i3.i2.u213.t52, i3.i2.u213.t55, i3.i2.u213.t75, i3.i2.u213.t83, i3.i2.u213.t87, i3.i2.u213.t101, i3.i2.u213.t115, i4.i0.t334, i4.i0.u76.t330, i4.i1.u75.t332, i4.i1.u79.t326, i4.i2.t328, i4.i2.u80.t324, i4.i3.t45, i4.i3.u228.t47, i5.i1.t149, i5.i1.u179.t150, i5.i2.t141, i5.i2.u183.t142, i5.i3.t137, i5.i3.u186.t138, i5.i4.t133, i5.i4.u187.t134, i5.i5.t20, i5.i5.u241.t24, i6.i0.u41.t386, i6.i0.u43.t382, i6.i0.u45.t378, i6.i1.t204, i6.i1.u152.t205, i7.i1.t263, i7.i1.u126.t264, i7.i2.t255, i7.i2.u130.t256, i7.i3.t248, i7.i3.u132.t249, i8.i0.t426, i8.i0.u20.t428, i8.i2.t238, i8.i2.u136.t239, i8.i3.t234, i8.i3.u139.t235, i9.t413, i9.i0.u23.t422, i9.i1.t418, i9.i1.u26.t416, i9.i2.t230, i9.i2.u140.t231, i9.i3.t226, i9.i3.u143.t227, i10.i0.t405, i10.i0.u28.t412, i10.i0.u30.t408, i10.i0.u32.t404, i10.i1.u146.t218, i10.i2.t222, i10.i2.u145.t223, i11.i0.u147.t215, i11.i1.t212, i11.i1.u148.t213, i12.t370, i12.t350, i12.t0, i12.i0.t208, i12.i0.t353, i12.i0.u49.t357, i12.i0.u49.t361, i12.i0.u151.t209, i12.i1.t1, i12.i1.t200, i12.i1.u55.t351, i12.i1.u154.t201, i12.i2.t196, i12.i2.u157.t197, i13.i0.u70.t342, i13.i0.u72.t338, i13.i1.t188, i13.i1.u161.t189, i14.i1.t184, i14.i1.u163.t185, i14.i2.t180, i14.i2.u164.t181, i14.i3.t176, i14.i3.u167.t177, i14.i4.t172, i14.i4.u168.t173, i14.i6.t168, i14.i6.u171.t169, i15.i0.u89.t306, i15.i1.t164, i15.i1.u172.t165, i16.i0.t318, i16.i0.t320, i16.i0.u81.t322, i16.i1.u85.t314, i16.i2.t160, i16.i2.u174.t161, i16.i3.t153, i16.i3.u176.t156, i16.i3.u177.t154, i17.i0.u87.t310, i17.i0.u91.t302, i17.i0.u93.t298, i17.i1.t145, i17.i1.u182.t146, i18.i0.u96.t292, i18.i0.u101.t282, i18.i1.t294, i18.i1.u97.t290, i18.i2.t286, i18.i2.u98.t288, i18.i3.t129, i18.i3.u190.t130, i19.t111, i19.t109, i19.t106, i19.t103, i19.t99, i19.t96, i19.t94, i19.t90, i19.t85, i19.t81, i19.t78, i19.t50, i19.t41, i19.t39, i19.t34, i19.t27, i19.t22, i19.t17, i19.t11, i19.u194.t59, i19.u194.t63, i19.u194.t67, i19.u194.t73, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :36/382/166/584
(forward)formula 1,0,172.872,2305576,1,0,3.86423e+06,5271,6362,8.45344e+06,306,34047,1591917
FORMULA BusinessProcesses-PT-18-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(E(AF(((!(AX((((((((((i19.u206.p556==1)||(i3.i2.u213.p654==1))||(i3.i2.u213.p604==1))||(i19.u244.p674==1))||(i12.i0.u54.p137==1))||(i10.i2.u144.p394==1))||(i14.i0.u116.p312==1))||(i12.i2.u56.p143==1))||(i12.i0.u151.p411==1)))) + (((((((((((((((((i8.i0.u20.p49==0)&&(i13.i0.u225.p618==0))&&((i12.i1.u57.p146==0)||(i12.i1.u223.p609==0)))&&(((i4.i2.u80.p206==0)||(i14.i4.u168.p458==0))||(i4.i1.u230.p634==0)))&&(((i12.i2.u50.p155==0)||(i12.i2.u157.p428==0))||(i12.i2.u221.p708==0)))&&(i17.i0.u91.p236==0))&&(i18.i0.u96.p251==0))&&(i16.i0.u81.p210==0))&&(i9.i1.u27.p67==0))&&(i9.i3.u142.p389==0))&&(i3.i2.u213.p589==0))&&(i1.i1.u158.p430==0))&&(i3.i2.u195.p530==0))&&(i10.i0.u208.p563==0))&&(((i4.i1.u75.p194==0)||(i14.i3.u167.p452==0))||(i19.u194.p688==0)))&&(i2.i2.u127.p344==0))&&(i19.u194.p596==0))) + !(AF((i6.i0.u42.p108==1))))) U ((((((i16.i1.u7.p16==1)||(i19.u197.p537==1))||(((i18.i2.u98.p254==1)&&(i7.i1.u126.p337==1))&&(i19.u194.p688==1)))||(i6.i0.u10.p25==1))||(((i18.i2.u100.p259==1)&&(i0.i4.u191.p518==1))&&(i18.i2.u245.p676==1)))||(i1.i0.u48.p127==1))))
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!(((!(!(EX(!((((((((((i19.u206.p556==1)||(i3.i2.u213.p654==1))||(i3.i2.u213.p604==1))||(i19.u244.p674==1))||(i12.i0.u54.p137==1))||(i10.i2.u144.p394==1))||(i14.i0.u116.p312==1))||(i12.i2.u56.p143==1))||(i12.i0.u151.p411==1)))))) + (((((((((((((((((i8.i0.u20.p49==0)&&(i13.i0.u225.p618==0))&&((i12.i1.u57.p146==0)||(i12.i1.u223.p609==0)))&&(((i4.i2.u80.p206==0)||(i14.i4.u168.p458==0))||(i4.i1.u230.p634==0)))&&(((i12.i2.u50.p155==0)||(i12.i2.u157.p428==0))||(i12.i2.u221.p708==0)))&&(i17.i0.u91.p236==0))&&(i18.i0.u96.p251==0))&&(i16.i0.u81.p210==0))&&(i9.i1.u27.p67==0))&&(i9.i3.u142.p389==0))&&(i3.i2.u213.p589==0))&&(i1.i1.u158.p430==0))&&(i3.i2.u195.p530==0))&&(i10.i0.u208.p563==0))&&(((i4.i1.u75.p194==0)||(i14.i3.u167.p452==0))||(i19.u194.p688==0)))&&(i2.i2.u127.p344==0))&&(i19.u194.p596==0))) + !(!(EG(!((i6.i0.u42.p108==1)))))))))) * ((((((i16.i1.u7.p16==1)||(i19.u197.p537==1))||(((i18.i2.u98.p254==1)&&(i7.i1.u126.p337==1))&&(i19.u194.p688==1)))||(i6.i0.u10.p25==1))||(((i18.i2.u100.p259==1)&&(i0.i4.u191.p518==1))&&(i18.i2.u245.p676==1)))||(i1.i0.u48.p127==1)))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 2,0,765.646,3765996,1,0,4.95471e+06,5271,4540,1.3876e+07,263,34047,1398940
FORMULA BusinessProcesses-PT-18-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
Detected timeout of ITS tools.
[2021-05-11 21:06:46] [INFO ] Applying decomposition
[2021-05-11 21:06:47] [INFO ] Flatten gal took : 35 ms
[2021-05-11 21:06:47] [INFO ] Decomposing Gal with order
[2021-05-11 21:06:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 21:06:47] [INFO ] Removed a total of 119 redundant transitions.
[2021-05-11 21:06:47] [INFO ] Flatten gal took : 77 ms
[2021-05-11 21:06:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 140 labels/synchronizations in 212 ms.
[2021-05-11 21:06:47] [INFO ] Time to serialize gal into /tmp/CTLFireability15633140436400652131.gal : 16 ms
[2021-05-11 21:06:47] [INFO ] Time to serialize properties into /tmp/CTLFireability10442493867492954046.ctl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability15633140436400652131.gal, -t, CGAL, -ctl, /tmp/CTLFireability10442493867492954046.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/CTLFireability15633140436400652131.gal -t CGAL -ctl /tmp/CTLFireability10442493867492954046.ctl
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.
Detected timeout of ITS tools.
[2021-05-11 21:27:38] [INFO ] Flatten gal took : 383 ms
[2021-05-11 21:27:39] [INFO ] Input system was already deterministic with 584 transitions.
[2021-05-11 21:27:39] [INFO ] Transformed 651 places.
[2021-05-11 21:27:39] [INFO ] Transformed 584 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:28:10] [INFO ] Time to serialize gal into /tmp/CTLFireability8456108830082340160.gal : 17 ms
[2021-05-11 21:28:10] [INFO ] Time to serialize properties into /tmp/CTLFireability1855050405760297422.ctl : 8 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/CTLFireability8456108830082340160.gal, -t, CGAL, -ctl, /tmp/CTLFireability1855050405760297422.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/CTLFireability8456108830082340160.gal -t CGAL -ctl /tmp/CTLFireability1855050405760297422.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 9 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-18"
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-18, 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-162038143900458"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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