Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r021-oct2-158897699200522.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699200522
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 3.6K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 131K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-10-00
FORMULA_NAME BusinessProcesses-PT-10-01
FORMULA_NAME BusinessProcesses-PT-10-02
FORMULA_NAME BusinessProcesses-PT-10-03
FORMULA_NAME BusinessProcesses-PT-10-04
FORMULA_NAME BusinessProcesses-PT-10-05
FORMULA_NAME BusinessProcesses-PT-10-06
FORMULA_NAME BusinessProcesses-PT-10-07
FORMULA_NAME BusinessProcesses-PT-10-08
FORMULA_NAME BusinessProcesses-PT-10-09
FORMULA_NAME BusinessProcesses-PT-10-10
FORMULA_NAME BusinessProcesses-PT-10-11
FORMULA_NAME BusinessProcesses-PT-10-12
FORMULA_NAME BusinessProcesses-PT-10-13
FORMULA_NAME BusinessProcesses-PT-10-14
FORMULA_NAME BusinessProcesses-PT-10-15

=== Now, execution of the tool begins

BK_START 1589251878505

[2020-05-12 02:51:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-12 02:51:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:51:21] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2020-05-12 02:51:21] [INFO ] Transformed 518 places.
[2020-05-12 02:51:21] [INFO ] Transformed 471 transitions.
[2020-05-12 02:51:21] [INFO ] Found NUPN structural information;
[2020-05-12 02:51:21] [INFO ] Parsed PT model containing 518 places and 471 transitions in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 52 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 821 resets, run finished after 303 ms. (steps per millisecond=330 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 471 rows 518 cols
[2020-05-12 02:51:21] [INFO ] Computed 85 place invariants in 26 ms
[2020-05-12 02:51:22] [INFO ] [Real]Absence check using 48 positive place invariants in 328 ms returned sat
[2020-05-12 02:51:22] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 272 ms returned sat
[2020-05-12 02:51:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:51:23] [INFO ] [Real]Absence check using state equation in 754 ms returned sat
[2020-05-12 02:51:23] [INFO ] Deduced a trap composed of 128 places in 394 ms
[2020-05-12 02:51:24] [INFO ] Deduced a trap composed of 10 places in 311 ms
[2020-05-12 02:51:24] [INFO ] Deduced a trap composed of 12 places in 185 ms
[2020-05-12 02:51:24] [INFO ] Deduced a trap composed of 17 places in 247 ms
[2020-05-12 02:51:25] [INFO ] Deduced a trap composed of 23 places in 334 ms
[2020-05-12 02:51:25] [INFO ] Deduced a trap composed of 16 places in 303 ms
[2020-05-12 02:51:26] [INFO ] Deduced a trap composed of 135 places in 1045 ms
[2020-05-12 02:51:26] [INFO ] Deduced a trap composed of 127 places in 436 ms
[2020-05-12 02:51:27] [INFO ] Deduced a trap composed of 23 places in 224 ms
[2020-05-12 02:51:27] [INFO ] Deduced a trap composed of 29 places in 230 ms
[2020-05-12 02:51:27] [INFO ] Deduced a trap composed of 22 places in 177 ms
[2020-05-12 02:51:27] [INFO ] Deduced a trap composed of 25 places in 164 ms
[2020-05-12 02:51:27] [INFO ] Deduced a trap composed of 109 places in 139 ms
[2020-05-12 02:51:28] [INFO ] Deduced a trap composed of 25 places in 154 ms
[2020-05-12 02:51:28] [INFO ] Deduced a trap composed of 121 places in 159 ms
[2020-05-12 02:51:28] [INFO ] Deduced a trap composed of 124 places in 180 ms
[2020-05-12 02:51:28] [INFO ] Deduced a trap composed of 23 places in 314 ms
[2020-05-12 02:51:29] [INFO ] Deduced a trap composed of 24 places in 234 ms
[2020-05-12 02:51:29] [INFO ] Deduced a trap composed of 129 places in 308 ms
[2020-05-12 02:51:29] [INFO ] Deduced a trap composed of 39 places in 121 ms
[2020-05-12 02:51:29] [INFO ] Deduced a trap composed of 111 places in 124 ms
[2020-05-12 02:51:29] [INFO ] Deduced a trap composed of 25 places in 126 ms
[2020-05-12 02:51:30] [INFO ] Deduced a trap composed of 119 places in 212 ms
[2020-05-12 02:51:30] [INFO ] Deduced a trap composed of 26 places in 158 ms
[2020-05-12 02:51:30] [INFO ] Deduced a trap composed of 114 places in 128 ms
[2020-05-12 02:51:30] [INFO ] Deduced a trap composed of 116 places in 219 ms
[2020-05-12 02:51:30] [INFO ] Deduced a trap composed of 113 places in 136 ms
[2020-05-12 02:51:31] [INFO ] Deduced a trap composed of 119 places in 135 ms
[2020-05-12 02:51:31] [INFO ] Deduced a trap composed of 32 places in 69 ms
[2020-05-12 02:51:31] [INFO ] Deduced a trap composed of 26 places in 94 ms
[2020-05-12 02:51:31] [INFO ] Deduced a trap composed of 33 places in 83 ms
[2020-05-12 02:51:31] [INFO ] Deduced a trap composed of 37 places in 79 ms
[2020-05-12 02:51:31] [INFO ] Deduced a trap composed of 38 places in 145 ms
[2020-05-12 02:51:31] [INFO ] Deduced a trap composed of 22 places in 143 ms
[2020-05-12 02:51:31] [INFO ] Deduced a trap composed of 32 places in 143 ms
[2020-05-12 02:51:32] [INFO ] Deduced a trap composed of 44 places in 283 ms
[2020-05-12 02:51:32] [INFO ] Deduced a trap composed of 51 places in 302 ms
[2020-05-12 02:51:32] [INFO ] Deduced a trap composed of 46 places in 140 ms
[2020-05-12 02:51:32] [INFO ] Deduced a trap composed of 110 places in 138 ms
[2020-05-12 02:51:33] [INFO ] Deduced a trap composed of 114 places in 123 ms
[2020-05-12 02:51:33] [INFO ] Deduced a trap composed of 28 places in 120 ms
[2020-05-12 02:51:33] [INFO ] Deduced a trap composed of 107 places in 127 ms
[2020-05-12 02:51:33] [INFO ] Deduced a trap composed of 119 places in 130 ms
[2020-05-12 02:51:33] [INFO ] Deduced a trap composed of 15 places in 128 ms
[2020-05-12 02:51:33] [INFO ] Deduced a trap composed of 105 places in 290 ms
[2020-05-12 02:51:34] [INFO ] Deduced a trap composed of 123 places in 146 ms
[2020-05-12 02:51:34] [INFO ] Deduced a trap composed of 33 places in 73 ms
[2020-05-12 02:51:34] [INFO ] Deduced a trap composed of 34 places in 71 ms
[2020-05-12 02:51:34] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 11047 ms
[2020-05-12 02:51:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:51:34] [INFO ] [Nat]Absence check using 48 positive place invariants in 43 ms returned sat
[2020-05-12 02:51:34] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 25 ms returned sat
[2020-05-12 02:51:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:51:35] [INFO ] [Nat]Absence check using state equation in 510 ms returned sat
[2020-05-12 02:51:35] [INFO ] Deduced a trap composed of 12 places in 168 ms
[2020-05-12 02:51:35] [INFO ] Deduced a trap composed of 125 places in 146 ms
[2020-05-12 02:51:35] [INFO ] Deduced a trap composed of 23 places in 144 ms
[2020-05-12 02:51:35] [INFO ] Deduced a trap composed of 127 places in 141 ms
[2020-05-12 02:51:35] [INFO ] Deduced a trap composed of 130 places in 144 ms
[2020-05-12 02:51:36] [INFO ] Deduced a trap composed of 24 places in 161 ms
[2020-05-12 02:51:36] [INFO ] Deduced a trap composed of 126 places in 145 ms
[2020-05-12 02:51:36] [INFO ] Deduced a trap composed of 18 places in 323 ms
[2020-05-12 02:51:36] [INFO ] Deduced a trap composed of 36 places in 318 ms
[2020-05-12 02:51:37] [INFO ] Deduced a trap composed of 22 places in 143 ms
[2020-05-12 02:51:37] [INFO ] Deduced a trap composed of 129 places in 140 ms
[2020-05-12 02:51:37] [INFO ] Deduced a trap composed of 38 places in 149 ms
[2020-05-12 02:51:37] [INFO ] Deduced a trap composed of 127 places in 139 ms
[2020-05-12 02:51:37] [INFO ] Deduced a trap composed of 24 places in 138 ms
[2020-05-12 02:51:37] [INFO ] Deduced a trap composed of 17 places in 134 ms
[2020-05-12 02:51:38] [INFO ] Deduced a trap composed of 126 places in 136 ms
[2020-05-12 02:51:38] [INFO ] Deduced a trap composed of 117 places in 136 ms
[2020-05-12 02:51:38] [INFO ] Deduced a trap composed of 134 places in 131 ms
[2020-05-12 02:51:38] [INFO ] Deduced a trap composed of 120 places in 124 ms
[2020-05-12 02:51:38] [INFO ] Deduced a trap composed of 26 places in 136 ms
[2020-05-12 02:51:38] [INFO ] Deduced a trap composed of 132 places in 135 ms
[2020-05-12 02:51:38] [INFO ] Deduced a trap composed of 126 places in 139 ms
[2020-05-12 02:51:39] [INFO ] Deduced a trap composed of 12 places in 140 ms
[2020-05-12 02:51:39] [INFO ] Deduced a trap composed of 29 places in 137 ms
[2020-05-12 02:51:39] [INFO ] Deduced a trap composed of 125 places in 132 ms
[2020-05-12 02:51:39] [INFO ] Deduced a trap composed of 123 places in 133 ms
[2020-05-12 02:51:39] [INFO ] Deduced a trap composed of 124 places in 128 ms
[2020-05-12 02:51:39] [INFO ] Deduced a trap composed of 9 places in 128 ms
[2020-05-12 02:51:40] [INFO ] Deduced a trap composed of 25 places in 126 ms
[2020-05-12 02:51:40] [INFO ] Deduced a trap composed of 135 places in 131 ms
[2020-05-12 02:51:40] [INFO ] Deduced a trap composed of 133 places in 129 ms
[2020-05-12 02:51:40] [INFO ] Deduced a trap composed of 44 places in 129 ms
[2020-05-12 02:51:40] [INFO ] Deduced a trap composed of 133 places in 124 ms
[2020-05-12 02:51:40] [INFO ] Deduced a trap composed of 38 places in 125 ms
[2020-05-12 02:51:40] [INFO ] Deduced a trap composed of 39 places in 126 ms
[2020-05-12 02:51:41] [INFO ] Deduced a trap composed of 32 places in 141 ms
[2020-05-12 02:51:41] [INFO ] Deduced a trap composed of 130 places in 129 ms
[2020-05-12 02:51:41] [INFO ] Deduced a trap composed of 39 places in 125 ms
[2020-05-12 02:51:41] [INFO ] Deduced a trap composed of 47 places in 150 ms
[2020-05-12 02:51:41] [INFO ] Deduced a trap composed of 15 places in 57 ms
[2020-05-12 02:51:41] [INFO ] Deduced a trap composed of 38 places in 57 ms
[2020-05-12 02:51:41] [INFO ] Deduced a trap composed of 21 places in 54 ms
[2020-05-12 02:51:41] [INFO ] Deduced a trap composed of 49 places in 47 ms
[2020-05-12 02:51:41] [INFO ] Deduced a trap composed of 47 places in 61 ms
[2020-05-12 02:51:42] [INFO ] Deduced a trap composed of 117 places in 156 ms
[2020-05-12 02:51:42] [INFO ] Deduced a trap composed of 124 places in 162 ms
[2020-05-12 02:51:42] [INFO ] Deduced a trap composed of 128 places in 136 ms
[2020-05-12 02:51:42] [INFO ] Deduced a trap composed of 122 places in 145 ms
[2020-05-12 02:51:42] [INFO ] Deduced a trap composed of 124 places in 150 ms
[2020-05-12 02:51:43] [INFO ] Deduced a trap composed of 123 places in 299 ms
[2020-05-12 02:51:43] [INFO ] Deduced a trap composed of 8 places in 145 ms
[2020-05-12 02:51:43] [INFO ] Deduced a trap composed of 121 places in 142 ms
[2020-05-12 02:51:43] [INFO ] Deduced a trap composed of 115 places in 138 ms
[2020-05-12 02:51:43] [INFO ] Deduced a trap composed of 122 places in 145 ms
[2020-05-12 02:51:43] [INFO ] Deduced a trap composed of 123 places in 127 ms
[2020-05-12 02:51:44] [INFO ] Deduced a trap composed of 114 places in 154 ms
[2020-05-12 02:51:44] [INFO ] Deduced a trap composed of 133 places in 128 ms
[2020-05-12 02:51:44] [INFO ] Deduced a trap composed of 122 places in 148 ms
[2020-05-12 02:51:44] [INFO ] Deduced a trap composed of 127 places in 148 ms
[2020-05-12 02:51:44] [INFO ] Deduced a trap composed of 111 places in 142 ms
[2020-05-12 02:51:44] [INFO ] Deduced a trap composed of 130 places in 143 ms
[2020-05-12 02:51:45] [INFO ] Deduced a trap composed of 118 places in 151 ms
[2020-05-12 02:51:45] [INFO ] Deduced a trap composed of 112 places in 143 ms
[2020-05-12 02:51:45] [INFO ] Deduced a trap composed of 131 places in 148 ms
[2020-05-12 02:51:45] [INFO ] Deduced a trap composed of 129 places in 141 ms
[2020-05-12 02:51:45] [INFO ] Deduced a trap composed of 115 places in 131 ms
[2020-05-12 02:51:45] [INFO ] Deduced a trap composed of 119 places in 132 ms
[2020-05-12 02:51:46] [INFO ] Deduced a trap composed of 30 places in 129 ms
[2020-05-12 02:51:46] [INFO ] Deduced a trap composed of 125 places in 131 ms
[2020-05-12 02:51:46] [INFO ] Deduced a trap composed of 128 places in 128 ms
[2020-05-12 02:51:46] [INFO ] Deduced a trap composed of 126 places in 125 ms
[2020-05-12 02:51:46] [INFO ] Deduced a trap composed of 116 places in 131 ms
[2020-05-12 02:51:46] [INFO ] Deduced a trap composed of 118 places in 130 ms
[2020-05-12 02:51:47] [INFO ] Deduced a trap composed of 26 places in 125 ms
[2020-05-12 02:51:47] [INFO ] Deduced a trap composed of 17 places in 129 ms
[2020-05-12 02:51:47] [INFO ] Deduced a trap composed of 132 places in 123 ms
[2020-05-12 02:51:47] [INFO ] Deduced a trap composed of 115 places in 126 ms
[2020-05-12 02:51:47] [INFO ] Deduced a trap composed of 125 places in 126 ms
[2020-05-12 02:51:47] [INFO ] Deduced a trap composed of 132 places in 123 ms
[2020-05-12 02:51:47] [INFO ] Deduced a trap composed of 21 places in 124 ms
[2020-05-12 02:51:48] [INFO ] Deduced a trap composed of 129 places in 129 ms
[2020-05-12 02:51:48] [INFO ] Deduced a trap composed of 125 places in 122 ms
[2020-05-12 02:51:48] [INFO ] Deduced a trap composed of 120 places in 126 ms
[2020-05-12 02:51:48] [INFO ] Deduced a trap composed of 137 places in 129 ms
[2020-05-12 02:51:48] [INFO ] Deduced a trap composed of 140 places in 125 ms
[2020-05-12 02:51:48] [INFO ] Trap strengthening (SAT) tested/added 86/85 trap constraints in 13734 ms
[2020-05-12 02:51:48] [INFO ] Computed and/alt/rep : 470/1893/470 causal constraints in 23 ms.
[2020-05-12 02:51:53] [INFO ] Added : 365 causal constraints over 74 iterations in 4688 ms. Result :sat
[2020-05-12 02:51:53] [INFO ] [Real]Absence check using 48 positive place invariants in 34 ms returned sat
[2020-05-12 02:51:53] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 18 ms returned sat
[2020-05-12 02:51:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:51:54] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2020-05-12 02:51:54] [INFO ] Deduced a trap composed of 12 places in 164 ms
[2020-05-12 02:51:54] [INFO ] Deduced a trap composed of 119 places in 144 ms
[2020-05-12 02:51:54] [INFO ] Deduced a trap composed of 16 places in 127 ms
[2020-05-12 02:51:54] [INFO ] Deduced a trap composed of 15 places in 129 ms
[2020-05-12 02:51:54] [INFO ] Deduced a trap composed of 113 places in 131 ms
[2020-05-12 02:51:55] [INFO ] Deduced a trap composed of 110 places in 128 ms
[2020-05-12 02:51:55] [INFO ] Deduced a trap composed of 115 places in 125 ms
[2020-05-12 02:51:55] [INFO ] Deduced a trap composed of 122 places in 123 ms
[2020-05-12 02:51:55] [INFO ] Deduced a trap composed of 26 places in 125 ms
[2020-05-12 02:51:55] [INFO ] Deduced a trap composed of 29 places in 120 ms
[2020-05-12 02:51:55] [INFO ] Deduced a trap composed of 26 places in 120 ms
[2020-05-12 02:51:55] [INFO ] Deduced a trap composed of 18 places in 117 ms
[2020-05-12 02:51:56] [INFO ] Deduced a trap composed of 120 places in 127 ms
[2020-05-12 02:51:56] [INFO ] Deduced a trap composed of 31 places in 117 ms
[2020-05-12 02:51:56] [INFO ] Deduced a trap composed of 112 places in 139 ms
[2020-05-12 02:51:56] [INFO ] Deduced a trap composed of 32 places in 136 ms
[2020-05-12 02:51:56] [INFO ] Deduced a trap composed of 39 places in 68 ms
[2020-05-12 02:51:56] [INFO ] Deduced a trap composed of 21 places in 64 ms
[2020-05-12 02:51:56] [INFO ] Deduced a trap composed of 24 places in 56 ms
[2020-05-12 02:51:56] [INFO ] Deduced a trap composed of 116 places in 148 ms
[2020-05-12 02:51:57] [INFO ] Deduced a trap composed of 113 places in 122 ms
[2020-05-12 02:51:57] [INFO ] Deduced a trap composed of 21 places in 134 ms
[2020-05-12 02:51:57] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3179 ms
[2020-05-12 02:51:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:51:57] [INFO ] [Nat]Absence check using 48 positive place invariants in 37 ms returned sat
[2020-05-12 02:51:57] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 20 ms returned sat
[2020-05-12 02:51:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:51:57] [INFO ] [Nat]Absence check using state equation in 542 ms returned sat
[2020-05-12 02:51:58] [INFO ] Deduced a trap composed of 128 places in 157 ms
[2020-05-12 02:51:58] [INFO ] Deduced a trap composed of 12 places in 155 ms
[2020-05-12 02:51:58] [INFO ] Deduced a trap composed of 128 places in 149 ms
[2020-05-12 02:51:58] [INFO ] Deduced a trap composed of 124 places in 138 ms
[2020-05-12 02:51:58] [INFO ] Deduced a trap composed of 16 places in 134 ms
[2020-05-12 02:51:58] [INFO ] Deduced a trap composed of 128 places in 129 ms
[2020-05-12 02:51:59] [INFO ] Deduced a trap composed of 123 places in 145 ms
[2020-05-12 02:51:59] [INFO ] Deduced a trap composed of 131 places in 146 ms
[2020-05-12 02:51:59] [INFO ] Deduced a trap composed of 18 places in 145 ms
[2020-05-12 02:51:59] [INFO ] Deduced a trap composed of 23 places in 133 ms
[2020-05-12 02:51:59] [INFO ] Deduced a trap composed of 123 places in 131 ms
[2020-05-12 02:51:59] [INFO ] Deduced a trap composed of 124 places in 131 ms
[2020-05-12 02:52:00] [INFO ] Deduced a trap composed of 133 places in 134 ms
[2020-05-12 02:52:00] [INFO ] Deduced a trap composed of 129 places in 136 ms
[2020-05-12 02:52:00] [INFO ] Deduced a trap composed of 15 places in 126 ms
[2020-05-12 02:52:00] [INFO ] Deduced a trap composed of 125 places in 141 ms
[2020-05-12 02:52:01] [INFO ] Deduced a trap composed of 21 places in 521 ms
[2020-05-12 02:52:01] [INFO ] Deduced a trap composed of 21 places in 295 ms
[2020-05-12 02:52:01] [INFO ] Deduced a trap composed of 29 places in 49 ms
[2020-05-12 02:52:01] [INFO ] Deduced a trap composed of 23 places in 41 ms
[2020-05-12 02:52:01] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3523 ms
[2020-05-12 02:52:01] [INFO ] Computed and/alt/rep : 470/1893/470 causal constraints in 32 ms.
[2020-05-12 02:52:04] [INFO ] Added : 359 causal constraints over 73 iterations in 3189 ms. Result :sat
[2020-05-12 02:52:04] [INFO ] Deduced a trap composed of 28 places in 17 ms
[2020-05-12 02:52:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2020-05-12 02:52:04] [INFO ] [Real]Absence check using 48 positive place invariants in 25 ms returned sat
[2020-05-12 02:52:04] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 16 ms returned sat
[2020-05-12 02:52:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:52:05] [INFO ] [Real]Absence check using state equation in 503 ms returned sat
[2020-05-12 02:52:05] [INFO ] Deduced a trap composed of 44 places in 138 ms
[2020-05-12 02:52:05] [INFO ] Deduced a trap composed of 16 places in 121 ms
[2020-05-12 02:52:05] [INFO ] Deduced a trap composed of 24 places in 107 ms
[2020-05-12 02:52:05] [INFO ] Deduced a trap composed of 13 places in 130 ms
[2020-05-12 02:52:06] [INFO ] Deduced a trap composed of 12 places in 70 ms
[2020-05-12 02:52:06] [INFO ] Deduced a trap composed of 11 places in 84 ms
[2020-05-12 02:52:06] [INFO ] Deduced a trap composed of 44 places in 97 ms
[2020-05-12 02:52:06] [INFO ] Deduced a trap composed of 21 places in 70 ms
[2020-05-12 02:52:06] [INFO ] Deduced a trap composed of 45 places in 45 ms
[2020-05-12 02:52:06] [INFO ] Deduced a trap composed of 43 places in 43 ms
[2020-05-12 02:52:06] [INFO ] Deduced a trap composed of 28 places in 36 ms
[2020-05-12 02:52:06] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1138 ms
[2020-05-12 02:52:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:52:06] [INFO ] [Nat]Absence check using 48 positive place invariants in 37 ms returned sat
[2020-05-12 02:52:06] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 17 ms returned sat
[2020-05-12 02:52:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:52:07] [INFO ] [Nat]Absence check using state equation in 506 ms returned sat
[2020-05-12 02:52:07] [INFO ] Deduced a trap composed of 22 places in 336 ms
[2020-05-12 02:52:07] [INFO ] Deduced a trap composed of 10 places in 131 ms
[2020-05-12 02:52:07] [INFO ] Deduced a trap composed of 21 places in 152 ms
[2020-05-12 02:52:07] [INFO ] Deduced a trap composed of 16 places in 133 ms
[2020-05-12 02:52:08] [INFO ] Deduced a trap composed of 134 places in 144 ms
[2020-05-12 02:52:08] [INFO ] Deduced a trap composed of 15 places in 134 ms
[2020-05-12 02:52:08] [INFO ] Deduced a trap composed of 131 places in 133 ms
[2020-05-12 02:52:08] [INFO ] Deduced a trap composed of 29 places in 148 ms
[2020-05-12 02:52:08] [INFO ] Deduced a trap composed of 34 places in 133 ms
[2020-05-12 02:52:08] [INFO ] Deduced a trap composed of 133 places in 135 ms
[2020-05-12 02:52:09] [INFO ] Deduced a trap composed of 131 places in 140 ms
[2020-05-12 02:52:09] [INFO ] Deduced a trap composed of 24 places in 130 ms
[2020-05-12 02:52:09] [INFO ] Deduced a trap composed of 137 places in 131 ms
[2020-05-12 02:52:09] [INFO ] Deduced a trap composed of 126 places in 127 ms
[2020-05-12 02:52:09] [INFO ] Deduced a trap composed of 131 places in 126 ms
[2020-05-12 02:52:09] [INFO ] Deduced a trap composed of 134 places in 135 ms
[2020-05-12 02:52:10] [INFO ] Deduced a trap composed of 134 places in 140 ms
[2020-05-12 02:52:10] [INFO ] Deduced a trap composed of 123 places in 143 ms
[2020-05-12 02:52:10] [INFO ] Deduced a trap composed of 121 places in 128 ms
[2020-05-12 02:52:10] [INFO ] Deduced a trap composed of 132 places in 122 ms
[2020-05-12 02:52:10] [INFO ] Deduced a trap composed of 40 places in 122 ms
[2020-05-12 02:52:10] [INFO ] Deduced a trap composed of 35 places in 125 ms
[2020-05-12 02:52:10] [INFO ] Deduced a trap composed of 140 places in 126 ms
[2020-05-12 02:52:11] [INFO ] Deduced a trap composed of 22 places in 123 ms
[2020-05-12 02:52:11] [INFO ] Deduced a trap composed of 134 places in 127 ms
[2020-05-12 02:52:11] [INFO ] Deduced a trap composed of 132 places in 134 ms
[2020-05-12 02:52:11] [INFO ] Deduced a trap composed of 122 places in 123 ms
[2020-05-12 02:52:11] [INFO ] Deduced a trap composed of 25 places in 121 ms
[2020-05-12 02:52:11] [INFO ] Deduced a trap composed of 36 places in 121 ms
[2020-05-12 02:52:11] [INFO ] Deduced a trap composed of 133 places in 126 ms
[2020-05-12 02:52:12] [INFO ] Deduced a trap composed of 56 places in 124 ms
[2020-05-12 02:52:13] [INFO ] Deduced a trap composed of 127 places in 1240 ms
[2020-05-12 02:52:13] [INFO ] Deduced a trap composed of 125 places in 121 ms
[2020-05-12 02:52:13] [INFO ] Deduced a trap composed of 131 places in 124 ms
[2020-05-12 02:52:13] [INFO ] Deduced a trap composed of 131 places in 121 ms
[2020-05-12 02:52:13] [INFO ] Deduced a trap composed of 123 places in 125 ms
[2020-05-12 02:52:14] [INFO ] Deduced a trap composed of 48 places in 123 ms
[2020-05-12 02:52:14] [INFO ] Deduced a trap composed of 40 places in 129 ms
[2020-05-12 02:52:14] [INFO ] Deduced a trap composed of 43 places in 139 ms
[2020-05-12 02:52:14] [INFO ] Deduced a trap composed of 117 places in 132 ms
[2020-05-12 02:52:14] [INFO ] Deduced a trap composed of 45 places in 120 ms
[2020-05-12 02:52:14] [INFO ] Deduced a trap composed of 135 places in 123 ms
[2020-05-12 02:52:15] [INFO ] Deduced a trap composed of 137 places in 125 ms
[2020-05-12 02:52:15] [INFO ] Deduced a trap composed of 129 places in 121 ms
[2020-05-12 02:52:15] [INFO ] Deduced a trap composed of 130 places in 125 ms
[2020-05-12 02:52:15] [INFO ] Deduced a trap composed of 124 places in 139 ms
[2020-05-12 02:52:15] [INFO ] Deduced a trap composed of 127 places in 137 ms
[2020-05-12 02:52:15] [INFO ] Deduced a trap composed of 120 places in 138 ms
[2020-05-12 02:52:15] [INFO ] Deduced a trap composed of 124 places in 112 ms
[2020-05-12 02:52:16] [INFO ] Deduced a trap composed of 126 places in 136 ms
[2020-05-12 02:52:16] [INFO ] Deduced a trap composed of 124 places in 118 ms
[2020-05-12 02:52:16] [INFO ] Deduced a trap composed of 129 places in 134 ms
[2020-05-12 02:52:16] [INFO ] Deduced a trap composed of 120 places in 129 ms
[2020-05-12 02:52:16] [INFO ] Deduced a trap composed of 122 places in 131 ms
[2020-05-12 02:52:16] [INFO ] Deduced a trap composed of 124 places in 132 ms
[2020-05-12 02:52:16] [INFO ] Deduced a trap composed of 37 places in 114 ms
[2020-05-12 02:52:17] [INFO ] Deduced a trap composed of 123 places in 115 ms
[2020-05-12 02:52:17] [INFO ] Deduced a trap composed of 21 places in 127 ms
[2020-05-12 02:52:17] [INFO ] Deduced a trap composed of 113 places in 127 ms
[2020-05-12 02:52:17] [INFO ] Deduced a trap composed of 124 places in 117 ms
[2020-05-12 02:52:17] [INFO ] Deduced a trap composed of 117 places in 130 ms
[2020-05-12 02:52:17] [INFO ] Deduced a trap composed of 121 places in 116 ms
[2020-05-12 02:52:17] [INFO ] Deduced a trap composed of 116 places in 114 ms
[2020-05-12 02:52:18] [INFO ] Deduced a trap composed of 114 places in 113 ms
[2020-05-12 02:52:18] [INFO ] Deduced a trap composed of 33 places in 117 ms
[2020-05-12 02:52:18] [INFO ] Deduced a trap composed of 125 places in 125 ms
[2020-05-12 02:52:18] [INFO ] Deduced a trap composed of 51 places in 131 ms
[2020-05-12 02:52:18] [INFO ] Deduced a trap composed of 120 places in 115 ms
[2020-05-12 02:52:18] [INFO ] Deduced a trap composed of 118 places in 120 ms
[2020-05-12 02:52:18] [INFO ] Deduced a trap composed of 123 places in 132 ms
[2020-05-12 02:52:19] [INFO ] Deduced a trap composed of 124 places in 135 ms
[2020-05-12 02:52:19] [INFO ] Deduced a trap composed of 127 places in 116 ms
[2020-05-12 02:52:19] [INFO ] Deduced a trap composed of 120 places in 132 ms
[2020-05-12 02:52:19] [INFO ] Deduced a trap composed of 80 places in 117 ms
[2020-05-12 02:52:19] [INFO ] Deduced a trap composed of 122 places in 109 ms
[2020-05-12 02:52:19] [INFO ] Deduced a trap composed of 122 places in 134 ms
[2020-05-12 02:52:19] [INFO ] Deduced a trap composed of 115 places in 134 ms
[2020-05-12 02:52:20] [INFO ] Deduced a trap composed of 112 places in 118 ms
[2020-05-12 02:52:20] [INFO ] Deduced a trap composed of 114 places in 115 ms
[2020-05-12 02:52:20] [INFO ] Deduced a trap composed of 123 places in 133 ms
[2020-05-12 02:52:20] [INFO ] Deduced a trap composed of 114 places in 128 ms
[2020-05-12 02:52:20] [INFO ] Deduced a trap composed of 124 places in 138 ms
[2020-05-12 02:52:20] [INFO ] Deduced a trap composed of 117 places in 143 ms
[2020-05-12 02:52:21] [INFO ] Deduced a trap composed of 111 places in 116 ms
[2020-05-12 02:52:21] [INFO ] Deduced a trap composed of 117 places in 116 ms
[2020-05-12 02:52:21] [INFO ] Deduced a trap composed of 119 places in 112 ms
[2020-05-12 02:52:21] [INFO ] Deduced a trap composed of 45 places in 118 ms
[2020-05-12 02:52:21] [INFO ] Deduced a trap composed of 123 places in 128 ms
[2020-05-12 02:52:21] [INFO ] Deduced a trap composed of 123 places in 123 ms
[2020-05-12 02:52:21] [INFO ] Deduced a trap composed of 120 places in 153 ms
[2020-05-12 02:52:22] [INFO ] Deduced a trap composed of 122 places in 110 ms
[2020-05-12 02:52:22] [INFO ] Deduced a trap composed of 133 places in 123 ms
[2020-05-12 02:52:22] [INFO ] Deduced a trap composed of 114 places in 116 ms
[2020-05-12 02:52:22] [INFO ] Deduced a trap composed of 107 places in 114 ms
[2020-05-12 02:52:22] [INFO ] Deduced a trap composed of 109 places in 113 ms
[2020-05-12 02:52:22] [INFO ] Deduced a trap composed of 112 places in 110 ms
[2020-05-12 02:52:22] [INFO ] Deduced a trap composed of 113 places in 109 ms
[2020-05-12 02:52:23] [INFO ] Deduced a trap composed of 24 places in 55 ms
[2020-05-12 02:52:23] [INFO ] Deduced a trap composed of 30 places in 55 ms
[2020-05-12 02:52:23] [INFO ] Deduced a trap composed of 43 places in 56 ms
[2020-05-12 02:52:23] [INFO ] Deduced a trap composed of 48 places in 59 ms
[2020-05-12 02:52:23] [INFO ] Deduced a trap composed of 41 places in 58 ms
[2020-05-12 02:52:23] [INFO ] Deduced a trap composed of 37 places in 57 ms
[2020-05-12 02:52:23] [INFO ] Deduced a trap composed of 45 places in 60 ms
[2020-05-12 02:52:23] [INFO ] Deduced a trap composed of 41 places in 62 ms
[2020-05-12 02:52:23] [INFO ] Deduced a trap composed of 44 places in 60 ms
[2020-05-12 02:52:23] [INFO ] Deduced a trap composed of 38 places in 58 ms
[2020-05-12 02:52:24] [INFO ] Deduced a trap composed of 14 places in 116 ms
[2020-05-12 02:52:24] [INFO ] Deduced a trap composed of 122 places in 115 ms
[2020-05-12 02:52:24] [INFO ] Deduced a trap composed of 110 places in 117 ms
[2020-05-12 02:52:24] [INFO ] Deduced a trap composed of 116 places in 122 ms
[2020-05-12 02:52:24] [INFO ] Deduced a trap composed of 121 places in 117 ms
[2020-05-12 02:52:24] [INFO ] Deduced a trap composed of 115 places in 116 ms
[2020-05-12 02:52:24] [INFO ] Deduced a trap composed of 125 places in 114 ms
[2020-05-12 02:52:24] [INFO ] Deduced a trap composed of 127 places in 108 ms
[2020-05-12 02:52:25] [INFO ] Deduced a trap composed of 116 places in 109 ms
[2020-05-12 02:52:25] [INFO ] Deduced a trap composed of 115 places in 108 ms
[2020-05-12 02:52:25] [INFO ] Deduced a trap composed of 134 places in 105 ms
[2020-05-12 02:52:25] [INFO ] Trap strengthening (SAT) tested/added 119/118 trap constraints in 18230 ms
[2020-05-12 02:52:25] [INFO ] Computed and/alt/rep : 470/1893/470 causal constraints in 21 ms.
[2020-05-12 02:52:26] [INFO ] Added : 155 causal constraints over 31 iterations in 1164 ms. Result :(error "Failed to check-sat")
[2020-05-12 02:52:26] [INFO ] [Real]Absence check using 48 positive place invariants in 27 ms returned sat
[2020-05-12 02:52:26] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 18 ms returned sat
[2020-05-12 02:52:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:52:27] [INFO ] [Real]Absence check using state equation in 520 ms returned sat
[2020-05-12 02:52:27] [INFO ] Deduced a trap composed of 10 places in 243 ms
[2020-05-12 02:52:27] [INFO ] Deduced a trap composed of 23 places in 135 ms
[2020-05-12 02:52:27] [INFO ] Deduced a trap composed of 22 places in 129 ms
[2020-05-12 02:52:27] [INFO ] Deduced a trap composed of 17 places in 126 ms
[2020-05-12 02:52:28] [INFO ] Deduced a trap composed of 8 places in 114 ms
[2020-05-12 02:52:28] [INFO ] Deduced a trap composed of 21 places in 117 ms
[2020-05-12 02:52:28] [INFO ] Deduced a trap composed of 23 places in 133 ms
[2020-05-12 02:52:28] [INFO ] Deduced a trap composed of 15 places in 126 ms
[2020-05-12 02:52:28] [INFO ] Deduced a trap composed of 31 places in 146 ms
[2020-05-12 02:52:28] [INFO ] Deduced a trap composed of 19 places in 127 ms
[2020-05-12 02:52:28] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1603 ms
[2020-05-12 02:52:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:52:28] [INFO ] [Nat]Absence check using 48 positive place invariants in 39 ms returned sat
[2020-05-12 02:52:28] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 18 ms returned sat
[2020-05-12 02:52:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:52:29] [INFO ] [Nat]Absence check using state equation in 824 ms returned sat
[2020-05-12 02:52:29] [INFO ] Deduced a trap composed of 130 places in 145 ms
[2020-05-12 02:52:30] [INFO ] Deduced a trap composed of 8 places in 156 ms
[2020-05-12 02:52:30] [INFO ] Deduced a trap composed of 13 places in 137 ms
[2020-05-12 02:52:30] [INFO ] Deduced a trap composed of 11 places in 161 ms
[2020-05-12 02:52:30] [INFO ] Deduced a trap composed of 17 places in 165 ms
[2020-05-12 02:52:30] [INFO ] Deduced a trap composed of 134 places in 138 ms
[2020-05-12 02:52:31] [INFO ] Deduced a trap composed of 24 places in 739 ms
[2020-05-12 02:52:31] [INFO ] Deduced a trap composed of 130 places in 142 ms
[2020-05-12 02:52:31] [INFO ] Deduced a trap composed of 23 places in 123 ms
[2020-05-12 02:52:31] [INFO ] Deduced a trap composed of 21 places in 71 ms
[2020-05-12 02:52:32] [INFO ] Deduced a trap composed of 15 places in 67 ms
[2020-05-12 02:52:32] [INFO ] Deduced a trap composed of 29 places in 51 ms
[2020-05-12 02:52:32] [INFO ] Deduced a trap composed of 40 places in 47 ms
[2020-05-12 02:52:32] [INFO ] Deduced a trap composed of 39 places in 45 ms
[2020-05-12 02:52:32] [INFO ] Deduced a trap composed of 25 places in 36 ms
[2020-05-12 02:52:32] [INFO ] Deduced a trap composed of 16 places in 38 ms
[2020-05-12 02:52:32] [INFO ] Deduced a trap composed of 25 places in 91 ms
[2020-05-12 02:52:32] [INFO ] Deduced a trap composed of 23 places in 90 ms
[2020-05-12 02:52:32] [INFO ] Deduced a trap composed of 36 places in 93 ms
[2020-05-12 02:52:32] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2929 ms
[2020-05-12 02:52:32] [INFO ] Computed and/alt/rep : 470/1893/470 causal constraints in 22 ms.
[2020-05-12 02:52:35] [INFO ] Added : 356 causal constraints over 72 iterations in 2732 ms. Result :sat
[2020-05-12 02:52:35] [INFO ] Deduced a trap composed of 28 places in 123 ms
[2020-05-12 02:52:35] [INFO ] Deduced a trap composed of 117 places in 256 ms
[2020-05-12 02:52:36] [INFO ] Deduced a trap composed of 124 places in 243 ms
[2020-05-12 02:52:36] [INFO ] Deduced a trap composed of 124 places in 119 ms
[2020-05-12 02:52:36] [INFO ] Deduced a trap composed of 128 places in 114 ms
[2020-05-12 02:52:36] [INFO ] Deduced a trap composed of 125 places in 118 ms
[2020-05-12 02:52:36] [INFO ] Deduced a trap composed of 125 places in 114 ms
[2020-05-12 02:52:37] [INFO ] Deduced a trap composed of 113 places in 115 ms
[2020-05-12 02:52:37] [INFO ] Deduced a trap composed of 112 places in 115 ms
[2020-05-12 02:52:37] [INFO ] Deduced a trap composed of 116 places in 116 ms
[2020-05-12 02:52:37] [INFO ] Deduced a trap composed of 119 places in 112 ms
[2020-05-12 02:52:37] [INFO ] Deduced a trap composed of 130 places in 117 ms
[2020-05-12 02:52:37] [INFO ] Deduced a trap composed of 123 places in 126 ms
[2020-05-12 02:52:38] [INFO ] Deduced a trap composed of 134 places in 110 ms
[2020-05-12 02:52:38] [INFO ] Deduced a trap composed of 134 places in 110 ms
[2020-05-12 02:52:38] [INFO ] Deduced a trap composed of 129 places in 112 ms
[2020-05-12 02:52:38] [INFO ] Deduced a trap composed of 131 places in 121 ms
[2020-05-12 02:52:38] [INFO ] Deduced a trap composed of 128 places in 104 ms
[2020-05-12 02:52:38] [INFO ] Deduced a trap composed of 123 places in 112 ms
[2020-05-12 02:52:39] [INFO ] Deduced a trap composed of 118 places in 134 ms
[2020-05-12 02:52:39] [INFO ] Deduced a trap composed of 129 places in 114 ms
[2020-05-12 02:52:39] [INFO ] Deduced a trap composed of 116 places in 102 ms
[2020-05-12 02:52:39] [INFO ] Deduced a trap composed of 114 places in 91 ms
[2020-05-12 02:52:39] [INFO ] Deduced a trap composed of 118 places in 139 ms
[2020-05-12 02:52:40] [INFO ] Deduced a trap composed of 116 places in 154 ms
[2020-05-12 02:52:40] [INFO ] Deduced a trap composed of 113 places in 108 ms
[2020-05-12 02:52:40] [INFO ] Deduced a trap composed of 111 places in 113 ms
[2020-05-12 02:52:40] [INFO ] Deduced a trap composed of 128 places in 116 ms
[2020-05-12 02:52:40] [INFO ] Deduced a trap composed of 119 places in 128 ms
[2020-05-12 02:52:40] [INFO ] Deduced a trap composed of 116 places in 129 ms
[2020-05-12 02:52:41] [INFO ] Deduced a trap composed of 124 places in 139 ms
[2020-05-12 02:52:41] [INFO ] Deduced a trap composed of 131 places in 119 ms
[2020-05-12 02:52:41] [INFO ] Deduced a trap composed of 121 places in 121 ms
[2020-05-12 02:52:41] [INFO ] Deduced a trap composed of 125 places in 119 ms
[2020-05-12 02:52:41] [INFO ] Deduced a trap composed of 131 places in 132 ms
[2020-05-12 02:52:42] [INFO ] Deduced a trap composed of 124 places in 131 ms
[2020-05-12 02:52:42] [INFO ] Deduced a trap composed of 122 places in 129 ms
[2020-05-12 02:52:42] [INFO ] Deduced a trap composed of 127 places in 117 ms
[2020-05-12 02:52:42] [INFO ] Deduced a trap composed of 123 places in 206 ms
[2020-05-12 02:52:42] [INFO ] Deduced a trap composed of 127 places in 91 ms
[2020-05-12 02:52:43] [INFO ] Deduced a trap composed of 135 places in 109 ms
[2020-05-12 02:52:43] [INFO ] Deduced a trap composed of 127 places in 106 ms
[2020-05-12 02:52:43] [INFO ] Deduced a trap composed of 133 places in 102 ms
[2020-05-12 02:52:43] [INFO ] Deduced a trap composed of 124 places in 99 ms
[2020-05-12 02:52:43] [INFO ] Deduced a trap composed of 126 places in 99 ms
[2020-05-12 02:52:43] [INFO ] Deduced a trap composed of 131 places in 109 ms
[2020-05-12 02:52:44] [INFO ] Deduced a trap composed of 111 places in 104 ms
[2020-05-12 02:52:44] [INFO ] Deduced a trap composed of 131 places in 94 ms
[2020-05-12 02:52:44] [INFO ] Deduced a trap composed of 133 places in 112 ms
[2020-05-12 02:52:44] [INFO ] Deduced a trap composed of 131 places in 134 ms
[2020-05-12 02:52:44] [INFO ] Deduced a trap composed of 123 places in 100 ms
[2020-05-12 02:52:45] [INFO ] Deduced a trap composed of 134 places in 93 ms
[2020-05-12 02:52:45] [INFO ] Deduced a trap composed of 131 places in 104 ms
[2020-05-12 02:52:45] [INFO ] Deduced a trap composed of 139 places in 108 ms
[2020-05-12 02:52:45] [INFO ] Deduced a trap composed of 129 places in 92 ms
[2020-05-12 02:52:45] [INFO ] Deduced a trap composed of 135 places in 102 ms
[2020-05-12 02:52:45] [INFO ] Deduced a trap composed of 132 places in 104 ms
[2020-05-12 02:52:46] [INFO ] Deduced a trap composed of 126 places in 100 ms
[2020-05-12 02:52:46] [INFO ] Deduced a trap composed of 131 places in 102 ms
[2020-05-12 02:52:46] [INFO ] Deduced a trap composed of 136 places in 105 ms
[2020-05-12 02:52:46] [INFO ] Deduced a trap composed of 133 places in 111 ms
[2020-05-12 02:52:46] [INFO ] Deduced a trap composed of 126 places in 109 ms
[2020-05-12 02:52:47] [INFO ] Trap strengthening (SAT) tested/added 63/62 trap constraints in 11705 ms
[2020-05-12 02:52:47] [INFO ] [Real]Absence check using 48 positive place invariants in 44 ms returned sat
[2020-05-12 02:52:47] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 20 ms returned sat
[2020-05-12 02:52:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:52:47] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2020-05-12 02:52:47] [INFO ] Deduced a trap composed of 13 places in 73 ms
[2020-05-12 02:52:47] [INFO ] Deduced a trap composed of 22 places in 75 ms
[2020-05-12 02:52:48] [INFO ] Deduced a trap composed of 20 places in 74 ms
[2020-05-12 02:52:48] [INFO ] Deduced a trap composed of 26 places in 82 ms
[2020-05-12 02:52:48] [INFO ] Deduced a trap composed of 31 places in 80 ms
[2020-05-12 02:52:48] [INFO ] Deduced a trap composed of 25 places in 73 ms
[2020-05-12 02:52:48] [INFO ] Deduced a trap composed of 15 places in 77 ms
[2020-05-12 02:52:48] [INFO ] Deduced a trap composed of 17 places in 80 ms
[2020-05-12 02:52:48] [INFO ] Deduced a trap composed of 24 places in 65 ms
[2020-05-12 02:52:48] [INFO ] Deduced a trap composed of 17 places in 70 ms
[2020-05-12 02:52:48] [INFO ] Deduced a trap composed of 23 places in 90 ms
[2020-05-12 02:52:48] [INFO ] Deduced a trap composed of 21 places in 84 ms
[2020-05-12 02:52:49] [INFO ] Deduced a trap composed of 26 places in 72 ms
[2020-05-12 02:52:49] [INFO ] Deduced a trap composed of 28 places in 73 ms
[2020-05-12 02:52:49] [INFO ] Deduced a trap composed of 30 places in 67 ms
[2020-05-12 02:52:49] [INFO ] Deduced a trap composed of 22 places in 75 ms
[2020-05-12 02:52:49] [INFO ] Deduced a trap composed of 26 places in 78 ms
[2020-05-12 02:52:49] [INFO ] Deduced a trap composed of 22 places in 80 ms
[2020-05-12 02:52:49] [INFO ] Deduced a trap composed of 30 places in 74 ms
[2020-05-12 02:52:49] [INFO ] Deduced a trap composed of 37 places in 84 ms
[2020-05-12 02:52:49] [INFO ] Deduced a trap composed of 40 places in 78 ms
[2020-05-12 02:52:49] [INFO ] Deduced a trap composed of 33 places in 83 ms
[2020-05-12 02:52:49] [INFO ] Deduced a trap composed of 15 places in 70 ms
[2020-05-12 02:52:50] [INFO ] Deduced a trap composed of 19 places in 78 ms
[2020-05-12 02:52:50] [INFO ] Deduced a trap composed of 29 places in 76 ms
[2020-05-12 02:52:50] [INFO ] Deduced a trap composed of 43 places in 65 ms
[2020-05-12 02:52:50] [INFO ] Deduced a trap composed of 45 places in 62 ms
[2020-05-12 02:52:50] [INFO ] Deduced a trap composed of 39 places in 51 ms
[2020-05-12 02:52:50] [INFO ] Deduced a trap composed of 38 places in 46 ms
[2020-05-12 02:52:50] [INFO ] Deduced a trap composed of 41 places in 41 ms
[2020-05-12 02:52:50] [INFO ] Deduced a trap composed of 39 places in 43 ms
[2020-05-12 02:52:50] [INFO ] Deduced a trap composed of 41 places in 66 ms
[2020-05-12 02:52:50] [INFO ] Deduced a trap composed of 41 places in 106 ms
[2020-05-12 02:52:50] [INFO ] Deduced a trap composed of 36 places in 65 ms
[2020-05-12 02:52:50] [INFO ] Deduced a trap composed of 35 places in 45 ms
[2020-05-12 02:52:51] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 3279 ms
[2020-05-12 02:52:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:52:51] [INFO ] [Nat]Absence check using 48 positive place invariants in 150 ms returned sat
[2020-05-12 02:52:51] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 18 ms returned sat
[2020-05-12 02:52:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:52:51] [INFO ] [Nat]Absence check using state equation in 588 ms returned sat
[2020-05-12 02:52:51] [INFO ] Deduced a trap composed of 11 places in 106 ms
[2020-05-12 02:52:52] [INFO ] Deduced a trap composed of 23 places in 81 ms
[2020-05-12 02:52:52] [INFO ] Deduced a trap composed of 15 places in 79 ms
[2020-05-12 02:52:52] [INFO ] Deduced a trap composed of 16 places in 77 ms
[2020-05-12 02:52:52] [INFO ] Deduced a trap composed of 18 places in 76 ms
[2020-05-12 02:52:52] [INFO ] Deduced a trap composed of 21 places in 75 ms
[2020-05-12 02:52:52] [INFO ] Deduced a trap composed of 36 places in 112 ms
[2020-05-12 02:52:52] [INFO ] Deduced a trap composed of 13 places in 94 ms
[2020-05-12 02:52:52] [INFO ] Deduced a trap composed of 40 places in 97 ms
[2020-05-12 02:52:52] [INFO ] Deduced a trap composed of 29 places in 71 ms
[2020-05-12 02:52:53] [INFO ] Deduced a trap composed of 28 places in 67 ms
[2020-05-12 02:52:53] [INFO ] Deduced a trap composed of 22 places in 83 ms
[2020-05-12 02:52:53] [INFO ] Deduced a trap composed of 24 places in 73 ms
[2020-05-12 02:52:53] [INFO ] Deduced a trap composed of 23 places in 78 ms
[2020-05-12 02:52:53] [INFO ] Deduced a trap composed of 26 places in 60 ms
[2020-05-12 02:52:53] [INFO ] Deduced a trap composed of 25 places in 78 ms
[2020-05-12 02:52:53] [INFO ] Deduced a trap composed of 22 places in 60 ms
[2020-05-12 02:52:53] [INFO ] Deduced a trap composed of 40 places in 60 ms
[2020-05-12 02:52:53] [INFO ] Deduced a trap composed of 35 places in 61 ms
[2020-05-12 02:52:53] [INFO ] Deduced a trap composed of 15 places in 42 ms
[2020-05-12 02:52:53] [INFO ] Deduced a trap composed of 17 places in 42 ms
[2020-05-12 02:52:53] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2054 ms
[2020-05-12 02:52:53] [INFO ] Computed and/alt/rep : 470/1893/470 causal constraints in 28 ms.
[2020-05-12 02:52:57] [INFO ] Added : 362 causal constraints over 73 iterations in 3247 ms. Result :sat
[2020-05-12 02:52:57] [INFO ] [Real]Absence check using 48 positive place invariants in 26 ms returned sat
[2020-05-12 02:52:57] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 18 ms returned sat
[2020-05-12 02:52:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:52:57] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2020-05-12 02:52:57] [INFO ] Deduced a trap composed of 35 places in 90 ms
[2020-05-12 02:52:57] [INFO ] Deduced a trap composed of 8 places in 82 ms
[2020-05-12 02:52:58] [INFO ] Deduced a trap composed of 38 places in 81 ms
[2020-05-12 02:52:58] [INFO ] Deduced a trap composed of 32 places in 83 ms
[2020-05-12 02:52:58] [INFO ] Deduced a trap composed of 49 places in 85 ms
[2020-05-12 02:52:58] [INFO ] Deduced a trap composed of 45 places in 83 ms
[2020-05-12 02:52:58] [INFO ] Deduced a trap composed of 50 places in 83 ms
[2020-05-12 02:52:58] [INFO ] Deduced a trap composed of 17 places in 102 ms
[2020-05-12 02:52:58] [INFO ] Deduced a trap composed of 15 places in 95 ms
[2020-05-12 02:52:58] [INFO ] Deduced a trap composed of 55 places in 95 ms
[2020-05-12 02:52:58] [INFO ] Deduced a trap composed of 57 places in 94 ms
[2020-05-12 02:52:59] [INFO ] Deduced a trap composed of 44 places in 94 ms
[2020-05-12 02:52:59] [INFO ] Deduced a trap composed of 45 places in 83 ms
[2020-05-12 02:52:59] [INFO ] Deduced a trap composed of 27 places in 58 ms
[2020-05-12 02:52:59] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1444 ms
[2020-05-12 02:52:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:52:59] [INFO ] [Nat]Absence check using 48 positive place invariants in 36 ms returned sat
[2020-05-12 02:52:59] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 32 ms returned sat
[2020-05-12 02:52:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:52:59] [INFO ] [Nat]Absence check using state equation in 531 ms returned sat
[2020-05-12 02:53:00] [INFO ] Deduced a trap composed of 33 places in 113 ms
[2020-05-12 02:53:00] [INFO ] Deduced a trap composed of 45 places in 99 ms
[2020-05-12 02:53:00] [INFO ] Deduced a trap composed of 35 places in 100 ms
[2020-05-12 02:53:00] [INFO ] Deduced a trap composed of 11 places in 84 ms
[2020-05-12 02:53:00] [INFO ] Deduced a trap composed of 25 places in 95 ms
[2020-05-12 02:53:00] [INFO ] Deduced a trap composed of 33 places in 83 ms
[2020-05-12 02:53:00] [INFO ] Deduced a trap composed of 12 places in 95 ms
[2020-05-12 02:53:00] [INFO ] Deduced a trap composed of 45 places in 94 ms
[2020-05-12 02:53:00] [INFO ] Deduced a trap composed of 50 places in 81 ms
[2020-05-12 02:53:01] [INFO ] Deduced a trap composed of 16 places in 93 ms
[2020-05-12 02:53:01] [INFO ] Deduced a trap composed of 28 places in 87 ms
[2020-05-12 02:53:01] [INFO ] Deduced a trap composed of 34 places in 90 ms
[2020-05-12 02:53:01] [INFO ] Deduced a trap composed of 42 places in 101 ms
[2020-05-12 02:53:01] [INFO ] Deduced a trap composed of 49 places in 103 ms
[2020-05-12 02:53:01] [INFO ] Deduced a trap composed of 44 places in 87 ms
[2020-05-12 02:53:01] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1720 ms
[2020-05-12 02:53:01] [INFO ] Computed and/alt/rep : 470/1893/470 causal constraints in 28 ms.
[2020-05-12 02:53:04] [INFO ] Added : 346 causal constraints over 70 iterations in 2778 ms. Result :sat
[2020-05-12 02:53:04] [INFO ] [Real]Absence check using 48 positive place invariants in 25 ms returned sat
[2020-05-12 02:53:04] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 13 ms returned unsat
[2020-05-12 02:53:04] [INFO ] [Real]Absence check using 48 positive place invariants in 31 ms returned sat
[2020-05-12 02:53:04] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 17 ms returned sat
[2020-05-12 02:53:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:53:05] [INFO ] [Real]Absence check using state equation in 552 ms returned sat
[2020-05-12 02:53:05] [INFO ] Deduced a trap composed of 122 places in 138 ms
[2020-05-12 02:53:05] [INFO ] Deduced a trap composed of 118 places in 141 ms
[2020-05-12 02:53:05] [INFO ] Deduced a trap composed of 16 places in 151 ms
[2020-05-12 02:53:05] [INFO ] Deduced a trap composed of 127 places in 144 ms
[2020-05-12 02:53:06] [INFO ] Deduced a trap composed of 124 places in 146 ms
[2020-05-12 02:53:06] [INFO ] Deduced a trap composed of 9 places in 141 ms
[2020-05-12 02:53:06] [INFO ] Deduced a trap composed of 18 places in 152 ms
[2020-05-12 02:53:06] [INFO ] Deduced a trap composed of 27 places in 137 ms
[2020-05-12 02:53:06] [INFO ] Deduced a trap composed of 125 places in 134 ms
[2020-05-12 02:53:06] [INFO ] Deduced a trap composed of 19 places in 133 ms
[2020-05-12 02:53:07] [INFO ] Deduced a trap composed of 24 places in 151 ms
[2020-05-12 02:53:07] [INFO ] Deduced a trap composed of 22 places in 139 ms
[2020-05-12 02:53:07] [INFO ] Deduced a trap composed of 127 places in 155 ms
[2020-05-12 02:53:07] [INFO ] Deduced a trap composed of 134 places in 135 ms
[2020-05-12 02:53:07] [INFO ] Deduced a trap composed of 119 places in 147 ms
[2020-05-12 02:53:07] [INFO ] Deduced a trap composed of 115 places in 121 ms
[2020-05-12 02:53:08] [INFO ] Deduced a trap composed of 42 places in 132 ms
[2020-05-12 02:53:08] [INFO ] Deduced a trap composed of 120 places in 133 ms
[2020-05-12 02:53:08] [INFO ] Deduced a trap composed of 119 places in 120 ms
[2020-05-12 02:53:08] [INFO ] Deduced a trap composed of 116 places in 125 ms
[2020-05-12 02:53:08] [INFO ] Deduced a trap composed of 15 places in 140 ms
[2020-05-12 02:53:08] [INFO ] Deduced a trap composed of 39 places in 131 ms
[2020-05-12 02:53:09] [INFO ] Deduced a trap composed of 126 places in 154 ms
[2020-05-12 02:53:09] [INFO ] Deduced a trap composed of 14 places in 137 ms
[2020-05-12 02:53:09] [INFO ] Deduced a trap composed of 42 places in 143 ms
[2020-05-12 02:53:09] [INFO ] Deduced a trap composed of 29 places in 110 ms
[2020-05-12 02:53:09] [INFO ] Deduced a trap composed of 120 places in 108 ms
[2020-05-12 02:53:09] [INFO ] Deduced a trap composed of 112 places in 121 ms
[2020-05-12 02:53:09] [INFO ] Deduced a trap composed of 39 places in 127 ms
[2020-05-12 02:53:10] [INFO ] Deduced a trap composed of 25 places in 124 ms
[2020-05-12 02:53:10] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 4861 ms
[2020-05-12 02:53:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:53:10] [INFO ] [Nat]Absence check using 48 positive place invariants in 39 ms returned sat
[2020-05-12 02:53:10] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 19 ms returned sat
[2020-05-12 02:53:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:53:10] [INFO ] [Nat]Absence check using state equation in 535 ms returned sat
[2020-05-12 02:53:10] [INFO ] Deduced a trap composed of 17 places in 178 ms
[2020-05-12 02:53:11] [INFO ] Deduced a trap composed of 8 places in 147 ms
[2020-05-12 02:53:11] [INFO ] Deduced a trap composed of 129 places in 120 ms
[2020-05-12 02:53:11] [INFO ] Deduced a trap composed of 125 places in 119 ms
[2020-05-12 02:53:11] [INFO ] Deduced a trap composed of 49 places in 125 ms
[2020-05-12 02:53:11] [INFO ] Deduced a trap composed of 47 places in 134 ms
[2020-05-12 02:53:11] [INFO ] Deduced a trap composed of 125 places in 131 ms
[2020-05-12 02:53:12] [INFO ] Deduced a trap composed of 127 places in 133 ms
[2020-05-12 02:53:12] [INFO ] Deduced a trap composed of 46 places in 119 ms
[2020-05-12 02:53:12] [INFO ] Deduced a trap composed of 54 places in 115 ms
[2020-05-12 02:53:12] [INFO ] Deduced a trap composed of 34 places in 121 ms
[2020-05-12 02:53:12] [INFO ] Deduced a trap composed of 121 places in 134 ms
[2020-05-12 02:53:12] [INFO ] Deduced a trap composed of 14 places in 164 ms
[2020-05-12 02:53:12] [INFO ] Deduced a trap composed of 69 places in 131 ms
[2020-05-12 02:53:13] [INFO ] Deduced a trap composed of 117 places in 122 ms
[2020-05-12 02:53:13] [INFO ] Deduced a trap composed of 119 places in 130 ms
[2020-05-12 02:53:13] [INFO ] Deduced a trap composed of 134 places in 112 ms
[2020-05-12 02:53:13] [INFO ] Deduced a trap composed of 127 places in 109 ms
[2020-05-12 02:53:13] [INFO ] Deduced a trap composed of 10 places in 126 ms
[2020-05-12 02:53:13] [INFO ] Deduced a trap composed of 130 places in 135 ms
[2020-05-12 02:53:13] [INFO ] Deduced a trap composed of 82 places in 120 ms
[2020-05-12 02:53:14] [INFO ] Deduced a trap composed of 48 places in 130 ms
[2020-05-12 02:53:14] [INFO ] Deduced a trap composed of 129 places in 262 ms
[2020-05-12 02:53:14] [INFO ] Deduced a trap composed of 25 places in 139 ms
[2020-05-12 02:53:14] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3742 ms
[2020-05-12 02:53:14] [INFO ] Computed and/alt/rep : 470/1893/470 causal constraints in 18 ms.
[2020-05-12 02:53:18] [INFO ] Added : 374 causal constraints over 76 iterations in 3543 ms. Result :sat
[2020-05-12 02:53:18] [INFO ] [Real]Absence check using 48 positive place invariants in 37 ms returned sat
[2020-05-12 02:53:18] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 18 ms returned sat
[2020-05-12 02:53:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:53:18] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2020-05-12 02:53:18] [INFO ] Deduced a trap composed of 122 places in 133 ms
[2020-05-12 02:53:19] [INFO ] Deduced a trap composed of 118 places in 126 ms
[2020-05-12 02:53:19] [INFO ] Deduced a trap composed of 16 places in 139 ms
[2020-05-12 02:53:19] [INFO ] Deduced a trap composed of 127 places in 144 ms
[2020-05-12 02:53:19] [INFO ] Deduced a trap composed of 124 places in 142 ms
[2020-05-12 02:53:19] [INFO ] Deduced a trap composed of 9 places in 125 ms
[2020-05-12 02:53:19] [INFO ] Deduced a trap composed of 18 places in 136 ms
[2020-05-12 02:53:20] [INFO ] Deduced a trap composed of 27 places in 139 ms
[2020-05-12 02:53:20] [INFO ] Deduced a trap composed of 125 places in 153 ms
[2020-05-12 02:53:20] [INFO ] Deduced a trap composed of 19 places in 135 ms
[2020-05-12 02:53:20] [INFO ] Deduced a trap composed of 24 places in 130 ms
[2020-05-12 02:53:20] [INFO ] Deduced a trap composed of 22 places in 122 ms
[2020-05-12 02:53:20] [INFO ] Deduced a trap composed of 127 places in 122 ms
[2020-05-12 02:53:20] [INFO ] Deduced a trap composed of 134 places in 120 ms
[2020-05-12 02:53:21] [INFO ] Deduced a trap composed of 119 places in 118 ms
[2020-05-12 02:53:21] [INFO ] Deduced a trap composed of 115 places in 134 ms
[2020-05-12 02:53:21] [INFO ] Deduced a trap composed of 42 places in 115 ms
[2020-05-12 02:53:21] [INFO ] Deduced a trap composed of 120 places in 134 ms
[2020-05-12 02:53:21] [INFO ] Deduced a trap composed of 119 places in 112 ms
[2020-05-12 02:53:21] [INFO ] Deduced a trap composed of 116 places in 113 ms
[2020-05-12 02:53:21] [INFO ] Deduced a trap composed of 15 places in 114 ms
[2020-05-12 02:53:22] [INFO ] Deduced a trap composed of 39 places in 112 ms
[2020-05-12 02:53:22] [INFO ] Deduced a trap composed of 126 places in 112 ms
[2020-05-12 02:53:22] [INFO ] Deduced a trap composed of 14 places in 115 ms
[2020-05-12 02:53:22] [INFO ] Deduced a trap composed of 42 places in 113 ms
[2020-05-12 02:53:22] [INFO ] Deduced a trap composed of 29 places in 113 ms
[2020-05-12 02:53:22] [INFO ] Deduced a trap composed of 120 places in 108 ms
[2020-05-12 02:53:22] [INFO ] Deduced a trap composed of 112 places in 113 ms
[2020-05-12 02:53:22] [INFO ] Deduced a trap composed of 39 places in 108 ms
[2020-05-12 02:53:23] [INFO ] Deduced a trap composed of 25 places in 168 ms
[2020-05-12 02:53:23] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 4367 ms
[2020-05-12 02:53:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:53:23] [INFO ] [Nat]Absence check using 48 positive place invariants in 37 ms returned sat
[2020-05-12 02:53:23] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 20 ms returned sat
[2020-05-12 02:53:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:53:23] [INFO ] [Nat]Absence check using state equation in 501 ms returned sat
[2020-05-12 02:53:23] [INFO ] Deduced a trap composed of 17 places in 133 ms
[2020-05-12 02:53:24] [INFO ] Deduced a trap composed of 8 places in 135 ms
[2020-05-12 02:53:24] [INFO ] Deduced a trap composed of 129 places in 125 ms
[2020-05-12 02:53:24] [INFO ] Deduced a trap composed of 125 places in 125 ms
[2020-05-12 02:53:24] [INFO ] Deduced a trap composed of 49 places in 140 ms
[2020-05-12 02:53:24] [INFO ] Deduced a trap composed of 47 places in 127 ms
[2020-05-12 02:53:24] [INFO ] Deduced a trap composed of 125 places in 124 ms
[2020-05-12 02:53:24] [INFO ] Deduced a trap composed of 127 places in 121 ms
[2020-05-12 02:53:25] [INFO ] Deduced a trap composed of 46 places in 119 ms
[2020-05-12 02:53:25] [INFO ] Deduced a trap composed of 54 places in 122 ms
[2020-05-12 02:53:25] [INFO ] Deduced a trap composed of 34 places in 118 ms
[2020-05-12 02:53:25] [INFO ] Deduced a trap composed of 121 places in 122 ms
[2020-05-12 02:53:25] [INFO ] Deduced a trap composed of 14 places in 110 ms
[2020-05-12 02:53:25] [INFO ] Deduced a trap composed of 69 places in 113 ms
[2020-05-12 02:53:25] [INFO ] Deduced a trap composed of 117 places in 129 ms
[2020-05-12 02:53:26] [INFO ] Deduced a trap composed of 119 places in 126 ms
[2020-05-12 02:53:26] [INFO ] Deduced a trap composed of 134 places in 128 ms
[2020-05-12 02:53:26] [INFO ] Deduced a trap composed of 127 places in 153 ms
[2020-05-12 02:53:26] [INFO ] Deduced a trap composed of 10 places in 107 ms
[2020-05-12 02:53:26] [INFO ] Deduced a trap composed of 130 places in 128 ms
[2020-05-12 02:53:26] [INFO ] Deduced a trap composed of 82 places in 132 ms
[2020-05-12 02:53:26] [INFO ] Deduced a trap composed of 48 places in 129 ms
[2020-05-12 02:53:27] [INFO ] Deduced a trap composed of 129 places in 125 ms
[2020-05-12 02:53:27] [INFO ] Deduced a trap composed of 25 places in 128 ms
[2020-05-12 02:53:27] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3465 ms
[2020-05-12 02:53:27] [INFO ] Computed and/alt/rep : 470/1893/470 causal constraints in 31 ms.
[2020-05-12 02:53:30] [INFO ] Added : 374 causal constraints over 76 iterations in 3497 ms. Result :sat
[2020-05-12 02:53:31] [INFO ] [Real]Absence check using 48 positive place invariants in 312 ms returned sat
[2020-05-12 02:53:31] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 264 ms returned sat
[2020-05-12 02:53:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:53:32] [INFO ] [Real]Absence check using state equation in 1085 ms returned sat
[2020-05-12 02:53:32] [INFO ] Deduced a trap composed of 18 places in 144 ms
[2020-05-12 02:53:32] [INFO ] Deduced a trap composed of 30 places in 141 ms
[2020-05-12 02:53:33] [INFO ] Deduced a trap composed of 15 places in 151 ms
[2020-05-12 02:53:33] [INFO ] Deduced a trap composed of 111 places in 140 ms
[2020-05-12 02:53:33] [INFO ] Deduced a trap composed of 44 places in 82 ms
[2020-05-12 02:53:33] [INFO ] Deduced a trap composed of 12 places in 133 ms
[2020-05-12 02:53:33] [INFO ] Deduced a trap composed of 122 places in 136 ms
[2020-05-12 02:53:33] [INFO ] Deduced a trap composed of 53 places in 131 ms
[2020-05-12 02:53:33] [INFO ] Deduced a trap composed of 18 places in 137 ms
[2020-05-12 02:53:34] [INFO ] Deduced a trap composed of 27 places in 134 ms
[2020-05-12 02:53:34] [INFO ] Deduced a trap composed of 15 places in 136 ms
[2020-05-12 02:53:34] [INFO ] Deduced a trap composed of 115 places in 136 ms
[2020-05-12 02:53:34] [INFO ] Deduced a trap composed of 59 places in 133 ms
[2020-05-12 02:53:34] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2008 ms
[2020-05-12 02:53:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:53:34] [INFO ] [Nat]Absence check using 48 positive place invariants in 39 ms returned sat
[2020-05-12 02:53:34] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 19 ms returned sat
[2020-05-12 02:53:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:53:35] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2020-05-12 02:53:35] [INFO ] Deduced a trap composed of 8 places in 118 ms
[2020-05-12 02:53:35] [INFO ] Deduced a trap composed of 14 places in 120 ms
[2020-05-12 02:53:35] [INFO ] Deduced a trap composed of 40 places in 120 ms
[2020-05-12 02:53:35] [INFO ] Deduced a trap composed of 19 places in 67 ms
[2020-05-12 02:53:35] [INFO ] Deduced a trap composed of 20 places in 66 ms
[2020-05-12 02:53:35] [INFO ] Deduced a trap composed of 50 places in 56 ms
[2020-05-12 02:53:35] [INFO ] Deduced a trap composed of 16 places in 52 ms
[2020-05-12 02:53:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 743 ms
[2020-05-12 02:53:35] [INFO ] Computed and/alt/rep : 470/1893/470 causal constraints in 28 ms.
[2020-05-12 02:53:38] [INFO ] Added : 354 causal constraints over 72 iterations in 3076 ms. Result :sat
[2020-05-12 02:53:39] [INFO ] [Real]Absence check using 48 positive place invariants in 14 ms returned unsat
[2020-05-12 02:53:39] [INFO ] [Real]Absence check using 48 positive place invariants in 25 ms returned sat
[2020-05-12 02:53:39] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 16 ms returned sat
[2020-05-12 02:53:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:53:39] [INFO ] [Real]Absence check using state equation in 506 ms returned sat
[2020-05-12 02:53:39] [INFO ] Deduced a trap composed of 11 places in 157 ms
[2020-05-12 02:53:40] [INFO ] Deduced a trap composed of 61 places in 157 ms
[2020-05-12 02:53:40] [INFO ] Deduced a trap composed of 45 places in 125 ms
[2020-05-12 02:53:40] [INFO ] Deduced a trap composed of 61 places in 126 ms
[2020-05-12 02:53:40] [INFO ] Deduced a trap composed of 16 places in 113 ms
[2020-05-12 02:53:40] [INFO ] Deduced a trap composed of 21 places in 133 ms
[2020-05-12 02:53:40] [INFO ] Deduced a trap composed of 126 places in 121 ms
[2020-05-12 02:53:40] [INFO ] Deduced a trap composed of 24 places in 122 ms
[2020-05-12 02:53:40] [INFO ] Deduced a trap composed of 28 places in 42 ms
[2020-05-12 02:53:40] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1258 ms
[2020-05-12 02:53:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:53:41] [INFO ] [Nat]Absence check using 48 positive place invariants in 36 ms returned sat
[2020-05-12 02:53:41] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 26 ms returned sat
[2020-05-12 02:53:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:53:41] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2020-05-12 02:53:41] [INFO ] Deduced a trap composed of 10 places in 137 ms
[2020-05-12 02:53:41] [INFO ] Deduced a trap composed of 137 places in 150 ms
[2020-05-12 02:53:42] [INFO ] Deduced a trap composed of 16 places in 150 ms
[2020-05-12 02:53:42] [INFO ] Deduced a trap composed of 14 places in 127 ms
[2020-05-12 02:53:42] [INFO ] Deduced a trap composed of 24 places in 170 ms
[2020-05-12 02:53:42] [INFO ] Deduced a trap composed of 19 places in 137 ms
[2020-05-12 02:53:42] [INFO ] Deduced a trap composed of 23 places in 170 ms
[2020-05-12 02:53:42] [INFO ] Deduced a trap composed of 17 places in 148 ms
[2020-05-12 02:53:43] [INFO ] Deduced a trap composed of 128 places in 161 ms
[2020-05-12 02:53:43] [INFO ] Deduced a trap composed of 9 places in 137 ms
[2020-05-12 02:53:43] [INFO ] Deduced a trap composed of 132 places in 152 ms
[2020-05-12 02:53:43] [INFO ] Deduced a trap composed of 134 places in 131 ms
[2020-05-12 02:53:43] [INFO ] Deduced a trap composed of 134 places in 115 ms
[2020-05-12 02:53:43] [INFO ] Deduced a trap composed of 28 places in 115 ms
[2020-05-12 02:53:43] [INFO ] Deduced a trap composed of 33 places in 154 ms
[2020-05-12 02:53:44] [INFO ] Deduced a trap composed of 120 places in 141 ms
[2020-05-12 02:53:44] [INFO ] Deduced a trap composed of 34 places in 119 ms
[2020-05-12 02:53:44] [INFO ] Deduced a trap composed of 128 places in 115 ms
[2020-05-12 02:53:44] [INFO ] Deduced a trap composed of 124 places in 128 ms
[2020-05-12 02:53:44] [INFO ] Deduced a trap composed of 30 places in 123 ms
[2020-05-12 02:53:44] [INFO ] Deduced a trap composed of 118 places in 127 ms
[2020-05-12 02:53:44] [INFO ] Deduced a trap composed of 132 places in 128 ms
[2020-05-12 02:53:45] [INFO ] Deduced a trap composed of 142 places in 116 ms
[2020-05-12 02:53:45] [INFO ] Deduced a trap composed of 130 places in 139 ms
[2020-05-12 02:53:45] [INFO ] Deduced a trap composed of 132 places in 126 ms
[2020-05-12 02:53:45] [INFO ] Deduced a trap composed of 131 places in 134 ms
[2020-05-12 02:53:45] [INFO ] Deduced a trap composed of 138 places in 111 ms
[2020-05-12 02:53:45] [INFO ] Deduced a trap composed of 15 places in 127 ms
[2020-05-12 02:53:45] [INFO ] Deduced a trap composed of 136 places in 155 ms
[2020-05-12 02:53:46] [INFO ] Deduced a trap composed of 128 places in 113 ms
[2020-05-12 02:53:46] [INFO ] Deduced a trap composed of 124 places in 112 ms
[2020-05-12 02:53:46] [INFO ] Deduced a trap composed of 116 places in 106 ms
[2020-05-12 02:53:46] [INFO ] Deduced a trap composed of 135 places in 134 ms
[2020-05-12 02:53:46] [INFO ] Deduced a trap composed of 129 places in 125 ms
[2020-05-12 02:53:46] [INFO ] Deduced a trap composed of 125 places in 152 ms
[2020-05-12 02:53:46] [INFO ] Deduced a trap composed of 132 places in 110 ms
[2020-05-12 02:53:47] [INFO ] Deduced a trap composed of 135 places in 117 ms
[2020-05-12 02:53:47] [INFO ] Deduced a trap composed of 114 places in 140 ms
[2020-05-12 02:53:47] [INFO ] Deduced a trap composed of 114 places in 131 ms
[2020-05-12 02:53:47] [INFO ] Deduced a trap composed of 129 places in 128 ms
[2020-05-12 02:53:47] [INFO ] Deduced a trap composed of 112 places in 117 ms
[2020-05-12 02:53:47] [INFO ] Deduced a trap composed of 119 places in 121 ms
[2020-05-12 02:53:48] [INFO ] Deduced a trap composed of 124 places in 115 ms
[2020-05-12 02:53:48] [INFO ] Deduced a trap composed of 118 places in 138 ms
[2020-05-12 02:53:48] [INFO ] Deduced a trap composed of 122 places in 127 ms
[2020-05-12 02:53:48] [INFO ] Deduced a trap composed of 131 places in 149 ms
[2020-05-12 02:53:48] [INFO ] Deduced a trap composed of 120 places in 129 ms
[2020-05-12 02:53:48] [INFO ] Deduced a trap composed of 126 places in 162 ms
[2020-05-12 02:53:49] [INFO ] Deduced a trap composed of 122 places in 177 ms
[2020-05-12 02:53:49] [INFO ] Deduced a trap composed of 112 places in 130 ms
[2020-05-12 02:53:49] [INFO ] Deduced a trap composed of 136 places in 130 ms
[2020-05-12 02:53:49] [INFO ] Deduced a trap composed of 132 places in 123 ms
[2020-05-12 02:53:49] [INFO ] Deduced a trap composed of 136 places in 133 ms
[2020-05-12 02:53:49] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 8164 ms
[2020-05-12 02:53:49] [INFO ] Computed and/alt/rep : 470/1893/470 causal constraints in 20 ms.
[2020-05-12 02:53:52] [INFO ] Added : 344 causal constraints over 70 iterations in 3076 ms. Result :sat
[2020-05-12 02:53:52] [INFO ] Deduced a trap composed of 123 places in 93 ms
[2020-05-12 02:53:53] [INFO ] Deduced a trap composed of 119 places in 98 ms
[2020-05-12 02:53:53] [INFO ] Deduced a trap composed of 114 places in 109 ms
[2020-05-12 02:53:53] [INFO ] Deduced a trap composed of 122 places in 102 ms
[2020-05-12 02:53:53] [INFO ] Deduced a trap composed of 123 places in 100 ms
[2020-05-12 02:53:53] [INFO ] Deduced a trap composed of 138 places in 119 ms
[2020-05-12 02:53:54] [INFO ] Deduced a trap composed of 131 places in 128 ms
[2020-05-12 02:53:54] [INFO ] Deduced a trap composed of 128 places in 136 ms
[2020-05-12 02:53:54] [INFO ] Deduced a trap composed of 125 places in 110 ms
[2020-05-12 02:53:54] [INFO ] Deduced a trap composed of 118 places in 114 ms
[2020-05-12 02:53:55] [INFO ] Deduced a trap composed of 131 places in 119 ms
[2020-05-12 02:53:55] [INFO ] Deduced a trap composed of 127 places in 160 ms
[2020-05-12 02:53:55] [INFO ] Deduced a trap composed of 133 places in 104 ms
[2020-05-12 02:53:56] [INFO ] Deduced a trap composed of 131 places in 127 ms
[2020-05-12 02:53:56] [INFO ] Deduced a trap composed of 135 places in 105 ms
[2020-05-12 02:53:56] [INFO ] Deduced a trap composed of 137 places in 135 ms
[2020-05-12 02:53:56] [INFO ] Deduced a trap composed of 114 places in 137 ms
[2020-05-12 02:53:56] [INFO ] Deduced a trap composed of 134 places in 149 ms
[2020-05-12 02:53:57] [INFO ] Deduced a trap composed of 127 places in 146 ms
[2020-05-12 02:53:57] [INFO ] Deduced a trap composed of 128 places in 116 ms
[2020-05-12 02:53:57] [INFO ] Deduced a trap composed of 131 places in 112 ms
[2020-05-12 02:53:57] [INFO ] Deduced a trap composed of 132 places in 136 ms
[2020-05-12 02:53:58] [INFO ] Deduced a trap composed of 126 places in 93 ms
[2020-05-12 02:53:58] [INFO ] Deduced a trap composed of 114 places in 99 ms
[2020-05-12 02:53:58] [INFO ] Deduced a trap composed of 119 places in 113 ms
[2020-05-12 02:53:58] [INFO ] Deduced a trap composed of 116 places in 95 ms
[2020-05-12 02:53:59] [INFO ] Deduced a trap composed of 115 places in 97 ms
[2020-05-12 02:53:59] [INFO ] Deduced a trap composed of 124 places in 127 ms
[2020-05-12 02:53:59] [INFO ] Deduced a trap composed of 133 places in 117 ms
[2020-05-12 02:53:59] [INFO ] Deduced a trap composed of 130 places in 107 ms
[2020-05-12 02:54:00] [INFO ] Deduced a trap composed of 115 places in 100 ms
[2020-05-12 02:54:00] [INFO ] Deduced a trap composed of 121 places in 98 ms
[2020-05-12 02:54:00] [INFO ] Deduced a trap composed of 126 places in 128 ms
[2020-05-12 02:54:00] [INFO ] Deduced a trap composed of 114 places in 126 ms
[2020-05-12 02:54:01] [INFO ] Deduced a trap composed of 9 places in 184 ms
[2020-05-12 02:54:01] [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 closed (> (+ s0 s1 s212 s213 s351 s352 s353 s354 s355) 0)") while checking expression at index 11
[2020-05-12 02:54:01] [INFO ] [Real]Absence check using 48 positive place invariants in 51 ms returned sat
[2020-05-12 02:54:01] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 16 ms returned sat
[2020-05-12 02:54:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:54:01] [INFO ] [Real]Absence check using state equation in 436 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-05-12 02:54:01] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-12 02:54:01] [INFO ] Flatten gal took : 89 ms
FORMULA BusinessProcesses-PT-10-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-12 02:54:01] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-12 02:54:02] [INFO ] Applying decomposition
[2020-05-12 02:54:02] [INFO ] Flatten gal took : 35 ms
[2020-05-12 02:54:02] [INFO ] Input system was already deterministic with 471 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph7711724772750912987.txt, -o, /tmp/graph7711724772750912987.bin, -w, /tmp/graph7711724772750912987.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph7711724772750912987.bin, -l, -1, -v, -w, /tmp/graph7711724772750912987.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-12 02:54:02] [INFO ] Decomposing Gal with order
[2020-05-12 02:54:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 02:54:02] [INFO ] Removed a total of 256 redundant transitions.
[2020-05-12 02:54:02] [INFO ] Flatten gal took : 158 ms
[2020-05-12 02:54:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 19 ms.
[2020-05-12 02:54:02] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 8 ms
[2020-05-12 02:54:02] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 10 LTL properties
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 471 rows 518 cols
Checking formula 0 : !((!(F(X((F(G("((((i13.i2.u71.p189==1)&&(i13.i2.u138.p349==1))&&(i13.i2.u188.p509==1))||(i6.i2.u98.p250==1))")))||(X(("(i10.i3.u126.p317==1)")U(F("(i6.i2.u98.p250==1)")))))))))
Formula 0 simplified : FX(FG"((((i13.i2.u71.p189==1)&&(i13.i2.u138.p349==1))&&(i13.i2.u188.p509==1))||(i6.i2.u98.p250==1))" | X("(i10.i3.u126.p317==1)" U F"(i6.i2.u98.p250==1)"))
[2020-05-12 02:54:02] [INFO ] Computed 85 place invariants in 23 ms
built 50 ordering constraints for composite.
built 17 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
inv : p0 + p1 + p2 + p3 + p4 + p198 + p199 + p200 + p475 + p476 = 1
inv : p490 + p491 + p492 + p493 - p497 - p498 - p499 = 0
built 4 ordering constraints for composite.
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p120 + p121 + p122 + p436 + p437 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p27 + p32 + p33 + p381 + p382 + p383 + p384 + p387 + p388 + p389 = 1
built 6 ordering constraints for composite.
inv : p0 + p1 + p212 + p213 + p351 + p352 + p353 + p354 + p355 = 1
inv : p86 + p87 + p88 + p89 - p424 - p425 - p480 - p481 = 0
inv : p141 + p142 + p143 - p448 - p449 = 0
built 11 ordering constraints for composite.
inv : p500 + p501 + p502 - p503 - p504 - p505 = 0
inv : p0 + p1 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p281 + p282 + p283 + p284 + p285 = 1
inv : p201 + p202 + p203 - p475 - p476 = 0
inv : p76 + p77 - p82 - p83 - p224 - p226 - p227 - p281 - p282 - p284 - p285 + p291 + p292 + p294 + p295 - p296 - p297 - p299 - p300 + p301 + p302 + p304 + p305 + p432 + p433 - p436 - p437 + p481 - p484 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p144 + p145 + p146 + p452 + p453 = 1
built 14 ordering constraints for composite.
inv : p48 + p49 + p50 - p400 - p401 = 0
inv : p0 + p1 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p296 + p297 + p298 + p299 + p300 = 1
built 4 ordering constraints for composite.
inv : p0 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p487 + p488 + p489 + p497 + p498 + p499 + p503 + p504 + p505 + p509 + p510 + p511 + p515 + p516 + p517 = 1
built 6 ordering constraints for composite.
inv : p1 + p2 + p3 + p4 + p5 + p150 + p151 + p153 + p155 + p157 + p158 + p159 + p160 + p162 + p163 + p164 + p165 + p166 + p167 + p172 + p173 + p181 + p182 + p187 + p188 + p195 + p196 + p197 - p361 - p362 - p363 - p364 - p365 - p366 - p367 - p368 - p369 - p370 - p371 - p372 - p373 - p374 - p375 - p376 - p377 - p378 - p379 - p380 - p381 - p382 - p383 - p384 - p385 - p386 - p387 - p388 - p389 - p390 - p391 - p392 - p393 - p394 - p395 - p396 - p397 - p398 - p399 - p400 - p401 - p402 - p403 - p404 - p405 - p406 - p407 - p408 - p409 - p410 - p411 - p412 - p413 - p414 - p415 - p416 - p417 - p418 - p419 - p420 - p421 - p422 - p423 - p424 - p425 - p426 - p427 - p428 - p429 - p430 - p431 - p432 - p433 - p434 - p435 - p436 - p437 - p438 - p439 - p440 - p441 - p442 - p443 - p444 - p445 - p446 - p447 - p448 - p449 - p450 - p451 - p452 - p453 - p454 - p456 - p458 - p460 - p461 - p462 - p463 - p465 - p466 - p467 - p468 - p469 - p470 - p473 - p474 - p475 - p476 - p477 - p478 - p479 - p487 - p488 - p489 - p492 - p493 - p501 - p502 - p507 - p508 - p515 - p516 - p517 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p126 + p127 + p128 + p440 + p441 = 1
built 4 ordering constraints for composite.
inv : p0 + p1 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p266 + p267 + p268 + p269 + p270 = 1
inv : p0 + p1 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p326 + p327 + p328 + p329 + p330 = 1
inv : p0 + p1 + p2 + p3 + p204 + p205 + p206 + p207 = 1
inv : p480 + p481 + p482 + p483 - p487 - p488 - p489 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p57 + p58 + p59 + p408 + p409 = 1
inv : p135 + p136 + p137 - p444 - p445 = 0
inv : p480 + p484 + p485 + p486 - p487 - p488 - p489 = 0
built 4 ordering constraints for composite.
inv : p0 + p1 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p276 + p277 + p278 + p279 + p280 = 1
inv : p147 + p148 + p149 - p452 - p453 = 0
built 4 ordering constraints for composite.
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p70 + p71 + p72 + p73 + p74 + p75 + p82 + p83 + p224 + p226 + p227 + p281 + p282 + p284 + p285 - p291 - p292 - p294 - p295 + p296 + p297 + p299 + p300 - p301 - p302 - p304 - p305 - p432 - p433 + p436 + p437 - p481 + p484 = 1
inv : p490 + p494 + p495 + p496 - p497 - p498 - p499 = 0
inv : p43 + p44 - p396 - p397 = 0
built 16 ordering constraints for composite.
inv : p1 + p2 + p3 + p4 + p5 + p150 + p151 + p153 + p155 + p156 + p157 + p159 + p160 + p161 + p162 + p163 + p165 + p166 + p167 + p175 + p176 + p184 + p185 + p189 + p190 + p191 + p193 + p194 - p361 - p362 - p363 - p364 - p365 - p366 - p367 - p368 - p369 - p370 - p371 - p372 - p373 - p374 - p375 - p376 - p377 - p378 - p379 - p380 - p381 - p382 - p383 - p384 - p385 - p386 - p387 - p388 - p389 - p390 - p391 - p392 - p393 - p394 - p395 - p396 - p397 - p398 - p399 - p400 - p401 - p402 - p403 - p404 - p405 - p406 - p407 - p408 - p409 - p410 - p411 - p412 - p413 - p414 - p415 - p416 - p417 - p418 - p419 - p420 - p421 - p422 - p423 - p424 - p425 - p426 - p427 - p428 - p429 - p430 - p431 - p432 - p433 - p434 - p435 - p436 - p437 - p438 - p439 - p440 - p441 - p442 - p443 - p444 - p445 - p446 - p447 - p448 - p449 - p450 - p451 - p452 - p453 - p454 - p456 - p458 - p459 - p460 - p462 - p463 - p464 - p465 - p466 - p468 - p469 - p470 - p473 - p474 - p475 - p476 - p477 - p478 - p479 - p487 - p488 - p489 - p495 - p496 - p504 - p505 - p509 - p510 - p511 - p513 - p514 = 0
inv : p0 + p1 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p306 + p307 + p308 + p309 + p310 = 1
inv : p152 + p154 + p156 + p161 + p170 + p171 - p181 - p182 + p183 + p184 + p185 - p187 - p188 + p189 + p190 + p191 - p455 - p457 - p459 - p464 + p492 + p493 - p497 - p498 - p499 + p501 + p502 - p503 - p504 - p505 + p507 + p508 - p509 - p510 - p511 = 0
built 18 ordering constraints for composite.
inv : p0 + p1 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p286 + p287 + p288 + p289 + p290 = 1
inv : p180 + p181 + p182 - p183 - p184 - p185 = 0
built 4 ordering constraints for composite.
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p396 + p397 = 1
built 4 ordering constraints for composite.
inv : p0 + p1 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p246 + p247 + p248 + p249 + p250 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p63 + p66 + p67 + p410 + p411 + p414 + p415 + p416 = 1
built 9 ordering constraints for composite.
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p98 + p99 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 = 1
inv : p0 + p1 + p212 + p213 + p214 + p215 + p216 + p336 + p337 + p338 + p339 + p340 = 1
inv : p512 + p513 + p514 - p515 - p516 - p517 = 0
built 4 ordering constraints for composite.
inv : p0 + p1 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p291 + p292 + p293 + p294 + p295 = 1
inv : p192 + p193 + p194 - p195 - p196 - p197 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p132 + p133 + p134 + p444 + p445 = 1
built 4 ordering constraints for composite.
inv : p0 + p1 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p271 + p272 + p273 + p274 + p275 = 1
inv : p123 + p124 + p125 - p436 - p437 = 0
built 4 ordering constraints for composite.
inv : p79 + p80 - p82 - p83 + p223 - p226 - p286 - p287 - p289 - p290 + p291 + p292 + p294 + p295 + p301 + p302 + p304 + p305 - p306 - p307 - p309 - p310 - p436 - p437 + p440 + p441 - p480 - p484 + p487 = 0
inv : p0 + p1 + p212 + p213 + p214 + p346 + p347 + p348 + p349 + p350 = 1
inv : p0 + p1 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p261 + p262 + p263 + p264 + p265 = 1
inv : p0 + p1 + p2 + p208 + p209 + p210 + p211 = 1
built 10 ordering constraints for composite.
inv : p86 + p87 + p88 + p92 - p424 - p425 - p480 - p484 = 0
inv : p0 + p1 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p321 + p322 + p323 + p324 + p325 = 1
built 7 ordering constraints for composite.
inv : p0 + p168 + p169 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p487 + p488 + p489 + p497 + p498 + p499 + p503 + p504 + p505 + p509 + p510 + p511 + p515 + p516 + p517 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p379 + p380 = 1
built 4 ordering constraints for composite.
inv : p28 + p29 + p30 + p31 + p34 + p35 - p381 - p382 - p383 - p384 - p387 - p388 - p389 = 0
inv : p0 + p1 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p311 + p312 + p313 + p314 + p315 = 1
built 61 ordering constraints for composite.
inv : p129 + p130 + p131 - p440 - p441 = 0
inv : p152 + p156 + p158 + p167 + p177 + p189 + p195 - p455 - p459 - p461 - p470 - p497 - p509 - p515 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p84 + p85 + p96 + p97 + p424 + p425 + p487 = 1
inv : p0 + p1 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p316 + p317 + p318 + p319 + p320 = 1
inv : p186 + p187 + p188 - p189 - p190 - p191 = 0
inv : p117 + p118 + p119 - p432 - p433 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p138 + p139 + p140 + p448 + p449 = 1
inv : p0 + p1 + p212 + p213 + p214 + p215 + p341 + p342 + p343 + p344 + p345 = 1
inv : p152 + p154 + p158 + p164 + p170 + p174 + p183 - p193 - p194 + p195 + p196 + p197 - p455 - p457 - p461 - p467 + p495 + p496 - p497 - p498 - p499 - p503 + p513 + p514 - p515 - p516 - p517 = 0
inv : p54 + p55 + p56 - p404 - p405 = 0
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p84 + p85 + p93 + p94 + p424 + p425 + p480 + p484 = 1
inv : p24 + p25 + p26 - p379 - p380 = 0
inv : p0 + p1 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p251 + p252 + p253 + p254 + p255 = 1
inv : p0 + p1 + p212 + p213 + p214 + p215 + p216 + p217 + p331 + p332 + p333 + p334 + p335 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p45 + p46 + p47 + p400 + p401 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p84 + p85 + p90 + p91 + p424 + p425 + p480 + p481 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p51 + p52 + p53 + p404 + p405 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p70 + p71 + p72 + p73 + p81 + p82 + p83 = 1
inv : p0 + p1 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p241 + p242 + p243 + p244 + p245 = 1
inv : p0 + p1 + p212 + p356 + p357 + p358 + p359 + p360 = 1
inv : p1 + p2 + p3 + p4 + p5 + p150 + p151 + p153 + p154 + p155 + p157 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p178 + p179 + p183 + p184 + p185 + p190 + p191 + p196 + p197 - p361 - p362 - p363 - p364 - p365 - p366 - p367 - p368 - p369 - p370 - p371 - p372 - p373 - p374 - p375 - p376 - p377 - p378 - p379 - p380 - p381 - p382 - p383 - p384 - p385 - p386 - p387 - p388 - p389 - p390 - p391 - p392 - p393 - p394 - p395 - p396 - p397 - p398 - p399 - p400 - p401 - p402 - p403 - p404 - p405 - p406 - p407 - p408 - p409 - p410 - p411 - p412 - p413 - p414 - p415 - p416 - p417 - p418 - p419 - p420 - p421 - p422 - p423 - p424 - p425 - p426 - p427 - p428 - p429 - p430 - p431 - p432 - p433 - p434 - p435 - p436 - p437 - p438 - p439 - p440 - p441 - p442 - p443 - p444 - p445 - p446 - p447 - p448 - p449 - p450 - p451 - p452 - p453 - p454 - p456 - p457 - p458 - p460 - p462 - p463 - p464 - p465 - p466 - p467 - p468 - p469 - p473 - p474 - p475 - p476 - p477 - p478 - p479 - p487 - p488 - p489 - p498 - p499 - p503 - p504 - p505 - p510 - p511 - p516 - p517 = 0
inv : p86 + p87 + p95 - p424 - p425 - p487 = 0
inv : p0 + p1 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 = 1
inv : p64 + p65 + p68 + p69 - p410 - p411 - p414 - p415 - p416 = 0
inv : p0 + p1 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p256 + p257 + p258 + p259 + p260 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p70 + p71 + p72 + p73 + p74 + p78 + p82 + p83 - p223 + p226 + p286 + p287 + p289 + p290 - p291 - p292 - p294 - p295 - p301 - p302 - p304 - p305 + p306 + p307 + p309 + p310 + p436 + p437 - p440 - p441 + p480 + p484 - p487 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p114 + p115 + p116 + p432 + p433 = 1
inv : p0 + p1 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p301 + p302 + p303 + p304 + p305 = 1
inv : p506 + p507 + p508 - p509 - p510 - p511 = 0
inv : p60 + p61 + p62 - p408 - p409 = 0
built 9 ordering constraints for composite.
Total of 85 invariants.
built 6 ordering constraints for composite.
[2020-05-12 02:54:02] [INFO ] Computed 85 place invariants in 29 ms
built 5 ordering constraints for composite.
built 17 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 26 ordering constraints for composite.
built 18 ordering constraints for composite.
built 5 ordering constraints for composite.
built 12 ordering constraints for composite.
built 22 ordering constraints for composite.
built 4 ordering constraints for composite.
built 13 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 5 ordering constraints for composite.
built 26 ordering constraints for composite.
built 21 ordering constraints for composite.
built 43 ordering constraints for composite.
built 38 ordering constraints for composite.
built 22 ordering constraints for composite.
built 17 ordering constraints for composite.
built 7 ordering constraints for composite.
built 24 ordering constraints for composite.
built 13 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 14 ordering constraints for composite.
built 4 ordering constraints for composite.
built 8 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
[2020-05-12 02:54:03] [INFO ] Proved 518 variables to be positive in 696 ms
[2020-05-12 02:54:03] [INFO ] Computing symmetric may disable matrix : 471 transitions.
[2020-05-12 02:54:03] [INFO ] Computation of disable matrix completed :0/471 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 02:54:03] [INFO ] Computation of Complete disable matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 02:54:03] [INFO ] Computing symmetric may enable matrix : 471 transitions.
[2020-05-12 02:54:03] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-12 02:54:04] [INFO ] Computing symmetric co enabling matrix : 471 transitions.
[2020-05-12 02:54:07] [INFO ] Computation of co-enabling matrix(4/471) took 2096 ms. Total solver calls (SAT/UNSAT): 772(721/51)
[2020-05-12 02:54:10] [INFO ] Computation of co-enabling matrix(15/471) took 5333 ms. Total solver calls (SAT/UNSAT): 3479(1303/2176)
[2020-05-12 02:54:14] [INFO ] Computation of co-enabling matrix(24/471) took 9162 ms. Total solver calls (SAT/UNSAT): 5401(1615/3786)
[2020-05-12 02:54:17] [INFO ] Computation of co-enabling matrix(35/471) took 12201 ms. Total solver calls (SAT/UNSAT): 7684(2534/5150)
[2020-05-12 02:54:20] [INFO ] Computation of co-enabling matrix(49/471) took 15307 ms. Total solver calls (SAT/UNSAT): 10250(3302/6948)
[2020-05-12 02:54:24] [INFO ] Computation of co-enabling matrix(58/471) took 19203 ms. Total solver calls (SAT/UNSAT): 12031(3688/8343)
[2020-05-12 02:54:27] [INFO ] Computation of co-enabling matrix(72/471) took 22222 ms. Total solver calls (SAT/UNSAT): 14051(4098/9953)
[2020-05-12 02:54:30] [INFO ] Computation of co-enabling matrix(80/471) took 25410 ms. Total solver calls (SAT/UNSAT): 15405(4366/11039)
[2020-05-12 02:54:33] [INFO ] Computation of co-enabling matrix(88/471) took 28614 ms. Total solver calls (SAT/UNSAT): 16726(4628/12098)
[2020-05-12 02:54:36] [INFO ] Computation of co-enabling matrix(101/471) took 31707 ms. Total solver calls (SAT/UNSAT): 18719(5063/13656)
[2020-05-12 02:54:39] [INFO ] Computation of co-enabling matrix(118/471) took 34802 ms. Total solver calls (SAT/UNSAT): 21070(5666/15404)
[2020-05-12 02:54:42] [INFO ] Computation of co-enabling matrix(173/471) took 37823 ms. Total solver calls (SAT/UNSAT): 24304(6155/18149)
[2020-05-12 02:54:45] [INFO ] Computation of co-enabling matrix(229/471) took 40848 ms. Total solver calls (SAT/UNSAT): 25801(6770/19031)
[2020-05-12 02:54:49] [INFO ] Computation of co-enabling matrix(240/471) took 44503 ms. Total solver calls (SAT/UNSAT): 26543(7198/19345)
[2020-05-12 02:54:53] [INFO ] Computation of co-enabling matrix(243/471) took 48292 ms. Total solver calls (SAT/UNSAT): 26834(7489/19345)
[2020-05-12 02:54:57] [INFO ] Computation of co-enabling matrix(246/471) took 52357 ms. Total solver calls (SAT/UNSAT): 27116(7771/19345)
[2020-05-12 02:55:00] [INFO ] Computation of co-enabling matrix(251/471) took 55703 ms. Total solver calls (SAT/UNSAT): 27578(8233/19345)
[2020-05-12 02:55:03] [INFO ] Computation of co-enabling matrix(260/471) took 58964 ms. Total solver calls (SAT/UNSAT): 28214(8869/19345)
[2020-05-12 02:55:06] [INFO ] Computation of co-enabling matrix(288/471) took 61974 ms. Total solver calls (SAT/UNSAT): 29049(8988/20061)
[2020-05-12 02:55:09] [INFO ] Computation of co-enabling matrix(391/471) took 64975 ms. Total solver calls (SAT/UNSAT): 31541(9351/22190)
SMT solver raised 'unknown', retrying with same input.
[2020-05-12 02:55:14] [INFO ] Computation of co-enabling matrix(395/471) took 69535 ms. Total solver calls (SAT/UNSAT): 31698(9504/22194)
[2020-05-12 02:55:17] [INFO ] Computation of co-enabling matrix(407/471) took 72614 ms. Total solver calls (SAT/UNSAT): 32286(9654/22632)
[2020-05-12 02:55:20] [INFO ] Computation of co-enabling matrix(451/471) took 75635 ms. Total solver calls (SAT/UNSAT): 33587(10138/23449)
[2020-05-12 02:55:21] [INFO ] Computation of Finished co-enabling matrix. took 76311 ms. Total solver calls (SAT/UNSAT): 33758(10169/23589)
[2020-05-12 02:55:21] [INFO ] Computing Do-Not-Accords matrix : 471 transitions.
[2020-05-12 02:55:21] [INFO ] Computation of Completed DNA matrix. took 410 ms. Total solver calls (SAT/UNSAT): 254(0/254)
[2020-05-12 02:55:21] [INFO ] Built C files in 79586ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 4408 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 63 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( <>(X(( <>([]((LTLAP0==true)))) || ( X(((LTLAP1==true))U(<>((LTLAP2==true))))) ))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( <>(X(( <>([]((LTLAP0==true)))) || ( X(((LTLAP1==true))U(<>((LTLAP2==true))))) ))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, !( <>(X(( <>([]((LTLAP0==true)))) || ( X(((LTLAP1==true))U(<>((LTLAP2==true))))) ))) , --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2020-05-12 03:14:56] [INFO ] Applying decomposition
[2020-05-12 03:14:56] [INFO ] Flatten gal took : 21 ms
[2020-05-12 03:14:56] [INFO ] Decomposing Gal with order
[2020-05-12 03:14:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-12 03:14:56] [INFO ] Removed a total of 117 redundant transitions.
[2020-05-12 03:14:56] [INFO ] Flatten gal took : 68 ms
[2020-05-12 03:14:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 24 ms.
[2020-05-12 03:14:56] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 8 ms
[2020-05-12 03:14:56] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 10 LTL properties
Checking formula 0 : !((!(F(X((F(G("((((i0.i0.i0.i0.i0.i1.u53.p189==1)&&(i0.i1.i0.i0.u105.p349==1))&&(i1.u120.p509==1))||(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u85.p250==1))")))||(X(("(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.u99.p317==1)")U(F("(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u85.p250==1)")))))))))
Formula 0 simplified : FX(FG"((((i0.i0.i0.i0.i0.i1.u53.p189==1)&&(i0.i1.i0.i0.u105.p349==1))&&(i1.u120.p509==1))||(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u85.p250==1))" | X("(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.u99.p317==1)" U F"(i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u85.p250==1)"))
built 2 ordering constraints for composite.
built 115 ordering constraints for composite.
built 65 ordering constraints for composite.
built 64 ordering constraints for composite.
built 63 ordering constraints for composite.
built 61 ordering constraints for composite.
built 45 ordering constraints for composite.
built 43 ordering constraints for composite.
built 41 ordering constraints for composite.
built 39 ordering constraints for composite.
built 37 ordering constraints for composite.
built 35 ordering constraints for composite.
built 33 ordering constraints for composite.
built 29 ordering constraints for composite.
built 25 ordering constraints for composite.
built 21 ordering constraints for composite.
built 18 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 25 ordering constraints for composite.
built 6 ordering constraints for composite.
built 52 ordering constraints for composite.
built 50 ordering constraints for composite.
built 48 ordering constraints for composite.
built 46 ordering constraints for composite.
built 44 ordering constraints for composite.
built 42 ordering constraints for composite.
built 40 ordering constraints for composite.
built 38 ordering constraints for composite.
built 36 ordering constraints for composite.
built 34 ordering constraints for composite.
built 32 ordering constraints for composite.
built 30 ordering constraints for composite.
built 28 ordering constraints for composite.
built 26 ordering constraints for composite.
built 24 ordering constraints for composite.
built 22 ordering constraints for composite.
built 20 ordering constraints for composite.
built 18 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 10 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 73 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-12 03:35:50] [INFO ] Flatten gal took : 298 ms
[2020-05-12 03:35:51] [INFO ] Input system was already deterministic with 471 transitions.
[2020-05-12 03:35:51] [INFO ] Transformed 518 places.
[2020-05-12 03:35:51] [INFO ] Transformed 471 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//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//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
[2020-05-12 03:36:21] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 16 ms
[2020-05-12 03:36:21] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 10 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((!(F(X((F(G("((((p189==1)&&(p349==1))&&(p509==1))||(p250==1))")))||(X(("(p317==1)")U(F("(p250==1)")))))))))
Formula 0 simplified : FX(FG"((((p189==1)&&(p349==1))&&(p509==1))||(p250==1))" | X("(p317==1)" U F"(p250==1)"))

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-oct2-158897699200522"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-10.tgz
mv BusinessProcesses-PT-10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;